| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cayleylem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for cayley 19389. (Contributed by Paul Chapman, 3-Mar-2008.) (Revised by Mario Carneiro, 13-Jan-2015.) |
| Ref | Expression |
|---|---|
| cayleylem1.x | ⊢ 𝑋 = (Base‘𝐺) |
| cayleylem1.p | ⊢ + = (+g‘𝐺) |
| cayleylem1.u | ⊢ 0 = (0g‘𝐺) |
| cayleylem1.h | ⊢ 𝐻 = (SymGrp‘𝑋) |
| cayleylem1.s | ⊢ 𝑆 = (Base‘𝐻) |
| cayleylem1.f | ⊢ 𝐹 = (𝑔 ∈ 𝑋 ↦ (𝑎 ∈ 𝑋 ↦ (𝑔 + 𝑎))) |
| Ref | Expression |
|---|---|
| cayleylem2 | ⊢ (𝐺 ∈ Grp → 𝐹:𝑋–1-1→𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq1 6839 | . . . 4 ⊢ ((𝐹‘𝑥) = (0g‘𝐻) → ((𝐹‘𝑥)‘ 0 ) = ((0g‘𝐻)‘ 0 )) | |
| 2 | simpr 484 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋) | |
| 3 | cayleylem1.x | . . . . . . . . 9 ⊢ 𝑋 = (Base‘𝐺) | |
| 4 | cayleylem1.u | . . . . . . . . 9 ⊢ 0 = (0g‘𝐺) | |
| 5 | 3, 4 | grpidcl 18941 | . . . . . . . 8 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝑋) |
| 6 | 5 | adantr 480 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → 0 ∈ 𝑋) |
| 7 | cayleylem1.f | . . . . . . . 8 ⊢ 𝐹 = (𝑔 ∈ 𝑋 ↦ (𝑎 ∈ 𝑋 ↦ (𝑔 + 𝑎))) | |
| 8 | 7, 3 | grplactval 19018 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝑋 ∧ 0 ∈ 𝑋) → ((𝐹‘𝑥)‘ 0 ) = (𝑥 + 0 )) |
| 9 | 2, 6, 8 | syl2anc 585 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥)‘ 0 ) = (𝑥 + 0 )) |
| 10 | cayleylem1.p | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
| 11 | 3, 10, 4 | grprid 18944 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → (𝑥 + 0 ) = 𝑥) |
| 12 | 9, 11 | eqtrd 2771 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥)‘ 0 ) = 𝑥) |
| 13 | 3 | fvexi 6854 | . . . . . . . 8 ⊢ 𝑋 ∈ V |
| 14 | cayleylem1.h | . . . . . . . . 9 ⊢ 𝐻 = (SymGrp‘𝑋) | |
| 15 | 14 | symgid 19376 | . . . . . . . 8 ⊢ (𝑋 ∈ V → ( I ↾ 𝑋) = (0g‘𝐻)) |
| 16 | 13, 15 | ax-mp 5 | . . . . . . 7 ⊢ ( I ↾ 𝑋) = (0g‘𝐻) |
| 17 | 16 | fveq1i 6841 | . . . . . 6 ⊢ (( I ↾ 𝑋)‘ 0 ) = ((0g‘𝐻)‘ 0 ) |
| 18 | fvresi 7128 | . . . . . . 7 ⊢ ( 0 ∈ 𝑋 → (( I ↾ 𝑋)‘ 0 ) = 0 ) | |
| 19 | 6, 18 | syl 17 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → (( I ↾ 𝑋)‘ 0 ) = 0 ) |
| 20 | 17, 19 | eqtr3id 2785 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → ((0g‘𝐻)‘ 0 ) = 0 ) |
| 21 | 12, 20 | eqeq12d 2752 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → (((𝐹‘𝑥)‘ 0 ) = ((0g‘𝐻)‘ 0 ) ↔ 𝑥 = 0 )) |
| 22 | 1, 21 | imbitrid 244 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥) = (0g‘𝐻) → 𝑥 = 0 )) |
| 23 | 22 | ralrimiva 3129 | . 2 ⊢ (𝐺 ∈ Grp → ∀𝑥 ∈ 𝑋 ((𝐹‘𝑥) = (0g‘𝐻) → 𝑥 = 0 )) |
| 24 | cayleylem1.s | . . . 4 ⊢ 𝑆 = (Base‘𝐻) | |
| 25 | 3, 10, 4, 14, 24, 7 | cayleylem1 19387 | . . 3 ⊢ (𝐺 ∈ Grp → 𝐹 ∈ (𝐺 GrpHom 𝐻)) |
| 26 | eqid 2736 | . . . 4 ⊢ (0g‘𝐻) = (0g‘𝐻) | |
| 27 | 3, 24, 4, 26 | ghmf1 19221 | . . 3 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → (𝐹:𝑋–1-1→𝑆 ↔ ∀𝑥 ∈ 𝑋 ((𝐹‘𝑥) = (0g‘𝐻) → 𝑥 = 0 ))) |
| 28 | 25, 27 | syl 17 | . 2 ⊢ (𝐺 ∈ Grp → (𝐹:𝑋–1-1→𝑆 ↔ ∀𝑥 ∈ 𝑋 ((𝐹‘𝑥) = (0g‘𝐻) → 𝑥 = 0 ))) |
| 29 | 23, 28 | mpbird 257 | 1 ⊢ (𝐺 ∈ Grp → 𝐹:𝑋–1-1→𝑆) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3051 Vcvv 3429 ↦ cmpt 5166 I cid 5525 ↾ cres 5633 –1-1→wf1 6495 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 +gcplusg 17220 0gc0g 17402 Grpcgrp 18909 GrpHom cghm 19187 SymGrpcsymg 19344 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-map 8775 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-7 12249 df-8 12250 df-9 12251 df-n0 12438 df-z 12525 df-uz 12789 df-fz 13462 df-struct 17117 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-tset 17239 df-0g 17404 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-submnd 18752 df-efmnd 18837 df-grp 18912 df-minusg 18913 df-sbg 18914 df-subg 19099 df-ghm 19188 df-ga 19265 df-symg 19345 |
| This theorem is referenced by: cayley 19389 |
| Copyright terms: Public domain | W3C validator |