Step
*
5
of Lemma
pv11_p1_ldr_mem_propose
1. Cmd : {T:Type| valueall-type(T)} @i'
2. f : pv11_p1_headers_type{i:l}(Cmd)@i'
3. (f [decision]) = (ℤ × Cmd) ∈ Type
4. (f [propose]) = (ℤ × Cmd) ∈ Type
5. (f ``pv11_p1 adopted``) = (pv11_p1_Ballot_Num() × ((pv11_p1_Ballot_Num() × ℤ × Cmd) List)) ∈ Type
6. (f ``pv11_p1 preempted``) = pv11_p1_Ballot_Num() ∈ Type
7. (f ``pv11_p1 p2b``) = (Id × pv11_p1_Ballot_Num() × ℤ × pv11_p1_Ballot_Num()) ∈ Type
8. (f ``pv11_p1 p2a``) = (Id × pv11_p1_Ballot_Num() × ℤ × Cmd) ∈ Type
9. (f ``pv11_p1 p1b``)
= (Id × pv11_p1_Ballot_Num() × pv11_p1_Ballot_Num() × ((pv11_p1_Ballot_Num() × ℤ × Cmd) List))
∈ Type
10. (f ``pv11_p1 p1a``) = (Id × pv11_p1_Ballot_Num()) ∈ Type
11. f ∈ Name ─→ Type
12. es : EO+(Message(f))@i'
13. e1 : E@i
14. e2 : E@i
15. ldrs_uid : Id ─→ ℤ@i
16. v5 : pv11_p1_Ballot_Num()@i
17. v9 : 𝔹@i
18. v10 : (ℤ × Cmd) List@i
19. v3 : pv11_p1_Ballot_Num()@i
20. v7 : 𝔹@i
21. v8 : (ℤ × Cmd) List@i
22. x6 : pv11_p1_Ballot_Num()@i
23. x7 : (pv11_p1_Ballot_Num() × ℤ × Cmd) List@i
24. (e1 <loc e2)@i
25. inr (inl <x6, x7>) ∈ pv11_p1_propose'base(Cmd;f) (+) pv11_p1_adopted'base(Cmd;f) (+) pv11_p1_preempted'base(Cmd;f)(\000Ce1)@i
26. <v5, v9, v10> ∈
Memory-loc-class(pv11_p1_on_propose(Cmd) + pv11_p1_when_adopted(Cmd;ldrs_uid) + ...;λloc.{pv11_p1_init_leader(Cmd)
loc};... (+) ...)(e1)
27. <v3, v7, v8> ∈
Memory-loc-class(pv11_p1_on_propose(Cmd) + pv11_p1_when_adopted(Cmd;ldrs_uid) + ...;λloc.{pv11_p1_init_leader(Cmd)
loc};... (+) ...)(e2)
28. x4 : ℤ@i
29. x5 : Cmd@i
30. x2 : ℤ@i
31. x3 : Cmd@i
32. s5 : pv11_p1_Ballot_Num()@i
33. s9 : 𝔹@i
34. s10 : (ℤ × Cmd) List@i
35. s3 : pv11_p1_Ballot_Num()@i
36. s7 : 𝔹@i
37. s8 : (ℤ × Cmd) List@i
38. ¬(x2 ∈ map(λx.(fst(x));s8))
39. e : E@i
40. e' : E@i
41. e1 ≤loc e @i
42. (e <loc e')@i
43. (e' <loc e2)@i
44. inl <x4, x5> ∈ pv11_p1_propose'base(Cmd;f) (+) pv11_p1_adopted'base(Cmd;f) (+) pv11_p1_preempted'base(Cmd;f)(e)@i
45. <s5, s9, s10> ∈
Memory-loc-class(pv11_p1_on_propose(Cmd) + pv11_p1_when_adopted(Cmd;ldrs_uid) + ...;λloc.{pv11_p1_init_leader(Cmd)
loc};... (+) ...)(e)@i
46. inl <x2, x3> ∈ pv11_p1_propose'base(Cmd;f) (+) pv11_p1_adopted'base(Cmd;f) (+) pv11_p1_preempted'base(Cmd;f)(e')@i
47. <s3, s7, s8> ∈
Memory-loc-class(pv11_p1_on_propose(Cmd) + pv11_p1_when_adopted(Cmd;ldrs_uid) + ...;λloc.{pv11_p1_init_leader(Cmd)
loc};... (+) ...)(e')@i
48. ¬(x4 ∈ map(λx.(fst(x));s10))
49. y1 : ℤ
50. y2 : Cmd
51. (<y1, y2> ∈ s8)
52. x4 = y1 ∈ ℤ
⊢ ∃y@0:ℤ × Cmd. ((y@0 ∈ pv11_p1_add_if_new() pv11_p1_same_proposal(Cmd) <x2, x3> s8) ∧ (x4 = (fst(y@0)) ∈ ℤ))
BY
{ (InstConcl [⌈<y1, y2>⌉]⋅ THEN AllReduce THEN Auto THEN Repeat ((GenListD 0 THEN Auto))) }
Latex:
Latex:
1. Cmd : \{T:Type| valueall-type(T)\} @i'
2. f : pv11\_p1\_headers\_type\{i:l\}(Cmd)@i'
3. (f [decision]) = (\mBbbZ{} \mtimes{} Cmd)
4. (f [propose]) = (\mBbbZ{} \mtimes{} Cmd)
5. (f ``pv11\_p1 adopted``) = (pv11\_p1\_Ballot\_Num() \mtimes{} ((pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} Cmd) List))
6. (f ``pv11\_p1 preempted``) = pv11\_p1\_Ballot\_Num()
7. (f ``pv11\_p1 p2b``) = (Id \mtimes{} pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} pv11\_p1\_Ballot\_Num())
8. (f ``pv11\_p1 p2a``) = (Id \mtimes{} pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} Cmd)
9. (f ``pv11\_p1 p1b``)
= (Id \mtimes{} pv11\_p1\_Ballot\_Num() \mtimes{} pv11\_p1\_Ballot\_Num() \mtimes{} ((pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} Cmd) List))
10. (f ``pv11\_p1 p1a``) = (Id \mtimes{} pv11\_p1\_Ballot\_Num())
11. f \mmember{} Name {}\mrightarrow{} Type
12. es : EO+(Message(f))@i'
13. e1 : E@i
14. e2 : E@i
15. ldrs$_{uid}$ : Id {}\mrightarrow{} \mBbbZ{}@i
16. v5 : pv11\_p1\_Ballot\_Num()@i
17. v9 : \mBbbB{}@i
18. v10 : (\mBbbZ{} \mtimes{} Cmd) List@i
19. v3 : pv11\_p1\_Ballot\_Num()@i
20. v7 : \mBbbB{}@i
21. v8 : (\mBbbZ{} \mtimes{} Cmd) List@i
22. x6 : pv11\_p1\_Ballot\_Num()@i
23. x7 : (pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} Cmd) List@i
24. (e1 <loc e2)@i
25. inr (inl <x6, x7>) \mmember{}
pv11\_p1\_propose'base(Cmd;f) (+) pv11\_p1\_adopted'base(Cmd;f) (+) pv11\_p1\_preempted'base(Cmd;f)(
e1)@i
26. <v5, v9, v10> \mmember{}
Memory-loc-class(pv11\_p1\_on\_propose(Cmd) + pv11\_p1\_when\_adopted(Cmd;ldrs$_{uid}\000C$) + ...;...;...)(e1)
27. <v3, v7, v8> \mmember{}
Memory-loc-class(pv11\_p1\_on\_propose(Cmd) + pv11\_p1\_when\_adopted(Cmd;ldrs$_{uid}\000C$) + ...;...;...)(e2)
28. x4 : \mBbbZ{}@i
29. x5 : Cmd@i
30. x2 : \mBbbZ{}@i
31. x3 : Cmd@i
32. s5 : pv11\_p1\_Ballot\_Num()@i
33. s9 : \mBbbB{}@i
34. s10 : (\mBbbZ{} \mtimes{} Cmd) List@i
35. s3 : pv11\_p1\_Ballot\_Num()@i
36. s7 : \mBbbB{}@i
37. s8 : (\mBbbZ{} \mtimes{} Cmd) List@i
38. \mneg{}(x2 \mmember{} map(\mlambda{}x.(fst(x));s8))
39. e : E@i
40. e' : E@i
41. e1 \mleq{}loc e @i
42. (e <loc e')@i
43. (e' <loc e2)@i
44. inl <x4, x5> \mmember{}
pv11\_p1\_propose'base(Cmd;f) (+) pv11\_p1\_adopted'base(Cmd;f) (+) pv11\_p1\_preempted'base(Cmd;f)(
e)@i
45. <s5, s9, s10> \mmember{}
Memory-loc-class(pv11\_p1\_on\_propose(Cmd) + pv11\_p1\_when\_adopted(Cmd;ldrs$_{uid}\000C$) + ...;...;...)(
e)@i
46. inl <x2, x3> \mmember{}
pv11\_p1\_propose'base(Cmd;f) (+) pv11\_p1\_adopted'base(Cmd;f) (+) pv11\_p1\_preempted'base(Cmd;f)(
e')@i
47. <s3, s7, s8> \mmember{}
Memory-loc-class(pv11\_p1\_on\_propose(Cmd) + pv11\_p1\_when\_adopted(Cmd;ldrs$_{uid}\000C$) + ...;...;...)(
e')@i
48. \mneg{}(x4 \mmember{} map(\mlambda{}x.(fst(x));s10))
49. y1 : \mBbbZ{}
50. y2 : Cmd
51. (<y1, y2> \mmember{} s8)
52. x4 = y1
\mvdash{} \mexists{}y@0:\mBbbZ{} \mtimes{} Cmd. ((y@0 \mmember{} pv11\_p1\_add\_if\_new() pv11\_p1\_same\_proposal(Cmd) <x2, x3> s8) \mwedge{} (x4 = (fst(y@\000C0))))
By
Latex:
(InstConcl [\mkleeneopen{}<y1, y2>\mkleeneclose{}]\mcdot{} THEN AllReduce THEN Auto THEN Repeat ((GenListD 0 THEN Auto)))
Home
Index