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

Theorem ghmcyg 19808
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 2731 . . . 4 (.g𝐺) = (.g𝐺)
31, 2iscyg 19791 . . 3 (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵))
43simprbi 496 . 2 (𝐺 ∈ CycGrp → ∃𝑥𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)
5 ghmcyg.1 . . . 4 𝐶 = (Base‘𝐻)
6 eqid 2731 . . . 4 (.g𝐻) = (.g𝐻)
7 ghmgrp2 19131 . . . . 5 (𝐹 ∈ (𝐺 GrpHom 𝐻) → 𝐻 ∈ Grp)
87ad2antrr 726 . . . 4 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐻 ∈ Grp)
9 fof 6735 . . . . . 6 (𝐹:𝐵onto𝐶𝐹:𝐵𝐶)
109ad2antlr 727 . . . . 5 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐹:𝐵𝐶)
11 simprl 770 . . . . 5 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝑥𝐵)
1210, 11ffvelcdmd 7018 . . . 4 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → (𝐹𝑥) ∈ 𝐶)
13 simplr 768 . . . . . . . 8 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐹:𝐵onto𝐶)
14 foeq2 6732 . . . . . . . . 9 (ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵 → (𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))–onto𝐶𝐹:𝐵onto𝐶))
1514ad2antll 729 . . . . . . . 8 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → (𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))–onto𝐶𝐹:𝐵onto𝐶))
1613, 15mpbird 257 . . . . . . 7 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))–onto𝐶)
17 foelrn 7040 . . . . . . 7 ((𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))–onto𝐶𝑦𝐶) → ∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))𝑦 = (𝐹𝑧))
1816, 17sylan 580 . . . . . 6 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) → ∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))𝑦 = (𝐹𝑧))
19 ovex 7379 . . . . . . . 8 (𝑚(.g𝐺)𝑥) ∈ V
2019rgenw 3051 . . . . . . 7 𝑚 ∈ ℤ (𝑚(.g𝐺)𝑥) ∈ V
21 oveq1 7353 . . . . . . . . 9 (𝑛 = 𝑚 → (𝑛(.g𝐺)𝑥) = (𝑚(.g𝐺)𝑥))
2221cbvmptv 5193 . . . . . . . 8 (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = (𝑚 ∈ ℤ ↦ (𝑚(.g𝐺)𝑥))
23 fveq2 6822 . . . . . . . . 9 (𝑧 = (𝑚(.g𝐺)𝑥) → (𝐹𝑧) = (𝐹‘(𝑚(.g𝐺)𝑥)))
2423eqeq2d 2742 . . . . . . . 8 (𝑧 = (𝑚(.g𝐺)𝑥) → (𝑦 = (𝐹𝑧) ↔ 𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥))))
2522, 24rexrnmptw 7028 . . . . . . 7 (∀𝑚 ∈ ℤ (𝑚(.g𝐺)𝑥) ∈ V → (∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))𝑦 = (𝐹𝑧) ↔ ∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥))))
2620, 25ax-mp 5 . . . . . 6 (∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))𝑦 = (𝐹𝑧) ↔ ∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥)))
2718, 26sylib 218 . . . . 5 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) → ∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥)))
28 simp-4l 782 . . . . . . . 8 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) ∧ 𝑚 ∈ ℤ) → 𝐹 ∈ (𝐺 GrpHom 𝐻))
29 simpr 484 . . . . . . . 8 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℤ)
3011ad2antrr 726 . . . . . . . 8 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) ∧ 𝑚 ∈ ℤ) → 𝑥𝐵)
311, 2, 6ghmmulg 19140 . . . . . . . 8 ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑚 ∈ ℤ ∧ 𝑥𝐵) → (𝐹‘(𝑚(.g𝐺)𝑥)) = (𝑚(.g𝐻)(𝐹𝑥)))
3228, 29, 30, 31syl3anc 1373 . . . . . . 7 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) ∧ 𝑚 ∈ ℤ) → (𝐹‘(𝑚(.g𝐺)𝑥)) = (𝑚(.g𝐻)(𝐹𝑥)))
3332eqeq2d 2742 . . . . . 6 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) ∧ 𝑚 ∈ ℤ) → (𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥)) ↔ 𝑦 = (𝑚(.g𝐻)(𝐹𝑥))))
3433rexbidva 3154 . . . . 5 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) → (∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥)) ↔ ∃𝑚 ∈ ℤ 𝑦 = (𝑚(.g𝐻)(𝐹𝑥))))
3527, 34mpbid 232 . . . 4 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) → ∃𝑚 ∈ ℤ 𝑦 = (𝑚(.g𝐻)(𝐹𝑥)))
365, 6, 8, 12, 35iscygd 19799 . . 3 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐻 ∈ CycGrp)
3736rexlimdvaa 3134 . 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 206  wa 395   = wceq 1541  wcel 2111  wral 3047  wrex 3056  Vcvv 3436  cmpt 5170  ran crn 5615  wf 6477  ontowfo 6479  cfv 6481  (class class class)co 7346  cz 12468  Basecbs 17120  Grpcgrp 18846  .gcmg 18980   GrpHom cghm 19124  CycGrpccyg 19789
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668  ax-cnex 11062  ax-resscn 11063  ax-1cn 11064  ax-icn 11065  ax-addcl 11066  ax-addrcl 11067  ax-mulcl 11068  ax-mulrcl 11069  ax-mulcom 11070  ax-addass 11071  ax-mulass 11072  ax-distr 11073  ax-i2m1 11074  ax-1ne0 11075  ax-1rid 11076  ax-rnegex 11077  ax-rrecex 11078  ax-cnre 11079  ax-pre-lttri 11080  ax-pre-lttrn 11081  ax-pre-ltadd 11082  ax-pre-mulgt0 11083
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-riota 7303  df-ov 7349  df-oprab 7350  df-mpo 7351  df-om 7797  df-1st 7921  df-2nd 7922  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329  df-er 8622  df-map 8752  df-en 8870  df-dom 8871  df-sdom 8872  df-pnf 11148  df-mnf 11149  df-xr 11150  df-ltxr 11151  df-le 11152  df-sub 11346  df-neg 11347  df-nn 12126  df-n0 12382  df-z 12469  df-uz 12733  df-fz 13408  df-seq 13909  df-0g 17345  df-mgm 18548  df-sgrp 18627  df-mnd 18643  df-mhm 18691  df-grp 18849  df-minusg 18850  df-mulg 18981  df-ghm 19125  df-cyg 19790
This theorem is referenced by:  giccyg  19812
  Copyright terms: Public domain W3C validator