Nuprl Lemma : convergent-flow-order-preserving
∀[Info:Type]
∀es:EO+(Info). ∀X:EClass(Top). ∀f:E(X) ⟶ E(X).
(interface-order-preserving(es;X;f) ⇒ global-order-preserving(es;X;f) supposing convergent-flow(es;X;f))
Proof
Definitions occuring in Statement :
convergent-flow: convergent-flow(es;X;f),
global-order-preserving: global-order-preserving(es;X;f),
interface-order-preserving: interface-order-preserving(es;X;f),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
implies: P ⇒ Q,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
implies: P ⇒ Q,
uimplies: b supposing a,
convergent-flow: convergent-flow(es;X;f),
and: P ∧ Q,
global-order-preserving: global-order-preserving(es;X;f),
so_lambda: λ2x y.t[x; y],
so_lambda: λ2x.t[x],
prop: ℙ,
subtype_rel: A ⊆r B,
es-E-interface: E(X),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
so_apply: x[s],
so_apply: x[s1;s2],
guard: {T},
es-locl: (e <loc e'),
es-causl: (e < e'),
squash: ↓T,
decidable: Dec(P),
or: P ∨ Q,
not: ¬A,
false: False,
interface-order-preserving: interface-order-preserving(es;X;f),
true: True
Latex:
\mforall{}[Info:Type]
\mforall{}es:EO+(Info). \mforall{}X:EClass(Top). \mforall{}f:E(X) {}\mrightarrow{} E(X).
(interface-order-preserving(es;X;f)
{}\mRightarrow{} global-order-preserving(es;X;f) supposing convergent-flow(es;X;f))
Date html generated:
2016_05_16-PM-10_16_17
Last ObjectModification:
2016_01_17-PM-07_35_52
Theory : event-ordering
Home
Index