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

Theorem r19.23 3004
 Description: Restricted quantifier version of 19.23 2067. See r19.23v 3005 for a version requiring fewer axioms. (Contributed by NM, 22-Oct-2010.) (Proof shortened by Mario Carneiro, 8-Oct-2016.)
Hypothesis
Ref Expression
r19.23.1 𝑥𝜓
Assertion
Ref Expression
r19.23 (∀𝑥𝐴 (𝜑𝜓) ↔ (∃𝑥𝐴 𝜑𝜓))

Proof of Theorem r19.23
StepHypRef Expression
1 r19.23.1 . 2 𝑥𝜓
2 r19.23t 3003 . 2 (Ⅎ𝑥𝜓 → (∀𝑥𝐴 (𝜑𝜓) ↔ (∃𝑥𝐴 𝜑𝜓)))
31, 2ax-mp 5 1 (∀𝑥𝐴 (𝜑𝜓) ↔ (∃𝑥𝐴 𝜑𝜓))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195  Ⅎwnf 1699  ∀wral 2896  ∃wrex 2897 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-12 2034 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-ex 1696  df-nf 1701  df-ral 2901  df-rex 2902 This theorem is referenced by:  rexlimi  3006  ss2iundf  36970  iunssf  38290
 Copyright terms: Public domain W3C validator