Nuprl Lemma : has-value-l-last-list
∀[l:Base]. l ∈ Top List supposing (l-last(l))↓
Proof
Definitions occuring in Statement :
l-last: l-last(l),
list: T List,
has-value: (a)↓,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
member: t ∈ T,
base: Base
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
l-last: l-last(l),
prop: ℙ
Lemmas referenced :
base_wf,
has-value_wf_base,
has-value-l-last-default-list
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalHypSubstitution,
lemma_by_obid,
isectElimination,
thin,
hypothesisEquality,
baseClosed,
independent_isectElimination,
hypothesis,
equalityTransitivity,
equalitySymmetry,
sqequalRule,
axiomEquality,
baseApply,
closedConclusion,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[l:Base]. l \mmember{} Top List supposing (l-last(l))\mdownarrow{}
Date html generated:
2016_05_14-AM-07_41_50
Last ObjectModification:
2016_01_15-AM-08_35_41
Theory : list_1
Home
Index