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)
nfnd
Next ⟩
exanali
Metamath Proof Explorer
Ascii
Unicode
Theorem
nfnd
Description:
Deduction associated with
nfnt
.
(Contributed by
Mario Carneiro
, 24-Sep-2016)
Ref
Expression
Hypothesis
nfnd.1
⊢
φ
→
Ⅎ
x
ψ
Assertion
nfnd
⊢
φ
→
Ⅎ
x
¬
ψ
Proof
Step
Hyp
Ref
Expression
1
nfnd.1
⊢
φ
→
Ⅎ
x
ψ
2
nfnt
⊢
Ⅎ
x
ψ
→
Ⅎ
x
¬
ψ
3
1
2
syl
⊢
φ
→
Ⅎ
x
¬
ψ