Nuprl Lemma : es-closed-open-interval-sorted-by
∀[Info:Type]. ∀es:EO+(Info). ∀e1,e2:E. sorted-by(λx,y. (x <loc y);[e1;e2))
Proof
Definitions occuring in Statement :
event-ordering+: EO+(Info),
es-closed-open-interval: [e;e'),
es-locl: (e <loc e'),
es-E: E,
sorted-by: sorted-by(R;L),
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
lambda: λx.A[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
es-closed-open-interval: [e;e'),
member: t ∈ T,
subtype_rel: A ⊆r B,
implies: P ⇒ Q,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
l-ordered: l-ordered(T;x,y.R[x; y];L),
es-locl: (e <loc e'),
es-causl: (e < e'),
squash: ↓T,
prop: ℙ
Latex:
\mforall{}[Info:Type]. \mforall{}es:EO+(Info). \mforall{}e1,e2:E. sorted-by(\mlambda{}x,y. (x <loc y);[e1;e2))
Date html generated:
2016_05_16-PM-01_12_42
Last ObjectModification:
2016_01_17-PM-07_54_30
Theory : event-ordering
Home
Index