| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ghmid | 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 14031 | . . . . . 6 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp) | |
| 2 | eqid 2238 | . . . . . . 7 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 3 | ghmid.y | . . . . . . 7 ⊢ 𝑌 = (0g‘𝑆) | |
| 4 | 2, 3 | grpidcl 13817 | . . . . . 6 ⊢ (𝑆 ∈ Grp → 𝑌 ∈ (Base‘𝑆)) |
| 5 | 1, 4 | syl 14 | . . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑌 ∈ (Base‘𝑆)) |
| 6 | eqid 2238 | . . . . . 6 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 7 | eqid 2238 | . . . . . 6 ⊢ (+g‘𝑇) = (+g‘𝑇) | |
| 8 | 2, 6, 7 | ghmlin 14034 | . . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑌 ∈ (Base‘𝑆) ∧ 𝑌 ∈ (Base‘𝑆)) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌))) |
| 9 | 5, 5, 8 | mpd3an23 1380 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌))) |
| 10 | 2, 6, 3 | grplid 13819 | . . . . . 6 ⊢ ((𝑆 ∈ Grp ∧ 𝑌 ∈ (Base‘𝑆)) → (𝑌(+g‘𝑆)𝑌) = 𝑌) |
| 11 | 1, 5, 10 | syl2anc 415 | . . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝑌(+g‘𝑆)𝑌) = 𝑌) |
| 12 | 11 | fveq2d 5697 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = (𝐹‘𝑌)) |
| 13 | 9, 12 | eqtr3d 2273 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)) = (𝐹‘𝑌)) |
| 14 | ghmgrp2 14032 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp) | |
| 15 | eqid 2238 | . . . . . 6 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
| 16 | 2, 15 | ghmf 14033 | . . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇)) |
| 17 | 16, 5 | ffvelcdmd 5838 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘𝑌) ∈ (Base‘𝑇)) |
| 18 | ghmid.z | . . . . 5 ⊢ 0 = (0g‘𝑇) | |
| 19 | 15, 7, 18 | grpid 13827 | . . . 4 ⊢ ((𝑇 ∈ Grp ∧ (𝐹‘𝑌) ∈ (Base‘𝑇)) → (((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)) = (𝐹‘𝑌) ↔ 0 = (𝐹‘𝑌))) |
| 20 | 14, 17, 19 | syl2anc 415 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)) = (𝐹‘𝑌) ↔ 0 = (𝐹‘𝑌))) |
| 21 | 13, 20 | mpbid 147 | . 2 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 0 = (𝐹‘𝑌)) |
| 22 | 21 | eqcomd 2244 | 1 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘𝑌) = 0 ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ‘cfv 5375 (class class class)co 6079 Basecbs 13335 +gcplusg 13414 0gc0g 13593 Grpcgrp 13788 GrpHom cghm 14026 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1re 8267 ax-addrcl 8270 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-inn 9288 df-2 9346 df-ndx 13338 df-slot 13339 df-base 13341 df-plusg 13427 df-0g 13595 df-mgm 13659 df-sgrp 13700 df-mnd 13713 df-grp 13791 df-ghm 14027 |
| This theorem is referenced by: ghminv 14036 ghmmhm 14039 ghmpreima 14052 f1ghm0to0 14058 kerf1ghm 14060 zrh0 14943 zndvds0 14968 |
| Copyright terms: Public domain | W3C validator |