Theorem ee4anv 2385

Description: Distribute two pairs of existential quantifiers over a conjunction. For a version requiring fewer axioms but with additional disjoint variable conditions, see 4exdistrv 1989. (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

Step	Hyp	Ref	Expression
1		excom 2200	. . 3 ⊢ (∃𝑦∃𝑧∃𝑤(𝜑 ∧ 𝜓) ↔ ∃𝑧∃𝑦∃𝑤(𝜑 ∧ 𝜓))
2	1	exbii 1881	. 2 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤(𝜑 ∧ 𝜓) ↔ ∃𝑥∃𝑧∃𝑦∃𝑤(𝜑 ∧ 𝜓))
3		eeanv 2383	. . 3 ⊢ (∃𝑦∃𝑤(𝜑 ∧ 𝜓) ↔ (∃𝑦𝜑 ∧ ∃𝑤𝜓))
4	3	2exbii 1882	. 2 ⊢ (∃𝑥∃𝑧∃𝑦∃𝑤(𝜑 ∧ 𝜓) ↔ ∃𝑥∃𝑧(∃𝑦𝜑 ∧ ∃𝑤𝜓))
5		nfv 1947	. . . 4 ⊢ Ⅎ𝑧𝜑
6	5	nfex 2359	. . 3 ⊢ Ⅎ𝑧∃𝑦𝜑
7		nfv 1947	. . . 4 ⊢ Ⅎ𝑥𝜓
8	7	nfex 2359	. . 3 ⊢ Ⅎ𝑥∃𝑤𝜓
9	6, 8	eean 2382	. 2 ⊢ (∃𝑥∃𝑧(∃𝑦𝜑 ∧ ∃𝑤𝜓) ↔ (∃𝑥∃𝑦𝜑 ∧ ∃𝑧∃𝑤𝜓))
10	2, 4, 9	3bitri 300	1 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤(𝜑 ∧ 𝜓) ↔ (∃𝑥∃𝑦𝜑 ∧ ∃𝑧∃𝑤𝜓))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ∃wex 1812

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-10 2179  ax-11 2195  ax-12 2216

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817

This theorem is used by:  5oalem7  32085  elfuns  36444