Nuprl Lemma : mFOL-sequent-freevars_wf

[s:mFOL-sequent()]. (mFOL-sequent-freevars(s) ∈ ℤ List)


Proof




Definitions occuring in Statement :  mFOL-sequent-freevars: mFOL-sequent-freevars(s) mFOL-sequent: mFOL-sequent() list: List uall: [x:A]. B[x] member: t ∈ T int:
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T mFOL-sequent-freevars: mFOL-sequent-freevars(s) mFOL-sequent: mFOL-sequent()
Lemmas referenced :  reduce_wf mFOL_wf list_wf l-union_wf int-deq_wf mFOL-freevars_wf mFOL-sequent_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut sqequalRule spreadEquality sqequalHypSubstitution hypothesisEquality lemma_by_obid isectElimination thin hypothesis intEquality lambdaEquality axiomEquality equalityTransitivity equalitySymmetry

Latex:
\mforall{}[s:mFOL-sequent()].  (mFOL-sequent-freevars(s)  \mmember{}  \mBbbZ{}  List)



Date html generated: 2016_05_15-PM-10_26_04
Last ObjectModification: 2015_12_27-PM-06_27_08

Theory : minimal-first-order-logic


Home Index