{ 
t:
. voters,clients:Id List. comp-wf(sc-compiled{i:l}(t;voters;clients)) }
{ Proof }
Definitions occuring in Statement :
sc-compiled: sc-compiled{i:l}(t;voters;clients),
comp-wf: comp-wf(cr),
Id: Id,
nat: ,
all: x:A. B[x],
list: type List
Definitions :
prop: 
,
esharp-rule: E#Rule,
compilation-result: CompilationResult,
compile-esharp-rule: compileE#Rule(env;erl),
esharp-join: x + y,
so_lambda: 
x y.t[x; y],
list_accum: list_accum(x,a.f[x; a];y;l),
spread: spread def,
comp-wf: comp-wf(cr),
lambda: x.A[x],
compile-esharp-program: compileE#(prg),
sc-compiled: sc-compiled{i:l}(t;voters;clients),
member: t 
T,
nat: ,
function: x:A 
B[x],
all: x:A. B[x],
Id: Id,
list: type List,
subtype_rel: A 
r B,
strong-subtype: strong-subtype(A;B),
set: {x:A| B[x]} ,
implies: P 
Q,
not: 
A,
le: A 
B,
false: False,
int: 
,
sc-program: sc-program(t;voters;clients),
norm-esharp-program: norm-esharp-program(),
apply: f a,
esharp-program: E#Program,
equal: s = t,
RepUR: Error :RepUR,
CollapseTHEN: Error :CollapseTHEN,
id-fun: id-fun(T),
eclass: EClass(A[eo; e]),
fpf: a:A fp-> B[a],
Auto: Error :Auto,
tactic: Error :tactic,
product: x:A 
B[x],
top: Top,
universe: Type,
void: Void,
isect: 
x:A. B[x],
fpf-cap: f(x)?z,
union: left + right,
true: True,
fpf-sub: f g,
es-E-interface: E(X),
deq: EqDecider(T),
ma-state: State(ds),
ge: i 
j ,
pair: <a, b>,
fpf-dom: x dom(f),
guard: {T},
class-program: ClassProgram(T),
spreadn: spread3,
subtype: S T,
natural_number: $n,
less_than: a < b,
rationals: 
,
real: 
,
add: n + m,
tag-by: zT,
or: P 
Q,
rev_implies: P 
Q,
and: P 
Q,
iff: P Q,
ldag: LabeledDAG(T),
labeled-graph: LabeledGraph(T),
record: record(x.T[x]),
isect2: T1 T2,
record+: record+,
fset: FSet{T},
b-union: A 
B,
le_int: i z j,
ifthenelse: if b then t else f fi ,
Knd: Knd,
so_lambda: x.t[x],
intensional-universe: IType,
lt_int: i <z j,
sqequal: s ~ t,
decide_bfalse: decide_bfalse{decide_bfalse_compseq_tag_def:o}(v11.g[v11]; v21.f[v21]),
list_ind: list_ind def,
MaAuto: Error :MaAuto,
bfalse: ff,
bool: 
,
assert: 
b,
bnot: 
b,
limited-type: LimitedType,
btrue: tt,
squash: 
T,
eq_int: (i =
j),
eq_atom: x =a y,
null: null(as),
infix_ap: x f y,
set_blt: a < b,
grp_blt: a < b,
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'),
eq_atom: eq_atom$n(x;y),
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_str: Error :eq_str,
eq_id: a = b,
eq_lnk: a = b,
es-eq-E: e = e',
bimplies: p q,
band: p q,
bor: p q,
sq_type: SQType(T),
SplitOn: Error :SplitOn,
CollapseTHENA: Error :CollapseTHENA,
AllHyps: Error :AllHyps,
Repeat: Error :Repeat,
D: Error :D,
RepeatFor: Error :RepeatFor,
trivial-comp-result: TrivialCompResult,
esharp-env: E#Env
Lemmas :
trivial-comp-result_wf,
bool_cases,
eqtt_to_assert,
assert_of_le_int,
subtype_base_sq,
bool_subtype_base,
iff_transitivity,
eqff_to_assert,
iff_wf,
rev_implies_wf,
squash_wf,
bnot_of_le_int,
assert_of_lt_int,
bool_wf,
lt_int_wf,
assert_wf,
bnot_wf,
intensional-universe_wf,
ifthenelse_wf,
le_int_wf,
false_wf,
true_wf,
subtype_rel_set,
le_wf,
nat_properties,
subtype_rel_sum,
top_wf,
subtype_rel_self,
sc-program_wf,
member_wf,
id-fun_wf,
subtype_rel_wf,
norm-esharp-program_wf,
esharp-program_wf,
sc-compiled_wf,
Id_wf,
nat_wf,
compile-esharp-rule_wf,
esharp-join_wf,
compilation-result_wf,
esharp-rule_wf,
list_accum_wf,
comp-wf_wf
\mforall{}t:\mBbbN{}. \mforall{}voters,clients:Id List. comp-wf(sc-compiled\{i:l\}(t;voters;clients))
Date html generated:
2011_08_17-PM-06_35_25
Last ObjectModification:
2010_09_24-PM-03_26_27
Home
Index