---

Step * of Lemma decidable__equal_cs-withdrawn

∀[V:Type]. ∀x:consensus-state3(V). Dec(x = WITHDRAWN ∈ consensus-state3(V))
BY
{ (Auto THEN Unfolds ``cs-withdrawn consensus-state3`` 0 THEN D -1) }

1
1. [V] : Type
2. x1 : V@i
⊢ Dec((inl x1) = (inr inr tt  ) ∈ (V + V + 𝔹))

2
1. [V] : Type
2. y : V + 𝔹@i
⊢ Dec((inr y ) = (inr inr tt  ) ∈ (V + V + 𝔹))

---

Latex:


\mforall{}[V:Type].  \mforall{}x:consensus-state3(V).  Dec(x  =  WITHDRAWN)


By

(Auto  THEN  Unfolds  ``cs-withdrawn  consensus-state3``  0  THEN  D  -1)

---

Home Index