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
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
es-cut-add: c+e,
es-cut: Cut(X;f),
sys-antecedent: sys-antecedent(es;Sys),
prop: ℙ,
implies: P ⇒ Q,
subtype_rel: A ⊆r B,
es-E-interface: E(X),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
fset-closed: (s closed under fs),
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
or: P ∨ Q,
uiff: uiff(P;Q),
decidable: Dec(P),
guard: {T},
not: ¬A,
false: False,
es-interface-pred: X-pred,
top: Top,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
bfalse: ff,
sq_stable: SqStable(P),
squash: ↓T
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:
2016_05_17-AM-07_35_22
Last ObjectModification:
2016_01_17-PM-03_00_02
Theory : event-ordering
Home
Index