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

Theorem ee4anv 2383
Description: Distribute two pairs of existential quantifiers over a conjunction. For a version requiring fewer axioms but with additional disjoint variable conditions, see 4exdistrv 1990. (Contributed by NM, 31-Jul-1995.) Remove disjoint variable conditions on 𝑦, 𝑧 and 𝑥, 𝑤. (Revised by Eric Schmidt, 26-Oct-2025.)
Assertion
Ref Expression
ee4anv (∃𝑥∃𝑦∃𝑧∃𝑤(𝜑 ∧ 𝜓) ↔ (∃𝑥∃𝑦𝜑 ∧ ∃𝑧∃𝑤𝜓))
Distinct variable groups:   𝜑,𝑧   𝜑,𝑤   𝜓,𝑥   𝜓,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑧, 𝑤)

Proof of Theorem ee4anv
StepHypRef Expression
1 excom 2201 . . 3 (∃𝑦∃𝑧∃𝑤(𝜑 ∧ 𝜓) ↔ ∃𝑧∃𝑦∃𝑤(𝜑 ∧ 𝜓))
21exbii 1880 . 2 (∃𝑥∃𝑦∃𝑧∃𝑤(𝜑 ∧ 𝜓) ↔ ∃𝑥∃𝑧∃𝑦∃𝑤(𝜑 ∧ 𝜓))
3 eeanv 2381 . . 3 (∃𝑦∃𝑤(𝜑 ∧ 𝜓) ↔ (∃𝑦𝜑 ∧ ∃𝑤𝜓))
432exbii 1881 . 2 (∃𝑥∃𝑧∃𝑦∃𝑤(𝜑 ∧ 𝜓) ↔ ∃𝑥∃𝑧(∃𝑦𝜑 ∧ ∃𝑤𝜓))
5 nfv 1948 . . . 4 Ⅎ𝑧𝜑
65nfex 2357 . . 3 Ⅎ𝑧∃𝑦𝜑
7 nfv 1948 . . . 4 Ⅎ𝑥𝜓
87nfex 2357 . . 3 Ⅎ𝑥∃𝑤𝜓
96, 8eean 2380 . 2 (∃𝑥∃𝑧(∃𝑦𝜑 ∧ ∃𝑤𝜓) ↔ (∃𝑥∃𝑦𝜑 ∧ ∃𝑧∃𝑤𝜓))
102, 4, 93bitri 300 1 (∃𝑥∃𝑦∃𝑧∃𝑤(𝜑 ∧ 𝜓) ↔ (∃𝑥∃𝑦𝜑 ∧ ∃𝑧∃𝑤𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ∃wex 1811
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 1944  ax-6 2001  ax-7 2042  ax-10 2179  ax-11 2196  ax-12 2215
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:  5oalem7  32274  elfuns  36804
  Copyright terms: Public domain W3C validator