---

Step * 1 1 5 of Lemma cs-ref-map3-decided


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. ¬(filter(λx.cs-is-committed(x);L) = [] ∈ (consensus-state3(V) List))
6. False supposing ∀[i:ℕ||L||]. (¬↑cs-is-committed(L[i]))@i
7. (COMMITED[v] ∈ L)@i
⊢ Decided[cs-committed-val(hd(filter(λx.cs-is-committed(x);L)))] = Decided[v] ∈ consensus-state2(V)
BY
{ (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. ¬(filter(λx.cs-is-committed(x);L) = [] ∈ (consensus-state3(V) List))
6. False supposing ∀[i:ℕ||L||]. (¬↑cs-is-committed(L[i]))@i
7. (COMMITED[v] ∈ L)@i
⊢ cs-committed-val(hd(filter(λx.cs-is-committed(x);L))) = v ∈ V

---

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.  \mneg{}(filter(\mlambda{}x.cs-is-committed(x);L)  =  [])
6.  False  supposing  \mforall{}[i:\mBbbN{}||L||].  (\mneg{}\muparrow{}cs-is-committed(L[i]))@i
7.  (COMMITED[v]  \mmember{}  L)@i
\mvdash{}  Decided[cs-committed-val(hd(filter(\mlambda{}x.cs-is-committed(x);L)))]  =  Decided[v]


By

(EqCD  THEN  Auto)

---

Home Index