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

Theorem f1ghm0to0 19459
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 19436 . . . . 5 (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝐹‘𝑁) = 0 )
433ad2ant1 1151 . . . 4 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑁) = 0 )
54eqeq2d 2772 . . 3 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = (𝐹‘𝑁) ↔ (𝐹‘𝑋) = 0 ))
6 simp2 1155 . . . 4 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 𝐹:𝐴–1-1→𝐵)
7 simp3 1156 . . . 4 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ 𝐴)
8 ghmgrp1 19432 . . . . . 6 (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑅 ∈ Grp)
9 f1ghm0to0.a . . . . . . 7 𝐴 = (Base‘𝑅)
109, 1grpidcl 19176 . . . . . 6 (𝑅 ∈ Grp → 𝑁 ∈ 𝐴)
118, 10syl 18 . . . . 5 (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑁 ∈ 𝐴)
12113ad2ant1 1151 . . . 4 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → 𝑁 ∈ 𝐴)
13 f1veqaeq 7260 . . . 4 ((𝐹:𝐴–1-1→𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑁 ∈ 𝐴)) → ((𝐹‘𝑋) = (𝐹‘𝑁) → 𝑋 = 𝑁))
146, 7, 12, 13syl12anc 850 . . 3 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = (𝐹‘𝑁) → 𝑋 = 𝑁))
155, 14sylbird 263 . 2 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 0 → 𝑋 = 𝑁))
16 fveq2 6885 . . . 4 (𝑋 = 𝑁 → (𝐹‘𝑋) = (𝐹‘𝑁))
1716, 4sylan9eqr 2818 . . 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 2145  –1-1→wf1 6535  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  0gc0g 17610  Grpcgrp 19144   GrpHom cghm 19427
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-map 8849  df-0g 17612  df-mgm 18816  df-sgrp 18908  df-mnd 18924  df-grp 19147  df-ghm 19428
This theorem is used by:  ghmf1  19460  kerf1ghm  19461  gim0to0  19483
  Copyright terms: Public domain W3C validator