Theorem eeanv 2357

Description: Distribute a pair of existential quantifiers over a conjunction. Combination of 19.41v 1956 and 19.42v 1960. For a version requiring fewer axioms but with additional disjoint variable conditions, see exdistrv 1962. (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 1921	. 2 ⊢ Ⅎ𝑦𝜑
2		nfv 1921	. 2 ⊢ Ⅎ𝑥𝜓
3	1, 2	eean 2356	1 ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓))

Syntax hints:   ↔ wb 207   ∧ wa 396  ∃wex 1786

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-10 2152  ax-11 2168  ax-12 2189

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-ex 1787  df-nf 1791

This theorem is referenced by:  eeeanv  2358  ee4anv  2359  ee4anvOLD  2360  ttrcltr  9628