Nuprl Lemma : value-type-polyform
∀[n:ℤ]. value-type(polyform(n))
Proof
Definitions occuring in Statement :
polyform: polyform(n),
value-type: value-type(T),
uall: ∀[x:A]. B[x],
int: ℤ
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
polyform: polyform(n),
member: t ∈ T,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a
Lemmas referenced :
set-value-type,
tree_wf,
assert_wf,
ispolyform_wf,
valuetype__tree
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
intEquality,
hypothesis,
sqequalRule,
lambdaEquality,
applyEquality,
hypothesisEquality,
independent_isectElimination
Latex:
\mforall{}[n:\mBbbZ{}]. value-type(polyform(n))
Date html generated:
2017_10_01-AM-08_32_16
Last ObjectModification:
2017_05_02-PM-03_09_07
Theory : integer!polynomial!trees
Home
Index