Step
*
of Lemma
cs-inning-committable-some1
∀[V:Type]
((∃v,v':V. (¬(v = v' ∈ V)))
⇒ (∀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 could commit v
⇐⇒ (∃v∈L. in state s, inning i could commit v )
∨ (∃ws∈W. ∀a:{a:Id| (a ∈ A)} . ((a ∈ ws)
⇒ in state s, a has not completed inning i)))))))
BY
{ (InstLemma `cs-inning-committable-some2` [] THEN RepeatFor 9 ((ParallelLast' THENA Auto))) }
1
1. [V] : Type
2. ∃v,v':V. (¬(v = v' ∈ V))@i
3. ∀v,v':V. Dec(v = v' ∈ V)@i
4. A : Id List@i
5. W : {a:Id| (a ∈ A)} List List@i
6. one-intersection(A;W)@i
7. s : ConsensusState@i
8. i : ℤ@i
9. L : V List
10. ∀v:V
(in state s, inning i could commit v
⇐⇒ (in state s, inning i could commit v ∧ (v ∈ L))
∨ (∃ws∈W. ∀a:{a:Id| (a ∈ A)} . ((a ∈ ws)
⇒ in state s, a has not completed inning i)))
⊢ ∃v:V. in state s, inning i could commit v
⇐⇒ (∃v∈L. in state s, inning i could commit v )
∨ (∃ws∈W. ∀a:{a:Id| (a ∈ A)} . ((a ∈ ws)
⇒ in state s, a has not completed inning i))
Latex:
\mforall{}[V:Type]
((\mexists{}v,v':V. (\mneg{}(v = v')))
{}\mRightarrow{} (\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 could commit v
\mLeftarrow{}{}\mRightarrow{} (\mexists{}v\mmember{}L. in state s, inning i could commit v )
\mvee{} (\mexists{}ws\mmember{}W. \mforall{}a:\{a:Id| (a \mmember{} A)\}
((a \mmember{} ws) {}\mRightarrow{} in state s, a has not completed inning i)))))))
By
(InstLemma `cs-inning-committable-some2` [] THEN RepeatFor 9 ((ParallelLast' THENA Auto)))
Home
Index