Nuprl Lemma : es-prior-interface-val-locl
∀[Info:Type]. ∀es:EO+(Info). ∀X:EClass(Top). ∀e:E(prior(X)). ∀e':E(X). ((prior(X)(e) <loc e') ⇒ e ≤loc e' )
Proof
Definitions occuring in Statement :
es-prior-interface: prior(X),
es-E-interface: E(X),
eclass-val: X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-locl: (e <loc e'),
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
implies: P ⇒ Q,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
uimplies: b supposing a,
es-E-interface: E(X),
subtype_rel: A ⊆r B,
sq_type: SQType(T),
guard: {T},
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
decidable: Dec(P),
or: P ∨ Q,
and: P ∧ Q,
not: ¬A,
es-locl: (e <loc e'),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
false: False,
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)). \mforall{}e':E(X). ((prior(X)(e) <loc e') {}\mRightarrow{} e \mleq{}loc e' )
Date html generated:
2016_05_16-PM-11_58_19
Last ObjectModification:
2015_12_29-AM-00_59_42
Theory : event-ordering
Home
Index