Nuprl Theory a_sci_inv13l

(only non hidden objects are presented)

THMrank_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)])::
MLundo_hol_type_inf_hack_againadd_get_type_top_level_hook `hol_type_inf_hack` (\T. T) ;;
MLis_proc_Auto_additionupdate_Auto_additions `is_proc -- is_proc_Auto_addition` (\p. if not is_term `is_proc` (concl p) then fail else D 0 p) ;;
THMlist_el_cons_2A:. x,y:A. l:A List. x (y::l) x = y x l
THMlist_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}
MLlist_el_cons_2_mldelete_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`) ;;
THMlist_el_but_last_el'a:S. l:'a List. x:'a. x but_last_el(l) x l
THMlist_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}
MLFChainPartlet Inv13FChain part hyps p = OnInv13Part part (\j. Simple (FHyp j hyps)) p ;; let Inv13FChain1 part hyp p = Inv13FChain part [hyp] p ;;
MLGetPartllet 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 ;;
MLPartlvisitinglet 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) ] ;;
THMbuf_hsend_same_rw_2s:state. p:. q:PId. M:mesg. buf[p]([h<-(hsend(q;p;M)::h)]s) = (M::buf[p]_)
DISPinbuf_df2Parens ::Prec(atomrel):: {->0}<M:M:*>{<-}{\\? }*INBUF* {->0}buf[<p:p:*>]{\\}<s:s:*>{<-} == <M> *INBUF* buf[<p>] <s>
DISPsci_vars_df2cv*<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>
THMmk_mesg_injT,T':. args,args': List. T'(args) = T(args') T = T' args = args'
THMmk_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 )])::
MLmk_mesg_inj_mlsimp_add (lemma_simp `mk_mesg_inj`) ;; simp_add (lemma_simp `cons_11`) ;;
DISPlist_el_df2Parens ::Prec(atomrel):: {->0}<t:term>{<-}{\\? }{->0} <l:list>{<-} == <t> <l>
THMlemma13l_m1n:. 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))
THMlemma13l_m2n:. 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))
THMlemma13l_m3n:. 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))
THMlemma13l_m4n:. 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))
THMlemma13l_p1n:. 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))
THMlemma13l_p2n:. 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))
THMlemma13l_p3n:. 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))
THMlemma13l_p4n:. 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))
THMlemma_13l_p5_lemman:. 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*:=qvals)));qval) = 0)
THMlemma13l_p5n:. 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))
THMlemma13l_p6n:. 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))
THMlemma13l_p7n:. 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))
THMlemma13l_p8n:. 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))
THMlemma13l_p9n:. 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))
THMlemma13l_p10n:. 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))
THMlemma13l_p11n:. 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))
THMlemma13l_p12n:. 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))
THMlemma13l_p13n:. 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))
THMlemma13l_p14n:. 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))
THMlemma13l_p15n:. 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))
THMlemma13l_p16n:. 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))
THMlemma13l_p17n:. 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))
THMlemma13l_htn: htriple(s.inv13all_assump(n;s);sci_program{}(n);s.r,q,p:P. q,cv,cs:. inv13l{}(n; s; p; q; cv; cs))

the other theories