Theorem pgpprm 19837

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 2763	. . 3 ⊢ (Base‘𝐺) = (Base‘𝐺)
2		eqid 2763	. . 3 ⊢ (od‘𝐺) = (od‘𝐺)
3	1, 2	ispgp 19836	. 2 ⊢ (𝑃 pGrp 𝐺 ↔ (𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp ∧ ∀𝑥 ∈ (Base‘𝐺)∃𝑛 ∈ ℕ0 ((od‘𝐺)‘𝑥) = (𝑃↑𝑛)))
4	3	simp1bi 1163	1 ⊢ (𝑃 pGrp 𝐺 → 𝑃 ∈ ℙ)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   class class class wbr 5106  ‘cfv 6558  (class class class)co 7443  ℕ₀cn0 12633  ↑cexp 14231  ℙcprime 16875  Basecbs 17416  Grpcgrp 19173  odcod 19768   pGrp cpgp 19770

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-xp 5661  df-iota 6512  df-fv 6566  df-ov 7446  df-pgp 19774

This theorem is used by:  subgpgp  19841  pgpssslw  19858  sylow2blem3  19866  pgpfac1lem2  20321  pgpfac1lem3a  20322  pgpfac1lem3  20323  pgpfac1lem4  20324  pgpfaclem1  20327