Nuprl Lemma : strong-interface-fifo-order-preserving
∀[Info:Type]
∀es:EO+(Info). ∀X:EClass(Top). ∀f:E(X) ⟶ E. (strong-interface-fifo(es;X;f) ⇐⇒ interface-order-preserving(es;X;f))
Proof
Definitions occuring in Statement :
strong-interface-fifo: strong-interface-fifo(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),
es-E: E,
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
member: t ∈ T,
strong-interface-fifo: strong-interface-fifo(es;X;f),
interface-order-preserving: interface-order-preserving(es;X;f),
es-locl: (e <loc e'),
es-causl: (e < e'),
squash: ↓T,
subtype_rel: A ⊆r B,
prop: ℙ,
rev_implies: P ⇐ Q,
es-E-interface: E(X),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
uimplies: b supposing a,
or: P ∨ Q,
es-le: e ≤loc e' ,
guard: {T},
false: False,
not: ¬A,
sq_type: SQType(T),
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True
Latex:
\mforall{}[Info:Type]
\mforall{}es:EO+(Info). \mforall{}X:EClass(Top). \mforall{}f:E(X) {}\mrightarrow{} E.
(strong-interface-fifo(es;X;f) \mLeftarrow{}{}\mRightarrow{} interface-order-preserving(es;X;f))
Date html generated:
2016_05_16-PM-10_15_10
Last ObjectModification:
2016_01_17-PM-07_26_59
Theory : event-ordering
Home
Index