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

Theorem eean 2217
Description: Rearrange existential quantifiers. (Contributed by NM, 27-Oct-2010.) (Revised by Mario Carneiro, 6-Oct-2016.)
Hypotheses
Ref Expression
eean.1 𝑦𝜑
eean.2 𝑥𝜓
Assertion
Ref Expression
eean (∃𝑥𝑦(𝜑𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓))

Proof of Theorem eean
StepHypRef Expression
1 eean.1 . . . 4 𝑦𝜑
2119.42 2143 . . 3 (∃𝑦(𝜑𝜓) ↔ (𝜑 ∧ ∃𝑦𝜓))
32exbii 1814 . 2 (∃𝑥𝑦(𝜑𝜓) ↔ ∃𝑥(𝜑 ∧ ∃𝑦𝜓))
4 eean.2 . . . 4 𝑥𝜓
54nfex 2192 . . 3 𝑥𝑦𝜓
6519.41 2141 . 2 (∃𝑥(𝜑 ∧ ∃𝑦𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓))
73, 6bitri 264 1 (∃𝑥𝑦(𝜑𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 383  wex 1744  wnf 1748
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-10 2059  ax-11 2074  ax-12 2087
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-ex 1745  df-nf 1750
This theorem is referenced by:  eeanv  2218  reean  3135
  Copyright terms: Public domain W3C validator