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

Theorem gim0to0 19492
Description: A group isomorphism 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, 23-May-2023.)
Hypotheses
Ref Expression
gim0to0.a 𝐴 = (Base‘𝑅)
gim0to0.b 𝐵 = (Base‘𝑆)
gim0to0.n 𝑁 = (0g‘𝑆)
gim0to0.0 0 = (0g‘𝑅)
Assertion
Ref Expression
gim0to0 ((𝐹 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 𝑁 ↔ 𝑋 = 0 ))

Proof of Theorem gim0to0
StepHypRef Expression
1 gimghm 19487 . . . . 5 (𝐹 ∈ (𝑅 GrpIso 𝑆) → 𝐹 ∈ (𝑅 GrpHom 𝑆))
2 gim0to0.a . . . . . . 7 𝐴 = (Base‘𝑅)
3 gim0to0.b . . . . . . 7 𝐵 = (Base‘𝑆)
42, 3gimf1o 19486 . . . . . 6 (𝐹 ∈ (𝑅 GrpIso 𝑆) → 𝐹:𝐴–1-1-onto→𝐵)
5 f1of1 6828 . . . . . 6 (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴–1-1→𝐵)
64, 5syl 18 . . . . 5 (𝐹 ∈ (𝑅 GrpIso 𝑆) → 𝐹:𝐴–1-1→𝐵)
71, 6jca 521 . . . 4 (𝐹 ∈ (𝑅 GrpIso 𝑆) → (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵))
87anim1i 627 . . 3 ((𝐹 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵) ∧ 𝑋 ∈ 𝐴))
9 df-3an 1105 . . 3 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) ↔ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵) ∧ 𝑋 ∈ 𝐴))
108, 9sylibr 237 . 2 ((𝐹 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑋 ∈ 𝐴) → (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴))
11 gim0to0.0 . . 3 0 = (0g‘𝑅)
12 gim0to0.n . . 3 𝑁 = (0g‘𝑆)
132, 3, 11, 12f1ghm0to0 19468 . 2 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 𝑁 ↔ 𝑋 = 0 ))
1410, 13syl 18 1 ((𝐹 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 𝑁 ↔ 𝑋 = 0 ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  –1-1→wf1 6540  –1-1-onto→wf1o 6542  ‘cfv 6543  (class class class)co 7424  Basecbs 17396  0gc0g 17619   GrpHom cghm 19436   GrpIso cgim 19480
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  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 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-1st 8005  df-2nd 8006  df-map 8857  df-0g 17621  df-mgm 18825  df-sgrp 18917  df-mnd 18933  df-grp 19156  df-ghm 19437  df-gim 19482
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator