MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  f1ghm0to0 Structured version   Visualization version   GIF version

Theorem f1ghm0to0 19509
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.)
Hypotheses
Ref Expression
f1ghm0to0.a 𝐴 = (Base‘𝑅)
f1ghm0to0.b 𝐵 = (Base‘𝑆)
f1ghm0to0.n 𝑁 = (0g‘𝑅)
f1ghm0to0.0 0 = (0g‘𝑆)
Assertion
Ref Expression
f1ghm0to0 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴⟶1-1𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 0 ↔ 𝑋 = 𝑁))

Proof of Theorem f1ghm0to0
StepHypRef Expression
1 f1ghm0to0.n . . . . . 6 𝑁 = (0g‘𝑅)
2 f1ghm0to0.0 . . . . . 6 0 = (0g‘𝑆)
31, 2ghmid 19486 . . . . 5 (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝐹‘𝑁) = 0 )
433ad2ant1 1151 . . . 4 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴⟶1-1𝐵 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑁) = 0 )
54eqeq2d 2774 . . 3 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴⟶1-1𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = (𝐹‘𝑁) ↔ (𝐹‘𝑋) = 0 ))
6 simp2 1155 . . . 4 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴⟶1-1𝐵 ∧ 𝑋 ∈ 𝐴) → 𝐹:𝐴⟶1-1𝐵)
7 simp3 1156 . . . 4 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴⟶1-1𝐵 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ 𝐴)
8 ghmgrp1 19482 . . . . . 6 (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑅 ∈ Grp)
9 f1ghm0to0.a . . . . . . 7 𝐴 = (Base‘𝑅)
109, 1grpidcl 19226 . . . . . 6 (𝑅 ∈ Grp → 𝑁 ∈ 𝐴)
118, 10syl 18 . . . . 5 (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑁 ∈ 𝐴)
12113ad2ant1 1151 . . . 4 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴⟶1-1𝐵 ∧ 𝑋 ∈ 𝐴) → 𝑁 ∈ 𝐴)
13 f1veqaeq 7291 . . . 4 ((𝐹:𝐴⟶1-1𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑁 ∈ 𝐴)) → ((𝐹‘𝑋) = (𝐹‘𝑁) → 𝑋 = 𝑁))
146, 7, 12, 13syl12anc 850 . . 3 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴⟶1-1𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = (𝐹‘𝑁) → 𝑋 = 𝑁))
155, 14sylbird 263 . 2 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴⟶1-1𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 0 → 𝑋 = 𝑁))
16 fveq2 6916 . . . 4 (𝑋 = 𝑁 → (𝐹‘𝑋) = (𝐹‘𝑁))
1716, 4sylan9eqr 2820 . . 3 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴⟶1-1𝐵 ∧ 𝑋 ∈ 𝐴) ∧ 𝑋 = 𝑁) → (𝐹‘𝑋) = 0 )
1817ex 418 . 2 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴⟶1-1𝐵 ∧ 𝑋 ∈ 𝐴) → (𝑋 = 𝑁 → (𝐹‘𝑋) = 0 ))
1915, 18impbid 215 1 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴⟶1-1𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 0 ↔ 𝑋 = 𝑁))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ⟶1-1wf1 6563  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  0gc0g 17660  Grpcgrp 19194   GrpHom cghm 19477
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-map 8887  df-0g 17662  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-grp 19197  df-ghm 19478
This theorem is used by:  ghmf1  19510  kerf1ghm  19511  gim0to0  19533
  Copyright terms: Public domain W3C validator