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 18755 | . . . . 5 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝐹‘ 0 ) = 𝑁) |
4 | 3 | 3ad2ant1 1131 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → (𝐹‘ 0 ) = 𝑁) |
5 | 4 | eqeq2d 2749 | . . 3 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = (𝐹‘ 0 ) ↔ (𝐹‘𝑋) = 𝑁)) |
6 | simp2 1135 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 𝐹:𝐴–1-1→𝐵) | |
7 | simp3 1136 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ 𝐴) | |
8 | ghmgrp1 18751 | . . . . . 6 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑅 ∈ Grp) | |
9 | f1ghm0to0.a | . . . . . . 7 ⊢ 𝐴 = (Base‘𝑅) | |
10 | 9, 1 | grpidcl 18522 | . . . . . 6 ⊢ (𝑅 ∈ Grp → 0 ∈ 𝐴) |
11 | 8, 10 | syl 17 | . . . . 5 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 0 ∈ 𝐴) |
12 | 11 | 3ad2ant1 1131 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 0 ∈ 𝐴) |
13 | f1veqaeq 7111 | . . . 4 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 0 ∈ 𝐴)) → ((𝐹‘𝑋) = (𝐹‘ 0 ) → 𝑋 = 0 )) | |
14 | 6, 7, 12, 13 | syl12anc 833 | . . 3 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = (𝐹‘ 0 ) → 𝑋 = 0 )) |
15 | 5, 14 | sylbird 259 | . 2 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 𝑁 → 𝑋 = 0 )) |
16 | fveq2 6756 | . . . 4 ⊢ (𝑋 = 0 → (𝐹‘𝑋) = (𝐹‘ 0 )) | |
17 | 16, 4 | sylan9eqr 2801 | . . 3 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) ∧ 𝑋 = 0 ) → (𝐹‘𝑋) = 𝑁) |
18 | 17 | ex 412 | . 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 1085 = wceq 1539 ∈ wcel 2108 –1-1→wf1 6415 ‘cfv 6418 (class class class)co 7255 Basecbs 16840 0gc0g 17067 Grpcgrp 18492 GrpHom cghm 18746 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-grp 18495 df-ghm 18747 |
This theorem is referenced by: gim0to0 19901 kerf1ghm 19902 |
Copyright terms: Public domain | W3C validator |