Theorem excom13 1699

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

Syntax hints:   ↔ wb 105  ∃wex 1502

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-4 1520  ax-ial 1544

This theorem depends on definitions:  df-bi 117

This theorem is referenced by:  exrot3  1700  exrot4  1701  euotd  4266