Nuprl Lemma : value-type-polynom
∀[n:ℕ]. value-type(polynom(n))
Proof
Definitions occuring in Statement :
polynom: polynom(n),
nat: ℕ,
value-type: value-type(T),
uall: ∀[x:A]. B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
value-type: value-type(T),
has-value: (a)↓,
prop: ℙ
Lemmas referenced :
subtype-value-type,
polynom_wf,
polyform_wf,
polynom_subtype_polyform,
polyform-value-type,
equal-wf-base,
base_wf,
nat_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
independent_isectElimination,
sqequalRule,
isect_memberEquality,
axiomSqleEquality,
because_Cache,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[n:\mBbbN{}]. value-type(polynom(n))
Date html generated:
2017_09_29-PM-05_59_48
Last ObjectModification:
2017_04_26-PM-02_04_31
Theory : integer!polynomials
Home
Index