Theorem excom13 1619

Description: Swap 1st and 3rd existential quantifiers. (Contributed by NM, 9-Mar-1995.)

Assertion

Ref	Expression
excom13	⊢ (∃𝑥∃𝑦∃𝑧𝜑 ↔ ∃𝑧∃𝑦∃𝑥𝜑)

Proof of Theorem excom13

Step	Hyp	Ref	Expression
1		excom 1594	. 2 ⊢ (∃𝑥∃𝑦∃𝑧𝜑 ↔ ∃𝑦∃𝑥∃𝑧𝜑)
2		excom 1594	. . 3 ⊢ (∃𝑥∃𝑧𝜑 ↔ ∃𝑧∃𝑥𝜑)
3	2	exbii 1536	. 2 ⊢ (∃𝑦∃𝑥∃𝑧𝜑 ↔ ∃𝑦∃𝑧∃𝑥𝜑)
4		excom 1594	. 2 ⊢ (∃𝑦∃𝑧∃𝑥𝜑 ↔ ∃𝑧∃𝑦∃𝑥𝜑)
5	1, 3, 4	3bitri 204	1 ⊢ (∃𝑥∃𝑦∃𝑧𝜑 ↔ ∃𝑧∃𝑦∃𝑥𝜑)

Syntax hints:   ↔ wb 103  ∃wex 1421

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-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-4 1440  ax-ial 1467

This theorem depends on definitions:  df-bi 115

This theorem is referenced by:  exrot3  1620  exrot4  1621  euotd  4009