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

Theorem ghmcyg 20010
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 2765 . . . 4 (.g𝐺) = (.g𝐺)
31, 2iscyg 19993 . . 3 (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵))
43simprbi 503 . 2 (𝐺 ∈ CycGrp → ∃𝑥𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)
5 ghmcyg.1 . . . 4 𝐶 = (Base‘𝐻)
6 eqid 2765 . . . 4 (.g𝐻) = (.g𝐻)
7 ghmgrp2 19333 . . . . 5 (𝐹 ∈ (𝐺 GrpHom 𝐻) → 𝐻 ∈ Grp)
87ad2antrr 739 . . . 4 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐻 ∈ Grp)
9 fof 6796 . . . . . 6 (𝐹:𝐵onto𝐶𝐹:𝐵𝐶)
109ad2antlr 740 . . . . 5 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐹:𝐵𝐶)
11 simprl 783 . . . . 5 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝑥𝐵)
1210, 11ffvelcdmd 7084 . . . 4 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → (𝐹𝑥) ∈ 𝐶)
13 simplr 781 . . . . . . . 8 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐹:𝐵onto𝐶)
14 foeq2 6793 . . . . . . . . 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 7106 . . . . . . 7 ((𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))–onto𝐶𝑦𝐶) → ∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))𝑦 = (𝐹𝑧))
1816, 17sylan 592 . . . . . 6 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) → ∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥))𝑦 = (𝐹𝑧))
19 ovex 7452 . . . . . . . 8 (𝑚(.g𝐺)𝑥) ∈ V
2019rgenw 3085 . . . . . . 7 𝑚 ∈ ℤ (𝑚(.g𝐺)𝑥) ∈ V
21 oveq1 7426 . . . . . . . . 9 (𝑛 = 𝑚 → (𝑛(.g𝐺)𝑥) = (𝑚(.g𝐺)𝑥))
2221cbvmptv 5217 . . . . . . . 8 (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = (𝑚 ∈ ℤ ↦ (𝑚(.g𝐺)𝑥))
23 fveq2 6885 . . . . . . . . 9 (𝑧 = (𝑚(.g𝐺)𝑥) → (𝐹𝑧) = (𝐹‘(𝑚(.g𝐺)𝑥)))
2423eqeq2d 2776 . . . . . . . 8 (𝑧 = (𝑚(.g𝐺)𝑥) → (𝑦 = (𝐹𝑧) ↔ 𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥))))
2522, 24rexrnmptw 7094 . . . . . . 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 19342 . . . . . . . 8 ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑚 ∈ ℤ ∧ 𝑥𝐵) → (𝐹‘(𝑚(.g𝐺)𝑥)) = (𝑚(.g𝐻)(𝐹𝑥)))
3228, 29, 30, 31syl3anc 1398 . . . . . . 7 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) ∧ 𝑚 ∈ ℤ) → (𝐹‘(𝑚(.g𝐺)𝑥)) = (𝑚(.g𝐻)(𝐹𝑥)))
3332eqeq2d 2776 . . . . . 6 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) ∧ 𝑚 ∈ ℤ) → (𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥)) ↔ 𝑦 = (𝑚(.g𝐻)(𝐹𝑥))))
3433rexbidva 3189 . . . . 5 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) → (∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g𝐺)𝑥)) ↔ ∃𝑚 ∈ ℤ 𝑦 = (𝑚(.g𝐻)(𝐹𝑥))))
3527, 34mpbid 235 . . . 4 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) ∧ 𝑦𝐶) → ∃𝑚 ∈ ℤ 𝑦 = (𝑚(.g𝐻)(𝐹𝑥)))
365, 6, 8, 12, 35iscygd 20001 . . 3 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵onto𝐶) ∧ (𝑥𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g𝐺)𝑥)) = 𝐵)) → 𝐻 ∈ CycGrp)
3736rexlimdvaa 3169 . 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 1570  wcel 2146  wral 3081  wrex 3091  Vcvv 3457  cmpt 5194  ran crn 5664  wf 6536  ontowfo 6538  cfv 6540  (class class class)co 7419  cz 12606  Basecbs 17291  Grpcgrp 19044  .gcmg 19177   GrpHom cghm 19327  CycGrpccyg 19991
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-cnex 11171  ax-resscn 11172  ax-1cn 11173  ax-icn 11174  ax-addcl 11175  ax-addrcl 11176  ax-mulcl 11177  ax-mulrcl 11178  ax-mulcom 11179  ax-addass 11180  ax-mulass 11181  ax-distr 11182  ax-i2m1 11183  ax-1ne0 11184  ax-1rid 11185  ax-rnegex 11186  ax-rrecex 11187  ax-cnre 11188  ax-pre-lttri 11189  ax-pre-lttrn 11190  ax-pre-ltadd 11191  ax-pre-mulgt0 11192
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-er 8700  df-map 8832  df-en 8950  df-dom 8951  df-sdom 8952  df-pnf 11260  df-mnf 11261  df-xr 11262  df-ltxr 11263  df-le 11264  df-sub 11458  df-neg 11459  df-nn 12249  df-n0 12520  df-z 12607  df-uz 12879  df-fz 13552  df-seq 14056  df-0g 17516  df-mgm 18720  df-sgrp 18809  df-mnd 18825  df-mhm 18878  df-grp 19047  df-minusg 19048  df-mulg 19178  df-ghm 19328  df-cyg 19992
This theorem is used by:  giccyg  20014
  Copyright terms: Public domain W3C validator