---

Step * 1 1 1 2 of Lemma cs-ref-map3-predecided


1. V : Type
2. L : consensus-state3(V) List@i
3. v : V@i
4. ∀[v':V]. v' = v ∈ V supposing (CONSIDERING[v'] ∈ L) ∨ (COMMITED[v'] ∈ L) 
   supposing (CONSIDERING[v] ∈ L) ∨ (COMMITED[v] ∈ L)
5. ∀v:V. ((COMMITED[v] ∈ L) ⇐⇒ cs-ref-map3(L) = Decided[v] ∈ consensus-state2(V))
6. ∀v':V. (¬(COMMITED[v'] ∈ L))@i
7. (CONSIDERING[v] ∈ L)@i
8. filter(λx.cs-is-committed(x);L) = [] ∈ (consensus-state3(V) List)
9. ¬(filter(λx.cs-is-considering(x);L) = [] ∈ (consensus-state3(V) List))
⊢ uiff(False;∀[i:ℕ||L||]. (¬↑cs-is-considering(L[i])))
⇒ uiff(True;∀[i:ℕ||L||]. (¬↑cs-is-committed(L[i])))
⇒ (PREDECIDED[cs-considered-val(hd(filter(λx.cs-is-considering(x);L)))] = PREDECIDED[v] ∈ consensus-state2(V))
BY
{ (RepeatFor 2 (((D 0 THENA Auto) THEN Thin (-1))) THEN EqCD THEN Auto) }

1
.....subterm..... T:t
1:n
1. V : Type
2. L : consensus-state3(V) List@i
3. v : V@i
4. ∀[v':V]. v' = v ∈ V supposing (CONSIDERING[v'] ∈ L) ∨ (COMMITED[v'] ∈ L) 
   supposing (CONSIDERING[v] ∈ L) ∨ (COMMITED[v] ∈ L)
5. ∀v:V. ((COMMITED[v] ∈ L) ⇐⇒ cs-ref-map3(L) = Decided[v] ∈ consensus-state2(V))
6. ∀v':V. (¬(COMMITED[v'] ∈ L))@i
7. (CONSIDERING[v] ∈ L)@i
8. filter(λx.cs-is-committed(x);L) = [] ∈ (consensus-state3(V) List)
9. ¬(filter(λx.cs-is-considering(x);L) = [] ∈ (consensus-state3(V) List))
⊢ cs-considered-val(hd(filter(λx.cs-is-considering(x);L))) = v ∈ V

---

Latex:

---

Latex:

1.  V  :  Type
2.  L  :  consensus-state3(V)  List@i
3.  v  :  V@i
4.  \mforall{}[v':V].  v'  =  v  supposing  (CONSIDERING[v']  \mmember{}  L)  \mvee{}  (COMMITED[v']  \mmember{}  L) 
      supposing  (CONSIDERING[v]  \mmember{}  L)  \mvee{}  (COMMITED[v]  \mmember{}  L)
5.  \mforall{}v:V.  ((COMMITED[v]  \mmember{}  L)  \mLeftarrow{}{}\mRightarrow{}  cs-ref-map3(L)  =  Decided[v])
6.  \mforall{}v':V.  (\mneg{}(COMMITED[v']  \mmember{}  L))@i
7.  (CONSIDERING[v]  \mmember{}  L)@i
8.  filter(\mlambda{}x.cs-is-committed(x);L)  =  []
9.  \mneg{}(filter(\mlambda{}x.cs-is-considering(x);L)  =  [])
\mvdash{}  uiff(False;\mforall{}[i:\mBbbN{}||L||].  (\mneg{}\muparrow{}cs-is-considering(L[i])))
{}\mRightarrow{}  uiff(True;\mforall{}[i:\mBbbN{}||L||].  (\mneg{}\muparrow{}cs-is-committed(L[i])))
{}\mRightarrow{}  (PREDECIDED[cs-considered-val(hd(filter(\mlambda{}x.cs-is-considering(x);L)))]  =  PREDECIDED[v])


By

---

Latex:
(RepeatFor  2  (((D  0  THENA  Auto)  THEN  Thin  (-1)))  THEN  EqCD  THEN  Auto)

---

Home Index