| 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 19191 | . . . . 5 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝐹‘𝑁) = 0 ) |
| 4 | 3 | 3ad2ant1 1134 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑁) = 0 ) |
| 5 | 4 | eqeq2d 2748 | . . 3 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = (𝐹‘𝑁) ↔ (𝐹‘𝑋) = 0 )) |
| 6 | simp2 1138 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 𝐹:𝐴–1-1→𝐵) | |
| 7 | simp3 1139 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ 𝐴) | |
| 8 | ghmgrp1 19187 | . . . . . 6 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑅 ∈ Grp) | |
| 9 | f1ghm0to0.a | . . . . . . 7 ⊢ 𝐴 = (Base‘𝑅) | |
| 10 | 9, 1 | grpidcl 18935 | . . . . . 6 ⊢ (𝑅 ∈ Grp → 𝑁 ∈ 𝐴) |
| 11 | 8, 10 | syl 17 | . . . . 5 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑁 ∈ 𝐴) |
| 12 | 11 | 3ad2ant1 1134 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 𝑁 ∈ 𝐴) |
| 13 | f1veqaeq 7205 | . . . 4 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑁 ∈ 𝐴)) → ((𝐹‘𝑋) = (𝐹‘𝑁) → 𝑋 = 𝑁)) | |
| 14 | 6, 7, 12, 13 | syl12anc 837 | . . 3 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = (𝐹‘𝑁) → 𝑋 = 𝑁)) |
| 15 | 5, 14 | sylbird 260 | . 2 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 0 → 𝑋 = 𝑁)) |
| 16 | fveq2 6835 | . . . 4 ⊢ (𝑋 = 𝑁 → (𝐹‘𝑋) = (𝐹‘𝑁)) | |
| 17 | 16, 4 | sylan9eqr 2794 | . . 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 1087 = wceq 1542 ∈ wcel 2114 –1-1→wf1 6490 ‘cfv 6493 (class class class)co 7361 Basecbs 17173 0gc0g 17396 Grpcgrp 18903 GrpHom cghm 19181 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-1st 7936 df-2nd 7937 df-map 8769 df-0g 17398 df-mgm 18602 df-sgrp 18681 df-mnd 18697 df-grp 18906 df-ghm 19182 |
| This theorem is referenced by: ghmf1 19215 kerf1ghm 19216 gim0to0 19238 |
| Copyright terms: Public domain | W3C validator |