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

Theorem gexex 18256
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 790 . . 3 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) → 𝐺 ∈ Abel)
5 simplr 792 . . 3 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) → 𝐸 ∈ ℕ)
6 simprl 794 . . 3 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) → 𝑥𝑋)
71, 3odf 17956 . . . . . . . 8 𝑂:𝑋⟶ℕ0
8 frn 6053 . . . . . . . 8 (𝑂:𝑋⟶ℕ0 → ran 𝑂 ⊆ ℕ0)
97, 8ax-mp 5 . . . . . . 7 ran 𝑂 ⊆ ℕ0
10 nn0ssz 11398 . . . . . . 7 0 ⊆ ℤ
119, 10sstri 3612 . . . . . 6 ran 𝑂 ⊆ ℤ
1211a1i 11 . . . . 5 ((((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) ∧ 𝑦𝑋) → ran 𝑂 ⊆ ℤ)
13 nnz 11399 . . . . . . . 8 (𝐸 ∈ ℕ → 𝐸 ∈ ℤ)
1413adantl 482 . . . . . . 7 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → 𝐸 ∈ ℤ)
15 ablgrp 18198 . . . . . . . . . . . 12 (𝐺 ∈ Abel → 𝐺 ∈ Grp)
1615adantr 481 . . . . . . . . . . 11 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → 𝐺 ∈ Grp)
171, 2, 3gexod 18001 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑥𝑋) → (𝑂𝑥) ∥ 𝐸)
1816, 17sylan 488 . . . . . . . . . 10 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ 𝑥𝑋) → (𝑂𝑥) ∥ 𝐸)
191, 3odcl 17955 . . . . . . . . . . . . 13 (𝑥𝑋 → (𝑂𝑥) ∈ ℕ0)
2019adantl 482 . . . . . . . . . . . 12 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ 𝑥𝑋) → (𝑂𝑥) ∈ ℕ0)
2120nn0zd 11480 . . . . . . . . . . 11 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ 𝑥𝑋) → (𝑂𝑥) ∈ ℤ)
22 simplr 792 . . . . . . . . . . 11 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ 𝑥𝑋) → 𝐸 ∈ ℕ)
23 dvdsle 15032 . . . . . . . . . . 11 (((𝑂𝑥) ∈ ℤ ∧ 𝐸 ∈ ℕ) → ((𝑂𝑥) ∥ 𝐸 → (𝑂𝑥) ≤ 𝐸))
2421, 22, 23syl2anc 693 . . . . . . . . . 10 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ 𝑥𝑋) → ((𝑂𝑥) ∥ 𝐸 → (𝑂𝑥) ≤ 𝐸))
2518, 24mpd 15 . . . . . . . . 9 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ 𝑥𝑋) → (𝑂𝑥) ≤ 𝐸)
2625ralrimiva 2966 . . . . . . . 8 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ∀𝑥𝑋 (𝑂𝑥) ≤ 𝐸)
27 ffn 6045 . . . . . . . . . 10 (𝑂:𝑋⟶ℕ0𝑂 Fn 𝑋)
287, 27ax-mp 5 . . . . . . . . 9 𝑂 Fn 𝑋
29 breq1 4656 . . . . . . . . . 10 (𝑦 = (𝑂𝑥) → (𝑦𝐸 ↔ (𝑂𝑥) ≤ 𝐸))
3029ralrn 6362 . . . . . . . . 9 (𝑂 Fn 𝑋 → (∀𝑦 ∈ ran 𝑂 𝑦𝐸 ↔ ∀𝑥𝑋 (𝑂𝑥) ≤ 𝐸))
3128, 30ax-mp 5 . . . . . . . 8 (∀𝑦 ∈ ran 𝑂 𝑦𝐸 ↔ ∀𝑥𝑋 (𝑂𝑥) ≤ 𝐸)
3226, 31sylibr 224 . . . . . . 7 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ∀𝑦 ∈ ran 𝑂 𝑦𝐸)
33 breq2 4657 . . . . . . . . 9 (𝑛 = 𝐸 → (𝑦𝑛𝑦𝐸))
3433ralbidv 2986 . . . . . . . 8 (𝑛 = 𝐸 → (∀𝑦 ∈ ran 𝑂 𝑦𝑛 ↔ ∀𝑦 ∈ ran 𝑂 𝑦𝐸))
3534rspcev 3309 . . . . . . 7 ((𝐸 ∈ ℤ ∧ ∀𝑦 ∈ ran 𝑂 𝑦𝐸) → ∃𝑛 ∈ ℤ ∀𝑦 ∈ ran 𝑂 𝑦𝑛)
3614, 32, 35syl2anc 693 . . . . . 6 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ∃𝑛 ∈ ℤ ∀𝑦 ∈ ran 𝑂 𝑦𝑛)
3736ad2antrr 762 . . . . 5 ((((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) ∧ 𝑦𝑋) → ∃𝑛 ∈ ℤ ∀𝑦 ∈ ran 𝑂 𝑦𝑛)
3828a1i 11 . . . . . 6 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) → 𝑂 Fn 𝑋)
39 fnfvelrn 6356 . . . . . 6 ((𝑂 Fn 𝑋𝑦𝑋) → (𝑂𝑦) ∈ ran 𝑂)
4038, 39sylan 488 . . . . 5 ((((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) ∧ 𝑦𝑋) → (𝑂𝑦) ∈ ran 𝑂)
41 suprzub 11779 . . . . 5 ((ran 𝑂 ⊆ ℤ ∧ ∃𝑛 ∈ ℤ ∀𝑦 ∈ ran 𝑂 𝑦𝑛 ∧ (𝑂𝑦) ∈ ran 𝑂) → (𝑂𝑦) ≤ sup(ran 𝑂, ℝ, < ))
4212, 37, 40, 41syl3anc 1326 . . . 4 ((((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) ∧ 𝑦𝑋) → (𝑂𝑦) ≤ sup(ran 𝑂, ℝ, < ))
43 simplrr 801 . . . 4 ((((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) ∧ 𝑦𝑋) → (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))
4442, 43breqtrrd 4681 . . 3 ((((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) ∧ 𝑦𝑋) → (𝑂𝑦) ≤ (𝑂𝑥))
451, 2, 3, 4, 5, 6, 44gexexlem 18255 . 2 (((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) ∧ (𝑥𝑋 ∧ (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))) → (𝑂𝑥) = 𝐸)
4611a1i 11 . . . 4 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ran 𝑂 ⊆ ℤ)
471grpbn0 17451 . . . . . 6 (𝐺 ∈ Grp → 𝑋 ≠ ∅)
4816, 47syl 17 . . . . 5 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → 𝑋 ≠ ∅)
497fdmi 6052 . . . . . . . 8 dom 𝑂 = 𝑋
5049eqeq1i 2627 . . . . . . 7 (dom 𝑂 = ∅ ↔ 𝑋 = ∅)
51 dm0rn0 5342 . . . . . . 7 (dom 𝑂 = ∅ ↔ ran 𝑂 = ∅)
5250, 51bitr3i 266 . . . . . 6 (𝑋 = ∅ ↔ ran 𝑂 = ∅)
5352necon3bii 2846 . . . . 5 (𝑋 ≠ ∅ ↔ ran 𝑂 ≠ ∅)
5448, 53sylib 208 . . . 4 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ran 𝑂 ≠ ∅)
55 suprzcl2 11778 . . . 4 ((ran 𝑂 ⊆ ℤ ∧ ran 𝑂 ≠ ∅ ∧ ∃𝑛 ∈ ℤ ∀𝑦 ∈ ran 𝑂 𝑦𝑛) → sup(ran 𝑂, ℝ, < ) ∈ ran 𝑂)
5646, 54, 36, 55syl3anc 1326 . . 3 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → sup(ran 𝑂, ℝ, < ) ∈ ran 𝑂)
57 fvelrnb 6243 . . . 4 (𝑂 Fn 𝑋 → (sup(ran 𝑂, ℝ, < ) ∈ ran 𝑂 ↔ ∃𝑥𝑋 (𝑂𝑥) = sup(ran 𝑂, ℝ, < )))
5828, 57ax-mp 5 . . 3 (sup(ran 𝑂, ℝ, < ) ∈ ran 𝑂 ↔ ∃𝑥𝑋 (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))
5956, 58sylib 208 . 2 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ∃𝑥𝑋 (𝑂𝑥) = sup(ran 𝑂, ℝ, < ))
6045, 59reximddv 3018 1 ((𝐺 ∈ Abel ∧ 𝐸 ∈ ℕ) → ∃𝑥𝑋 (𝑂𝑥) = 𝐸)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1483  wcel 1990  wne 2794  wral 2912  wrex 2913  wss 3574  c0 3915   class class class wbr 4653  dom cdm 5114  ran crn 5115   Fn wfn 5883  wf 5884  cfv 5888  supcsup 8346  cr 9935   < clt 10074  cle 10075  cn 11020  0cn0 11292  cz 11377  cdvds 14983  Basecbs 15857  Grpcgrp 17422  odcod 17944  gExcgex 17945  Abelcabl 18194
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-inf2 8538  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013  ax-pre-sup 10014
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-fal 1489  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-2o 7561  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-sup 8348  df-inf 8349  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-div 10685  df-nn 11021  df-2 11079  df-3 11080  df-n0 11293  df-z 11378  df-uz 11688  df-q 11789  df-rp 11833  df-fz 12327  df-fzo 12466  df-fl 12593  df-mod 12669  df-seq 12802  df-exp 12861  df-cj 13839  df-re 13840  df-im 13841  df-sqrt 13975  df-abs 13976  df-dvds 14984  df-gcd 15217  df-prm 15386  df-pc 15542  df-0g 16102  df-mgm 17242  df-sgrp 17284  df-mnd 17295  df-grp 17425  df-minusg 17426  df-sbg 17427  df-mulg 17541  df-od 17948  df-gex 17949  df-cmn 18195  df-abl 18196
This theorem is referenced by:  cyggexb  18300  pgpfaclem3  18482
  Copyright terms: Public domain W3C validator