Nuprl Lemma : es-cut-add_wf
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[f:sys-antecedent(es;X)]. ∀[c:Cut(X;f)]. ∀[e:E(X)].
(c+e ∈ Cut(X;f)) supposing (((↑e ∈b prior(X)) ⇒ prior(X)(e) ∈ c) and ((¬((f e) = e ∈ E(X))) ⇒ f e ∈ c))
Proof
Definitions occuring in Statement :
es-cut-add: c+e,
es-cut: Cut(X;f),
es-prior-interface: prior(X),
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-eq: es-eq(es),
fset-member: a ∈ s,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
not: ¬A,
implies: P ⇒ Q,
member: t ∈ T,
apply: f a,
universe: Type,
equal: s = t ∈ T
Lemmas :
fset-union_wf,
es-eq_wf-interface,
fset-singleton_wf,
fset-closed_wf,
cons_wf,
es-interface-pred_wf2,
nil_wf,
assert_wf,
in-eclass_wf,
es-prior-interface_wf0,
es-interface-subtype_rel2,
es-E_wf,
event-ordering+_subtype,
event-ordering+_wf,
top_wf,
subtype_top,
fset-member_wf-cut,
eclass-val_wf2,
es-prior-interface_wf,
not_wf,
equal_wf,
es-E-interface_wf,
es-cut_wf,
sys-antecedent_wf,
eclass_wf,
l_all_iff,
es-interface-pred_wf,
l_member_wf,
all_wf,
isect_wf,
fset-member_wf,
member-fset-union,
fset-member_witness,
member-fset-singleton,
cons_member,
or_wf,
decidable__equal_es-E-interface,
null_nil_lemma,
btrue_wf,
member-implies-null-eq-bfalse,
btrue_neq_bfalse,
bool_wf,
equal-wf-T-base,
bnot_wf,
eqtt_to_assert,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
sq_stable_from_decidable,
decidable__fset-member
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:sys-antecedent(es;X)]. \mforall{}[c:Cut(X;f)].
\mforall{}[e:E(X)].
(c+e \mmember{} Cut(X;f)) supposing (((\muparrow{}e \mmember{}\msubb{} prior(X)) {}\mRightarrow{} prior(X)(e) \mmember{} c) and ((\mneg{}((f e) = e)) {}\mRightarrow{} f e \mmember{} c))
Date html generated:
2015_07_21-PM-03_59_59
Last ObjectModification:
2015_01_27-PM-05_57_09
Home
Index