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

Theorem eean 2377
Description: Distribute 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 2272 . . 3 (∃𝑦(𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃𝑦𝜓))
32exbii 1880 . 2 (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ ∃𝑥(𝜑 ∧ ∃𝑦𝜓))
4 eean.2 . . . 4 Ⅎ𝑥𝜓
54nfex 2354 . . 3 Ⅎ𝑥∃𝑦𝜓
6519.41 2271 . 2 (∃𝑥(𝜑 ∧ ∃𝑦𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓))
73, 6bitri 278 1 (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ∃wex 1811  Ⅎwnf 1815
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-11 2193  ax-12 2212
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812  df-nf 1816
This theorem is used by:  eeanv  2378  ee4anv  2380  reean  3312
  Copyright terms: Public domain W3C validator