Nuprl Lemma : mFOL-boundvars_wf

[fmla:mFOL()]. (mFOL-boundvars(fmla) ∈ ℤ List)


Proof




Definitions occuring in Statement :  mFOL-boundvars: mFOL-boundvars(fmla) mFOL: mFOL() list: List uall: [x:A]. B[x] member: t ∈ T int:
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T mFOL-boundvars: mFOL-boundvars(fmla) so_lambda: λ2y.t[x; y] so_apply: x[s1;s2] so_lambda: so_lambda(x,y,z,w,v.t[x; y; z; w; v]) so_apply: x[s1;s2;s3;s4;s5] so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]) so_apply: x[s1;s2;s3;s4]
Lemmas referenced :  mFOL_ind_wf_simple list_wf nil_wf l-union_wf int-deq_wf mFOL_wf insert_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 atomEquality axiomEquality equalityTransitivity equalitySymmetry

Latex:
\mforall{}[fmla:mFOL()].  (mFOL-boundvars(fmla)  \mmember{}  \mBbbZ{}  List)



Date html generated: 2016_05_15-PM-10_14_50
Last ObjectModification: 2015_12_27-PM-06_32_15

Theory : minimal-first-order-logic


Home Index