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

Theorem ghmcyg 20103
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 2761 . . . 4 (.g‘𝐺) = (.g‘𝐺)
31, 2iscyg 20086 . . 3 (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵))
43simprbi 503 . 2 (𝐺 ∈ CycGrp → ∃𝑥 ∈ 𝐵 ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)
5 ghmcyg.1 . . . 4 𝐶 = (Base‘𝐻)
6 eqid 2761 . . . 4 (.g‘𝐻) = (.g‘𝐻)
7 ghmgrp2 19426 . . . . 5 (𝐹 ∈ (𝐺 GrpHom 𝐻) → 𝐻 ∈ Grp)
87ad2antrr 739 . . . 4 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → 𝐻 ∈ Grp)
9 fof 6794 . . . . . 6 (𝐹:𝐵–onto→𝐶 → 𝐹:𝐵⟶𝐶)
109ad2antlr 740 . . . . 5 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → 𝐹:𝐵⟶𝐶)
11 simprl 783 . . . . 5 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → 𝑥 ∈ 𝐵)
1210, 11ffvelcdmd 7083 . . . 4 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → (𝐹‘𝑥) ∈ 𝐶)
13 simplr 781 . . . . . . . 8 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → 𝐹:𝐵–onto→𝐶)
14 foeq2 6791 . . . . . . . . 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 7105 . . . . . . 7 ((𝐹:ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥))–onto→𝐶 ∧ 𝑦 ∈ 𝐶) → ∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥))𝑦 = (𝐹‘𝑧))
1816, 17sylan 592 . . . . . 6 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) → ∃𝑧 ∈ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥))𝑦 = (𝐹‘𝑧))
19 ovex 7451 . . . . . . . 8 (𝑚(.g‘𝐺)𝑥) ∈ V
2019rgenw 3081 . . . . . . 7 ∀𝑚 ∈ ℤ (𝑚(.g‘𝐺)𝑥) ∈ V
21 oveq1 7425 . . . . . . . . 9 (𝑛 = 𝑚 → (𝑛(.g‘𝐺)𝑥) = (𝑚(.g‘𝐺)𝑥))
2221cbvmptv 5209 . . . . . . . 8 (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = (𝑚 ∈ ℤ ↦ (𝑚(.g‘𝐺)𝑥))
23 fveq2 6883 . . . . . . . . 9 (𝑧 = (𝑚(.g‘𝐺)𝑥) → (𝐹‘𝑧) = (𝐹‘(𝑚(.g‘𝐺)𝑥)))
2423eqeq2d 2772 . . . . . . . 8 (𝑧 = (𝑚(.g‘𝐺)𝑥) → (𝑦 = (𝐹‘𝑧) ↔ 𝑦 = (𝐹‘(𝑚(.g‘𝐺)𝑥))))
2522, 24rexrnmptw 7093 . . . . . . 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 19435 . . . . . . . 8 ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑚 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → (𝐹‘(𝑚(.g‘𝐺)𝑥)) = (𝑚(.g‘𝐻)(𝐹‘𝑥)))
3228, 29, 30, 31syl3anc 1398 . . . . . . 7 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) ∧ 𝑚 ∈ ℤ) → (𝐹‘(𝑚(.g‘𝐺)𝑥)) = (𝑚(.g‘𝐻)(𝐹‘𝑥)))
3332eqeq2d 2772 . . . . . 6 (((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) ∧ 𝑚 ∈ ℤ) → (𝑦 = (𝐹‘(𝑚(.g‘𝐺)𝑥)) ↔ 𝑦 = (𝑚(.g‘𝐻)(𝐹‘𝑥))))
3433rexbidva 3185 . . . . 5 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) → (∃𝑚 ∈ ℤ 𝑦 = (𝐹‘(𝑚(.g‘𝐺)𝑥)) ↔ ∃𝑚 ∈ ℤ 𝑦 = (𝑚(.g‘𝐻)(𝐹‘𝑥))))
3527, 34mpbid 235 . . . 4 ((((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) ∧ 𝑦 ∈ 𝐶) → ∃𝑚 ∈ ℤ 𝑦 = (𝑚(.g‘𝐻)(𝐹‘𝑥)))
365, 6, 8, 12, 35iscygd 20094 . . 3 (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝐹:𝐵–onto→𝐶) ∧ (𝑥 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛(.g‘𝐺)𝑥)) = 𝐵)) → 𝐻 ∈ CycGrp)
3736rexlimdvaa 3165 . 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 2145  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ↦ cmpt 5186  ran crn 5652  ⟶wf 6533  –onto→wfo 6535  ‘cfv 6537  (class class class)co 7418  ℤcz 12686  Basecbs 17380  Grpcgrp 19137  .gcmg 19270   GrpHom cghm 19420  CycGrpccyg 20084
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-er 8710  df-map 8842  df-en 8967  df-dom 8968  df-sdom 8969  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-nn 12329  df-n0 12600  df-z 12687  df-uz 12959  df-fz 13633  df-seq 14138  df-0g 17605  df-mgm 18809  df-sgrp 18901  df-mnd 18917  df-mhm 18971  df-grp 19140  df-minusg 19141  df-mulg 19271  df-ghm 19421  df-cyg 20085
This theorem is used by:  giccyg  20107
  Copyright terms: Public domain W3C validator