Nuprl Lemma : es-interval-eq-le-before
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[e1,e2:E]. [e1, e2] = ≤loc(e2) ∈ (E List) supposing e1 ≤loc e2
Proof
Definitions occuring in Statement :
eo-forward: eo.e,
event-ordering+: EO+(Info),
es-interval: [e, e'],
es-le-before: ≤loc(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,
subtype_rel: A ⊆r B,
guard: {T},
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
es-le-before: ≤loc(e),
es-interval: [e, e'],
prop: ℙ
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[e1,e2:E]. [e1, e2] = \mleq{}loc(e2) supposing e1 \mleq{}loc e2
Date html generated:
2016_05_16-PM-01_13_26
Last ObjectModification:
2015_12_29-PM-01_53_21
Theory : event-ordering
Home
Index