Theorem eeanv 2378

Description: Distribute a pair of existential quantifiers over a conjunction. Combination of 19.41v 1982 and 19.42v 1986. For a version requiring fewer axioms but with additional disjoint variable conditions, see exdistrv 1988. (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 1947	. 2 ⊢ Ⅎ𝑦𝜑
2		nfv 1947	. 2 ⊢ Ⅎ𝑥𝜓
3	1, 2	eean 2377	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 2178  ax-11 2194  ax-12 2213

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:  eeeanv  2379  ee4anv  2380  ee4anvOLD  2381  ttrcltr  9696