Nuprl Lemma : es-loc-prior-interface
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[e:E]. loc(prior(X)(e)) = loc(e) ∈ Id supposing ↑e ∈b prior(X)
Proof
Definitions occuring in Statement :
es-prior-interface: prior(X),
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-loc: loc(e),
es-E: E,
Id: Id,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
uimplies: b supposing a,
es-locl: (e <loc e'),
and: P ∧ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
top: Top
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[e:E].
loc(prior(X)(e)) = loc(e) supposing \muparrow{}e \mmember{}\msubb{} prior(X)
Date html generated:
2016_05_16-PM-11_57_21
Last ObjectModification:
2015_12_29-AM-00_58_19
Theory : event-ordering
Home
Index