Nuprl Lemma : for_hdtl_nil_lemma
∀g,k,f,T:Top. (ForHdTl{T,f,k} h::t ∈ []. g[h;t] ~ k)
Proof
Definitions occuring in Statement :
for_hdtl: ForHdTl{A,f,k} h::t ∈ as. g[h; t],
nil: [],
top: Top,
so_apply: x[s1;s2],
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
for_hdtl: ForHdTl{A,f,k} h::t ∈ as. g[h; t],
top: Top
Lemmas referenced :
top_wf,
mapcons_nil_lemma,
reduce_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{}g,k,f,T:Top. (ForHdTl\{T,f,k\} h::t \mmember{} []. g[h;t] \msim{} k)
Date html generated:
2016_05_14-AM-07_38_34
Last ObjectModification:
2015_12_26-PM-02_12_46
Theory : list_1
Home
Index