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 18718 | . . 3 ⊢ (𝑃 pGrp 𝐺 → 𝑃 ∈ ℙ) | |
2 | 1 | adantr 483 | . 2 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑃 ∈ ℙ) |
3 | eqid 2821 | . . . 4 ⊢ (𝐺 ↾s 𝑆) = (𝐺 ↾s 𝑆) | |
4 | 3 | subggrp 18282 | . . 3 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ↾s 𝑆) ∈ Grp) |
5 | 4 | adantl 484 | . 2 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (𝐺 ↾s 𝑆) ∈ Grp) |
6 | eqid 2821 | . . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
7 | eqid 2821 | . . . . . . 7 ⊢ (od‘𝐺) = (od‘𝐺) | |
8 | 6, 7 | ispgp 18717 | . . . . . 6 ⊢ (𝑃 pGrp 𝐺 ↔ (𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp ∧ ∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛))) |
9 | 8 | simp3bi 1143 | . . . . 5 ⊢ (𝑃 pGrp 𝐺 → ∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛)) |
10 | 9 | adantr 483 | . . . 4 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → ∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛)) |
11 | 6 | subgss 18280 | . . . . . . 7 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
12 | 11 | adantl 484 | . . . . . 6 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑆 ⊆ (Base‘𝐺)) |
13 | ssralv 4033 | . . . . . 6 ⊢ (𝑆 ⊆ (Base‘𝐺) → (∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛) → ∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛))) | |
14 | 12, 13 | syl 17 | . . . . 5 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛) → ∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛))) |
15 | eqid 2821 | . . . . . . . . . 10 ⊢ (od‘(𝐺 ↾s 𝑆)) = (od‘(𝐺 ↾s 𝑆)) | |
16 | 3, 7, 15 | subgod 18695 | . . . . . . . . 9 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑆) → ((od‘𝐺)‘𝑥) = ((od‘(𝐺 ↾s 𝑆))‘𝑥)) |
17 | 16 | adantll 712 | . . . . . . . 8 ⊢ (((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆) → ((od‘𝐺)‘𝑥) = ((od‘(𝐺 ↾s 𝑆))‘𝑥)) |
18 | 17 | eqeq1d 2823 | . . . . . . 7 ⊢ (((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆) → (((od‘𝐺)‘𝑥) = (𝑃↑𝑛) ↔ ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛))) |
19 | 18 | rexbidv 3297 | . . . . . 6 ⊢ (((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆) → (∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛) ↔ ∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛))) |
20 | 19 | ralbidva 3196 | . . . . 5 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛) ↔ ∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛))) |
21 | 14, 20 | sylibd 241 | . . . 4 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛) → ∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛))) |
22 | 10, 21 | mpd 15 | . . 3 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → ∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛)) |
23 | 3 | subgbas 18283 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘(𝐺 ↾s 𝑆))) |
24 | 23 | adantl 484 | . . . 4 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑆 = (Base‘(𝐺 ↾s 𝑆))) |
25 | 24 | raleqdv 3415 | . . 3 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (∀𝑥 ∈ 𝑆 ∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛) ↔ ∀𝑥 ∈ (Base‘(𝐺 ↾s 𝑆))∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛))) |
26 | 22, 25 | mpbid 234 | . 2 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → ∀𝑥 ∈ (Base‘(𝐺 ↾s 𝑆))∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛)) |
27 | eqid 2821 | . . 3 ⊢ (Base‘(𝐺 ↾s 𝑆)) = (Base‘(𝐺 ↾s 𝑆)) | |
28 | 27, 15 | ispgp 18717 | . 2 ⊢ (𝑃 pGrp (𝐺 ↾s 𝑆) ↔ (𝑃 ∈ ℙ ∧ (𝐺 ↾s 𝑆) ∈ Grp ∧ ∀𝑥 ∈ (Base‘(𝐺 ↾s 𝑆))∃𝑛 ∈ ℕ0 ((od‘(𝐺 ↾s 𝑆))‘𝑥) = (𝑃↑𝑛))) |
29 | 2, 5, 26, 28 | syl3anbrc 1339 | 1 ⊢ ((𝑃 pGrp 𝐺 ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑃 pGrp (𝐺 ↾s 𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∀wral 3138 ∃wrex 3139 ⊆ wss 3936 class class class wbr 5066 ‘cfv 6355 (class class class)co 7156 ℕ0cn0 11898 ↑cexp 13430 ℙcprime 16015 Basecbs 16483 ↾s cress 16484 Grpcgrp 18103 SubGrpcsubg 18273 odcod 18652 pGrp cpgp 18654 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 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 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-sup 8906 df-inf 8907 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-2 11701 df-n0 11899 df-z 11983 df-uz 12245 df-seq 13371 df-ndx 16486 df-slot 16487 df-base 16489 df-sets 16490 df-ress 16491 df-plusg 16578 df-0g 16715 df-mgm 17852 df-sgrp 17901 df-mnd 17912 df-submnd 17957 df-grp 18106 df-minusg 18107 df-mulg 18225 df-subg 18276 df-od 18656 df-pgp 18658 |
This theorem is referenced by: pgpfaclem1 19203 pgpfaclem3 19205 |
Copyright terms: Public domain | W3C validator |