Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ispgp | Structured version Visualization version GIF version |
Description: A group is a 𝑃-group if every element has some power of 𝑃 as its order. (Contributed by Mario Carneiro, 15-Jan-2015.) |
Ref | Expression |
---|---|
ispgp.1 | ⊢ 𝑋 = (Base‘𝐺) |
ispgp.2 | ⊢ 𝑂 = (od‘𝐺) |
Ref | Expression |
---|---|
ispgp | ⊢ (𝑃 pGrp 𝐺 ↔ (𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ ℕ0 (𝑂‘𝑥) = (𝑃↑𝑛))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 485 | . . . . . 6 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺) | |
2 | 1 | fveq2d 6773 | . . . . 5 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → (Base‘𝑔) = (Base‘𝐺)) |
3 | ispgp.1 | . . . . 5 ⊢ 𝑋 = (Base‘𝐺) | |
4 | 2, 3 | eqtr4di 2798 | . . . 4 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → (Base‘𝑔) = 𝑋) |
5 | 1 | fveq2d 6773 | . . . . . . . 8 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → (od‘𝑔) = (od‘𝐺)) |
6 | ispgp.2 | . . . . . . . 8 ⊢ 𝑂 = (od‘𝐺) | |
7 | 5, 6 | eqtr4di 2798 | . . . . . . 7 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → (od‘𝑔) = 𝑂) |
8 | 7 | fveq1d 6771 | . . . . . 6 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → ((od‘𝑔)‘𝑥) = (𝑂‘𝑥)) |
9 | simpl 483 | . . . . . . 7 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → 𝑝 = 𝑃) | |
10 | 9 | oveq1d 7284 | . . . . . 6 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → (𝑝↑𝑛) = (𝑃↑𝑛)) |
11 | 8, 10 | eqeq12d 2756 | . . . . 5 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → (((od‘𝑔)‘𝑥) = (𝑝↑𝑛) ↔ (𝑂‘𝑥) = (𝑃↑𝑛))) |
12 | 11 | rexbidv 3228 | . . . 4 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → (∃𝑛 ∈ ℕ0 ((od‘𝑔)‘𝑥) = (𝑝↑𝑛) ↔ ∃𝑛 ∈ ℕ0 (𝑂‘𝑥) = (𝑃↑𝑛))) |
13 | 4, 12 | raleqbidv 3335 | . . 3 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → (∀𝑥 ∈ (Base‘𝑔)∃𝑛 ∈ ℕ0 ((od‘𝑔)‘𝑥) = (𝑝↑𝑛) ↔ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ ℕ0 (𝑂‘𝑥) = (𝑃↑𝑛))) |
14 | df-pgp 19134 | . . 3 ⊢ pGrp = {〈𝑝, 𝑔〉 ∣ ((𝑝 ∈ ℙ ∧ 𝑔 ∈ Grp) ∧ ∀𝑥 ∈ (Base‘𝑔)∃𝑛 ∈ ℕ0 ((od‘𝑔)‘𝑥) = (𝑝↑𝑛))} | |
15 | 13, 14 | brab2a 5679 | . 2 ⊢ (𝑃 pGrp 𝐺 ↔ ((𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp) ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ ℕ0 (𝑂‘𝑥) = (𝑃↑𝑛))) |
16 | df-3an 1088 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ ℕ0 (𝑂‘𝑥) = (𝑃↑𝑛)) ↔ ((𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp) ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ ℕ0 (𝑂‘𝑥) = (𝑃↑𝑛))) | |
17 | 15, 16 | bitr4i 277 | 1 ⊢ (𝑃 pGrp 𝐺 ↔ (𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 ∃𝑛 ∈ ℕ0 (𝑂‘𝑥) = (𝑃↑𝑛))) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1542 ∈ wcel 2110 ∀wral 3066 ∃wrex 3067 class class class wbr 5079 ‘cfv 6431 (class class class)co 7269 ℕ0cn0 12231 ↑cexp 13778 ℙcprime 16372 Basecbs 16908 Grpcgrp 18573 odcod 19128 pGrp cpgp 19130 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-ext 2711 ax-sep 5227 ax-nul 5234 ax-pr 5356 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-sb 2072 df-clab 2718 df-cleq 2732 df-clel 2818 df-ral 3071 df-rex 3072 df-rab 3075 df-v 3433 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-br 5080 df-opab 5142 df-xp 5595 df-iota 6389 df-fv 6439 df-ov 7272 df-pgp 19134 |
This theorem is referenced by: pgpprm 19194 pgpgrp 19195 pgpfi1 19196 subgpgp 19198 pgpfi 19206 |
Copyright terms: Public domain | W3C validator |