Theorem rexcom13 2519

Description: Swap 1st and 3rd 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 2518	. 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝜑 ↔ ∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝜑)
2		rexcom 2518	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝜑 ↔ ∃𝑧 ∈ 𝐶 ∃𝑥 ∈ 𝐴 𝜑)
3	2	rexbii 2373	. 2 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝜑 ↔ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 ∃𝑥 ∈ 𝐴 𝜑)
4		rexcom 2518	. 2 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 ∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑧 ∈ 𝐶 ∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑)
5	1, 3, 4	3bitri 204	1 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝜑 ↔ ∃𝑧 ∈ 𝐶 ∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑)

Syntax hints:   ↔ wb 103  ∃wrex 2349

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-cleq 2074  df-clel 2077  df-nfc 2208  df-rex 2354

This theorem is referenced by:  rexrot4  2520