Nuprl Lemma : eo-forward-split-before
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[e,x:E]. before(e) = (before(x) @ before(e)) ∈ (E List) supposing x ≤loc e
Proof
Definitions occuring in Statement :
eo-forward: eo.e,
event-ordering+: EO+(Info),
es-before: before(e),
es-le: e ≤loc e' ,
es-E: E,
append: as @ bs,
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,
squash: ↓T,
prop: ℙ,
true: True,
guard: {T},
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
es-closed-open-interval: [e;e'),
es-le: e ≤loc e' ,
or: P ∨ Q,
es-le-before: ≤loc(e),
top: Top,
append: as @ bs,
all: ∀x:A. B[x],
so_lambda: so_lambda(x,y,z.t[x; y; z]),
so_apply: x[s1;s2;s3]
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[e,x:E]. before(e) = (before(x) @ before(e)) supposing x \mleq{}loc e
Date html generated:
2016_05_16-PM-01_11_32
Last ObjectModification:
2016_01_17-PM-07_55_04
Theory : event-ordering
Home
Index