MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  excom13 Structured version   Visualization version   GIF version

Theorem excom13 2200
Description: Swap 1st and 3rd existential quantifiers. (Contributed by NM, 9-Mar-1995.)
Assertion
Ref Expression
excom13 (∃𝑥∃𝑦∃𝑧𝜑 ↔ ∃𝑧∃𝑦∃𝑥𝜑)

Proof of Theorem excom13
StepHypRef Expression
1 excom 2198 . 2 (∃𝑥∃𝑦∃𝑧𝜑 ↔ ∃𝑦∃𝑥∃𝑧𝜑)
2 excom 2198 . . 3 (∃𝑥∃𝑧𝜑 ↔ ∃𝑧∃𝑥𝜑)
32exbii 1880 . 2 (∃𝑦∃𝑥∃𝑧𝜑 ↔ ∃𝑦∃𝑧∃𝑥𝜑)
4 excom 2198 . 2 (∃𝑦∃𝑧∃𝑥𝜑 ↔ ∃𝑧∃𝑦∃𝑥𝜑)
51, 3, 43bitri 300 1 (∃𝑥∃𝑦∃𝑧𝜑 ↔ ∃𝑧∃𝑦∃𝑥𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209  ∃wex 1811
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-11 2193
This proof depends on definitions:  df-bi 210  df-ex 1812
This theorem is used by:  exrot3  2201  exrot4  2202  euotd  5485  elfuns  36770  fundcmpsurbijinj  48586
  Copyright terms: Public domain W3C validator