Nuprl Lemma : interface-buffer-val
∀[Info,A:Type]. ∀[es:EO+(Info)]. ∀[n:ℕ]. ∀[X:EClass(A)]. ∀[e:E].
Buffer(n;X)(e) = lastn(n;X(≤(X)(e))) ∈ (A List) supposing ↑e ∈b Buffer(n;X)
Proof
Definitions occuring in Statement :
es-interface-buffer: Buffer(n;X),
es-interface-predecessors: ≤(X)(e),
eclass-vals: X(L),
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
list: T List,
nat: ℕ,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T,
lastn: lastn(n;L)
Definitions unfolded in proof :
top: Top,
all: ∀x:A. B[x],
so_apply: x[s1;s2],
so_lambda: λ2x y.t[x; y],
subtype_rel: A ⊆r B,
prop: ℙ,
and: P ∧ Q,
uiff: uiff(P;Q),
uimplies: b supposing a,
member: t ∈ T,
uall: ∀[x:A]. B[x],
false: False,
not: ¬A,
bfalse: ff,
nat: ℕ,
es-E-interface: E(X),
ifthenelse: if b then t else f fi ,
btrue: tt,
it: ⋅,
unit: Unit,
bool: 𝔹,
implies: P ⇒ Q,
eclass-val: X(e),
es-interface-buffer: Buffer(n;X)
Latex:
\mforall{}[Info,A:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[n:\mBbbN{}]. \mforall{}[X:EClass(A)]. \mforall{}[e:E].
Buffer(n;X)(e) = lastn(n;X(\mleq{}(X)(e))) supposing \muparrow{}e \mmember{}\msubb{} Buffer(n;X)
Date html generated:
2016_05_17-AM-07_22_34
Last ObjectModification:
2015_12_28-PM-11_53_57
Theory : event-ordering
Home
Index