Theorem excom13 1667

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 1642	. 2 ⊢ (∃𝑥∃𝑦∃𝑧𝜑 ↔ ∃𝑦∃𝑥∃𝑧𝜑)
2		excom 1642	. . 3 ⊢ (∃𝑥∃𝑧𝜑 ↔ ∃𝑧∃𝑥𝜑)
3	2	exbii 1584	. 2 ⊢ (∃𝑦∃𝑥∃𝑧𝜑 ↔ ∃𝑦∃𝑧∃𝑥𝜑)
4		excom 1642	. 2 ⊢ (∃𝑦∃𝑧∃𝑥𝜑 ↔ ∃𝑧∃𝑦∃𝑥𝜑)
5	1, 3, 4	3bitri 205	1 ⊢ (∃𝑥∃𝑦∃𝑧𝜑 ↔ ∃𝑧∃𝑦∃𝑥𝜑)

Syntax hints:   ↔ wb 104  ∃wex 1468

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-4 1487  ax-ial 1514

This theorem depends on definitions:  df-bi 116

This theorem is referenced by:  exrot3  1668  exrot4  1669  euotd  4176