Nuprl Lemma : new_23_sig_commands_from_votes_wf
∀[Cmd:ValueAllType]. ∀[propose,notify:Atom List]. ∀[f:new_23_sig_headers_type{i:l}(Cmd;notify;propose)].
∀[es:EO+(Message(f))]. ∀[e:E]. ∀[e':{e':E| e ≤loc e' } ]. ∀[n,r:ℤ].
(new_23_sig_commands_from_votes(Cmd;notify;propose;f;es;e;e';n;r) ∈ Cmd List)
Proof
Definitions occuring in Statement :
new_23_sig_commands_from_votes: new_23_sig_commands_from_votes(Cmd;notify;propose;f;es;e;e';n;r),
new_23_sig_headers_type: new_23_sig_headers_type{i:l}(Cmd;notify;propose),
Message: Message(f),
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-E: E,
list: T List,
vatype: ValueAllType,
uall: ∀[x:A]. B[x],
member: t ∈ T,
set: {x:A| B[x]} ,
int: ℤ,
atom: Atom
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
new_23_sig_commands_from_votes: new_23_sig_commands_from_votes(Cmd;notify;propose;f;es;e;e';n;r),
prop: ℙ,
subtype_rel: A ⊆r B,
new_23_sig_headers_type: new_23_sig_headers_type{i:l}(Cmd;notify;propose),
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
vatype: ValueAllType,
implies: P ⇒ Q,
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
decidable: Dec(P),
or: P ∨ Q,
false: False,
not: ¬A,
top: Top,
has-es-info-type: has-es-info-type(es;e;f;T),
pi2: snd(t),
pi1: fst(t)
Latex:
\mforall{}[Cmd:ValueAllType]. \mforall{}[propose,notify:Atom List].
\mforall{}[f:new\_23\_sig\_headers\_type\{i:l\}(Cmd;notify;propose)]. \mforall{}[es:EO+(Message(f))]. \mforall{}[e:E].
\mforall{}[e':\{e':E| e \mleq{}loc e' \} ]. \mforall{}[n,r:\mBbbZ{}].
(new\_23\_sig\_commands\_from\_votes(Cmd;notify;propose;f;es;e;e';n;r) \mmember{} Cmd List)
Date html generated:
2016_05_17-PM-02_32_51
Last ObjectModification:
2015_12_29-PM-08_04_09
Theory : 2!3!consensus!with!signatures
Home
Index