Nuprl Lemma : last_nil
last([]) ~ ⊥
Proof
Definitions occuring in Statement :
last: last(L),
nil: [],
bottom: ⊥,
sqequal: s ~ t
Definitions unfolded in proof :
last: last(L),
select: L[n],
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
all: ∀x:A. B[x],
nil: [],
it: ⋅,
so_lambda: λ2x y.t[x; y],
top: Top,
so_apply: x[s1;s2]
Lemmas referenced :
base_wf,
stuck-spread
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
sqequalRule,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
baseClosed,
independent_isectElimination,
lambdaFormation,
hypothesis,
isect_memberEquality,
voidElimination,
voidEquality
Latex:
last([]) \msim{} \mbot{}
Date html generated:
2016_05_14-AM-06_37_30
Last ObjectModification:
2016_01_06-PM-08_33_13
Theory : list_0
Home
Index