Theorem eean 2169

Description: Rearrange existential quantifiers. (Contributed by NM, 27-Oct-2010.) (Revised by Mario Carneiro, 6-Oct-2016.)

Hypotheses

Ref	Expression
eean.1	⊢ Ⅎ𝑦𝜑
eean.2	⊢ Ⅎ𝑥𝜓

Assertion

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

Proof of Theorem eean

Step	Hyp	Ref	Expression
1		eean.1	. . . 4 ⊢ Ⅎ𝑦𝜑
2	1	19.42 2092	. . 3 ⊢ (∃𝑦(𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃𝑦𝜓))
3	2	exbii 1764	. 2 ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ ∃𝑥(𝜑 ∧ ∃𝑦𝜓))
4		eean.2	. . . 4 ⊢ Ⅎ𝑥𝜓
5	4	nfex 2140	. . 3 ⊢ Ⅎ𝑥∃𝑦𝜓
6	5	19.41 2090	. 2 ⊢ (∃𝑥(𝜑 ∧ ∃𝑦𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓))
7	3, 6	bitri 263	1 ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓))

Syntax hints:   ↔ wb 195   ∧ wa 383  ∃wex 1695  Ⅎwnf 1699

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-ex 1696  df-nf 1701

This theorem is referenced by:  eeanv  2170  reean  3085