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

Theorem r2exf 3286
Description: Double restricted existential quantification. For a version based on fewer axioms see r2ex 3201. (Contributed by Mario Carneiro, 14-Oct-2016.) Use r2exlem 3153. (Revised by Wolf Lammen, 10-Jan-2020.)
Hypothesis
Ref Expression
r2exf.1 𝑦𝐴
Assertion
Ref Expression
r2exf (∃𝑥𝐴𝑦𝐵 𝜑 ↔ ∃𝑥𝑦((𝑥𝐴𝑦𝐵) ∧ 𝜑))
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑥, 𝑦)   𝐵(𝑥, 𝑦)

Proof of Theorem r2exf
StepHypRef Expression
1 r2exf.1 . . 3 𝑦𝐴
21r2alf 3285 . 2 (∀𝑥𝐴𝑦𝐵 ¬ 𝜑 ↔ ∀𝑥𝑦((𝑥𝐴𝑦𝐵) → ¬ 𝜑))
32r2exlem 3153 1 (∃𝑥𝐴𝑦𝐵 𝜑 ↔ ∃𝑥𝑦((𝑥𝐴𝑦𝐵) ∧ 𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wb 209  wa 401  wex 1812  wcel 2145  wnfc 2909  wrex 3088
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-12 2215
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-nf 1817  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089
This theorem is used by:  rexcomf  3303
  Copyright terms: Public domain W3C validator