Nuprl Lemma : is-interface-right
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top + Top)]. ∀[e:E]. uiff(↑e ∈b right(X);(↑e ∈b X) ∧ (¬↑isl(X(e))))
Proof
Definitions occuring in Statement :
es-interface-right: right(X),
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
assert: ↑b,
isl: isl(x),
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
top: Top,
not: ¬A,
and: P ∧ Q,
union: left + right,
universe: Type
Lemmas :
bag_wf,
top_wf,
eq_int_wf,
bag-size_wf,
bool_wf,
eqtt_to_assert,
assert_of_eq_int,
nat_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
neg_assert_of_eq_int,
bag_size_empty_lemma,
false_wf,
in-eclass_wf,
es-interface-subtype_rel2,
es-E_wf,
event-ordering+_subtype,
event-ordering+_wf,
subtype_top,
assert_wf,
isl_wf,
eclass-val_wf,
es-interface-right_wf,
not_wf,
eclass_wf,
bag-size-one,
bag-only_wf2,
single-valued-bag-if-le1,
le_weakening,
decidable__lt,
le_antisymmetry_iff,
add_functionality_wrt_le,
add-zero,
le-add-cancel,
reduce_hd_cons_lemma,
filter_cons_lemma,
filter_nil_lemma,
map_nil_lemma,
length_of_nil_lemma,
true_wf,
map_cons_lemma,
length_of_cons_lemma
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top + Top)]. \mforall{}[e:E].
uiff(\muparrow{}e \mmember{}\msubb{} right(X);(\muparrow{}e \mmember{}\msubb{} X) \mwedge{} (\mneg{}\muparrow{}isl(X(e))))
Date html generated:
2015_07_20-PM-03_18_42
Last ObjectModification:
2015_01_27-PM-10_24_20
Home
Index