Theorem pgpgrp 19727

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

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088   class class class wbr 5107  ‘cfv 6537  (class class class)co 7417  ℕ₀cn0 12532  ↑cexp 14129  ℙcprime 16767  Basecbs 17307  Grpcgrp 19063  odcod 19657   pGrp cpgp 19659

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402

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 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-xp 5665  df-iota 6493  df-fv 6545  df-ov 7420  df-pgp 19663

This theorem is used by:  pgphash  19740