Theorem eeanv 2349

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

Syntax hints:   ↔ wb 206   ∧ wa 395  ∃wex 1775

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-10 2138  ax-11 2154  ax-12 2174

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-ex 1776  df-nf 1780

This theorem is referenced by:  eeeanv  2350  ee4anv  2351  ttrcltr  9753