Database
CLASSICAL FIRST-ORDER LOGIC WITH EQUALITY
Predicate calculus with equality: Tarski's system S2 (1 rule, 6 schemes)
Universal quantifier (continued); define "exists" and "not free"
Nonfreeness predicate
nfd
Next ⟩
nfrd
Metamath Proof Explorer
Ascii
Unicode
Theorem
nfd
Description:
Deduce that
x
is not free in
ps
in a context.
(Contributed by
Wolf Lammen
, 16-Sep-2021)
Ref
Expression
Hypothesis
nfd.1
⊢
φ
→
∃
x
ψ
→
∀
x
ψ
Assertion
nfd
⊢
φ
→
Ⅎ
x
ψ
Proof
Step
Hyp
Ref
Expression
1
nfd.1
⊢
φ
→
∃
x
ψ
→
∀
x
ψ
2
df-nf
⊢
Ⅎ
x
ψ
↔
∃
x
ψ
→
∀
x
ψ
3
1
2
sylibr
⊢
φ
→
Ⅎ
x
ψ