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

Theorem gim0to0 19533
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 19528 . . . . 5 (𝐹 ∈ (𝑅 GrpIso 𝑆) → 𝐹 ∈ (𝑅 GrpHom 𝑆))
2 gim0to0.a . . . . . . 7 𝐴 = (Base‘𝑅)
3 gim0to0.b . . . . . . 7 𝐵 = (Base‘𝑆)
42, 3gimf1o 19527 . . . . . 6 (𝐹 ∈ (𝑅 GrpIso 𝑆) → 𝐹:𝐴⟶1-1onto𝐵)
5 f1of1 6853 . . . . . 6 (𝐹:𝐴⟶1-1onto𝐵 → 𝐹:𝐴⟶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 19509 . 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 1570   ∈ wcel 2147  ⟶1-1wf1 6563  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  0gc0g 17660   GrpHom cghm 19477   GrpIso cgim 19521
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-fo 6572  df-f1o 6573  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  df-gim 19523
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator