Nuprl Lemma : cs-inning-committed-some1
∀[V:Type]
((∀v,v':V. Dec(v = v' ∈ V))
⇒ (∀A:Id List. ∀W:{a:Id| (a ∈ A)} List List.
(one-intersection(A;W)
⇒ (∀s:ConsensusState. ∀i:ℤ.
∃L:V List
(∃v:V. in state s, inning i has committed v ⇐⇒ (∃v∈L. in state s, inning i has committed v))))))
Proof
Definitions occuring in Statement :
one-intersection: one-intersection(A;W),
cs-inning-committed: in state s, inning i has committed v,
consensus-state4: ConsensusState,
Id: Id,
l_exists: (∃x∈L. P[x]),
l_member: (x ∈ l),
list: T List,
decidable: Dec(P),
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
iff: P ⇐⇒ Q,
implies: P ⇒ Q,
set: {x:A| B[x]} ,
int: ℤ,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
all: ∀x:A. B[x],
member: t ∈ T,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
top: Top,
fpf-dom: x ∈ dom(f),
deq-member: x ∈b L,
reduce: reduce(f;k;as),
list_ind: list_ind,
pi1: fst(t),
cs-estimate: Estimate(s;a),
pi2: snd(t),
exists: ∃x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
cand: A c∧ B,
cs-inning-committed: in state s, inning i has committed v,
one-intersection: one-intersection(A;W),
sq_stable: SqStable(P),
squash: ↓T,
cs-archived: by state s, a archived v in inning i,
fpf-domain: fpf-domain(f)
Latex:
\mforall{}[V:Type]
((\mforall{}v,v':V. Dec(v = v'))
{}\mRightarrow{} (\mforall{}A:Id List. \mforall{}W:\{a:Id| (a \mmember{} A)\} List List.
(one-intersection(A;W)
{}\mRightarrow{} (\mforall{}s:ConsensusState. \mforall{}i:\mBbbZ{}.
\mexists{}L:V List
(\mexists{}v:V. in state s, inning i has committed v
\mLeftarrow{}{}\mRightarrow{} (\mexists{}v\mmember{}L. in state s, inning i has committed v))))))
Date html generated:
2016_05_16-PM-00_04_38
Last ObjectModification:
2016_01_17-PM-03_54_00
Theory : event-ordering
Home
Index