{ 
[Info,A:Type]. [es:EO+(Info)]. [n:
]. [X:EClass(A)]. [e:E].
Buffer(n;X)(e) = lastn(n;X(
(X)(e))) supposing 
e 
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 X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
assert: b,
nat: ,
uimplies: b supposing a,
uall: [x:A]. B[x],
list: type List,
universe: Type,
equal: s = t,
lastn: lastn(n;L)
Definitions :
bool: 
,
void: Void,
atom: Atom,
es-base-E: es-base-E(es),
token: "$token",
es-E-interface: E(X),
cond-class: [X?Y],
apply: f a,
so_apply: x[s],
union: left + right,
or: P 
Q,
guard: {T},
eq_knd: a = b,
l_member: (x l),
fpf-dom: x dom(f),
so_lambda: 
x.t[x],
lambda: x.A[x],
subtype: S 
T,
quotient: x,y:A//B[x; y],
bag: bag(T),
top: Top,
in-eclass: e X,
pair: <a, b>,
fpf: a:A fp-> B[a],
strong-subtype: strong-subtype(A;B),
record-select: r.x,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
decide: case b of inl(x) => s[x] | inr(y) => t[y],
ifthenelse: if b then t else f fi ,
dep-isect: Error :dep-isect,
record+: record+,
ge: i 
j ,
less_than: a < b,
product: x:A 
B[x],
and: P 
Q,
uiff: uiff(P;Q),
subtype_rel: A r B,
function: x:A 
B[x],
all: x:A. B[x],
implies: P 
Q,
false: False,
not: 
A,
le: A B,
int: 
,
set: {x:A| B[x]} ,
axiom: Ax,
es-interface-predecessors: (X)(e),
eclass-vals: X(L),
lastn: lastn(n;L),
es-interface-buffer: Buffer(n;X),
eclass-val: X(e),
list: type List,
prop: 
,
assert: b,
uimplies: b supposing a,
equal: s = t,
universe: Type,
nat: ,
so_lambda: x y.t[x; y],
eclass: EClass(A[eo; e]),
uall: [x:A]. B[x],
isect: 
x:A. B[x],
member: t T,
es-E: E,
event_ordering: EO,
event-ordering+: EO+(Info),
MaAuto: Error :MaAuto,
CollapseTHENA: Error :CollapseTHENA,
CollapseTHEN: Error :CollapseTHEN,
real: 
,
grp_car: |g|,
es-loc: loc(e),
Id: Id,
bag_only_single: bag_only_single{bag_only_single_compseq_tag_def:o}(x),
limited-type: LimitedType,
bfalse: ff,
btrue: tt,
eq_bool: p =b q,
lt_int: i <z j,
le_int: i z j,
eq_int: (i =
j),
null: null(as),
set_blt: a < b,
grp_blt: a < b,
infix_ap: x f y,
dcdr-to-bool: [d],
bl-all: (xL.P[x])_b,
bl-exists: (
xL.P[x])_b,
b-exists: (i<n.P[i])_b,
eq_type: eq_type(T;T'),
qeq: qeq(r;s),
q_less: q_less(r;s),
q_le: q_le(r;s),
deq-member: deq-member(eq;x;L),
deq-disjoint: deq-disjoint(eq;as;bs),
deq-all-disjoint: deq-all-disjoint(eq;ass;bs),
eq_id: a = b,
eq_lnk: a = b,
es-eq-E: e = e',
es-bless: e <loc e',
es-ble: e loc e',
bimplies: p q,
band: p q,
bor: p q,
bnot: b,
unit: Unit,
RepUR: Error :RepUR
Lemmas :
eqtt_to_assert,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
bnot_wf,
not_wf,
bool_wf,
es-interface-predecessors_wf,
es-E-interface_wf,
Id_wf,
es-loc_wf,
member_wf,
eclass_wf,
es-interface-buffer_wf,
in-eclass_wf,
assert_wf,
lastn_wf,
eclass-vals_wf,
eclass-val_wf,
es-E_wf,
nat_wf,
event-ordering+_wf,
subtype_rel_wf,
es-interface-top,
event-ordering+_inc,
uall_wf,
es-interface-subtype_rel2,
es-base-E_wf,
subtype_rel_self,
top_wf,
is-interface-buffer
\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:
2011_08_16-PM-05_43_10
Last ObjectModification:
2011_06_20-AM-01_31_28
Home
Index