| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pgpfi1 | Structured version Visualization version GIF version | ||
| Description: A finite group with order a power of a prime 𝑃 is a 𝑃-group. (Contributed by Mario Carneiro, 16-Jan-2015.) |
| Ref | Expression |
|---|---|
| pgpfi1.1 | ⊢ 𝑋 = (Base‘𝐺) |
| Ref | Expression |
|---|---|
| pgpfi1 | ⊢ ((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) → ((♯‘𝑋) = (𝑃↑𝑁) → 𝑃 pGrp 𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl2 1193 | . . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) → 𝑃 ∈ ℙ) | |
| 2 | simpl1 1192 | . . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) → 𝐺 ∈ Grp) | |
| 3 | simpll3 1215 | . . . . . 6 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → 𝑁 ∈ ℕ0) | |
| 4 | 2 | adantr 480 | . . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → 𝐺 ∈ Grp) |
| 5 | simplr 768 | . . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → (♯‘𝑋) = (𝑃↑𝑁)) | |
| 6 | 1 | adantr 480 | . . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → 𝑃 ∈ ℙ) |
| 7 | prmnn 16651 | . . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 8 | 6, 7 | syl 17 | . . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → 𝑃 ∈ ℕ) |
| 9 | 8, 3 | nnexpcld 14217 | . . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → (𝑃↑𝑁) ∈ ℕ) |
| 10 | 9 | nnnn0d 12510 | . . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → (𝑃↑𝑁) ∈ ℕ0) |
| 11 | 5, 10 | eqeltrd 2829 | . . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → (♯‘𝑋) ∈ ℕ0) |
| 12 | pgpfi1.1 | . . . . . . . . . . 11 ⊢ 𝑋 = (Base‘𝐺) | |
| 13 | 12 | fvexi 6875 | . . . . . . . . . 10 ⊢ 𝑋 ∈ V |
| 14 | hashclb 14330 | . . . . . . . . . 10 ⊢ (𝑋 ∈ V → (𝑋 ∈ Fin ↔ (♯‘𝑋) ∈ ℕ0)) | |
| 15 | 13, 14 | ax-mp 5 | . . . . . . . . 9 ⊢ (𝑋 ∈ Fin ↔ (♯‘𝑋) ∈ ℕ0) |
| 16 | 11, 15 | sylibr 234 | . . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → 𝑋 ∈ Fin) |
| 17 | simpr 484 | . . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋) | |
| 18 | eqid 2730 | . . . . . . . . 9 ⊢ (od‘𝐺) = (od‘𝐺) | |
| 19 | 12, 18 | oddvds2 19503 | . . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋) → ((od‘𝐺)‘𝑥) ∥ (♯‘𝑋)) |
| 20 | 4, 16, 17, 19 | syl3anc 1373 | . . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → ((od‘𝐺)‘𝑥) ∥ (♯‘𝑋)) |
| 21 | 20, 5 | breqtrd 5136 | . . . . . 6 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → ((od‘𝐺)‘𝑥) ∥ (𝑃↑𝑁)) |
| 22 | oveq2 7398 | . . . . . . . 8 ⊢ (𝑛 = 𝑁 → (𝑃↑𝑛) = (𝑃↑𝑁)) | |
| 23 | 22 | breq2d 5122 | . . . . . . 7 ⊢ (𝑛 = 𝑁 → (((od‘𝐺)‘𝑥) ∥ (𝑃↑𝑛) ↔ ((od‘𝐺)‘𝑥) ∥ (𝑃↑𝑁))) |
| 24 | 23 | rspcev 3591 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ ((od‘𝐺)‘𝑥) ∥ (𝑃↑𝑁)) → ∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) ∥ (𝑃↑𝑛)) |
| 25 | 3, 21, 24 | syl2anc 584 | . . . . 5 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → ∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) ∥ (𝑃↑𝑛)) |
| 26 | 12, 18 | odcl2 19502 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋) → ((od‘𝐺)‘𝑥) ∈ ℕ) |
| 27 | 4, 16, 17, 26 | syl3anc 1373 | . . . . . 6 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → ((od‘𝐺)‘𝑥) ∈ ℕ) |
| 28 | pcprmpw2 16860 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ ((od‘𝐺)‘𝑥) ∈ ℕ) → (∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) ∥ (𝑃↑𝑛) ↔ ((od‘𝐺)‘𝑥) = (𝑃↑(𝑃 pCnt ((od‘𝐺)‘𝑥))))) | |
| 29 | pcprmpw 16861 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ ((od‘𝐺)‘𝑥) ∈ ℕ) → (∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛) ↔ ((od‘𝐺)‘𝑥) = (𝑃↑(𝑃 pCnt ((od‘𝐺)‘𝑥))))) | |
| 30 | 28, 29 | bitr4d 282 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ ((od‘𝐺)‘𝑥) ∈ ℕ) → (∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) ∥ (𝑃↑𝑛) ↔ ∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛))) |
| 31 | 6, 27, 30 | syl2anc 584 | . . . . 5 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → (∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) ∥ (𝑃↑𝑛) ↔ ∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛))) |
| 32 | 25, 31 | mpbid 232 | . . . 4 ⊢ ((((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) ∧ 𝑥 ∈ 𝑋) → ∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛)) |
| 33 | 32 | ralrimiva 3126 | . . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) → ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛)) |
| 34 | 12, 18 | ispgp 19529 | . . 3 ⊢ (𝑃 pGrp 𝐺 ↔ (𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛))) |
| 35 | 1, 2, 33, 34 | syl3anbrc 1344 | . 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) ∧ (♯‘𝑋) = (𝑃↑𝑁)) → 𝑃 pGrp 𝐺) |
| 36 | 35 | ex 412 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑃 ∈ ℙ ∧ 𝑁 ∈ ℕ0) → ((♯‘𝑋) = (𝑃↑𝑁) → 𝑃 pGrp 𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∀wral 3045 ∃wrex 3054 Vcvv 3450 class class class wbr 5110 ‘cfv 6514 (class class class)co 7390 Fincfn 8921 ℕcn 12193 ℕ0cn0 12449 ↑cexp 14033 ♯chash 14302 ∥ cdvds 16229 ℙcprime 16648 pCnt cpc 16814 Basecbs 17186 Grpcgrp 18872 odcod 19461 pGrp cpgp 19463 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-inf2 9601 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-pre-sup 11153 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-disj 5078 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-se 5595 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-isom 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-1o 8437 df-2o 8438 df-oadd 8441 df-omul 8442 df-er 8674 df-ec 8676 df-qs 8680 df-map 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-sup 9400 df-inf 9401 df-oi 9470 df-card 9899 df-acn 9902 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-div 11843 df-nn 12194 df-2 12256 df-3 12257 df-n0 12450 df-z 12537 df-uz 12801 df-q 12915 df-rp 12959 df-fz 13476 df-fzo 13623 df-fl 13761 df-mod 13839 df-seq 13974 df-exp 14034 df-hash 14303 df-cj 15072 df-re 15073 df-im 15074 df-sqrt 15208 df-abs 15209 df-clim 15461 df-sum 15660 df-dvds 16230 df-gcd 16472 df-prm 16649 df-pc 16815 df-sets 17141 df-slot 17159 df-ndx 17171 df-base 17187 df-ress 17208 df-plusg 17240 df-0g 17411 df-mgm 18574 df-sgrp 18653 df-mnd 18669 df-grp 18875 df-minusg 18876 df-sbg 18877 df-mulg 19007 df-subg 19062 df-eqg 19064 df-od 19465 df-pgp 19467 |
| This theorem is referenced by: pgp0 19533 pgpfi 19542 |
| Copyright terms: Public domain | W3C validator |