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.1 | ⊢ 0 = (0g‘𝑅) |
Ref | Expression |
---|---|
f1ghm0to0 | ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 𝑁 ↔ 𝑋 = 0 )) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | f1ghm0to0.1 | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
2 | f1ghm0to0.n | . . . . . 6 ⊢ 𝑁 = (0g‘𝑆) | |
3 | 1, 2 | ghmid 18840 | . . . . 5 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝐹‘ 0 ) = 𝑁) |
4 | 3 | 3ad2ant1 1132 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → (𝐹‘ 0 ) = 𝑁) |
5 | 4 | eqeq2d 2749 | . . 3 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = (𝐹‘ 0 ) ↔ (𝐹‘𝑋) = 𝑁)) |
6 | simp2 1136 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 𝐹:𝐴–1-1→𝐵) | |
7 | simp3 1137 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ 𝐴) | |
8 | ghmgrp1 18836 | . . . . . 6 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑅 ∈ Grp) | |
9 | f1ghm0to0.a | . . . . . . 7 ⊢ 𝐴 = (Base‘𝑅) | |
10 | 9, 1 | grpidcl 18607 | . . . . . 6 ⊢ (𝑅 ∈ Grp → 0 ∈ 𝐴) |
11 | 8, 10 | syl 17 | . . . . 5 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 0 ∈ 𝐴) |
12 | 11 | 3ad2ant1 1132 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 0 ∈ 𝐴) |
13 | f1veqaeq 7130 | . . . 4 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 0 ∈ 𝐴)) → ((𝐹‘𝑋) = (𝐹‘ 0 ) → 𝑋 = 0 )) | |
14 | 6, 7, 12, 13 | syl12anc 834 | . . 3 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = (𝐹‘ 0 ) → 𝑋 = 0 )) |
15 | 5, 14 | sylbird 259 | . 2 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 𝑁 → 𝑋 = 0 )) |
16 | fveq2 6774 | . . . 4 ⊢ (𝑋 = 0 → (𝐹‘𝑋) = (𝐹‘ 0 )) | |
17 | 16, 4 | sylan9eqr 2800 | . . 3 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) ∧ 𝑋 = 0 ) → (𝐹‘𝑋) = 𝑁) |
18 | 17 | ex 413 | . 2 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → (𝑋 = 0 → (𝐹‘𝑋) = 𝑁)) |
19 | 15, 18 | impbid 211 | 1 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 𝑁 ↔ 𝑋 = 0 )) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 –1-1→wf1 6430 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 0gc0g 17150 Grpcgrp 18577 GrpHom cghm 18831 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-0g 17152 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-grp 18580 df-ghm 18832 |
This theorem is referenced by: gim0to0 19986 kerf1ghm 19987 |
Copyright terms: Public domain | W3C validator |