Nuprl Theory a_sci_inv13o

(only non hidden objects are presented)

THMrank_succ_two_invalid_ann(s:(state:: ):: [] ((p:(PId:: ):: [] ((q:(PId:: ):: [] ((r:(PId:: ):: [] ((((((((((status-(q:: []PId?):: id):: []id) (s:: []state):: ):: []) = ((Delright:: ):: [])):: ):: [] ((((((status-(q:: []PId?):: id):: []id) (s:: []state):: ):: []) = ((Delleft:: ):: [])):: ):: []):: ) :: [] (((hasrank(s:: []state;r:: []):: ):: [] ((((((rank(s:: []state;p:: []):: ):: []) = ((((rank(s:: []state;q:: []):: ):: []) + (1:: []):: ):: [])):: ):: [] ((((((rank(s:: []state;q:: []):: ):: []) = ((((rank(s:: []state;r:: []):: ) :: []) + (1:: []):: ):: [])):: ) :: [] ((((rank(((((("cs":: []Atomq:: []PId? :: id) :: []id):=((((invalid{} :: ):: []) :: zexp) :: []zexp):: com):: []com) (s:: []state):: state) :: []state;p:: []):: ):: []) = ((((rank(((((("cs":: []Atomq :: []PId?:: id) :: []id):=((((invalid{} :: ) :: []) :: zexp) :: []zexp):: com) :: []com) (s:: []state):: state) :: []state;r:: []):: ):: []) + (1:: []):: ):: [])):: ) :: [(rank(s;q) = rank(s;r) + 1)]) :: ):: [(rank(s;p) = rank(s;q) + 1)]) :: ):: [hasrank(s;r)]):: ) :: [(status-q_ = Delright status-q_ = Delleft)]):: ) :: [(r PId)]):: ):: [(q PId)]):: ) :: [(p PId)]):: ):: [(s state)])::
THMrank_succ_two_off_ann(s:(state:: ):: [] ((p:(PId:: ):: [] ((q:(PId:: ):: [] ((r:(PId:: ):: [] (((hasrank(s:: []state;r:: []):: ):: [] ((((((rank(s:: []state;p:: []):: ):: []) = ((((rank(s:: []state;q:: []):: ):: []) + (1:: []):: ):: [])):: ):: [] ((((((rank(s:: []state;q:: []):: ):: []) = ((((rank(s:: []state;r:: []):: ):: []) + (1:: []):: ):: [])):: ):: [] ((((rank(((((("status":: []Atomq:: []PId? :: id):: []id):=((((Off:: ) :: []) :: zexp) :: []zexp):: com):: []com) (s:: []state):: state) :: []state;p:: []):: ):: []) = ((((rank(((((("status":: []Atomq :: []PId?:: id) :: []id):=((((Off:: ) :: []):: zexp) :: []zexp):: com):: []com) (s:: []state):: state) :: []state;r:: []):: ):: []) + (1:: []):: ):: [])):: ) :: [(rank(s;q) = rank(s;r) + 1)]):: ) :: [(rank(s;p) = rank(s;q) + 1)]):: ) :: [hasrank(s;r)]):: ):: [(r PId)]):: ) :: [(q PId)]):: ):: [(p PId)]):: ) :: [(s state)])::
THMis_proc_pidn:. p:. isP(p) p = p
THMis_proc_vpidsn:. p:. isP(p) p = p
THMis_proc_vpidn:. p:. isP(p) p = p
THMis_proc_pidsn:. p:. isP(p) p = p
THMis_proc_vprocn:. p:. isP(p) p = p
MLis_proc_pid_mllet IsProcPid p = let t = member_of_wf_goal p in if not is_var_term t then fail else let ty = type_of_wf_goal p in if not member ty [P?; P+m; PId?; P; PId] then fail else find_hyp (\x. is_term `is_proc` x & subterm x 1 = t); (DeannConcl THEN Try (Unfold `member` 0) THENM Using2 [`n`,n] (L `is_proc_pid`) ) p ;; update_EqCD_additions `IsProcPid -- is_proc_pid_ml` IsProcPid ;;
DISPhard_guard_df{<t:term:*>}== {<t>}
ABShard_guard{T} == T
THMhard_guard_wfT:. {T}
THMhard_guard_wf_ann(T:(:: '):: []' (((({T:: []}:: ):: []) ((:: '):: []')):: '):: [(T )]') :: '
THMhard_guard_unfoldT:. {T} = T
THMhard_guard_unfold_2T:. {T} = T
THMhard_guard_foldT:. T = {T}
THMhard_guard_fold_ann(T:(:: {1'}):: []' (((T:: []) = (({T:: []}:: ):: [])):: '):: [(T )]'):: '
THMhard_guard_unfold_2_ann(T:(:: {1'}):: []' (((({T:: []}:: ):: []) = (T:: [])):: '):: [(T )]'):: '
THMhard_guard_unfold_ann(T:(:: '):: []' (((({T:: []}:: ):: []) = (T:: [])):: '):: [(T )]'):: '
ABSinv13o_charinv13o_char{}(n; s; p; q; r) == purgeR(q::r::[]) buf[p]_ visiting(s;q) ((r = nil rank(s;p) = 0) (isP(r) (isP(r) hasrank(s;p) hasrank(s;r) rank(s;p) = rank(s;r) + 1 (isP(r) visiting(s;r)))))
THMinv13o_char_wfn:. s:state. p:. q:PId. r:. inv13o_char{}(n; s; p; q; r)
THMinv13o_char_wf_ann(n:(:: ):: []{2} ((s:(state:: ):: []{2} ((p::: []{2} ((q:(PId:: ):: []{2} ((r::: []{2} ((((inv13o_char{}((n:: []); (s:: []state); (p:: []); (q:: []PId); (r:: [])):: ):: []) ((:: {1'}):: []{2})):: {2}) :: [(r )]{2}):: {2}):: [(q PId)]{2}) :: {2}):: [(p )]{2}):: {2}):: [(s state)]{2}) :: {2}):: [(n )]{2}):: {2}
THMinv13o_char_unfoldn:. s:state. p:. q:PId. r:. inv13o_char{}(n; s; p; q; r) = (purgeR(q::r::[]) buf[p]_ visiting(s;q) ((r = nil rank(s;p) = 0) (isP(r) (isP(r) hasrank(s;p) hasrank(s;r) rank(s;p) = rank(s;r) + 1 (isP(r) visiting(s;r))))))
THMinv13o_char_unfold_ann(n:(:: ):: []{2} ((s:(state:: ):: []{2} ((p::: []{2} ((q:(PId:: ):: []{2} ((r::: []{2} ((((inv13o_char{}((n:: []); (s:: []state); (p:: []); (q:: []PId); (r:: [])):: ):: []) = ((((((((purgeR:: ):: []((((q:: []) ::((((r:: []) ::(([]:: List) :: [] List)) :: List) :: [] List)) :: List):: [] List) :: mesg):: []mesg) ((buf[(p:: [])] (s:: []state) :: mesg List) :: []mesg List)):: ) :: [] (((((visiting(s:: []state;q:: []PId):: ) :: []):: ):: [] (((((((r:: []) = ((nil:: PId?):: [])) :: ):: [] ((((rank(s:: []state;p:: []):: ) :: []) = (0:: [])):: ):: []):: ) :: [] (((isP((n:: []),(r:: [])):: ) :: [] (((isP((n:: []),(r:: [])):: ) :: [] (((hasrank(s:: []state;p :: []):: ):: [] (((hasrank(s:: []state;r :: []):: ):: [] ((((((rank(s:: []state;p :: []):: ) :: []) = ((((rank(s :: []state;r :: []):: ) :: []) + (1:: []):: ) :: [])):: ) :: [] (((isP((n:: []),(r :: [])):: ) :: [] (visiting(s :: []state;r :: []PId):: ) :: [isP(r)]) :: ):: []):: ) :: []):: ):: []) :: ):: [isP(r)]):: ) :: []):: ):: []):: ) :: []):: ):: [(purgeR(q::r::[]) buf[p]_)]):: ) :: [])):: {2}):: [(r )]{2}):: {2}) :: [(q PId)]{2}):: {2}):: [(p )]{2}):: {2}) :: [(s state)]{2}):: {2}):: [(n )]{2}):: {2}
THMinv13o_char_equivn:. s:state. p:. q:PId. r:. inv13o_char{}(n; s; p; q; r) inv13o{}(n; s; p; q; r)
THMinv13o_char_equiv_ann(n:(:: ):: [] ((s:(state:: ):: [] ((p::: [] ((q:(PId:: ):: [] ((r::: [] (((inv13o_char{}((n:: []); (s:: []state); (p:: []); (q:: []PId); (r:: [])):: ):: [] (inv13o{}((n:: []); (s:: []state); (p:: []); (q:: []PId); (r:: [])):: ) :: [inv13o_char{}(n; s; p; q; r)]):: ) :: [(r )]):: ):: [(q PId)]):: ) :: [(p )]):: ):: [(s state)]):: ) :: [(n )])::
MLGetPartolet GetParto p = let i = find_hyp (\t. is_term `list_el` t & let t' = subterm t 2 in is_term `mk_mesg` t' & is_term `purger` (subte rm t' 1)) p in OnInv13Part `o` (\j. Simple (FHyp j [i])) p ;;
THMlemma13o_m1n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (pp,q:P. r:. inv13o{}(n; (action_m1{}s); pp; q; r))
THMlemma13o_m2n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (pp,q:P. r:. inv13o{}(n; (action_m2{}s); pp; q; r))
MLis_proc_pid_ml_fixedlet NewIsProcPid p = let t = member_of_wf_goal p in if not is_var_term t then fail else let ty = type_of_wf_goal p in if not member ty [P?; P+m; PId?; P; PId] then fail else find_hyp (\x. is_term `is_proc` x & subterm x 2 = t) p ; (DeannConcl THEN Try (Unfold `member` 0) THENM Using2 [`n`,n] (L (`is_proc_` ^ opid_of_term ty)) THEN IfOnConcl (is_term `is_proc`) Hypothesis Id ) p ;; update_EqCD_additions `IsProcPid -- is_proc_pid_ml` NewIsProcPid ;;
THMlemma13o_m3n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (pp,q:P. r:. inv13o{}(n; (action_m3{}s); pp; q; r))
THMlemma13o_m4n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (pp,q:P. r:. inv13o{}(n; (action_m4{}s); pp; q; r))
THMlemma13o_p1n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p1{}(p)s); pp; q; r))
THMlemma13o_p2n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p2{}(p)s); pp; q; r))
THMlemma13o_p3n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p3{}(p)s); pp; q; r))
THMlemma13o_p4n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p4{}(p)s); pp; q; r))
THMlemma13o_p5n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p5{}(p)s); pp; q; r))
THMlemma13o_p6_AXIOMn:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,q:P. arg:. entering(s;p) (purgeR(p::arg::[]) buf[q]_))
THMlemma13o_p6_lemman:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,q:P. arg:. entering(s;p) (purgeR(p::arg::[]) buf[q]_))
THMlemma13o_p6n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p6{}(p)s); pp; q; r))
THMlemma13o_p7n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p7{}(p)s); pp; q; r))
THMlemma13o_p8n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p8{}(p)s); pp; q; r))
THMlemma13o_p9n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p9{}(p)s); pp; q; r))
THMinlist_implies_not_invalidn:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p:P. status*p_ = Inlist (cs*p_ = invalid{}))
THMlemma13o_p10n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p10{}(p)s); pp; q; r))
THMlemma13o_p11n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p11{}(p)s); pp; q; r))
THMlemma13o_p12n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p12{}(p)s); pp; q; r))
THMlemma13o_p13n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p13{}(p)s); pp; q; r))
THMlemma13o_p14n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p14{}(p)s); pp; q; r))
THMlemma13o_p15n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p15{}(p)s); pp; q; r))
THMlemma3o_p16_lemma1n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. qval:P. next_mesg(p;s.h) = purgeQ(pp::[]) status*p_ = Inlist r = succ*p_ (p = pp) (p = r) r = nil (r = nil rank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));pp) = 0) (isP(r) (isP(r) hasrank(s;pp) hasrank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));r) rank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));pp) = rank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));r) + 1 (isP(r) idle(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));r) entering(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[])) ::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));r) leaving(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[])) ::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)] (q*:=pps))))));r)))))
THMlemma13o_p16_lemma2_lemman:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. qval:P. next_mesg(p;s.h) = purgeQ(pp::[]) status*p_ = Inlist purgeR(q::p::[]) buf[pp]_ (idle(s;q) entering(s;q) leaving(s;q)) isP(p) hasrank(s;pp) hasrank(s;p) rank(s;pp) = rank(s;p) + 1 (isP(p) idle(s;p) entering(s;p) leaving(s;p)) (pp = p) isP(p) False)
THMlemma13o_p16_lemma2n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. qval:P. next_mesg(p;s.h) = purgeQ(pp::[]) status*p_ = Inlist purgeR(q::r::[]) buf[pp]_ {(idle(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));q) entering(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));q) leaving(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));q)) ((r = nil rank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));pp) = 0) (isP(r) (isP(r) hasrank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));pp) hasrank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));r) rank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));pp) = rank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));r) + 1 (isP(r) idle(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[])) ::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));r) entering(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[])) ::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));r) leaving(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[])) ::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)] (q*:=pps))))));r)))))})
THMlemma13o_p16_lemma3n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. qval:P. next_mesg(p;s.h) = purgeQ(qval::[]) status*p_ = Inlist purgeR(q::r::[]) buf[pp]_ (qval = pp) {(idle(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals))))));q) entering(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals))))));q) leaving(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals))))));q)) ((r = nil rank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals))))));pp) = 0) (isP(r) (isP(r) hasrank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals))))));pp) hasrank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals))))));r) rank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals))))));pp) = rank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals))))));r) + 1 (isP(r) idle(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;qval;purgeR(p::succ*p_::[])) ::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals))))));r) entering(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;qval;purgeR(p::succ*p_::[])) ::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)] (q*:=qvals))))));r) leaving(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;qval;purgeR(p::succ*p_::[])) ::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)] (q*:=qvals))))));r)))))})
THMlemma13o_p16_lemma4n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. qval:P. next_mesg(p;s.h) = purgeQ(qval::[]) (status*p_ = Inlist) purgeR(q::r::[]) buf[pp] ([h<-(hsend(p;qval;purgeR(p ::succ*p_::[])) ::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals)))) {(idle(s;q) entering(s;q) leaving(cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals));q)) ((r = nil rank(cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals));pp) = 0) (isP(r) (isP(r) hasrank(cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals));pp) hasrank(cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals));r) rank(cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals));pp) = rank(cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=qvals));r) + 1 (isP(r) idle(s;r) entering(s;r) leaving(cs*p:=invalid{} ([h<-(hreceive(p;h)::h)] (q*:=qvals));r)))))})
THMlemma13o_p16_lemma5n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. qval:P. next_mesg(p;s.h) = purgeQ(pp::[]) status*p_ = Inlist r = succ*p_ (p = pp) (p = r) (r = nil) (r = nil rank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));pp) = 0) (isP(r) (isP(r) hasrank(s;pp) hasrank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));r) rank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));pp) = rank(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));r) + 1 (isP(r) idle(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));r) entering(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[])) ::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)](q*:=pps))))));r) leaving(status*p:=Off (succ*p:=nil (pred*p:=nil ([h<-(hsend(p;pp;purgeR(p::succ*p_::[])) ::h)] (cs*p:=invalid{} ([h<-(hreceive(p;h)::h)] (q*:=pps))))));r)))))
THMlemma13o_p16n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p16{}(p)s); pp; q; r))
THMlemma13o_p17n:. s:state. in_exec{}(sci_program{}(n); s) inv13all_assump(n;s) (p,pp,q:P. r:. inv13o{}(n; (action_p17{}(p)s); pp; q; r))

the other theories