Database
CLASSICAL FIRST-ORDER LOGIC WITH EQUALITY
Predicate calculus with equality: Tarski's system S2 (1 rule, 6 schemes)
Axiom scheme ax-4 (Quantified Implication)
2nexaln
Next ⟩
alimex
Metamath Proof Explorer
Ascii
Unicode
Theorem
2nexaln
Description:
Theorem *11.25 in
WhiteheadRussell
p. 160.
(Contributed by
Andrew Salmon
, 24-May-2011)
Ref
Expression
Assertion
2nexaln
⊢
¬
∃
x
∃
y
φ
↔
∀
x
∀
y
¬
φ
Proof
Step
Hyp
Ref
Expression
1
2exnaln
⊢
∃
x
∃
y
φ
↔
¬
∀
x
∀
y
¬
φ
2
1
bicomi
⊢
¬
∀
x
∀
y
¬
φ
↔
∃
x
∃
y
φ
3
2
con1bii
⊢
¬
∃
x
∃
y
φ
↔
∀
x
∀
y
¬
φ