Nuprl Lemma : list-eo-info-before
∀L:Top List. ∀i:Id. ∀e:E. (map(λe.info(e);before(e)) ~ firstn(e;L))
Proof
Definitions occuring in Statement :
list-eo: list-eo(L;i),
es-info: info(e),
es-before: before(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],
sqequal: s ~ t
Lemmas :
list-eo-before,
list-eo-info,
list-eo-E-sq,
assert_of_lt_int,
length_wf,
top_wf,
nat_properties,
less_than_transitivity1,
less_than_irreflexivity,
ge_wf,
less_than_wf,
nat_wf,
equal-wf-T-base,
colength_wf_list,
list_wf,
list-cases,
length_nil,
non_neg_length,
nil_wf,
length_wf_nil,
product_subtype_list,
spread_cons_lemma,
sq_stable__le,
le_antisymmetry_iff,
add_functionality_wrt_le,
add-associates,
add-zero,
zero-add,
le-add-cancel,
decidable__le,
false_wf,
not-le-2,
condition-implies-le,
minus-add,
minus-one-mul,
add-commutes,
le_wf,
subtract_wf,
not-ge-2,
less-iff-le,
minus-minus,
add-swap,
subtype_base_sq,
set_subtype_base,
int_subtype_base,
cons_wf,
length_of_cons_lemma,
reduce_hd_cons_lemma,
list_ind_cons_lemma,
lt_int_wf,
bool_wf,
eqtt_to_assert,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
bool_subtype_base,
assert-bnot,
length_wf_nat,
length_cons,
upto_decomp2,
map_cons_lemma,
map-map,
upto_wf,
subtype_rel_list,
int_seg_wf,
subtype_rel_nested_set,
lelt_wf,
subtype_rel_sets,
set_wf,
map_nil_lemma,
select_cons_tl_sq,
le-add-cancel2,
decidable__equal_int,
not-equal-2,
minus-zero,
assert_wf
Latex:
\mforall{}L:Top List. \mforall{}i:Id. \mforall{}e:E. (map(\mlambda{}e.info(e);before(e)) \msim{} firstn(e;L))
Date html generated:
2015_07_21-PM-04_31_36
Last ObjectModification:
2015_01_27-PM-05_17_48
Home
Index