Nuprl Lemma : new-mFO-var_wf

[H:mFOL() List]. (new-mFO-var(H) ∈ ℤ)


Proof




Definitions occuring in Statement :  new-mFO-var: new-mFO-var(H) 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 new-mFO-var: new-mFO-var(H) so_lambda: λ2y.t[x; y] uimplies: supposing a callbyvalueall: callbyvalueall has-value: (a)↓ has-valueall: has-valueall(a) so_apply: x[s1;s2]
Lemmas referenced :  list_accum_wf mFOL_wf valueall-type-has-valueall list_wf list-valueall-type int-valueall-type mFOL-freevars_wf evalall-reduce value-type-has-value int-value-type bigger-int_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut sqequalRule lemma_by_obid sqequalHypSubstitution isectElimination thin hypothesis intEquality hypothesisEquality natural_numberEquality lambdaEquality independent_isectElimination callbyvalueReduce because_Cache axiomEquality equalityTransitivity equalitySymmetry

Latex:
\mforall{}[H:mFOL()  List].  (new-mFO-var(H)  \mmember{}  \mBbbZ{})



Date html generated: 2016_05_15-PM-10_31_02
Last ObjectModification: 2015_12_27-PM-06_24_13

Theory : minimal-first-order-logic


Home Index