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)
Lemmas :
is-interface-buffer,
assert_wf,
in-eclass_wf,
es-interface-buffer_wf,
es-interface-subtype_rel2,
es-E_wf,
event-ordering+_subtype,
event-ordering+_wf,
top_wf,
subtype_top,
list_wf,
eclass_wf,
nat_wf,
bool_wf,
eqtt_to_assert,
bag_only_single_lemma,
lastn_wf,
eclass-vals_wf,
es-interface-predecessors_wf,
subtype_rel_list,
es-E-interface_wf,
Id_wf,
es-loc_wf,
uiff_transitivity,
equal-wf-T-base,
bnot_wf,
not_wf,
eqff_to_assert,
assert_of_bnot
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:
2015_07_21-PM-03_51_30
Last ObjectModification:
2015_01_27-PM-05_59_34
Home
Index