Nuprl Lemma : list-eo-info-le-before
∀L:Top List. ∀i:Id. ∀e:E. (map(λe.info(e);≤loc(e)) ~ firstn(e + 1;L))
Proof
Definitions occuring in Statement :
list-eo: list-eo(L;i),
es-info: info(e),
es-le-before: ≤loc(e),
es-E: E,
Id: Id,
firstn: firstn(n;as),
map: map(f;as),
list: T List,
top: Top,
all: ∀x:A. B[x],
lambda: λx.A[x],
add: n + m,
natural_number: $n,
sqequal: s ~ t
Lemmas :
Id_wf,
list_wf,
top_wf,
map_append_sq,
list-eo-info-before,
map_cons_lemma,
map_nil_lemma,
list-eo-info,
list-eo-E-sq,
assert_of_lt_int,
length_wf,
lt_int_wf,
bool_wf,
eqtt_to_assert,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
less_than_wf,
firstn_decomp,
decidable__le,
false_wf,
not-le-2,
sq_stable__le,
condition-implies-le,
minus-add,
minus-one-mul,
zero-add,
add-associates,
add-swap,
add-commutes,
add_functionality_wrt_le,
add-zero,
le-add-cancel,
le_wf,
decidable__lt,
trivial-int-eq1,
set_wf,
nat_wf,
assert_wf
Latex:
\mforall{}L:Top List. \mforall{}i:Id. \mforall{}e:E. (map(\mlambda{}e.info(e);\mleq{}loc(e)) \msim{} firstn(e + 1;L))
Date html generated:
2015_07_21-PM-04_31_52
Last ObjectModification:
2015_01_27-PM-05_13_31
Home
Index