{ 
[V:Type]. [A:Id List]. [L:consensus-rcv(V;A) List]. [i,n:
].
(votes-from-inning(i;L) ~ []) supposing
((n < i) and
(filter(
r.n <z inning(r);L) = [])) }
{ Proof }
Definitions occuring in Statement :
votes-from-inning: votes-from-inning(i;L),
rcvd-inning-gt: i <z inning(r),
consensus-rcv: consensus-rcv(V;A),
Id: Id,
uimplies: b supposing a,
uall: [x:A]. B[x],
less_than: a < b,
lambda: x.A[x],
nil: [],
list: type List,
int: ,
universe: Type,
sqequal: s ~ t,
equal: s = t,
filter: filter(P;l)
Definitions :
votes-from-inning: votes-from-inning(i;L),
mapfilter: mapfilter(f;P;L),
map: map(f;as),
l_all: (x
L.P[x]),
not: 
A,
so_apply: x[s],
member: t T,
all: x:A. B[x],
implies: P 
Q,
false: False,
prop: 
,
ycomb: Y,
and: P 
Q,
rcvd-inning-gt: i <z inning(r),
assert: 
b,
rcvd-inning-eq: inning(r) =
i,
band: p 
q,
rcv-vote?: rcv-vote?(x),
spreadn: spread3,
rcvd-vote: rcvd-vote(x),
bfalse: ff,
btrue: tt,
outr: outr(x),
ifthenelse: if b then t else f fi ,
top: Top,
subtype: S 
T,
uall: [x:A]. B[x],
uimplies: b supposing a,
iff: P 
Q,
rev_implies: P Q,
consensus-rcv: consensus-rcv(V;A),
nat: 
,
guard: {T}
Lemmas :
filter_is_nil,
rcvd-inning-eq_wf,
assert_wf,
l_member_wf,
consensus-rcv_wf,
filter_wf,
rcvd-inning-gt_wf,
Id_wf,
member_filter,
false_wf,
eq_int_wf,
lt_int_wf,
implies_functionality_wrt_iff,
iff_weakening_uiff,
assert_of_eq_int,
assert_of_lt_int,
length_wf_nat,
filter_wf_top,
nat_wf,
top_wf,
member_wf,
nil_member
\mforall{}[V:Type]. \mforall{}[A:Id List]. \mforall{}[L:consensus-rcv(V;A) List]. \mforall{}[i,n:\mBbbZ{}].
(votes-from-inning(i;L) \msim{} []) supposing ((n < i) and (filter(\mlambda{}r.n <z inning(r);L) = []))
Date html generated:
2011_08_16-AM-10_11_28
Last ObjectModification:
2011_06_18-AM-09_04_12
Home
Index