Theorem reean 3311

Description: Rearrange restricted existential quantifiers. For a version based on fewer axioms see reeanv 3233. (Contributed by NM, 27-Oct-2010.) (Proof shortened by Andrew Salmon, 30-May-2011.)

Hypotheses

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

Assertion

Ref	Expression
reean	⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝜑 ∧ 𝜓) ↔ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜓))

Distinct variable groups:   𝑦,𝐴   𝑥,𝐵   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)   𝐴(𝑥)   𝐵(𝑦)

Proof of Theorem reean

Step	Hyp	Ref	Expression
1		nfv 1933	. . . 4 ⊢ Ⅎ𝑦 𝑥 ∈ 𝐴
2		reean.1	. . . 4 ⊢ Ⅎ𝑦𝜑
3	1, 2	nfan 1918	. . 3 ⊢ Ⅎ𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)
4		nfv 1933	. . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐵
5		reean.2	. . . 4 ⊢ Ⅎ𝑥𝜓
6	4, 5	nfan 1918	. . 3 ⊢ Ⅎ𝑥(𝑦 ∈ 𝐵 ∧ 𝜓)
7	3, 6	eean 2378	. 2 ⊢ (∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐵 ∧ 𝜓)) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ ∃𝑦(𝑦 ∈ 𝐵 ∧ 𝜓)))
8	7	reeanlem 3232	1 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝜑 ∧ 𝜓) ↔ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑦 ∈ 𝐵 𝜓))

Syntax hints:   ↔ wb 208   ∧ wa 399  Ⅎwnf 1802   ∈ wcel 2141  ∃wrex 3085

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-10 2174  ax-11 2190  ax-12 2211

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1562  df-ex 1799  df-nf 1803  df-ral 3076  df-rex 3086

This theorem is referenced by:  disjrnmpt2  45727