Theorem pgpgrp 19491

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

Assertion

Ref	Expression
pgpgrp	⊢ (𝑃 pGrp 𝐺 → 𝐺 ∈ Grp)

Proof of Theorem pgpgrp

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

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

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∃wrex 3053   class class class wbr 5095  ‘cfv 6486  (class class class)co 7353  ℕ₀cn0 12402  ↑cexp 13986  ℙcprime 16600  Basecbs 17138  Grpcgrp 18830  odcod 19421   pGrp cpgp 19423

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pr 5374

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3397  df-v 3440  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-br 5096  df-opab 5158  df-xp 5629  df-iota 6442  df-fv 6494  df-ov 7356  df-pgp 19427

This theorem is referenced by:  pgphash  19504