Nuprl Lemma : cut-order-iff
∀[Info:Type]
∀es:EO+(Info). ∀X:EClass(Top). ∀f:sys-antecedent(es;X). ∀a,b:E(X).
(a ≤(X;f) b
⇐⇒ (a = b ∈ E(X))
∨ (((¬(loc(f b) = loc(b) ∈ Id)) ∧ (f b < b)) ∧ a ≤(X;f) f b)
∨ ((↑b ∈b prior(X)) ∧ a ≤(X;f) prior(X)(b)))
Proof
Definitions occuring in Statement :
cut-order: a ≤(X;f) b,
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-causl: (e < e'),
es-loc: loc(e),
Id: Id,
assert: ↑b,
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
not: ¬A,
or: P ∨ Q,
and: P ∧ Q,
apply: f a,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
prop: ℙ,
rev_implies: P ⇐ Q,
subtype_rel: A ⊆r B,
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
uimplies: b supposing a,
top: Top,
or: P ∨ Q,
sq_stable: SqStable(P),
squash: ↓T,
guard: {T},
cand: A c∧ B,
decidable: Dec(P),
es-locl: (e <loc e'),
not: ¬A,
false: False,
exists: ∃x:A. B[x]
Latex:
\mforall{}[Info:Type]
\mforall{}es:EO+(Info). \mforall{}X:EClass(Top). \mforall{}f:sys-antecedent(es;X). \mforall{}a,b:E(X).
(a \mleq{}(X;f) b
\mLeftarrow{}{}\mRightarrow{} (a = b)
\mvee{} (((\mneg{}(loc(f b) = loc(b))) \mwedge{} (f b < b)) \mwedge{} a \mleq{}(X;f) f b)
\mvee{} ((\muparrow{}b \mmember{}\msubb{} prior(X)) \mwedge{} a \mleq{}(X;f) prior(X)(b)))
Date html generated:
2016_05_17-AM-07_45_35
Last ObjectModification:
2016_01_17-PM-02_49_49
Theory : event-ordering
Home
Index