(70steps) PrintForm Definitions Lemmas mb hybrid Sections GenAutomata Doc

At: P causal switchable0 5 1 1 2 1
1. E: EventStruct
2. x: |E| List
3. y: |E| List
4. i:||x||. j:||x||. ji & is-send(E)(x[j]) & (x[j] =msg=(E) x[i])
5. i1: (||x||-1)
6. loc(E)(x[i1]) = loc(E)(x[(i1+1)])
7. is-send(E)(x[i1]) & is-send(E)(x[(i1+1)]) is-send(E)(x[i1]) & is-send(E)(x[(i1+1)])
8. y = swap(x;i1;i1+1)
9. i: ||y||
10. ||swap(x;i1;i1+1)|| = ||x||
11. ||y|| = ||x||
12. ||swap(y;i1;i1+1)|| = ||y||
13. (i1, i1+1) ||x||||x||
14. is-send(E)(y[i])
15. j: ||x||
16. j(i1, i1+1)(i)
17. is-send(E)(x[j])
18. x[j] =msg=(E) x[((i1, i1+1)(i))]

(i1, i1+1)(j)i
By:
SplitOrHyps
THEN
ExRepD
Generated subgoals:

17. is-send(E)(x[i1])
8. is-send(E)(x[(i1+1)])
9. y = swap(x;i1;i1+1)
10. i: ||y||
11. ||swap(x;i1;i1+1)|| = ||x||
12. ||y|| = ||x||
13. ||swap(y;i1;i1+1)|| = ||y||
14. (i1, i1+1) ||x||||x||
15. is-send(E)(y[i])
16. j: ||x||
17. j(i1, i1+1)(i)
18. is-send(E)(x[j])
19. x[j] =msg=(E) x[((i1, i1+1)(i))]
(i1, i1+1)(j)i
27. is-send(E)(x[i1])
8. is-send(E)(x[(i1+1)])
9. y = swap(x;i1;i1+1)
10. i: ||y||
11. ||swap(x;i1;i1+1)|| = ||x||
12. ||y|| = ||x||
13. ||swap(y;i1;i1+1)|| = ||y||
14. (i1, i1+1) ||x||||x||
15. is-send(E)(y[i])
16. j: ||x||
17. j(i1, i1+1)(i)
18. is-send(E)(x[j])
19. x[j] =msg=(E) x[((i1, i1+1)(i))]
(i1, i1+1)(j)i

About:
listassertintnatural_numberaddsubtractapplyfunction
equalmemberandorallexists

(70steps) PrintForm Definitions Lemmas mb hybrid Sections GenAutomata Doc