Nuprl Lemma : commander_wf
[ldr:Id]. [num,c:
]. [b:ballot-id()]. [acceptors:Id List].
(commander(ldr;num;acceptors;b;c) 
EClass'(Message 
Id?))
Proof not projected
Definitions occuring in Statement :
commander: commander(ldr;num;acceptors;b;c),
ballot-id: ballot-id(),
Message: Message,
eclass: EClass(A[eo; e]),
Id: Id,
uall: [x:A]. B[x],
unit: Unit,
member: t T,
product: x:A B[x],
union: left + right,
list: type List,
int:
Definitions :
intensional-universe: IType,
record-select: r.x,
dep-isect: Error :dep-isect,
token: "$token",
es-base-E: es-base-E(es),
so_lambda: 
x.t[x],
tag-by: zT,
rev_implies: P 
Q,
iff: P 
Q,
ldag: LabeledDAG(T),
labeled-graph: LabeledGraph(T),
record+: record+,
record: record(x.T[x]),
fset: FSet{T},
dataflow: dataflow(A;B),
isect2: T1 
T2,
b-union: A 
B,
fpf-sub: f 
g,
deq: EqDecider(T),
ma-state: State(ds),
true: True,
squash: 
T,
event_ordering: EO,
label: ...$L... t,
class-program: ClassProgram(T),
fpf-cap: f(x)?z,
bag: bag(T),
es-E: E,
event-ordering+: EO+(Info),
strong-subtype: strong-subtype(A;B),
void: Void,
ge: i 
j ,
le: A 
B,
less_than: a < b,
set: {x:A| B[x]} ,
top: Top,
es-E-interface: E(X),
in-eclass: e 
X,
so_apply: x[s],
or: P 
Q,
eq_knd: a = b,
l_member: (x l),
fpf-dom: x dom(f),
false: False,
limited-type: LimitedType,
prop: 
,
bfalse: ff,
btrue: tt,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
and: P 
Q,
uiff: uiff(P;Q),
eq_bool: p =b q,
le_int: i z j,
eq_int: (i =
j),
eq_atom: x =a y,
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'),
not: 
A,
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_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,
assert: 
b,
fpf: a:A fp-> B[a],
subtype: S T,
uimplies: b supposing a,
subtype_rel: A r B,
guard: {T},
implies: P Q,
sq_type: SQType(T),
eq_id: a = b,
bnot: b,
it: 
,
msgPreempted: msgPreempted(b),
length: ||as||,
natural_number: $n,
multiply: n * m,
lt_int: i <z j,
eq_ballot: eq_ballot(b1;b2),
lambda: x.A[x],
name: Name,
mData: mData,
inr: inr x ,
inl: inl x ,
ifthenelse: if b then t else f fi ,
filter: filter(P;l),
pair: <a, b>,
apply: f a,
let: let,
spread: spread def,
so_lambda: x y.t[x; y],
class2b: class2b(c),
smr-class: smr-class(init;s,x.F[s; x];X),
once-class: once-class(X),
universe: Type,
bool: 
,
function: x:A 
B[x],
all: x:A. B[x],
atom: Atom$n,
axiom: Ax,
commander: commander(ldr;num;acceptors;b;c),
unit: Unit,
product: x:A B[x],
union: left + right,
Message: Message,
eclass: EClass(A[eo; e]),
int: ,
ballot-id: ballot-id(),
uall: [x:A]. B[x],
Id: Id,
list: type List,
isect: x:A. B[x],
member: t T,
equal: s = t
Lemmas :
member_wf,
Id_wf,
unit_wf,
Message_wf,
filter_wf,
ballot-id_wf,
smr-class_wf,
class2b_wf,
once-class_wf,
name_wf,
mData_wf,
eclass_wf,
bool_wf,
eqtt_to_assert,
assert_wf,
not_wf,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
bnot_wf,
eq_ballot_wf,
bfalse_wf,
ifthenelse_wf,
subtype_rel_wf,
eq_id_wf,
lt_int_wf,
length_wf1,
msgPreempted_wf,
assert_of_lt_int,
le_wf,
assert_functionality_wrt_uiff,
bnot_of_lt_int,
assert_of_le_int,
le_int_wf,
length_wf_nat,
it_wf,
es-interface-top,
eclass_wf3,
eclass_wf2,
es-E_wf,
event-ordering+_wf,
true_wf,
squash_wf,
event-ordering+_inc,
bag_wf,
subtype_rel_dep_function,
es-base-E_wf,
event_ordering_wf,
subtype_rel_record+,
subtype_rel_self,
intensional-universe_wf,
subtype_rel_function
\mforall{}[ldr:Id]. \mforall{}[num,c:\mBbbZ{}]. \mforall{}[b:ballot-id()]. \mforall{}[acceptors:Id List].
(commander(ldr;num;acceptors;b;c) \mmember{} EClass'(Message \mtimes{} Id?))
Date html generated:
2011_10_20-PM-04_24_37
Last ObjectModification:
2011_06_18-PM-01_50_03
Home
Index