![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cayley | Structured version Visualization version GIF version |
Description: Cayley's Theorem (constructive version): given group 𝐺, 𝐹 is an isomorphism between 𝐺 and the subgroup 𝑆 of the symmetric group 𝐻 on the underlying set 𝑋 of 𝐺. See also Theorem 3.15 in [Rotman] p. 42. (Contributed by Paul Chapman, 3-Mar-2008.) (Proof shortened by Mario Carneiro, 13-Jan-2015.) |
Ref | Expression |
---|---|
cayley.x | ⊢ 𝑋 = (Base‘𝐺) |
cayley.h | ⊢ 𝐻 = (SymGrp‘𝑋) |
cayley.p | ⊢ + = (+g‘𝐺) |
cayley.f | ⊢ 𝐹 = (𝑔 ∈ 𝑋 ↦ (𝑎 ∈ 𝑋 ↦ (𝑔 + 𝑎))) |
cayley.s | ⊢ 𝑆 = ran 𝐹 |
Ref | Expression |
---|---|
cayley | ⊢ (𝐺 ∈ Grp → (𝑆 ∈ (SubGrp‘𝐻) ∧ 𝐹 ∈ (𝐺 GrpHom (𝐻 ↾s 𝑆)) ∧ 𝐹:𝑋–1-1-onto→𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cayley.s | . . 3 ⊢ 𝑆 = ran 𝐹 | |
2 | cayley.x | . . . . 5 ⊢ 𝑋 = (Base‘𝐺) | |
3 | cayley.p | . . . . 5 ⊢ + = (+g‘𝐺) | |
4 | eqid 2727 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
5 | cayley.h | . . . . 5 ⊢ 𝐻 = (SymGrp‘𝑋) | |
6 | eqid 2727 | . . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
7 | cayley.f | . . . . 5 ⊢ 𝐹 = (𝑔 ∈ 𝑋 ↦ (𝑎 ∈ 𝑋 ↦ (𝑔 + 𝑎))) | |
8 | 2, 3, 4, 5, 6, 7 | cayleylem1 19358 | . . . 4 ⊢ (𝐺 ∈ Grp → 𝐹 ∈ (𝐺 GrpHom 𝐻)) |
9 | ghmrn 19174 | . . . 4 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → ran 𝐹 ∈ (SubGrp‘𝐻)) | |
10 | 8, 9 | syl 17 | . . 3 ⊢ (𝐺 ∈ Grp → ran 𝐹 ∈ (SubGrp‘𝐻)) |
11 | 1, 10 | eqeltrid 2832 | . 2 ⊢ (𝐺 ∈ Grp → 𝑆 ∈ (SubGrp‘𝐻)) |
12 | 1 | eqimss2i 4039 | . . . 4 ⊢ ran 𝐹 ⊆ 𝑆 |
13 | eqid 2727 | . . . . 5 ⊢ (𝐻 ↾s 𝑆) = (𝐻 ↾s 𝑆) | |
14 | 13 | resghm2b 19179 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐻) ∧ ran 𝐹 ⊆ 𝑆) → (𝐹 ∈ (𝐺 GrpHom 𝐻) ↔ 𝐹 ∈ (𝐺 GrpHom (𝐻 ↾s 𝑆)))) |
15 | 11, 12, 14 | sylancl 585 | . . 3 ⊢ (𝐺 ∈ Grp → (𝐹 ∈ (𝐺 GrpHom 𝐻) ↔ 𝐹 ∈ (𝐺 GrpHom (𝐻 ↾s 𝑆)))) |
16 | 8, 15 | mpbid 231 | . 2 ⊢ (𝐺 ∈ Grp → 𝐹 ∈ (𝐺 GrpHom (𝐻 ↾s 𝑆))) |
17 | 2, 3, 4, 5, 6, 7 | cayleylem2 19359 | . . . 4 ⊢ (𝐺 ∈ Grp → 𝐹:𝑋–1-1→(Base‘𝐻)) |
18 | f1f1orn 6844 | . . . 4 ⊢ (𝐹:𝑋–1-1→(Base‘𝐻) → 𝐹:𝑋–1-1-onto→ran 𝐹) | |
19 | 17, 18 | syl 17 | . . 3 ⊢ (𝐺 ∈ Grp → 𝐹:𝑋–1-1-onto→ran 𝐹) |
20 | f1oeq3 6823 | . . . 4 ⊢ (𝑆 = ran 𝐹 → (𝐹:𝑋–1-1-onto→𝑆 ↔ 𝐹:𝑋–1-1-onto→ran 𝐹)) | |
21 | 1, 20 | ax-mp 5 | . . 3 ⊢ (𝐹:𝑋–1-1-onto→𝑆 ↔ 𝐹:𝑋–1-1-onto→ran 𝐹) |
22 | 19, 21 | sylibr 233 | . 2 ⊢ (𝐺 ∈ Grp → 𝐹:𝑋–1-1-onto→𝑆) |
23 | 11, 16, 22 | 3jca 1126 | 1 ⊢ (𝐺 ∈ Grp → (𝑆 ∈ (SubGrp‘𝐻) ∧ 𝐹 ∈ (𝐺 GrpHom (𝐻 ↾s 𝑆)) ∧ 𝐹:𝑋–1-1-onto→𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ w3a 1085 = wceq 1534 ∈ wcel 2099 ⊆ wss 3944 ↦ cmpt 5225 ran crn 5673 –1-1→wf1 6539 –1-1-onto→wf1o 6541 ‘cfv 6542 (class class class)co 7414 Basecbs 17171 ↾s cress 17200 +gcplusg 17224 0gc0g 17412 Grpcgrp 18881 SubGrpcsubg 19066 GrpHom cghm 19158 SymGrpcsymg 19312 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-cnex 11186 ax-resscn 11187 ax-1cn 11188 ax-icn 11189 ax-addcl 11190 ax-addrcl 11191 ax-mulcl 11192 ax-mulrcl 11193 ax-mulcom 11194 ax-addass 11195 ax-mulass 11196 ax-distr 11197 ax-i2m1 11198 ax-1ne0 11199 ax-1rid 11200 ax-rnegex 11201 ax-rrecex 11202 ax-cnre 11203 ax-pre-lttri 11204 ax-pre-lttrn 11205 ax-pre-ltadd 11206 ax-pre-mulgt0 11207 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7865 df-1st 7987 df-2nd 7988 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-er 8718 df-map 8838 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11468 df-neg 11469 df-nn 12235 df-2 12297 df-3 12298 df-4 12299 df-5 12300 df-6 12301 df-7 12302 df-8 12303 df-9 12304 df-n0 12495 df-z 12581 df-uz 12845 df-fz 13509 df-struct 17107 df-sets 17124 df-slot 17142 df-ndx 17154 df-base 17172 df-ress 17201 df-plusg 17237 df-tset 17243 df-0g 17414 df-mgm 18591 df-sgrp 18670 df-mnd 18686 df-mhm 18731 df-submnd 18732 df-efmnd 18812 df-grp 18884 df-minusg 18885 df-sbg 18886 df-subg 19069 df-ghm 19159 df-ga 19232 df-symg 19313 |
This theorem is referenced by: cayleyth 19361 |
Copyright terms: Public domain | W3C validator |