Nuprl Lemma : polyconst_val_lemma
∀l,k:Top. (polyconst(k)@l ~ k)
Proof
Definitions occuring in Statement :
poly-int-val: p@l,
polyconst: polyconst(k),
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
polyconst: polyconst(k),
poly-int-val: p@l,
poly-val-fun: poly-val-fun(p),
tree_leaf: tree_leaf(value),
tree_ind: tree_ind,
all: ∀x:A. B[x],
member: t ∈ T
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
lambdaFormation,
cut,
introduction,
extract_by_obid,
hypothesis
Latex:
\mforall{}l,k:Top. (polyconst(k)@l \msim{} k)
Date html generated:
2017_10_01-AM-08_32_34
Last ObjectModification:
2017_05_02-PM-02_09_21
Theory : integer!polynomial!trees
Home
Index