Nuprl Lemma : mFOL-freevars_wf
∀[fmla:mFOL()]. (mFOL-freevars(fmla) ∈ ℤ List)
Proof
Definitions occuring in Statement :
mFOL-freevars: mFOL-freevars(fmla),
mFOL: mFOL(),
list: T List,
uall: ∀[x:A]. B[x],
member: t ∈ T,
int: ℤ
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
mFOL-freevars: mFOL-freevars(fmla),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
so_lambda: so_lambda(x,y,z,w,v.t[x; y; z; w; v]),
uimplies: b supposing a,
so_apply: x[s1;s2;s3;s4;s5],
so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]),
all: ∀x:A. B[x],
prop: ℙ,
so_apply: x[s1;s2;s3;s4]
Lemmas referenced :
mFOL_ind_wf_simple,
list_wf,
remove-repeats_wf,
int-deq_wf,
val-union_wf,
int-valueall-type,
mFOL_wf,
filter_wf5,
l_member_wf,
bnot_wf,
eq_int_wf,
bool_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
intEquality,
hypothesis,
hypothesisEquality,
lambdaEquality,
because_Cache,
atomEquality,
independent_isectElimination,
lambdaFormation,
setElimination,
rename,
setEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[fmla:mFOL()]. (mFOL-freevars(fmla) \mmember{} \mBbbZ{} List)
Date html generated:
2016_05_15-PM-10_14_38
Last ObjectModification:
2015_12_27-PM-06_32_40
Theory : minimal-first-order-logic
Home
Index