Nuprl Lemma : interface-predecessors-tagged-true
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top × 𝔹)]. ∀[e:E]. (≤(Tagged_tt(X))(e) ~ filter(λe.(snd(X(e)));≤(X)(e)))
Proof
Definitions occuring in Statement :
es-interface-predecessors: ≤(X)(e),
es-tagged-true-class: Tagged_tt(X),
eclass-val: X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
filter: filter(P;l),
bool: 𝔹,
uall: ∀[x:A]. B[x],
top: Top,
pi2: snd(t),
lambda: λx.A[x],
product: x:A × B[x],
universe: Type,
sqequal: s ~ t
Lemmas :
filter-sq,
es-E-interface_wf,
es-interface-subtype_rel2,
es-E_wf,
event-ordering+_subtype,
event-ordering+_wf,
subtype_top,
top_wf,
bool_wf,
Id_wf,
es-loc_wf,
es-interface-predecessors_wf,
l_member_wf,
set_wf,
eq_int_wf,
bag-size_wf,
eclass-val_wf,
in-eclass_wf,
sq_stable__assert,
eqtt_to_assert,
single-bag_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
empty-bag_wf,
nat_wf,
bag_size_single_lemma,
true_wf,
bag_size_empty_lemma,
false_wf,
assert_wf
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top \mtimes{} \mBbbB{})]. \mforall{}[e:E].
(\mleq{}(Tagged\_tt(X))(e) \msim{} filter(\mlambda{}e.(snd(X(e)));\mleq{}(X)(e)))
Date html generated:
2015_07_21-PM-03_39_37
Last ObjectModification:
2015_01_27-PM-06_34_26
Home
Index