Nuprl Lemma : polynom_wf
∀[n:ℤ]. (polynom(n) ∈ Type)
Proof
Definitions occuring in Statement :
polynom: polynom(n),
uall: ∀[x:A]. B[x],
member: t ∈ T,
int: ℤ,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
polynom: polynom(n),
implies: P ⇒ Q,
polyform: polyform(n),
prop: ℙ
Lemmas referenced :
polyform_wf,
assert_wf,
poly-zero_wf,
tree_leaf?_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
setEquality,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
functionEquality,
setElimination,
rename,
intEquality,
because_Cache,
axiomEquality,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[n:\mBbbZ{}]. (polynom(n) \mmember{} Type)
Date html generated:
2017_10_01-AM-08_32_20
Last ObjectModification:
2017_05_02-AM-10_44_15
Theory : integer!polynomial!trees
Home
Index