Theorem rexcom13 2475

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 2474	. 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝜑 ↔ ∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝜑)
2		rexcom 2474	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝜑 ↔ ∃𝑧 ∈ 𝐶 ∃𝑥 ∈ 𝐴 𝜑)
3	2	rexbii 2331	. 2 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝜑 ↔ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 ∃𝑥 ∈ 𝐴 𝜑)
4		rexcom 2474	. 2 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 ∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑧 ∈ 𝐶 ∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑)
5	1, 3, 4	3bitri 195	1 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝜑 ↔ ∃𝑧 ∈ 𝐶 ∃𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑)

Syntax hints:   ↔ wb 98  ∃wrex 2307

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rex 2312

This theorem is referenced by:  rexrot4  2476