Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > gexcl2 | Structured version Visualization version GIF version |
Description: The exponent of a finite group is finite. (Contributed by Mario Carneiro, 24-Apr-2016.) |
Ref | Expression |
---|---|
gexcl2.1 | ⊢ 𝑋 = (Base‘𝐺) |
gexcl2.2 | ⊢ 𝐸 = (gEx‘𝐺) |
Ref | Expression |
---|---|
gexcl2 | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin) → 𝐸 ∈ ℕ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | gexcl2.1 | . . . . . 6 ⊢ 𝑋 = (Base‘𝐺) | |
2 | eqid 2818 | . . . . . 6 ⊢ (od‘𝐺) = (od‘𝐺) | |
3 | 1, 2 | odcl2 18621 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋) → ((od‘𝐺)‘𝑥) ∈ ℕ) |
4 | 1, 2 | oddvds2 18622 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋) → ((od‘𝐺)‘𝑥) ∥ (♯‘𝑋)) |
5 | 3 | nnzd 12074 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋) → ((od‘𝐺)‘𝑥) ∈ ℤ) |
6 | 1 | grpbn0 18070 | . . . . . . . . 9 ⊢ (𝐺 ∈ Grp → 𝑋 ≠ ∅) |
7 | 6 | 3ad2ant1 1125 | . . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋) → 𝑋 ≠ ∅) |
8 | hashnncl 13715 | . . . . . . . . 9 ⊢ (𝑋 ∈ Fin → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅)) | |
9 | 8 | 3ad2ant2 1126 | . . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋) → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅)) |
10 | 7, 9 | mpbird 258 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋) → (♯‘𝑋) ∈ ℕ) |
11 | dvdsle 15648 | . . . . . . 7 ⊢ ((((od‘𝐺)‘𝑥) ∈ ℤ ∧ (♯‘𝑋) ∈ ℕ) → (((od‘𝐺)‘𝑥) ∥ (♯‘𝑋) → ((od‘𝐺)‘𝑥) ≤ (♯‘𝑋))) | |
12 | 5, 10, 11 | syl2anc 584 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋) → (((od‘𝐺)‘𝑥) ∥ (♯‘𝑋) → ((od‘𝐺)‘𝑥) ≤ (♯‘𝑋))) |
13 | 4, 12 | mpd 15 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋) → ((od‘𝐺)‘𝑥) ≤ (♯‘𝑋)) |
14 | 10 | nnzd 12074 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋) → (♯‘𝑋) ∈ ℤ) |
15 | fznn 12963 | . . . . . 6 ⊢ ((♯‘𝑋) ∈ ℤ → (((od‘𝐺)‘𝑥) ∈ (1...(♯‘𝑋)) ↔ (((od‘𝐺)‘𝑥) ∈ ℕ ∧ ((od‘𝐺)‘𝑥) ≤ (♯‘𝑋)))) | |
16 | 14, 15 | syl 17 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋) → (((od‘𝐺)‘𝑥) ∈ (1...(♯‘𝑋)) ↔ (((od‘𝐺)‘𝑥) ∈ ℕ ∧ ((od‘𝐺)‘𝑥) ≤ (♯‘𝑋)))) |
17 | 3, 13, 16 | mpbir2and 709 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋) → ((od‘𝐺)‘𝑥) ∈ (1...(♯‘𝑋))) |
18 | 17 | 3expa 1110 | . . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin) ∧ 𝑥 ∈ 𝑋) → ((od‘𝐺)‘𝑥) ∈ (1...(♯‘𝑋))) |
19 | 18 | ralrimiva 3179 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin) → ∀𝑥 ∈ 𝑋 ((od‘𝐺)‘𝑥) ∈ (1...(♯‘𝑋))) |
20 | gexcl2.2 | . . 3 ⊢ 𝐸 = (gEx‘𝐺) | |
21 | 1, 20, 2 | gexcl3 18641 | . 2 ⊢ ((𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 ((od‘𝐺)‘𝑥) ∈ (1...(♯‘𝑋))) → 𝐸 ∈ ℕ) |
22 | 19, 21 | syldan 591 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin) → 𝐸 ∈ ℕ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1079 = wceq 1528 ∈ wcel 2105 ≠ wne 3013 ∀wral 3135 ∅c0 4288 class class class wbr 5057 ‘cfv 6348 (class class class)co 7145 Fincfn 8497 1c1 10526 ≤ cle 10664 ℕcn 11626 ℤcz 11969 ...cfz 12880 ♯chash 13678 ∥ cdvds 15595 Basecbs 16471 Grpcgrp 18041 odcod 18581 gExcgex 18582 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-inf2 9092 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 ax-pre-sup 10603 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-fal 1541 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-disj 5023 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-2o 8092 df-oadd 8095 df-omul 8096 df-er 8278 df-ec 8280 df-qs 8284 df-map 8397 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-sup 8894 df-inf 8895 df-oi 8962 df-card 9356 df-acn 9359 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 df-nn 11627 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-fz 12881 df-fzo 13022 df-fl 13150 df-mod 13226 df-seq 13358 df-exp 13418 df-fac 13622 df-hash 13679 df-cj 14446 df-re 14447 df-im 14448 df-sqrt 14582 df-abs 14583 df-clim 14833 df-sum 15031 df-dvds 15596 df-ndx 16474 df-slot 16475 df-base 16477 df-sets 16478 df-ress 16479 df-plusg 16566 df-0g 16703 df-mgm 17840 df-sgrp 17889 df-mnd 17900 df-grp 18044 df-minusg 18045 df-sbg 18046 df-mulg 18163 df-subg 18214 df-eqg 18216 df-od 18585 df-gex 18586 |
This theorem is referenced by: cyggexb 18948 pgpfac1lem3a 19127 pgpfaclem3 19134 |
Copyright terms: Public domain | W3C validator |