Nuprl Lemma : ler_Leader_ilf
[client:Id]. [nodes:bag(Id)]. [uid:Id 
]. [es:EO']. [e:E]. [i:Id]. [k:]. [i1:Id].
(<i, make-Msg([leader]; 
Id;<k, i1>)> 
ler_leader_ring_main(client;nodes;uid)(e)
loc(e) 
nodes
(i = client)
(i1 = loc(e))
(
a1:Id. <k, a1> Prior(ler_Nbr())(e))
<k, uid loc(e)> Base([propose]; )(e))
Proof not projected
Definitions occuring in Statement :
ler_leader_ring_main: ler_leader_ring_main(client;nodes;uid),
ler_Nbr: ler_Nbr(),
make-Msg: make-Msg(hdr;typ;val),
base-headers-msg-val: Base(hdr;typ),
Message: Message,
primed-class: Prior(X),
classrel: v X(e),
event-ordering+: EO+(Info),
es-loc: loc(e),
es-E: E,
Id: Id,
uall: [x:A]. B[x],
exists: x:A. B[x],
iff: P Q,
squash: T,
and: P Q,
apply: f a,
function: x:A B[x],
pair: <a, b>,
product: x:A B[x],
cons: [car / cdr],
nil: [],
int: ,
token: "$token",
equal: s = t,
bag-member: x bs,
bag: bag(T)
Definitions :
subtype: S 
T,
top: Top,
bfalse: ff,
eq_atom: x =a y,
atom-deq: AtomDeq,
band: p 
q,
list-deq: list-deq(eq),
name-deq: NameDeq,
uiff: uiff(P;Q),
name_eq: name_eq(x;y),
assert: 
b,
ifthenelse: if b then t else f fi ,
guard: {T},
false: False,
or: P 
Q,
sq_or: a b,
name: Name,
cand: A c B,
so_lambda: 
x.t[x],
all: x:A. B[x],
prop: 
,
true: True,
rev_implies: P Q,
implies: P Q,
member: t T,
exists: x:A. B[x],
squash: T,
bag-member: x bs,
and: P Q,
classrel: v X(e),
iff: P Q,
uall: [x:A]. B[x],
sq_type: SQType(T),
pi2: snd(t),
pi1: fst(t),
uimplies: b supposing a,
so_apply: x[s]
Lemmas :
imax_wf,
not_wf,
int_subtype_base,
subtype_base_sq,
pi2_wf,
pi1_wf_top,
or_wf,
and_wf,
assert-name_eq,
msg-body_wf,
msg-type_wf,
msg-header_wf,
false_wf,
true_wf,
equal_wf,
make-Msg-equal,
ler-ilf,
bag_wf,
event-ordering+_wf,
es-E_wf,
base-headers-msg-val_wf,
ler_Nbr_wf,
primed-class_wf,
exists_wf,
squash_wf,
event-ordering+_inc,
es-loc_wf,
bag-member_wf,
valueall-type_wf,
Id-valueall-type,
int-valueall-type,
product-valueall-type,
make-Msg_wf,
ler_leader_ring_main_wf,
Id_wf,
Message_wf,
classrel_wf
\mforall{}[client:Id]. \mforall{}[nodes:bag(Id)]. \mforall{}[uid:Id {}\mrightarrow{} \mBbbZ{}]. \mforall{}[es:EO']. \mforall{}[e:E]. \mforall{}[i:Id]. \mforall{}[k:\mBbbZ{}]. \mforall{}[i1:Id].
(<i, make-Msg([leader];\mBbbZ{} \mtimes{} Id;<k, i1>)> \mmember{} ler\_leader\_ring\_main(client;nodes;uid)(e)
\mLeftarrow{}{}\mRightarrow{} loc(e) \mdownarrow{}\mmember{} nodes
\mwedge{} (i = client)
\mwedge{} (i1 = loc(e))
\mwedge{} (\mdownarrow{}\mexists{}a1:Id. <k, a1> \mmember{} Prior(ler\_Nbr())(e))
\mwedge{} <k, uid loc(e)> \mmember{} Base([propose];\mBbbZ{} \mtimes{} \mBbbZ{})(e))
Date html generated:
2012_02_20-PM-06_03_17
Last ObjectModification:
2012_02_02-PM-02_38_49
Home
Index