Nuprl Lemma : es-prior-interface-causl
∀[Info:Type]. ∀es:EO+(Info). ∀X:EClass(Top). ∀e:E. (prior(X)(e) < e) 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-causl: (e < e'),
es-E: E,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
uimplies: b supposing a,
guard: {T},
subtype_rel: A ⊆r B,
es-E-interface: E(X),
implies: P ⇒ Q,
es-causl: (e < e'),
squash: ↓T,
prop: ℙ,
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. (prior(X)(e) < e) supposing \muparrow{}e \mmember{}\msubb{} prior(X)
Date html generated:
2016_05_16-PM-11_57_40
Last ObjectModification:
2016_01_17-PM-06_58_02
Theory : event-ordering
Home
Index