Nuprl Lemma : co-list-value-type
∀[T:Type]. value-type(colist(T))
Proof
Definitions occuring in Statement :
colist: colist(T),
value-type: value-type(T),
uall: ∀[x:A]. B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
value-type: value-type(T),
uimplies: b supposing a,
has-value: (a)↓,
prop: ℙ
Lemmas referenced :
colist-value-type,
equal-wf-base,
colist_wf,
base_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
sqequalRule,
isect_memberEquality,
axiomSqleEquality,
because_Cache,
equalityTransitivity,
equalitySymmetry,
universeEquality
Latex:
\mforall{}[T:Type]. value-type(colist(T))
Date html generated:
2016_05_15-PM-10_09_18
Last ObjectModification:
2015_12_27-PM-05_59_37
Theory : eval!all
Home
Index