| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cayleylem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for cayley 19445. (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 6861 | . . . 4 ⊢ ((𝐹‘𝑥) = (0g‘𝐻) → ((𝐹‘𝑥)‘ 0 ) = ((0g‘𝐻)‘ 0 )) | |
| 2 | simpr 488 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋) | |
| 3 | cayleylem1.x | . . . . . . . . 9 ⊢ 𝑋 = (Base‘𝐺) | |
| 4 | cayleylem1.u | . . . . . . . . 9 ⊢ 0 = (0g‘𝐺) | |
| 5 | 3, 4 | grpidcl 18998 | . . . . . . . 8 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝑋) |
| 6 | 5 | adantr 484 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → 0 ∈ 𝑋) |
| 7 | cayleylem1.f | . . . . . . . 8 ⊢ 𝐹 = (𝑔 ∈ 𝑋 ↦ (𝑎 ∈ 𝑋 ↦ (𝑔 + 𝑎))) | |
| 8 | 7, 3 | grplactval 19075 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝑋 ∧ 0 ∈ 𝑋) → ((𝐹‘𝑥)‘ 0 ) = (𝑥 + 0 )) |
| 9 | 2, 6, 8 | syl2anc 593 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥)‘ 0 ) = (𝑥 + 0 )) |
| 10 | cayleylem1.p | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
| 11 | 3, 10, 4 | grprid 19001 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → (𝑥 + 0 ) = 𝑥) |
| 12 | 9, 11 | eqtrd 2796 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥)‘ 0 ) = 𝑥) |
| 13 | 3 | fvexi 6876 | . . . . . . . 8 ⊢ 𝑋 ∈ V |
| 14 | cayleylem1.h | . . . . . . . . 9 ⊢ 𝐻 = (SymGrp‘𝑋) | |
| 15 | 14 | symgid 19432 | . . . . . . . 8 ⊢ (𝑋 ∈ V → ( I ↾ 𝑋) = (0g‘𝐻)) |
| 16 | 13, 15 | ax-mp 5 | . . . . . . 7 ⊢ ( I ↾ 𝑋) = (0g‘𝐻) |
| 17 | 16 | fveq1i 6863 | . . . . . 6 ⊢ (( I ↾ 𝑋)‘ 0 ) = ((0g‘𝐻)‘ 0 ) |
| 18 | fvresi 7152 | . . . . . . 7 ⊢ ( 0 ∈ 𝑋 → (( I ↾ 𝑋)‘ 0 ) = 0 ) | |
| 19 | 6, 18 | syl 17 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → (( I ↾ 𝑋)‘ 0 ) = 0 ) |
| 20 | 17, 19 | eqtr3id 2810 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → ((0g‘𝐻)‘ 0 ) = 0 ) |
| 21 | 12, 20 | eqeq12d 2777 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → (((𝐹‘𝑥)‘ 0 ) = ((0g‘𝐻)‘ 0 ) ↔ 𝑥 = 0 )) |
| 22 | 1, 21 | imbitrid 246 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥) = (0g‘𝐻) → 𝑥 = 0 )) |
| 23 | 22 | ralrimiva 3153 | . 2 ⊢ (𝐺 ∈ Grp → ∀𝑥 ∈ 𝑋 ((𝐹‘𝑥) = (0g‘𝐻) → 𝑥 = 0 )) |
| 24 | cayleylem1.s | . . . 4 ⊢ 𝑆 = (Base‘𝐻) | |
| 25 | 3, 10, 4, 14, 24, 7 | cayleylem1 19443 | . . 3 ⊢ (𝐺 ∈ Grp → 𝐹 ∈ (𝐺 GrpHom 𝐻)) |
| 26 | eqid 2761 | . . . 4 ⊢ (0g‘𝐻) = (0g‘𝐻) | |
| 27 | 3, 24, 4, 26 | ghmf1 19277 | . . 3 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → (𝐹:𝑋–1-1→𝑆 ↔ ∀𝑥 ∈ 𝑋 ((𝐹‘𝑥) = (0g‘𝐻) → 𝑥 = 0 ))) |
| 28 | 25, 27 | syl 17 | . 2 ⊢ (𝐺 ∈ Grp → (𝐹:𝑋–1-1→𝑆 ↔ ∀𝑥 ∈ 𝑋 ((𝐹‘𝑥) = (0g‘𝐻) → 𝑥 = 0 ))) |
| 29 | 23, 28 | mpbird 259 | 1 ⊢ (𝐺 ∈ Grp → 𝐹:𝑋–1-1→𝑆) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∀wral 3075 Vcvv 3453 ↦ cmpt 5178 I cid 5537 ↾ cres 5645 –1-1→wf1 6513 ‘cfv 6516 (class class class)co 7391 Basecbs 17236 +gcplusg 17277 0gc0g 17459 Grpcgrp 18966 GrpHom cghm 19244 SymGrpcsymg 19400 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-tp 4584 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-1o 8431 df-er 8672 df-map 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-nn 12205 df-2 12274 df-3 12275 df-4 12276 df-5 12277 df-6 12278 df-7 12279 df-8 12280 df-9 12281 df-n0 12476 df-z 12563 df-uz 12834 df-fz 13507 df-struct 17174 df-sets 17191 df-slot 17209 df-ndx 17221 df-base 17237 df-ress 17258 df-plusg 17290 df-tset 17296 df-0g 17461 df-mgm 18665 df-sgrp 18744 df-mnd 18760 df-submnd 18809 df-efmnd 18894 df-grp 18969 df-minusg 18970 df-sbg 18971 df-subg 19156 df-ghm 19245 df-ga 19321 df-symg 19401 |
| This theorem is referenced by: cayley 19445 |
| Copyright terms: Public domain | W3C validator |