Nuprl Lemma : ranked-eo-info-before
∀[L:Id ─→ (Top List)]. ∀[rk:Top]. ∀[e:E]. (map(λe.info(e);before(e)) ~ firstn(snd(e);L (fst(e))))
Proof
Definitions occuring in Statement :
ranked-eo: ranked-eo(L;rk),
es-info: info(e),
es-before: before(e),
es-E: E,
Id: Id,
firstn: firstn(n;as),
map: map(f;as),
list: T List,
uall: ∀[x:A]. B[x],
top: Top,
pi1: fst(t),
pi2: snd(t),
apply: f a,
lambda: λx.A[x],
function: x:A ─→ B[x],
sqequal: s ~ t
Lemmas :
ranked-eo-before,
ranked-eo-info,
map-map,
firstn_map_upto,
subtype_rel_self,
Id_wf,
int_seg_wf,
length_wf,
int_seg_subtype-nat,
false_wf,
subtype_base_sq,
list_wf,
list_subtype_base,
set_subtype_base,
lelt_wf,
int_subtype_base,
upto_wf,
top_wf,
set_wf,
true_wf,
ranked-eo-E-sq,
imin_unfold,
iff_weakening_equal,
le_int_wf,
bool_wf,
eqtt_to_assert,
assert_of_le_int,
less_than_transitivity1,
less_than_irreflexivity,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
bool_subtype_base,
assert-bnot,
le_wf
Latex:
\mforall{}[L:Id {}\mrightarrow{} (Top List)]. \mforall{}[rk:Top]. \mforall{}[e:E]. (map(\mlambda{}e.info(e);before(e)) \msim{} firstn(snd(e);L (fst(e))))
Date html generated:
2015_07_21-PM-04_45_05
Last ObjectModification:
2015_02_04-PM-05_57_33
Home
Index