Nuprl - Proof: sends-rule 2 1 2 1 1 1 3 1

(148steps total) PrintForm Definitions Lemmas mb event system 6 Sections EventSystems Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: sends-rule 2 1 2 1 1 1 3 1

1. i : Id
2. k : Knd
3. l : IdLnk
4. ds : x:Id fp-> Type
5. da : a:Knd fp-> Type
6. (tg:Id

State(ds)

ma-valtype(da; k)

(da(rcv(l; tg))?Void List)) List
7. source(l) = i
8. w : World
9. p : FairFifo
10. FairFifo
11.

a:Action(i).

isnull(a)

(valtype(i;a)

r da(kind(a))?Top)
12. e : E
13. loc(e) = i
14. valtype(i;act(e))

r ma-valtype(da; kind(act(e)))

valtype(e) = valtype(i;act(e))

Type{i}

By:	Assert (isnull(act(e)))

Generated subgoals:

1 4. ds : x:Id fp-> Type
5. da : a:Knd fp-> Type
6. (tg:IdState(ds)ma-valtype(da; k)(da(rcv(l; tg))?Void List)) List
7. source(l) = i
8. w : World
9. FairFifo
10. FairFifo
11. a:Action(i). isnull(a)  (valtype(i;a) r da(kind(a))?Top)
12. e : E
13. loc(e) = i  Id
14. valtype(i;act(e)) r ma-valtype(da; kind(act(e)))
  isnull(act(e))
1 step

2 15. isnull(act(e))
  valtype(e) = valtype(i;act(e))  Type{i}
3 steps

About:

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(148steps total) PrintForm Definitions Lemmas mb event system 6 Sections EventSystems Doc