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

At: P no dup composable 1 1 1 2
1. E: EventStruct
2. x: |E| List
3. y: |E| List
4. z: |E| List
5. i,j:||x||. is-send(E)(x[i]) is-send(E)(x[j]) (x[j] =msg=(E) x[i]) loc(E)(x[i]) = loc(E)(x[j]) i = j
6. i,j:||y||. is-send(E)(y[i]) is-send(E)(y[j]) (y[j] =msg=(E) y[i]) loc(E)(y[i]) = loc(E)(y[j]) i = j
7. (xx.(yy.(x =msg=(E) y)))
8. z = (x @ y)
9. i: ||z||
10. j: ||z||
11. is-send(E)(z[i])
12. is-send(E)(z[j])
13. z[j] =msg=(E) z[i]
14. loc(E)(z[i]) = loc(E)(z[j])
15. i < j
16. j < ||x||

i = j
By:
Inst Thm* as,bs:T List. ||as @ bs|| = ||as||+||bs|| [|E|;x;y]
THEN
SubstFor (x @ y) -1
THEN
Assert (z[j] = y[(j-||x||)])
Generated subgoals:

117. ||z|| = ||x||+||y||
z[j] = y[(j-||x||)]
217. ||z|| = ||x||+||y||
18. z[j] = y[(j-||x||)]
i = j

About:
listassertintnatural_numbersubtractless_thanapplyequalimpliesall

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