MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ispgp Structured version   Visualization version   GIF version

Theorem ispgp 18981
Description: A group is a 𝑃-group if every element has some power of 𝑃 as its order. (Contributed by Mario Carneiro, 15-Jan-2015.)
Hypotheses
Ref Expression
ispgp.1 𝑋 = (Base‘𝐺)
ispgp.2 𝑂 = (od‘𝐺)
Assertion
Ref Expression
ispgp (𝑃 pGrp 𝐺 ↔ (𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp ∧ ∀𝑥𝑋𝑛 ∈ ℕ0 (𝑂𝑥) = (𝑃𝑛)))
Distinct variable groups:   𝑥,𝑛,𝐺   𝑃,𝑛,𝑥   𝑥,𝑋
Allowed substitution hints:   𝑂(𝑥,𝑛)   𝑋(𝑛)

Proof of Theorem ispgp
Dummy variables 𝑔 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 488 . . . . . 6 ((𝑝 = 𝑃𝑔 = 𝐺) → 𝑔 = 𝐺)
21fveq2d 6721 . . . . 5 ((𝑝 = 𝑃𝑔 = 𝐺) → (Base‘𝑔) = (Base‘𝐺))
3 ispgp.1 . . . . 5 𝑋 = (Base‘𝐺)
42, 3eqtr4di 2796 . . . 4 ((𝑝 = 𝑃𝑔 = 𝐺) → (Base‘𝑔) = 𝑋)
51fveq2d 6721 . . . . . . . 8 ((𝑝 = 𝑃𝑔 = 𝐺) → (od‘𝑔) = (od‘𝐺))
6 ispgp.2 . . . . . . . 8 𝑂 = (od‘𝐺)
75, 6eqtr4di 2796 . . . . . . 7 ((𝑝 = 𝑃𝑔 = 𝐺) → (od‘𝑔) = 𝑂)
87fveq1d 6719 . . . . . 6 ((𝑝 = 𝑃𝑔 = 𝐺) → ((od‘𝑔)‘𝑥) = (𝑂𝑥))
9 simpl 486 . . . . . . 7 ((𝑝 = 𝑃𝑔 = 𝐺) → 𝑝 = 𝑃)
109oveq1d 7228 . . . . . 6 ((𝑝 = 𝑃𝑔 = 𝐺) → (𝑝𝑛) = (𝑃𝑛))
118, 10eqeq12d 2753 . . . . 5 ((𝑝 = 𝑃𝑔 = 𝐺) → (((od‘𝑔)‘𝑥) = (𝑝𝑛) ↔ (𝑂𝑥) = (𝑃𝑛)))
1211rexbidv 3216 . . . 4 ((𝑝 = 𝑃𝑔 = 𝐺) → (∃𝑛 ∈ ℕ0 ((od‘𝑔)‘𝑥) = (𝑝𝑛) ↔ ∃𝑛 ∈ ℕ0 (𝑂𝑥) = (𝑃𝑛)))
134, 12raleqbidv 3313 . . 3 ((𝑝 = 𝑃𝑔 = 𝐺) → (∀𝑥 ∈ (Base‘𝑔)∃𝑛 ∈ ℕ0 ((od‘𝑔)‘𝑥) = (𝑝𝑛) ↔ ∀𝑥𝑋𝑛 ∈ ℕ0 (𝑂𝑥) = (𝑃𝑛)))
14 df-pgp 18922 . . 3 pGrp = {⟨𝑝, 𝑔⟩ ∣ ((𝑝 ∈ ℙ ∧ 𝑔 ∈ Grp) ∧ ∀𝑥 ∈ (Base‘𝑔)∃𝑛 ∈ ℕ0 ((od‘𝑔)‘𝑥) = (𝑝𝑛))}
1513, 14brab2a 5641 . 2 (𝑃 pGrp 𝐺 ↔ ((𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp) ∧ ∀𝑥𝑋𝑛 ∈ ℕ0 (𝑂𝑥) = (𝑃𝑛)))
16 df-3an 1091 . 2 ((𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp ∧ ∀𝑥𝑋𝑛 ∈ ℕ0 (𝑂𝑥) = (𝑃𝑛)) ↔ ((𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp) ∧ ∀𝑥𝑋𝑛 ∈ ℕ0 (𝑂𝑥) = (𝑃𝑛)))
1715, 16bitr4i 281 1 (𝑃 pGrp 𝐺 ↔ (𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp ∧ ∀𝑥𝑋𝑛 ∈ ℕ0 (𝑂𝑥) = (𝑃𝑛)))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 399  w3a 1089   = wceq 1543  wcel 2110  wral 3061  wrex 3062   class class class wbr 5053  cfv 6380  (class class class)co 7213  0cn0 12090  cexp 13635  cprime 16228  Basecbs 16760  Grpcgrp 18365  odcod 18916   pGrp cpgp 18918
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pr 5322
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-sb 2071  df-clab 2715  df-cleq 2729  df-clel 2816  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3410  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-sn 4542  df-pr 4544  df-op 4548  df-uni 4820  df-br 5054  df-opab 5116  df-xp 5557  df-iota 6338  df-fv 6388  df-ov 7216  df-pgp 18922
This theorem is referenced by:  pgpprm  18982  pgpgrp  18983  pgpfi1  18984  subgpgp  18986  pgpfi  18994
  Copyright terms: Public domain W3C validator