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

Theorem ghmcyg 20117
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 2760 . . . 4 (.g‘𝐺) = (.g‘𝐺)
31, 2iscyg 20100 . . 3 (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵))
43simprbi 503 . 2 (𝐺 ∈ CycGrp → ∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)
5 ghmcyg.1 . . . 4 𝐶 = (Base‘𝐻)
6 eqid 2760 . . . 4 (.g‘𝐻) = (.g‘𝐻)
7 ghmgrp2 19440 . . . . 5 (𝐹 ∈ (𝐺 GrpHom 𝐻) → 𝐻 ∈ Grp)
87ad2antrr 739 . . . 4 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → 𝐻 ∈ Grp)
9 fof 6799 . . . . . 6 (𝐹:𝐵–onto→𝐶 → 𝐹:𝐵⟶𝐶)
109ad2antlr 740 . . . . 5 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → 𝐹:𝐵⟶𝐶)
11 simprl 783 . . . . 5 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → 𝑥 ∈ 𝐵)
1210, 11ffvelcdmd 7088 . . . 4 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → (𝐹‘𝑥) ∈ 𝐶)
13 simplr 781 . . . . . . . 8 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → 𝐹:𝐵–onto→𝐶)
14 foeq2 6796 . . . . . . . . 9 (ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵 → (𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥))–onto→𝐶 ↔ 𝐹:𝐵–onto→𝐶))
1514ad2antll 742 . . . . . . . 8 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → (𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥))–onto→𝐶 ↔ 𝐹:𝐵–onto→𝐶))
1613, 15mpbird 260 . . . . . . 7 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → 𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥))–onto→𝐶)
17 foelrn 7110 . . . . . . 7 ((𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥))–onto→𝐶 ∧ 𝑦 ∈ 𝐶) → ∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥))𝑦 = (𝐹‘𝑧))
1816, 17sylan 592 . . . . . 6 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) → ∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥))𝑦 = (𝐹‘𝑧))
19 ovex 7455 . . . . . . . 8 (𝑚(.g‘𝐺)𝑥) ∈ V
2019rgenw 3080 . . . . . . 7 ∀𝑚 ∈ ℤ (𝑚(.g‘𝐺)𝑥) ∈ V
21 oveq1 7429 . . . . . . . . 9 (𝑛 = 𝑚 → (𝑛(.g‘𝐺)𝑥) = (𝑚(.g‘𝐺)𝑥))
2221cbvmptv 5208 . . . . . . . 8 (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = (𝑚 ∈ ℤ ↦ (𝑚(.g‘𝐺)𝑥))
23 fveq2 6888 . . . . . . . . 9 (𝑧 = (𝑚(.g‘𝐺)𝑥) → (𝐹‘𝑧) = (𝐹‘(𝑚(.g‘𝐺)𝑥)))
2423eqeq2d 2771 . . . . . . . 8 (𝑧 = (𝑚(.g‘𝐺)𝑥) → (𝑦 = (𝐹‘𝑧) ↔ 𝑦 = (𝐹‘(𝑚(.g‘𝐺)𝑥))))
2522, 24rexrnmptw 7098 . . . . . . 7 (∀𝑚 ∈ ℤ (𝑚(.g‘𝐺)𝑥) ∈ V → (∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥))𝑦 = (𝐹‘𝑧) ↔ ∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g‘𝐺)𝑥))))
2620, 25ax-mp 5 . . . . . 6 (∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥))𝑦 = (𝐹‘𝑧) ↔ ∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g‘𝐺)𝑥)))
2718, 26sylib 221 . . . . 5 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) → ∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g‘𝐺)𝑥)))
28 simp-4l 795 . . . . . . . 8 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) ∧ 𝑚 ∈ ℤ) → 𝐹 ∈ (𝐺 GrpHom 𝐻))
29 simpr 490 . . . . . . . 8 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℤ)
3011ad2antrr 739 . . . . . . . 8 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) ∧ 𝑚 ∈ ℤ) → 𝑥 ∈ 𝐵)
311, 2, 6ghmmulg 19449 . . . . . . . 8 ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑚 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → (𝐹‘(𝑚(.g‘𝐺)𝑥)) = (𝑚(.g‘𝐻)(𝐹‘𝑥)))
3228, 29, 30, 31syl3anc 1398 . . . . . . 7 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) ∧ 𝑚 ∈ ℤ) → (𝐹‘(𝑚(.g‘𝐺)𝑥)) = (𝑚(.g‘𝐻)(𝐹‘𝑥)))
3332eqeq2d 2771 . . . . . 6 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) ∧ 𝑚 ∈ ℤ) → (𝑦 = (𝐹‘(𝑚(.g‘𝐺)𝑥)) ↔ 𝑦 = (𝑚(.g‘𝐻)(𝐹‘𝑥))))
3433rexbidva 3184 . . . . 5 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) → (∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g‘𝐺)𝑥)) ↔ ∃𝑚 ∈ ℤ 𝑦 = (𝑚(.g‘𝐻)(𝐹‘𝑥))))
3527, 34mpbid 235 . . . 4 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) → ∃𝑚 ∈ ℤ 𝑦 = (𝑚(.g‘𝐻)(𝐹‘𝑥)))
365, 6, 8, 12, 35iscygd 20108 . . 3 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → 𝐻 ∈ CycGrp)
3736rexlimdvaa 3164 . 2 ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) → (∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵 → 𝐻 ∈ CycGrp))
384, 37syl5 35 1 ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) → (𝐺 ∈ CycGrp → 𝐻 ∈ CycGrp))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ↦ cmpt 5185  ran crn 5651  ⟶wf 6537  –onto→wfo 6539  ‘cfv 6541  (class class class)co 7422  ℤcz 12698  Basecbs 17394  Grpcgrp 19151  .gcmg 19284   GrpHom cghm 19434  CycGrpccyg 20098
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 5326  ax-pr 5390  ax-un 7753  ax-cnex 11261  ax-resscn 11262  ax-1cn 11263  ax-icn 11264  ax-addcl 11265  ax-addrcl 11266  ax-mulcl 11267  ax-mulrcl 11268  ax-mulcom 11269  ax-addass 11270  ax-mulass 11271  ax-distr 11272  ax-i2m1 11273  ax-1ne0 11274  ax-1rid 11275  ax-rnegex 11276  ax-rrecex 11277  ax-cnre 11278  ax-pre-lttri 11279  ax-pre-lttrn 11280  ax-pre-ltadd 11281  ax-pre-mulgt0 11282
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-nel 3062  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-pss 4013  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-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-riota 7379  df-ov 7425  df-oprab 7426  df-mpo 7427  df-om 7880  df-1st 8003  df-2nd 8004  df-frecs 8304  df-wrecs 8335  df-recs 8384  df-rdg 8423  df-er 8722  df-map 8854  df-en 8979  df-dom 8980  df-sdom 8981  df-pnf 11350  df-mnf 11351  df-xr 11352  df-ltxr 11353  df-le 11354  df-sub 11548  df-neg 11549  df-nn 12341  df-n0 12612  df-z 12699  df-uz 12971  df-fz 13645  df-seq 14150  df-0g 17619  df-mgm 18823  df-sgrp 18915  df-mnd 18931  df-mhm 18985  df-grp 19154  df-minusg 19155  df-mulg 19285  df-ghm 19435  df-cyg 20099
This theorem is used by:  giccyg  20121
  Copyright terms: Public domain W3C validator