Nuprl Lemma : lookup_nil_lemma
∀k,z,s:Top. ([][k] ~ z)
Proof
Definitions occuring in Statement :
lookup: as[k],
nil: [],
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
lookup: as[k],
ycomb: Y,
so_lambda: so_lambda(x,y,z.t[x; y; z]),
top: Top,
so_apply: x[s1;s2;s3]
Lemmas referenced :
top_wf,
list_ind_nil_lemma
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality
Latex:
\mforall{}k,z,s:Top. ([][k] \msim{} z)
Date html generated:
2016_05_16-AM-08_16_41
Last ObjectModification:
2015_12_28-PM-06_27_38
Theory : polynom_2
Home
Index