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