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

Theorem ghmcyg 19478
Description: The image of a cyclic group under a surjective group homomorphism is cyclic. (Contributed by Mario Carneiro, 21-Apr-2016.)
Hypotheses
Ref Expression
cygctb.1 𝐵 = (Base‘𝐺)
ghmcyg.1 𝐶 = (Base‘𝐻)
Assertion
Ref Expression
ghmcyg ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) → (𝐺 ∈ CycGrp → 𝐻 ∈ CycGrp))

Proof of Theorem ghmcyg
Dummy variables 𝑚 𝑛 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cygctb.1 . . . 4 𝐵 = (Base‘𝐺)
2 eqid 2739 . . . 4 (.g𝐺) = (.g𝐺)
31, 2iscyg 19460 . . 3 (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵))
43simprbi 496 . 2 (𝐺 ∈ CycGrp → ∃𝑥𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)
5 ghmcyg.1 . . . 4 𝐶 = (Base‘𝐻)
6 eqid 2739 . . . 4 (.g𝐻) = (.g𝐻)
7 ghmgrp2 18818 . . . . 5 (𝐹 ∈ (𝐺 GrpHom 𝐻) → 𝐻 ∈ Grp)
87ad2antrr 722 . . . 4 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐻 ∈ Grp)
9 fof 6684 . . . . . 6 (𝐹:𝐵onto𝐶𝐹:𝐵𝐶)
109ad2antlr 723 . . . . 5 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐹:𝐵𝐶)
11 simprl 767 . . . . 5 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝑥𝐵)
1210, 11ffvelrnd 6956 . . . 4 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → (𝐹𝑥) ∈ 𝐶)
13 simplr 765 . . . . . . . 8 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐹:𝐵onto𝐶)
14 foeq2 6681 . . . . . . . . 9 (ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵 → (𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))–onto𝐶𝐹:𝐵onto𝐶))
1514ad2antll 725 . . . . . . . 8 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → (𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))–onto𝐶𝐹:𝐵onto𝐶))
1613, 15mpbird 256 . . . . . . 7 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))–onto𝐶)
17 foelrn 6976 . . . . . . 7 ((𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))–onto𝐶𝑦𝐶) → ∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))𝑦 = (𝐹𝑧))
1816, 17sylan 579 . . . . . 6 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) → ∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))𝑦 = (𝐹𝑧))
19 ovex 7301 . . . . . . . 8 (𝑚(.g𝐺)𝑥) ∈ V
2019rgenw 3077 . . . . . . 7 𝑚 ∈ ℤ (𝑚(.g𝐺)𝑥) ∈ V
21 oveq1 7275 . . . . . . . . 9 (𝑛 = 𝑚 → (𝑛(.g𝐺)𝑥) = (𝑚(.g𝐺)𝑥))
2221cbvmptv 5191 . . . . . . . 8 (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = (𝑚 ∈ ℤ ↦ (𝑚(.g𝐺)𝑥))
23 fveq2 6768 . . . . . . . . 9 (𝑧 = (𝑚(.g𝐺)𝑥) → (𝐹𝑧) = (𝐹‘(𝑚(.g𝐺)𝑥)))
2423eqeq2d 2750 . . . . . . . 8 (𝑧 = (𝑚(.g𝐺)𝑥) → (𝑦 = (𝐹𝑧) ↔ 𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥))))
2522, 24rexrnmptw 6965 . . . . . . 7 (∀𝑚 ∈ ℤ (𝑚(.g𝐺)𝑥) ∈ V → (∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))𝑦 = (𝐹𝑧) ↔ ∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥))))
2620, 25ax-mp 5 . . . . . 6 (∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))𝑦 = (𝐹𝑧) ↔ ∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥)))
2718, 26sylib 217 . . . . 5 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) → ∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥)))
28 simp-4l 779 . . . . . . . 8 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) ∧ 𝑚 ∈ ℤ) → 𝐹 ∈ (𝐺 GrpHom 𝐻))
29 simpr 484 . . . . . . . 8 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℤ)
3011ad2antrr 722 . . . . . . . 8 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) ∧ 𝑚 ∈ ℤ) → 𝑥𝐵)
311, 2, 6ghmmulg 18827 . . . . . . . 8 ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑚 ∈ ℤ ∧ 𝑥𝐵) → (𝐹‘(𝑚(.g𝐺)𝑥)) = (𝑚(.g𝐻)(𝐹𝑥)))
3228, 29, 30, 31syl3anc 1369 . . . . . . 7 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) ∧ 𝑚 ∈ ℤ) → (𝐹‘(𝑚(.g𝐺)𝑥)) = (𝑚(.g𝐻)(𝐹𝑥)))
3332eqeq2d 2750 . . . . . 6 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) ∧ 𝑚 ∈ ℤ) → (𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥)) ↔ 𝑦 = (𝑚(.g𝐻)(𝐹𝑥))))
3433rexbidva 3226 . . . . 5 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) → (∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥)) ↔ ∃𝑚 ∈ ℤ 𝑦 = (𝑚(.g𝐻)(𝐹𝑥))))
3527, 34mpbid 231 . . . 4 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) → ∃𝑚 ∈ ℤ 𝑦 = (𝑚(.g𝐻)(𝐹𝑥)))
365, 6, 8, 12, 35iscygd 19468 . . 3 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐻 ∈ CycGrp)
3736rexlimdvaa 3215 . 2 ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) → (∃𝑥𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵𝐻 ∈ CycGrp))
384, 37syl5 34 1 ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) → (𝐺 ∈ CycGrp → 𝐻 ∈ CycGrp))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1541  wcel 2109  wral 3065  wrex 3066  Vcvv 3430  cmpt 5161  ran crn 5589  wf 6426  ontowfo 6428  cfv 6430  (class class class)co 7268  cz 12302  Basecbs 16893  Grpcgrp 18558  .gcmg 18681   GrpHom cghm 18812  CycGrpccyg 19458
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-rep 5213  ax-sep 5226  ax-nul 5233  ax-pow 5291  ax-pr 5355  ax-un 7579  ax-cnex 10911  ax-resscn 10912  ax-1cn 10913  ax-icn 10914  ax-addcl 10915  ax-addrcl 10916  ax-mulcl 10917  ax-mulrcl 10918  ax-mulcom 10919  ax-addass 10920  ax-mulass 10921  ax-distr 10922  ax-i2m1 10923  ax-1ne0 10924  ax-1rid 10925  ax-rnegex 10926  ax-rrecex 10927  ax-cnre 10928  ax-pre-lttri 10929  ax-pre-lttrn 10930  ax-pre-ltadd 10931  ax-pre-mulgt0 10932
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-nel 3051  df-ral 3070  df-rex 3071  df-reu 3072  df-rmo 3073  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-pss 3910  df-nul 4262  df-if 4465  df-pw 4540  df-sn 4567  df-pr 4569  df-tp 4571  df-op 4573  df-uni 4845  df-iun 4931  df-br 5079  df-opab 5141  df-mpt 5162  df-tr 5196  df-id 5488  df-eprel 5494  df-po 5502  df-so 5503  df-fr 5543  df-we 5545  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-res 5600  df-ima 5601  df-pred 6199  df-ord 6266  df-on 6267  df-lim 6268  df-suc 6269  df-iota 6388  df-fun 6432  df-fn 6433  df-f 6434  df-f1 6435  df-fo 6436  df-f1o 6437  df-fv 6438  df-riota 7225  df-ov 7271  df-oprab 7272  df-mpo 7273  df-om 7701  df-1st 7817  df-2nd 7818  df-frecs 8081  df-wrecs 8112  df-recs 8186  df-rdg 8225  df-er 8472  df-map 8591  df-en 8708  df-dom 8709  df-sdom 8710  df-pnf 10995  df-mnf 10996  df-xr 10997  df-ltxr 10998  df-le 10999  df-sub 11190  df-neg 11191  df-nn 11957  df-n0 12217  df-z 12303  df-uz 12565  df-fz 13222  df-seq 13703  df-0g 17133  df-mgm 18307  df-sgrp 18356  df-mnd 18367  df-mhm 18411  df-grp 18561  df-minusg 18562  df-mulg 18682  df-ghm 18813  df-cyg 19459
This theorem is referenced by:  giccyg  19482
  Copyright terms: Public domain W3C validator