Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > excom13 | Structured version Visualization version GIF version |
Description: Swap 1st and 3rd existential quantifiers. (Contributed by NM, 9-Mar-1995.) |
Ref | Expression |
---|---|
excom13 | ⊢ (∃𝑥∃𝑦∃𝑧𝜑 ↔ ∃𝑧∃𝑦∃𝑥𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | excom 2042 | . 2 ⊢ (∃𝑥∃𝑦∃𝑧𝜑 ↔ ∃𝑦∃𝑥∃𝑧𝜑) | |
2 | excom 2042 | . . 3 ⊢ (∃𝑥∃𝑧𝜑 ↔ ∃𝑧∃𝑥𝜑) | |
3 | 2 | exbii 1774 | . 2 ⊢ (∃𝑦∃𝑥∃𝑧𝜑 ↔ ∃𝑦∃𝑧∃𝑥𝜑) |
4 | excom 2042 | . 2 ⊢ (∃𝑦∃𝑧∃𝑥𝜑 ↔ ∃𝑧∃𝑦∃𝑥𝜑) | |
5 | 1, 3, 4 | 3bitri 286 | 1 ⊢ (∃𝑥∃𝑦∃𝑧𝜑 ↔ ∃𝑧∃𝑦∃𝑥𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 ∃wex 1704 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-11 2034 |
This theorem depends on definitions: df-bi 197 df-ex 1705 |
This theorem is referenced by: exrot3 2045 exrot4 2046 euotd 4975 elfuns 32022 |
Copyright terms: Public domain | W3C validator |