Nuprl Lemma : combine_list_single_lemma
∀u,f:Top. (combine-list(x,y.f[x;y];[u]) ~ u)
Proof
Definitions occuring in Statement :
combine-list: combine-list(x,y.f[x; y];L),
cons: [a / b],
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,
combine-list: combine-list(x,y.f[x; y];L),
top: Top,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Lemmas referenced :
top_wf,
reduce_hd_cons_lemma,
reduce_tl_cons_lemma,
list_accum_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{}u,f:Top. (combine-list(x,y.f[x;y];[u]) \msim{} u)
Date html generated:
2016_05_14-PM-01_41_37
Last ObjectModification:
2015_12_26-PM-05_30_09
Theory : list_1
Home
Index