Theorem eeanv 2387

Description: Distribute a pair of existential quantifiers over a conjunction. Combination of 19.41v 1976 and 19.42v 1980. For a version requiring fewer axioms but with additional disjoint variable conditions, see exdistrv 1982. (Contributed by NM, 26-Jul-1995.)

Assertion

Ref	Expression
eeanv	⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓))

Distinct variable groups:   𝜑,𝑦   𝜓,𝑥

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem eeanv

Step	Hyp	Ref	Expression
1		nfv 1941	. 2 ⊢ Ⅎ𝑦𝜑
2		nfv 1941	. 2 ⊢ Ⅎ𝑥𝜓
3	1, 2	eean 2386	1 ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓))

Syntax hints:   ↔ wb 209   ∧ wa 400  ∃wex 1806

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-10 2182  ax-11 2198  ax-12 2219

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ex 1807  df-nf 1811

This theorem is referenced by:  eeeanv  2388  ee4anv  2389  ee4anvOLD  2390  ttrcltr  9684