Theorem 4exdistrv 1957

Description: Distribute two pairs of existential quantifiers (over disjoint variables) over a conjunction. For a version with fewer disjoint variable conditions but requiring more axioms, see ee4anv 2372. (Contributed by BJ, 5-Jan-2023.)

Assertion

Ref	Expression
4exdistrv	⊢ (∃𝑥∃𝑧∃𝑦∃𝑤(𝜑 ∧ 𝜓) ↔ (∃𝑥∃𝑦𝜑 ∧ ∃𝑧∃𝑤𝜓))

Distinct variable groups:   𝜑,𝑤   𝜑,𝑧   𝜓,𝑦   𝜓,𝑥   𝑦,𝑤   𝑦,𝑧   𝑥,𝑤   𝑥,𝑧

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑧,𝑤)

Proof of Theorem 4exdistrv

Step	Hyp	Ref	Expression
1		exdistrv 1956	. . 3 ⊢ (∃𝑦∃𝑤(𝜑 ∧ 𝜓) ↔ (∃𝑦𝜑 ∧ ∃𝑤𝜓))
2	1	2exbii 1849	. 2 ⊢ (∃𝑥∃𝑧∃𝑦∃𝑤(𝜑 ∧ 𝜓) ↔ ∃𝑥∃𝑧(∃𝑦𝜑 ∧ ∃𝑤𝜓))
3		exdistrv 1956	. 2 ⊢ (∃𝑥∃𝑧(∃𝑦𝜑 ∧ ∃𝑤𝜓) ↔ (∃𝑥∃𝑦𝜑 ∧ ∃𝑧∃𝑤𝜓))
4	2, 3	bitri 277	1 ⊢ (∃𝑥∃𝑧∃𝑦∃𝑤(𝜑 ∧ 𝜓) ↔ (∃𝑥∃𝑦𝜑 ∧ ∃𝑧∃𝑤𝜓))

Syntax hints:   ↔ wb 208   ∧ wa 398  ∃wex 1780

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911

This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1781

This theorem is referenced by:  cgsex4g  3539  3oalem3  29441