Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > subgpgp | Structured version Visualization version GIF version |
Description: A subgroup of a p-group is a p-group. (Contributed by Mario Carneiro, 27-Apr-2016.) |
Ref | Expression |
---|---|
subgpgp | ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑃 pGrp (𝐺 ↾s 𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pgpprm 18647 | . . 3 ⊢ (𝑃 pGrp 𝐺 → 𝑃 ∈ ℙ) | |
2 | 1 | adantr 481 | . 2 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑃 ∈ ℙ) |
3 | eqid 2818 | . . . 4 ⊢ (𝐺 ↾s 𝑆) = (𝐺 ↾s 𝑆) | |
4 | 3 | subggrp 18220 | . . 3 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ↾s 𝑆) ∈ Grp) |
5 | 4 | adantl 482 | . 2 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (𝐺 ↾s 𝑆) ∈ Grp) |
6 | eqid 2818 | . . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
7 | eqid 2818 | . . . . . . 7 ⊢ (od‘𝐺) = (od‘𝐺) | |
8 | 6, 7 | ispgp 18646 | . . . . . 6 ⊢ (𝑃 pGrp 𝐺 ↔ (𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp ∧ ∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛))) |
9 | 8 | simp3bi 1139 | . . . . 5 ⊢ (𝑃 pGrp 𝐺 → ∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛)) |
10 | 9 | adantr 481 | . . . 4 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → ∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛)) |
11 | 6 | subgss 18218 | . . . . . . 7 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
12 | 11 | adantl 482 | . . . . . 6 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑆 ⊆ (Base‘𝐺)) |
13 | ssralv 4030 | . . . . . 6 ⊢ (𝑆 ⊆ (Base‘𝐺) → (∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛) → ∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛))) | |
14 | 12, 13 | syl 17 | . . . . 5 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛) → ∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛))) |
15 | eqid 2818 | . . . . . . . . . 10 ⊢ (od‘(𝐺 ↾s 𝑆)) = (od‘(𝐺 ↾s 𝑆)) | |
16 | 3, 7, 15 | subgod 18624 | . . . . . . . . 9 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆) → ((od‘𝐺)‘𝑥) = ((od‘(𝐺 ↾s 𝑆))‘𝑥)) |
17 | 16 | adantll 710 | . . . . . . . 8 ⊢ (((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆) → ((od‘𝐺)‘𝑥) = ((od‘(𝐺 ↾s 𝑆))‘𝑥)) |
18 | 17 | eqeq1d 2820 | . . . . . . 7 ⊢ (((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆) → (((od‘𝐺)‘𝑥) = (𝑃↑𝑛) ↔ ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛))) |
19 | 18 | rexbidv 3294 | . . . . . 6 ⊢ (((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆) → (∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛) ↔ ∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛))) |
20 | 19 | ralbidva 3193 | . . . . 5 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛) ↔ ∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛))) |
21 | 14, 20 | sylibd 240 | . . . 4 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛) → ∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛))) |
22 | 10, 21 | mpd 15 | . . 3 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → ∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛)) |
23 | 3 | subgbas 18221 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘(𝐺 ↾s 𝑆))) |
24 | 23 | adantl 482 | . . . 4 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑆 = (Base‘(𝐺 ↾s 𝑆))) |
25 | 24 | raleqdv 3413 | . . 3 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛) ↔ ∀𝑥 ∈ (Base‘(𝐺 ↾s 𝑆))∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛))) |
26 | 22, 25 | mpbid 233 | . 2 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → ∀𝑥 ∈ (Base‘(𝐺 ↾s 𝑆))∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛)) |
27 | eqid 2818 | . . 3 ⊢ (Base‘(𝐺 ↾s 𝑆)) = (Base‘(𝐺 ↾s 𝑆)) | |
28 | 27, 15 | ispgp 18646 | . 2 ⊢ (𝑃 pGrp (𝐺 ↾s 𝑆) ↔ (𝑃 ∈ ℙ ∧ (𝐺 ↾s 𝑆) ∈ Grp ∧ ∀𝑥 ∈ (Base‘(𝐺 ↾s 𝑆))∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛))) |
29 | 2, 5, 26, 28 | syl3anbrc 1335 | 1 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑃 pGrp (𝐺 ↾s 𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 ∀wral 3135 ∃wrex 3136 ⊆ wss 3933 class class class wbr 5057 ‘cfv 6348 (class class class)co 7145 ℕ0cn0 11885 ↑cexp 13417 ℙcprime 16003 Basecbs 16471 ↾s cress 16472 Grpcgrp 18041 SubGrpcsubg 18211 odcod 18581 pGrp cpgp 18583 |
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-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 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 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 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-iun 4912 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-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-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-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-sup 8894 df-inf 8895 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-2 11688 df-n0 11886 df-z 11970 df-uz 12232 df-seq 13358 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-submnd 17945 df-grp 18044 df-minusg 18045 df-mulg 18163 df-subg 18214 df-od 18585 df-pgp 18587 |
This theorem is referenced by: pgpfaclem1 19132 pgpfaclem3 19134 |
Copyright terms: Public domain | W3C validator |