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

Theorem gexex 18972
 Description: In an abelian group with finite exponent, there is an element in the group with order equal to the exponent. In other words, all orders of elements divide the largest order of an element of the group. This fails if 𝐸 = 0, for example in an infinite p-group, where there are elements of arbitrarily large orders (so 𝐸 is zero) but no elements of infinite order. (Contributed by Mario Carneiro, 24-Apr-2016.)
Hypotheses
Ref Expression
gexex.1 𝑋 = (Base‘𝐺)
gexex.2 𝐸 = (gEx‘𝐺)
gexex.3 𝑂 = (od‘𝐺)
Assertion
Ref Expression
gexex ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ∃𝑥𝑋 (𝑂𝑥) = 𝐸)
Distinct variable groups:   𝑥,𝐸   𝑥,𝐺   𝑥,𝑂   𝑥,𝑋

Proof of Theorem gexex
Dummy variables 𝑦 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 gexex.1 . . 3 𝑋 = (Base‘𝐺)
2 gexex.2 . . 3 𝐸 = (gEx‘𝐺)
3 gexex.3 . . 3 𝑂 = (od‘𝐺)
4 simpll 765 . . 3 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) → 𝐺 ∈ Abel)
5 simplr 767 . . 3 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) → 𝐸 ∈ ℕ)
6 simprl 769 . . 3 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) → 𝑥𝑋)
71, 3odf 18664 . . . . . . 7 𝑂:𝑋⟶ℕ0
8 frn 6519 . . . . . . 7 (𝑂:𝑋⟶ℕ0 → ran 𝑂 ⊆ ℕ0)
97, 8ax-mp 5 . . . . . 6 ran 𝑂 ⊆ ℕ0
10 nn0ssz 12002 . . . . . 6 0 ⊆ ℤ
119, 10sstri 3975 . . . . 5 ran 𝑂 ⊆ ℤ
12 nnz 12003 . . . . . . . 8 (𝐸 ∈ ℕ → 𝐸 ∈ ℤ)
1312adantl 484 . . . . . . 7 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → 𝐸 ∈ ℤ)
14 ablgrp 18910 . . . . . . . . . . . 12 (𝐺 ∈ Abel → 𝐺 ∈ Grp)
1514adantr 483 . . . . . . . . . . 11 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → 𝐺 ∈ Grp)
161, 2, 3gexod 18710 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑥𝑋) → (𝑂𝑥) ∥ 𝐸)
1715, 16sylan 582 . . . . . . . . . 10 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ 𝑥𝑋) → (𝑂𝑥) ∥ 𝐸)
181, 3odcl 18663 . . . . . . . . . . . . 13 (𝑥𝑋 → (𝑂𝑥) ∈ ℕ0)
1918adantl 484 . . . . . . . . . . . 12 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ 𝑥𝑋) → (𝑂𝑥) ∈ ℕ0)
2019nn0zd 12084 . . . . . . . . . . 11 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ 𝑥𝑋) → (𝑂𝑥) ∈ ℤ)
21 simplr 767 . . . . . . . . . . 11 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ 𝑥𝑋) → 𝐸 ∈ ℕ)
22 dvdsle 15659 . . . . . . . . . . 11 (((𝑂𝑥) ∈ ℤ ∧ 𝐸 ∈ ℕ) → ((𝑂𝑥) ∥ 𝐸 → (𝑂𝑥) ≤ 𝐸))
2320, 21, 22syl2anc 586 . . . . . . . . . 10 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ 𝑥𝑋) → ((𝑂𝑥) ∥ 𝐸 → (𝑂𝑥) ≤ 𝐸))
2417, 23mpd 15 . . . . . . . . 9 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ 𝑥𝑋) → (𝑂𝑥) ≤ 𝐸)
2524ralrimiva 3182 . . . . . . . 8 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ∀𝑥𝑋 (𝑂𝑥) ≤ 𝐸)
26 ffn 6513 . . . . . . . . . 10 (𝑂:𝑋⟶ℕ0𝑂 Fn 𝑋)
277, 26ax-mp 5 . . . . . . . . 9 𝑂 Fn 𝑋
28 breq1 5068 . . . . . . . . . 10 (𝑦 = (𝑂𝑥) → (𝑦𝐸 ↔ (𝑂𝑥) ≤ 𝐸))
2928ralrn 6853 . . . . . . . . 9 (𝑂 Fn 𝑋 → (∀𝑦 ∈ ran 𝑂 𝑦𝐸 ↔ ∀𝑥𝑋 (𝑂𝑥) ≤ 𝐸))
3027, 29ax-mp 5 . . . . . . . 8 (∀𝑦 ∈ ran 𝑂 𝑦𝐸 ↔ ∀𝑥𝑋 (𝑂𝑥) ≤ 𝐸)
3125, 30sylibr 236 . . . . . . 7 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ∀𝑦 ∈ ran 𝑂 𝑦𝐸)
32 brralrspcev 5125 . . . . . . 7 ((𝐸 ∈ ℤ ∧ ∀𝑦 ∈ ran 𝑂 𝑦𝐸) → ∃𝑛 ∈ ℤ ∀𝑦 ∈ ran 𝑂 𝑦𝑛)
3313, 31, 32syl2anc 586 . . . . . 6 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ∃𝑛 ∈ ℤ ∀𝑦 ∈ ran 𝑂 𝑦𝑛)
3433ad2antrr 724 . . . . 5 ((((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) ∧ 𝑦𝑋) → ∃𝑛 ∈ ℤ ∀𝑦 ∈ ran 𝑂 𝑦𝑛)
3527a1i 11 . . . . . 6 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) → 𝑂 Fn 𝑋)
36 fnfvelrn 6847 . . . . . 6 ((𝑂 Fn 𝑋𝑦𝑋) → (𝑂𝑦) ∈ ran 𝑂)
3735, 36sylan 582 . . . . 5 ((((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) ∧ 𝑦𝑋) → (𝑂𝑦) ∈ ran 𝑂)
38 suprzub 12338 . . . . 5 ((ran 𝑂 ⊆ ℤ ∧ ∃𝑛 ∈ ℤ ∀𝑦 ∈ ran 𝑂 𝑦𝑛 ∧ (𝑂𝑦) ∈ ran 𝑂) → (𝑂𝑦) ≤ sup(ran 𝑂, ℝ, < ))
3911, 34, 37, 38mp3an2i 1462 . . . 4 ((((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) ∧ 𝑦𝑋) → (𝑂𝑦) ≤ sup(ran 𝑂, ℝ, < ))
40 simplrr 776 . . . 4 ((((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) ∧ 𝑦𝑋) → (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))
4139, 40breqtrrd 5093 . . 3 ((((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) ∧ 𝑦𝑋) → (𝑂𝑦) ≤ (𝑂𝑥))
421, 2, 3, 4, 5, 6, 41gexexlem 18971 . 2 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) → (𝑂𝑥) = 𝐸)
431grpbn0 18131 . . . . . 6 (𝐺 ∈ Grp → 𝑋 ≠ ∅)
4415, 43syl 17 . . . . 5 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → 𝑋 ≠ ∅)
457fdmi 6523 . . . . . . . 8 dom 𝑂 = 𝑋
4645eqeq1i 2826 . . . . . . 7 (dom 𝑂 = ∅ ↔ 𝑋 = ∅)
47 dm0rn0 5794 . . . . . . 7 (dom 𝑂 = ∅ ↔ ran 𝑂 = ∅)
4846, 47bitr3i 279 . . . . . 6 (𝑋 = ∅ ↔ ran 𝑂 = ∅)
4948necon3bii 3068 . . . . 5 (𝑋 ≠ ∅ ↔ ran 𝑂 ≠ ∅)
5044, 49sylib 220 . . . 4 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ran 𝑂 ≠ ∅)
51 suprzcl2 12337 . . . 4 ((ran 𝑂 ⊆ ℤ ∧ ran 𝑂 ≠ ∅ ∧ ∃𝑛 ∈ ℤ ∀𝑦 ∈ ran 𝑂 𝑦𝑛) → sup(ran 𝑂, ℝ, < ) ∈ ran 𝑂)
5211, 50, 33, 51mp3an2i 1462 . . 3 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → sup(ran 𝑂, ℝ, < ) ∈ ran 𝑂)
53 fvelrnb 6725 . . . 4 (𝑂 Fn 𝑋 → (sup(ran 𝑂, ℝ, < ) ∈ ran 𝑂 ↔ ∃𝑥𝑋 (𝑂𝑥) = sup(ran 𝑂, ℝ, < )))
5427, 53ax-mp 5 . . 3 (sup(ran 𝑂, ℝ, < ) ∈ ran 𝑂 ↔ ∃𝑥𝑋 (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))
5552, 54sylib 220 . 2 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ∃𝑥𝑋 (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))
5642, 55reximddv 3275 1 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ∃𝑥𝑋 (𝑂𝑥) = 𝐸)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1533   ∈ wcel 2110   ≠ wne 3016  ∀wral 3138  ∃wrex 3139   ⊆ wss 3935  ∅c0 4290   class class class wbr 5065  dom cdm 5554  ran crn 5555   Fn wfn 6349  ⟶wf 6350  ‘cfv 6354  supcsup 8903  ℝcr 10535   < clt 10674   ≤ cle 10675  ℕcn 11637  ℕ0cn0 11896  ℤcz 11980   ∥ cdvds 15606  Basecbs 16482  Grpcgrp 18102  odcod 18651  gExcgex 18652  Abelcabl 18906 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329  ax-un 7460  ax-cnex 10592  ax-resscn 10593  ax-1cn 10594  ax-icn 10595  ax-addcl 10596  ax-addrcl 10597  ax-mulcl 10598  ax-mulrcl 10599  ax-mulcom 10600  ax-addass 10601  ax-mulass 10602  ax-distr 10603  ax-i2m1 10604  ax-1ne0 10605  ax-1rid 10606  ax-rnegex 10607  ax-rrecex 10608  ax-cnre 10609  ax-pre-lttri 10610  ax-pre-lttrn 10611  ax-pre-ltadd 10612  ax-pre-mulgt0 10613  ax-pre-sup 10614 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-fal 1546  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-tp 4571  df-op 4573  df-uni 4838  df-iun 4920  df-br 5066  df-opab 5128  df-mpt 5146  df-tr 5172  df-id 5459  df-eprel 5464  df-po 5473  df-so 5474  df-fr 5513  df-we 5515  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-pred 6147  df-ord 6193  df-on 6194  df-lim 6195  df-suc 6196  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-riota 7113  df-ov 7158  df-oprab 7159  df-mpo 7160  df-om 7580  df-1st 7688  df-2nd 7689  df-wrecs 7946  df-recs 8007  df-rdg 8045  df-1o 8101  df-2o 8102  df-er 8288  df-en 8509  df-dom 8510  df-sdom 8511  df-fin 8512  df-sup 8905  df-inf 8906  df-pnf 10676  df-mnf 10677  df-xr 10678  df-ltxr 10679  df-le 10680  df-sub 10871  df-neg 10872  df-div 11297  df-nn 11638  df-2 11699  df-3 11700  df-n0 11897  df-z 11981  df-uz 12243  df-q 12348  df-rp 12389  df-fz 12892  df-fzo 13033  df-fl 13161  df-mod 13237  df-seq 13369  df-exp 13429  df-cj 14457  df-re 14458  df-im 14459  df-sqrt 14593  df-abs 14594  df-dvds 15607  df-gcd 15843  df-prm 16015  df-pc 16173  df-0g 16714  df-mgm 17851  df-sgrp 17900  df-mnd 17911  df-grp 18105  df-minusg 18106  df-sbg 18107  df-mulg 18224  df-od 18655  df-gex 18656  df-cmn 18907  df-abl 18908 This theorem is referenced by:  cyggexb  19018  pgpfaclem3  19204
 Copyright terms: Public domain W3C validator