| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ghmid | Structured version Visualization version GIF version | ||
| Description: A homomorphism of groups preserves the identity. (Contributed by Stefan O'Rear, 31-Dec-2014.) |
| Ref | Expression |
|---|---|
| ghmid.y | ⊢ 𝑌 = (0g‘𝑆) |
| ghmid.z | ⊢ 0 = (0g‘𝑇) |
| Ref | Expression |
|---|---|
| ghmid | ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘𝑌) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ghmgrp1 19294 | . . . . . 6 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp) | |
| 2 | eqid 2762 | . . . . . . 7 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 3 | ghmid.y | . . . . . . 7 ⊢ 𝑌 = (0g‘𝑆) | |
| 4 | 2, 3 | grpidcl 19038 | . . . . . 6 ⊢ (𝑆 ∈ Grp → 𝑌 ∈ (Base‘𝑆)) |
| 5 | 1, 4 | syl 18 | . . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑌 ∈ (Base‘𝑆)) |
| 6 | eqid 2762 | . . . . . 6 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 7 | eqid 2762 | . . . . . 6 ⊢ (+g‘𝑇) = (+g‘𝑇) | |
| 8 | 2, 6, 7 | ghmlin 19297 | . . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑌 ∈ (Base‘𝑆) ∧ 𝑌 ∈ (Base‘𝑆)) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌))) |
| 9 | 5, 5, 8 | mpd3an23 1491 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌))) |
| 10 | 2, 6, 3 | grplid 19040 | . . . . . 6 ⊢ ((𝑆 ∈ Grp ∧ 𝑌 ∈ (Base‘𝑆)) → (𝑌(+g‘𝑆)𝑌) = 𝑌) |
| 11 | 1, 5, 10 | syl2anc 595 | . . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝑌(+g‘𝑆)𝑌) = 𝑌) |
| 12 | 11 | fveq2d 6885 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = (𝐹‘𝑌)) |
| 13 | 9, 12 | eqtr3d 2799 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)) = (𝐹‘𝑌)) |
| 14 | ghmgrp2 19295 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp) | |
| 15 | eqid 2762 | . . . . . 6 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
| 16 | 2, 15 | ghmf 19296 | . . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇)) |
| 17 | 16, 5 | ffvelcdmd 7080 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘𝑌) ∈ (Base‘𝑇)) |
| 18 | ghmid.z | . . . . 5 ⊢ 0 = (0g‘𝑇) | |
| 19 | 15, 7, 18 | grpid 19048 | . . . 4 ⊢ ((𝑇 ∈ Grp ∧ (𝐹‘𝑌) ∈ (Base‘𝑇)) → (((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)) = (𝐹‘𝑌) ↔ 0 = (𝐹‘𝑌))) |
| 20 | 14, 17, 19 | syl2anc 595 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)) = (𝐹‘𝑌) ↔ 0 = (𝐹‘𝑌))) |
| 21 | 13, 20 | mpbid 235 | . 2 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 0 = (𝐹‘𝑌)) |
| 22 | 21 | eqcomd 2768 | 1 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘𝑌) = 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ∈ wcel 2142 ‘cfv 6536 (class class class)co 7412 Basecbs 17275 +gcplusg 17316 0gc0g 17498 Grpcgrp 19006 GrpHom cghm 19289 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7984 df-2nd 7985 df-map 8824 df-0g 17500 df-mgm 18704 df-sgrp 18783 df-mnd 18799 df-grp 19009 df-ghm 19290 |
| This theorem is used by: ghminv 19299 ghmmhm 19302 ghmpreima 19314 f1ghm0to0 19321 kerf1ghm 19323 ghmqusker 19363 lactghmga 19481 nrhmzr 20647 zrinitorngc 20752 imadrhmcl 20911 srng0 20968 islmhm2 21170 zrh0 21674 chrrhm 21692 zndvds0 21711 ip0l 21797 evlslem2 22241 evlslem3 22242 evlslem6 22243 rhmmpl 22551 rhmply1vr1 22555 0mat2pmat 22904 nmolb2d 24886 nmoi 24896 nmoix 24897 nmoleub 24899 nmoleub2lem2 25286 nmhmcn 25290 dchrptlem2 27440 psgnid 33426 ricnzr1 33617 ricdomn1 33618 mplidomlem 33926 dimkerim 34026 lvecendof1f1o 34032 ricdrng1 43324 rhmpsr 43343 |
| Copyright terms: Public domain | W3C validator |