Database
CLASSICAL FIRST-ORDER LOGIC WITH EQUALITY
Predicate calculus with equality: Auxiliary axiom schemes (4 schemes)
Axiom scheme ax-11 (Quantifier Commutation)
excom13
Next ⟩
exrot3
Metamath Proof Explorer
Ascii
Unicode
Theorem
excom13
Description:
Swap 1st and 3rd existential quantifiers.
(Contributed by
NM
, 9-Mar-1995)
Ref
Expression
Assertion
excom13
⊢
∃
x
∃
y
∃
z
φ
↔
∃
z
∃
y
∃
x
φ
Proof
Step
Hyp
Ref
Expression
1
excom
⊢
∃
x
∃
y
∃
z
φ
↔
∃
y
∃
x
∃
z
φ
2
excom
⊢
∃
x
∃
z
φ
↔
∃
z
∃
x
φ
3
2
exbii
⊢
∃
y
∃
x
∃
z
φ
↔
∃
y
∃
z
∃
x
φ
4
excom
⊢
∃
y
∃
z
∃
x
φ
↔
∃
z
∃
y
∃
x
φ
5
1
3
4
3bitri
⊢
∃
x
∃
y
∃
z
φ
↔
∃
z
∃
y
∃
x
φ