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

Theorem ghmf1 19277
Description: Two ways of saying a group homomorphism is 1-1 into its codomain. (Contributed by Paul Chapman, 3-Mar-2008.) (Revised by Mario Carneiro, 13-Jan-2015.) (Proof shortened by AV, 4-Apr-2025.)
Hypotheses
Ref Expression
f1ghm0to0.a 𝐴 = (Base‘𝑅)
f1ghm0to0.b 𝐵 = (Base‘𝑆)
f1ghm0to0.n 𝑁 = (0g𝑅)
f1ghm0to0.0 0 = (0g𝑆)
Assertion
Ref Expression
ghmf1 (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝐹:𝐴1-1𝐵 ↔ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)))
Distinct variable groups:   𝑥, 0   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹   𝑥,𝑁   𝑥,𝑅   𝑥,𝑆

Proof of Theorem ghmf1
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 f1ghm0to0.a . . . . . 6 𝐴 = (Base‘𝑅)
2 f1ghm0to0.b . . . . . 6 𝐵 = (Base‘𝑆)
3 f1ghm0to0.n . . . . . 6 𝑁 = (0g𝑅)
4 f1ghm0to0.0 . . . . . 6 0 = (0g𝑆)
51, 2, 3, 4f1ghm0to0 19276 . . . . 5 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴1-1𝐵𝑥𝐴) → ((𝐹𝑥) = 0𝑥 = 𝑁))
653expa 1117 . . . 4 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴1-1𝐵) ∧ 𝑥𝐴) → ((𝐹𝑥) = 0𝑥 = 𝑁))
76biimpd 229 . . 3 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴1-1𝐵) ∧ 𝑥𝐴) → ((𝐹𝑥) = 0𝑥 = 𝑁))
87ralrimiva 3144 . 2 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴1-1𝐵) → ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁))
91, 2ghmf 19251 . . . 4 (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝐹:𝐴𝐵)
109adantr 480 . . 3 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) → 𝐹:𝐴𝐵)
11 eqid 2735 . . . . . . . . . 10 (-g𝑅) = (-g𝑅)
12 eqid 2735 . . . . . . . . . 10 (-g𝑆) = (-g𝑆)
131, 11, 12ghmsub 19255 . . . . . . . . 9 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝑦𝐴𝑧𝐴) → (𝐹‘(𝑦(-g𝑅)𝑧)) = ((𝐹𝑦)(-g𝑆)(𝐹𝑧)))
14133expb 1119 . . . . . . . 8 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ (𝑦𝐴𝑧𝐴)) → (𝐹‘(𝑦(-g𝑅)𝑧)) = ((𝐹𝑦)(-g𝑆)(𝐹𝑧)))
1514adantlr 715 . . . . . . 7 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → (𝐹‘(𝑦(-g𝑅)𝑧)) = ((𝐹𝑦)(-g𝑆)(𝐹𝑧)))
1615eqeq1d 2737 . . . . . 6 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → ((𝐹‘(𝑦(-g𝑅)𝑧)) = 0 ↔ ((𝐹𝑦)(-g𝑆)(𝐹𝑧)) = 0 ))
17 fveqeq2 6916 . . . . . . . 8 (𝑥 = (𝑦(-g𝑅)𝑧) → ((𝐹𝑥) = 0 ↔ (𝐹‘(𝑦(-g𝑅)𝑧)) = 0 ))
18 eqeq1 2739 . . . . . . . 8 (𝑥 = (𝑦(-g𝑅)𝑧) → (𝑥 = 𝑁 ↔ (𝑦(-g𝑅)𝑧) = 𝑁))
1917, 18imbi12d 344 . . . . . . 7 (𝑥 = (𝑦(-g𝑅)𝑧) → (((𝐹𝑥) = 0𝑥 = 𝑁) ↔ ((𝐹‘(𝑦(-g𝑅)𝑧)) = 0 → (𝑦(-g𝑅)𝑧) = 𝑁)))
20 simplr 769 . . . . . . 7 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁))
21 ghmgrp1 19249 . . . . . . . . 9 (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑅 ∈ Grp)
2221adantr 480 . . . . . . . 8 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) → 𝑅 ∈ Grp)
231, 11grpsubcl 19051 . . . . . . . . 9 ((𝑅 ∈ Grp ∧ 𝑦𝐴𝑧𝐴) → (𝑦(-g𝑅)𝑧) ∈ 𝐴)
24233expb 1119 . . . . . . . 8 ((𝑅 ∈ Grp ∧ (𝑦𝐴𝑧𝐴)) → (𝑦(-g𝑅)𝑧) ∈ 𝐴)
2522, 24sylan 580 . . . . . . 7 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → (𝑦(-g𝑅)𝑧) ∈ 𝐴)
2619, 20, 25rspcdva 3623 . . . . . 6 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → ((𝐹‘(𝑦(-g𝑅)𝑧)) = 0 → (𝑦(-g𝑅)𝑧) = 𝑁))
2716, 26sylbird 260 . . . . 5 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → (((𝐹𝑦)(-g𝑆)(𝐹𝑧)) = 0 → (𝑦(-g𝑅)𝑧) = 𝑁))
28 ghmgrp2 19250 . . . . . . 7 (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑆 ∈ Grp)
2928ad2antrr 726 . . . . . 6 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → 𝑆 ∈ Grp)
309ad2antrr 726 . . . . . . 7 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → 𝐹:𝐴𝐵)
31 simprl 771 . . . . . . 7 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → 𝑦𝐴)
3230, 31ffvelcdmd 7105 . . . . . 6 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → (𝐹𝑦) ∈ 𝐵)
33 simprr 773 . . . . . . 7 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → 𝑧𝐴)
3430, 33ffvelcdmd 7105 . . . . . 6 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → (𝐹𝑧) ∈ 𝐵)
352, 4, 12grpsubeq0 19057 . . . . . 6 ((𝑆 ∈ Grp ∧ (𝐹𝑦) ∈ 𝐵 ∧ (𝐹𝑧) ∈ 𝐵) → (((𝐹𝑦)(-g𝑆)(𝐹𝑧)) = 0 ↔ (𝐹𝑦) = (𝐹𝑧)))
3629, 32, 34, 35syl3anc 1370 . . . . 5 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → (((𝐹𝑦)(-g𝑆)(𝐹𝑧)) = 0 ↔ (𝐹𝑦) = (𝐹𝑧)))
3721ad2antrr 726 . . . . . 6 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → 𝑅 ∈ Grp)
381, 3, 11grpsubeq0 19057 . . . . . 6 ((𝑅 ∈ Grp ∧ 𝑦𝐴𝑧𝐴) → ((𝑦(-g𝑅)𝑧) = 𝑁𝑦 = 𝑧))
3937, 31, 33, 38syl3anc 1370 . . . . 5 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → ((𝑦(-g𝑅)𝑧) = 𝑁𝑦 = 𝑧))
4027, 36, 393imtr3d 293 . . . 4 (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) ∧ (𝑦𝐴𝑧𝐴)) → ((𝐹𝑦) = (𝐹𝑧) → 𝑦 = 𝑧))
4140ralrimivva 3200 . . 3 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) → ∀𝑦𝐴𝑧𝐴 ((𝐹𝑦) = (𝐹𝑧) → 𝑦 = 𝑧))
42 dff13 7275 . . 3 (𝐹:𝐴1-1𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐴𝑧𝐴 ((𝐹𝑦) = (𝐹𝑧) → 𝑦 = 𝑧)))
4310, 41, 42sylanbrc 583 . 2 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)) → 𝐹:𝐴1-1𝐵)
448, 43impbida 801 1 (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝐹:𝐴1-1𝐵 ↔ ∀𝑥𝐴 ((𝐹𝑥) = 0𝑥 = 𝑁)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2106  wral 3059  wf 6559  1-1wf1 6560  cfv 6563  (class class class)co 7431  Basecbs 17245  0gc0g 17486  Grpcgrp 18964  -gcsg 18966   GrpHom cghm 19243
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8013  df-2nd 8014  df-map 8867  df-0g 17488  df-mgm 18666  df-sgrp 18745  df-mnd 18761  df-grp 18967  df-minusg 18968  df-sbg 18969  df-ghm 19244
This theorem is referenced by:  cayleylem2  19446  fidomndrnglem  20790  islindf5  21877  asclf1  42518  pwssplit4  43078
  Copyright terms: Public domain W3C validator