Theorem rexcom13 3296

Description: Swap first and third restricted existential quantifiers. (Contributed by NM, 8-Apr-2015.)

Assertion

Ref	Expression
rexcom13	⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝜑 ↔ ∃𝑧 ∈ 𝐶 ∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑)

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

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

Proof of Theorem rexcom13

Step	Hyp	Ref	Expression
1		rexcom 3292	. 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝜑 ↔ ∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝜑)
2		rexcom 3292	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝜑 ↔ ∃𝑧 ∈ 𝐶 ∃𝑥 ∈ 𝐴 𝜑)
3	2	rexbii 3110	. 2 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝜑 ↔ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 ∃𝑥 ∈ 𝐴 𝜑)
4		rexcom 3292	. 2 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 ∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑧 ∈ 𝐶 ∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑)
5	1, 3, 4	3bitri 300	1 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝜑 ↔ ∃𝑧 ∈ 𝐶 ∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑)

This proof depends on syntax axioms:   ↔ wb 209  ∃wrex 3087

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-11 2194

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-ral 3078  df-rex 3088

This theorem is used by:  rexrot4  3297