Theorem pgpprm 19654

Description: Reverse closure for the first argument of pGrp. (Contributed by Mario Carneiro, 15-Jan-2015.)

Assertion

Ref	Expression
pgpprm	⊢ (𝑃 pGrp 𝐺 → 𝑃 ∈ ℙ)

Proof of Theorem pgpprm

Dummy variables 𝑥 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2765	. . 3 ⊢ (Base‘𝐺) = (Base‘𝐺)
2		eqid 2765	. . 3 ⊢ (od‘𝐺) = (od‘𝐺)
3	1, 2	ispgp 19653	. 2 ⊢ (𝑃 pGrp 𝐺 ↔ (𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp ∧ ∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛)))
4	3	simp1bi 1161	1 ⊢ (𝑃 pGrp 𝐺 → 𝑃 ∈ ℙ)

Syntax hints:   → wi 4   = wceq 1563   ∈ wcel 2145  ∀wral 3079  ∃wrex 3089   class class class wbr 5105  ‘cfv 6525  (class class class)co 7400  ℕ₀cn0 12495  ↑cexp 14088  ℙcprime 16719  Basecbs 17259  Grpcgrp 18990  odcod 19585   pGrp cpgp 19587

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-sep 5251  ax-pr 5395

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-xp 5658  df-iota 6481  df-fv 6533  df-ov 7403  df-pgp 19591

This theorem is referenced by:  subgpgp  19658  pgpssslw  19675  sylow2blem3  19683  pgpfac1lem2  20138  pgpfac1lem3a  20139  pgpfac1lem3  20140  pgpfac1lem4  20141  pgpfaclem1  20144