Nuprl Lemma : request-buffer_wf
[Info,A:Type]. [Req:EClass(
A)]. (request-buffer(Req) 
EClass(A List))
Proof not projected
Definitions occuring in Statement :
request-buffer: request-buffer(Req),
eclass: EClass(A[eo; e]),
uall: [x:A]. B[x],
member: t T,
product: x:A B[x],
list: type List,
int: ,
universe: Type
Definitions :
listp: A List
,
combination: Combination(n;T),
bfalse: ff,
btrue: tt,
le_int: i 
z j,
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,
so_apply: x[s],
union: left + right,
or: P Q,
guard: {T},
l_member: (x l),
limited-type: LimitedType,
prop: 
,
real: 
,
rationals: 
,
minus: -n,
false: False,
lelt: i j < k,
so_lambda: 
x.t[x],
cand: A c B,
last: last(L),
hd: hd(l),
null: null(as),
assert: 
b,
implies: P Q,
select: l[i],
subtract: n - m,
int_seg: {i..j
},
append: as @ bs,
set: {x:A| B[x]} ,
void: Void,
nat: 
,
map: map(f;as),
cons: [car / cdr],
pi2: snd(t),
length: ||as||,
add: n + m,
sq_exists: x:{A| B[x]},
split-gap: split-gap(f;L),
insert-by: insert-by(eq;r;x;l),
eq_int: (i =
j),
pi1: fst(t),
lt_int: i <z j,
strong-subtype: strong-subtype(A;B),
le: A B,
ge: i 
j ,
not: A,
less_than: a < b,
and: P Q,
uiff: uiff(P;Q),
fpf: a:A fp-> B[a],
uimplies: b supposing a,
spread: spread def,
let: let,
nil: [],
natural_number: $n,
pair: <a, b>,
smr-class: smr-class(init;s,x.F[s; x];X),
bag: bag(T),
bool: 
,
subtype: S 
T,
subtype_rel: A r B,
eq_atom: eq_atom$n(x;y),
atom: Atom,
apply: f a,
top: Top,
es-base-E: es-base-E(es),
token: "$token",
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
record-select: r.x,
dep-isect: Error :dep-isect,
record+: record+,
event_ordering: EO,
es-E: E,
event-ordering+: EO+(Info),
lambda: x.A[x],
function: x:A 
B[x],
all: x:A. B[x],
so_lambda: x y.t[x; y],
request-buffer: request-buffer(Req),
eclass: EClass(A[eo; e]),
axiom: Ax,
universe: Type,
uall: [x:A]. B[x],
isect: 
x:A. B[x],
member: t T,
equal: s = t,
MaAuto: Error :MaAuto,
int: ,
product: x:A B[x],
list: type List,
CollapseTHEN: Error :CollapseTHEN
Lemmas :
split-gap_wf,
pi1_wf_top,
lt_int_wf,
eq_int_wf,
insert-by_wf,
ifthenelse_wf,
smr-class_wf,
eclass_wf,
member_wf,
event-ordering+_wf,
es-E_wf,
bag_wf,
event-ordering+_inc,
subtype_rel_self,
es-base-E_wf,
not_wf,
ge_wf,
assert_wf,
int_seg_wf,
append_wf,
length_wf1,
select_wf,
pi1_wf,
top_wf,
int_seg_properties,
null_wf3,
hd_wf,
last_wf,
bool_wf,
uiff_transitivity,
eqtt_to_assert,
assert_of_lt_int,
le_wf,
eqff_to_assert,
assert_functionality_wrt_uiff,
bnot_of_lt_int,
assert_of_le_int,
le_int_wf,
bnot_wf,
pi2_wf,
map_wf
\mforall{}[Info,A:Type]. \mforall{}[Req:EClass(\mBbbZ{} \mtimes{} A)]. (request-buffer(Req) \mmember{} EClass(A List))
Date html generated:
2011_10_20-PM-04_10_11
Last ObjectModification:
2011_01_25-AM-00_07_49
Home
Index