| 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 19461 | . . . . . 6 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp) | |
| 2 | eqid 2763 | . . . . . . 7 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 3 | ghmid.y | . . . . . . 7 ⊢ 𝑌 = (0g‘𝑆) | |
| 4 | 2, 3 | grpidcl 19205 | . . . . . 6 ⊢ (𝑆 ∈ Grp → 𝑌 ∈ (Base‘𝑆)) |
| 5 | 1, 4 | syl 18 | . . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑌 ∈ (Base‘𝑆)) |
| 6 | eqid 2763 | . . . . . 6 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 7 | eqid 2763 | . . . . . 6 ⊢ (+g‘𝑇) = (+g‘𝑇) | |
| 8 | 2, 6, 7 | ghmlin 19464 | . . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑌 ∈ (Base‘𝑆) ∧ 𝑌 ∈ (Base‘𝑆)) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌))) |
| 9 | 5, 5, 8 | mpd3an23 1493 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌))) |
| 10 | 2, 6, 3 | grplid 19207 | . . . . . 6 ⊢ ((𝑆 ∈ Grp ∧ 𝑌 ∈ (Base‘𝑆)) → (𝑌(+g‘𝑆)𝑌) = 𝑌) |
| 11 | 1, 5, 10 | syl2anc 596 | . . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝑌(+g‘𝑆)𝑌) = 𝑌) |
| 12 | 11 | fveq2d 6912 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = (𝐹‘𝑌)) |
| 13 | 9, 12 | eqtr3d 2800 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)) = (𝐹‘𝑌)) |
| 14 | ghmgrp2 19462 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp) | |
| 15 | eqid 2763 | . . . . . 6 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
| 16 | 2, 15 | ghmf 19463 | . . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇)) |
| 17 | 16, 5 | ffvelcdmd 7109 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘𝑌) ∈ (Base‘𝑇)) |
| 18 | ghmid.z | . . . . 5 ⊢ 0 = (0g‘𝑇) | |
| 19 | 15, 7, 18 | grpid 19215 | . . . 4 ⊢ ((𝑇 ∈ Grp ∧ (𝐹‘𝑌) ∈ (Base‘𝑇)) → (((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)) = (𝐹‘𝑌) ↔ 0 = (𝐹‘𝑌))) |
| 20 | 14, 17, 19 | syl2anc 596 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)) = (𝐹‘𝑌) ↔ 0 = (𝐹‘𝑌))) |
| 21 | 13, 20 | mpbid 235 | . 2 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 0 = (𝐹‘𝑌)) |
| 22 | 21 | eqcomd 2769 | 1 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘𝑌) = 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2147 ‘cfv 6558 (class class class)co 7443 Basecbs 17416 +gcplusg 17457 0gc0g 17639 Grpcgrp 19173 GrpHom cghm 19456 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-1st 8025 df-2nd 8026 df-map 8877 df-0g 17641 df-mgm 18845 df-sgrp 18937 df-mnd 18953 df-grp 19176 df-ghm 19457 |
| This theorem is used by: ghminv 19466 ghmmhm 19469 ghmpreima 19481 f1ghm0to0 19488 kerf1ghm 19490 ghmqusker 19531 lactghmga 19649 nrhmzr 20819 zrinitorngc 20924 imadrhmcl 21084 srng0 21141 islmhm2 21343 zrh0 21849 chrrhm 21867 zndvds0 21886 ip0l 21972 evlslem2 22418 evlslem3 22419 evlslem6 22420 rhmmpl 22728 rhmply1vr1 22732 0mat2pmat 23084 nmolb2d 25067 nmoi 25077 nmoix 25078 nmoleub 25080 nmoleub2lem2 25467 nmhmcn 25471 dchrptlem2 27622 psgnid 33728 ricnzr1 33919 ricdomn1 33920 mplidomlem 34229 dimkerim 34329 lvecendof1f1o 34335 ricdrng1 43785 rhmpsr 43804 |
| Copyright terms: Public domain | W3C validator |