| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1ghm0to0 | Structured version Visualization version GIF version | ||
| Description: If a group homomorphism 𝐹 is injective, it maps the zero of one group (and only the zero) to the zero of the other group. (Contributed by AV, 24-Oct-2019.) (Revised by Thierry Arnoux, 13-May-2023.) |
| Ref | Expression |
|---|---|
| f1ghm0to0.a | ⊢ 𝐴 = (Base‘𝑅) |
| f1ghm0to0.b | ⊢ 𝐵 = (Base‘𝑆) |
| f1ghm0to0.n | ⊢ 𝑁 = (0g‘𝑅) |
| f1ghm0to0.0 | ⊢ 0 = (0g‘𝑆) |
| Ref | Expression |
|---|---|
| f1ghm0to0 | ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 0 ↔ 𝑋 = 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1ghm0to0.n | . . . . . 6 ⊢ 𝑁 = (0g‘𝑅) | |
| 2 | f1ghm0to0.0 | . . . . . 6 ⊢ 0 = (0g‘𝑆) | |
| 3 | 1, 2 | ghmid 19130 | . . . . 5 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝐹‘𝑁) = 0 ) |
| 4 | 3 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑁) = 0 ) |
| 5 | 4 | eqeq2d 2740 | . . 3 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = (𝐹‘𝑁) ↔ (𝐹‘𝑋) = 0 )) |
| 6 | simp2 1137 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 𝐹:𝐴–1-1→𝐵) | |
| 7 | simp3 1138 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ 𝐴) | |
| 8 | ghmgrp1 19126 | . . . . . 6 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑅 ∈ Grp) | |
| 9 | f1ghm0to0.a | . . . . . . 7 ⊢ 𝐴 = (Base‘𝑅) | |
| 10 | 9, 1 | grpidcl 18873 | . . . . . 6 ⊢ (𝑅 ∈ Grp → 𝑁 ∈ 𝐴) |
| 11 | 8, 10 | syl 17 | . . . . 5 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑁 ∈ 𝐴) |
| 12 | 11 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 𝑁 ∈ 𝐴) |
| 13 | f1veqaeq 7213 | . . . 4 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑁 ∈ 𝐴)) → ((𝐹‘𝑋) = (𝐹‘𝑁) → 𝑋 = 𝑁)) | |
| 14 | 6, 7, 12, 13 | syl12anc 836 | . . 3 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = (𝐹‘𝑁) → 𝑋 = 𝑁)) |
| 15 | 5, 14 | sylbird 260 | . 2 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 0 → 𝑋 = 𝑁)) |
| 16 | fveq2 6840 | . . . 4 ⊢ (𝑋 = 𝑁 → (𝐹‘𝑋) = (𝐹‘𝑁)) | |
| 17 | 16, 4 | sylan9eqr 2786 | . . 3 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) ∧ 𝑋 = 𝑁) → (𝐹‘𝑋) = 0 ) |
| 18 | 17 | ex 412 | . 2 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → (𝑋 = 𝑁 → (𝐹‘𝑋) = 0 )) |
| 19 | 15, 18 | impbid 212 | 1 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 0 ↔ 𝑋 = 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 –1-1→wf1 6496 ‘cfv 6499 (class class class)co 7369 Basecbs 17155 0gc0g 17378 Grpcgrp 18841 GrpHom cghm 19120 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5526 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-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-1st 7947 df-2nd 7948 df-map 8778 df-0g 17380 df-mgm 18543 df-sgrp 18622 df-mnd 18638 df-grp 18844 df-ghm 19121 |
| This theorem is referenced by: ghmf1 19154 kerf1ghm 19155 gim0to0 19177 |
| Copyright terms: Public domain | W3C validator |