| THM | rank_zero_one_invalid_ann | ( s:(state::  ):: []
(( p:(PId::  ):: []
(( q:(PId::  ):: []
((((((((status-(p:: []PId?):: id):: []id) (s:: []state)
:: ):: [] )
= ((Delleft:: ):: [] ))::  ):: []
 ((((((rank(s:: []state;p:: [] ):: ):: [] )
= (0:: [] ))::  ):: []
 ((((((rank(s:: []state;q:: [] ):: ):: [] )
= (1:: [] ))::  ):: []
 ((((rank(((((("cs":: []Atomp:: []PId?:: id)
:: []id):=((((invalid{}:: ):: [] )
:: zexp):: []zexp)
:: com):: []com)
(s:: []state):: state):: []state;q
:: [] ):: ):: [] )
= (0:: [] ))::  ):: [(rank(s;q) = 1)] )
::  ):: [(rank(s;p) = 0)] )::  )
:: [(status-p_ = Delleft)] )::  ):: [(q PId)] )
::  ):: [(p PId)] )::  ):: [(s state)] )::   |
| ML | undo_hol_type_inf_hack_again | add_get_type_top_level_hook `hol_type_inf_hack` (\T. T) ;; |
| ML | is_proc_Auto_addition | update_Auto_additions
`is_proc -- is_proc_Auto_addition`
(\p. if not is_term `is_proc` (concl p) then fail else D 0 p)
;; |
| THM | list_el_cons_2 | A: . x,y:A. l:A List. x (y::l)   x = y x l |
| THM | list_el_cons_2_ann | ( A:( :: {1'}):: [] {2}
(( x:A:: [] {2}
(( y:A:: [] {2}
(( l:((A:: [] {2}) List:: {2}):: [] {2}
(((((x:: []A) ((((y:: []A)::(l:: []A List)):: A List)
:: []A List)):: {2}):: [] {2}
  (((((x:: []A) = (y:: []A)):: {2}):: [] {2}
(((x:: []A) (l:: []A List)):: {2}):: [] {2})
:: {2}):: [] {2}):: {2}):: [(l A List)] {2})
:: {2}):: [(y A)] {2}):: {2}):: [(x A)] {2}):: {2})
:: [(A  )] {2}):: {2} |
| ML | list_el_cons_2_ml | delete_simp_everywhere `list_el_cons` ;;
simpset_add `buf_simps` (lemma_simp `list_el_cons_2`) ;;
simpset_add `HOL_standard_lib_simps` (lemma_simp `list_el_cons_2`) ;;
simpset_add `hol1` (lemma_simp `list_el_cons_2`) ;; |
| THM | list_el_but_last_el | 'a:S. l:'a List. x:'a. x but_last_el(l)  x l |
| THM | list_el_but_last_el_ann | ( 'a:(S:: {2}):: [] {2}
(( l:(('a:: [] {2}) List:: {2}):: [] {2}
(( x:'a:: [] {2}
(((((x:: []'a) ((but_last_el(l:: []'a List):: 'a List)
:: []'a List)):: {2}):: [] {2}
 (((x:: []'a) (l:: []'a List)):: {2})
:: [(x but_last_el(l))] {2}):: {2})
:: [(x 'a)] {2}):: {2}):: [(l 'a List)] {2}):: {2})
:: [('a S)] {2}):: {2} |
| ML | FChainPart | let Inv13FChain part hyps p =
OnInv13Part part (\j. Simple (FHyp j hyps)) p
;;
let Inv13FChain1 part hyp p =
Inv13FChain part [hyp] p
;; |
| ML | GetPartl | let GetPartl p =
let i = find_hyp (\t. is_term `list_el` t &
let t' = subterm t 2 in
is_term `mk_mesg` t' & is_term `prependr` (sub
term t' 1))
p in
OnInv13Part `l` (\j. Simple (FHyp j [i])) p
;; |
| ML | Partlvisiting | let SwapNeg p =
let id = opid_of_term (dest_not (concl p)) in
let i = find_hyp (\t. id = opid_of_term (dest_not t) ? false) p in
(D 0 THENM D i) p
;;
let Partlvisiting =
SeqOnSameConcl
[GetPartl
;Last RepeatAndHD
;Thin (-1) THEN Thin (-1)
;DTerm r (-1)
;Last (Unfold `visiting`)
THENM D 0
THENM (D (-2) THEN Auto THEN Try SwapNeg)
]
;; |
| THM | buf_hsend_same_rw_2 | s:state. p: . q:PId. M:mesg.
buf[p] ([h<-(hsend(q;p;M)::h)] s) = (M::buf[p]_) |
| DISP | inbuf_df2 | Parens ::Prec(atomrel)::
{->0}<M:M:*>{<-}{\\? }*INBUF* {->0}buf[<p:p:*>] {\\}<s:s:*>{<-}
== <M> *INBUF* buf[<p>]
<s> |
| DISP | sci_vars_df2 | cv*<p:pid?>== cv*<p>
head*<p:pid?>== head*<p>
cs*<p:pid?>== cs*<p>
cs*== cs*
succ*<p:pid?>== succ*<p>
pred*<p:pid?>== pred*<p>
q*== q*
p*== p*
r*== r*
status*<p:pid?>== status*<p>
mstatus*<p:pid?>== mstatus*<p> |
| THM | mk_mesg_inj | T,T': . args,args': List.
T'(args) = T(args')   T = T' args = args' |
| THM | mk_mesg_inj_ann | ( T: :: []
(( T': :: []
(( args:(( :: [] ) List::  ):: []
(( args':(( :: [] ) List::  ):: []
((((((T':: [] (args:: [] List):: mesg):: []mesg)
= ((T:: [] (args':: [] List):: mesg):: []mesg))
::  ):: []
  (((((T:: [] ) = (T':: [] ))::  ):: []
(((args:: [] List) = (args':: [] List))::  )
:: [] )::  ):: [] )::  )
:: [(args' List)] )::  ):: [(args List)] )
::  ):: [(T' )] )::  ):: [(T )] )::   |
| ML | mk_mesg_inj_ml | simp_add (lemma_simp `mk_mesg_inj`) ;;
simp_add (lemma_simp `cons_11`) ;; |
| DISP | list_el_df2 | Parens ::Prec(atomrel)::
{->0}<t:term>{<-}{\\? } {->0} <l:list>{<-}
== <t> <l> |
| THM | lemma13l_m1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p':P. q,cv,cs: . inv13l{}(n; (action_m1{} s); p'; q; cv; cs)) |
| THM | lemma13l_m2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p':P. q,cv,cs: . inv13l{}(n; (action_m2{} s); p'; q; cv; cs)) |
| THM | lemma13l_m3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p':P. q,cv,cs: . inv13l{}(n; (action_m3{} s); p'; q; cv; cs)) |
| THM | lemma13l_m4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p':P. q,cv,cs: . inv13l{}(n; (action_m4{} s); p'; q; cv; cs)) |
| THM | lemma13l_p1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p1{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p2{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p3{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p4{}(p) s); p'; q; cv; cs)) |
| THM | lemma_13l_p5_lemma | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: . qval:P.
next_mesg(p;s.h) = prependQ(qval::[])
 status*p_ = Delleft
 succ*p_ = nil
 (p = qval)
 prependQ(qval::[]) buf[p]_
 hasrank(s;p)
 hasrank(s;qval)
 rank(s;qval) = rank(s;p) + 1
 visiting(s;p)
 hasrank(s;p)
 rank(s;p) = 0
 rank(cs*p:=invalid{}
([h<-(hsend(p;qval;prependR(p
::nil::ok{}::cv*p_::cs*p_::[]))
::h)]
([h<-(hreceive(p;h)::h)] (q*:=qval s)));qval) = 0) |
| THM | lemma13l_p5 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p5{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p6 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p6{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p7 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p7{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p8 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p8{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p9 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p9{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p10 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p10{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p11 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p11{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p12 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p12{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p13 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p13{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p14 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p14{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p15 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p15{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p16 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p16{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_p17 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,p':P. q,cv,cs: .
inv13l{}(n; (action_p17{}(p) s); p'; q; cv; cs)) |
| THM | lemma13l_ht | n:
htriple(s.inv13all_assump(n;s);sci_program{}(n);s. r,q,p:P.
q,cv,cs: .
inv13l{}(n;
s;
p;
q;
cv;
cs)) |