Nuprl Lemma : es-closed-open-interval-forward
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[e1,e2,e:E]. ([e1;e2) = [e1;e2) ∈ (E List)) supposing (e ≤loc e1 and e1 ≤loc e2 )
Proof
Definitions occuring in Statement :
eo-forward: eo.e,
event-ordering+: EO+(Info),
es-closed-open-interval: [e;e'),
es-le: e ≤loc e' ,
es-E: E,
list: T List,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
prop: ℙ,
subtype_rel: A ⊆r B,
implies: P ⇒ Q,
all: ∀x:A. B[x],
guard: {T},
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
label: ...$L... t,
squash: ↓T,
true: True,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[e1,e2,e:E].
([e1;e2) = [e1;e2)) supposing (e \mleq{}loc e1 and e1 \mleq{}loc e2 )
Date html generated:
2016_05_16-PM-01_12_52
Last ObjectModification:
2016_01_17-PM-07_57_06
Theory : event-ordering
Home
Index