Nuprl Theory sci_inv_rw

(only non hidden objects are presented)

COMsci_inv_rw_1---- NonInterference Theorems for Idle -------------------
THMidle_ni_m3n:. s:state. in_exec{}(sci_program{}(n); s) (q:P. idle(action_m3{}s;q) idle(s;q))
THMidle_ni_m4n:. s:state. in_exec{}(sci_program{}(n); s) (q:P. idle(action_m4{}s;q) idle(s;q))
THMidle_ni_p1n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p1{}(p)s;q) idle(s;q))
THMidle_ni_p2n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p2{}(p)s;q) idle(s;q))
THMidle_ni_p3n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p3{}(p)s;q) idle(s;q))
THMidle_ni_p4n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p4{}(p)s;q) idle(s;q))
THMidle_ni_p5n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p5{}(p)s;q) idle(s;q))
THMidle_ni_p6n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p6{}(p)s;q) idle(s;q))
THMidle_ni_p7n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p7{}(p)s;q) idle(s;q))
THMidle_ni_p8n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p8{}(p)s;q) idle(s;q))
THMidle_ni_p9n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p9{}(p)s;q) idle(s;q))
THMidle_ni_p10n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p10{}(p)s;q) idle(s;q))
THMidle_ni_p11n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p11{}(p)s;q) idle(s;q))
THMidle_ni_p12n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p12{}(p)s;q) idle(s;q))
THMidle_ni_p13n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (idle(action_p13{}(p)s;q) idle(s;q)))
THMidle_ni_p14n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p14{}(p)s;q) idle(s;q))
THMidle_ni_p15n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (idle(action_p15{}(p)s;q) idle(s;q)))
THMidle_ni_p16n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (idle(action_p16{}(p)s;q) idle(s;q)))
THMidle_ni_p17n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. idle(action_p17{}(p)s;q) idle(s;q))
MLsci_idle_ni_simpsetmap ((simpset_add `sci_idle_ni`) o lemma_simp) ``idle_ni_m3 idle_ni_m4 idle_ni_p1 idle_ni_p2 idle_ni_p3 idle_ni_p4 idle_ni_p5 idle_ni_p6 idle_ni_p7 idle_ni_p8 idle_ni_p9 idle_ni_p10 idle_ni_p11 idle_ni_p12 idle_ni_p14 idle_ni_p17`` ;; map (simpset_add `sci_idle_ni`) [lemma_cond_simp `idle_ni_p13` [Trivial ORELSE DiffBufferPids]; lemma_cond_simp `idle_ni_p15` [Trivial ORELSE DiffBufferPids]; lemma_cond_simp `idle_ni_p16` [Trivial ORELSE DiffBufferPids] ] ;;
COMsci_inv_rw_2---- NonInterference Theorems for Entering ---------------
THMentering_ni_m3n:. s:state. in_exec{}(sci_program{}(n); s) (q:P. entering(action_m3{}s;q) entering(s;q))
THMentering_ni_m4n:. s:state. in_exec{}(sci_program{}(n); s) (q:P. entering(action_m4{}s;q) entering(s;q))
THMentering_ni_p1n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p1{}(p)s;q) entering(s;q))
THMentering_ni_p2n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p2{}(p)s;q) entering(s;q))
THMentering_ni_p3n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (entering(action_p3{}(p)s;q) entering(s;q)))
THMentering_ni_p4n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (entering(action_p4{}(p)s;q) entering(s;q)))
THMentering_ni_p5n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p5{}(p)s;q) entering(s;q))
THMentering_ni_p6n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (entering(action_p6{}(p)s;q) entering(s;q)))
THMentering_ni_p7n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p7{}(p)s;q) entering(s;q))
THMentering_ni_p8n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p8{}(p)s;q) entering(s;q))
THMentering_ni_p9n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p9{}(p)s;q) entering(s;q))
THMentering_ni_p10n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p10{}(p)s;q) entering(s;q))
THMentering_ni_p11n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p11{}(p)s;q) entering(s;q))
THMentering_ni_p12n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p12{}(p)s;q) entering(s;q))
THMentering_ni_p13n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p13{}(p)s;q) entering(s;q))
THMentering_ni_p14n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p14{}(p)s;q) entering(s;q))
THMentering_ni_p15n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p15{}(p)s;q) entering(s;q))
THMentering_ni_p16n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p16{}(p)s;q) entering(s;q))
THMentering_ni_p17n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. entering(action_p17{}(p)s;q) entering(s;q))
MLsci_entering_ni_simpsetmap ((simpset_add `sci_entering_ni`) o lemma_simp) ``entering_ni_m3 entering_ni_m4 entering_ni_p1 entering_ni_p2 entering_ni_p5 entering_ni_p7 entering_ni_p8 entering_ni_p9 entering_ni_p10 entering_ni_p11 entering_ni_p12 entering_ni_p13 entering_ni_p14 entering_ni_p15 entering_ni_p16 entering_ni_p17`` ;; map (simpset_add `sci_entering_ni`) [lemma_cond_simp `entering_ni_p3` [Trivial ORELSE DiffBufferPids]; lemma_cond_simp `entering_ni_p4` [Trivial ORELSE DiffBufferPids]; lemma_cond_simp `entering_ni_p6` [Trivial ORELSE DiffBufferPids] ] ;;
COMsci_inv_rw_3---- NonInterference Theorems for Leaving ----------------
THMleaving_ni_m1n:. s:state. in_exec{}(sci_program{}(n); s) (q:P. leaving(action_m1{}s;q) leaving(s;q))
THMleaving_ni_m2n:. s:state. in_exec{}(sci_program{}(n); s) (q:P. leaving(action_m2{}s;q) leaving(s;q))
THMleaving_ni_m4n:. s:state. in_exec{}(sci_program{}(n); s) (q:P. leaving(action_m4{}s;q) leaving(s;q))
THMleaving_ni_p1n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. leaving(action_p1{}(p)s;q) leaving(s;q))
THMleaving_ni_p2n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. leaving(action_p2{}(p)s;q) leaving(s;q))
THMleaving_ni_p3n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. leaving(action_p3{}(p)s;q) leaving(s;q))
THMleaving_ni_p4n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. leaving(action_p4{}(p)s;q) leaving(s;q))
THMleaving_ni_p5n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (leaving(action_p5{}(p)s;q) leaving(s;q)))
THMleaving_ni_p6n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. leaving(action_p6{}(p)s;q) leaving(s;q))
THMleaving_ni_p7n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. leaving(action_p7{}(p)s;q) leaving(s;q))
THMleaving_ni_p8n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. leaving(action_p8{}(p)s;q) leaving(s;q))
THMleaving_ni_p9n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. leaving(action_p9{}(p)s;q) leaving(s;q))
THMleaving_ni_p10n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (cs-q_ = invalid{}) (leaving(action_p10{}(p)s;q) leaving(s;q)))
THMleaving_ni_p11n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (cs-q_ = invalid{}) (leaving(action_p11{}(p)s;q) leaving(s;q)))
THMleaving_ni_p12n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. leaving(action_p12{}(p)s;q) leaving(s;q))
THMleaving_ni_p13n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (leaving(action_p13{}(p)s;q) leaving(s;q)))
THMleaving_ni_p15n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (leaving(action_p15{}(p)s;q) leaving(s;q)))
THMleaving_ni_p16n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (leaving(action_p16{}(p)s;q) leaving(s;q)))
THMleaving_ni_p17n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. leaving(action_p17{}(p)s;q) leaving(s;q))
MLsci_leaving_ni_simpsetmap ((simpset_add `sci_leaving_ni`) o lemma_simp) ``leaving_ni_m1 leaving_ni_m2 leaving_ni_m4 leaving_ni_p1 leaving_ni_p2 leaving_ni_p3 leaving_ni_p4 leaving_ni_p6 leaving_ni_p7 leaving_ni_p8 leaving_ni_p9 leaving_ni_p12 leaving_ni_p17`` ;; map (simpset_add `sci_leaving_ni`) [lemma_cond_simp `leaving_ni_p5` [Trivial ORELSE DiffBufferPids]; lemma_cond_simp `leaving_ni_p10` [IdSimpCond]; lemma_cond_simp `leaving_ni_p11` [IdSimpCond]; lemma_cond_simp `leaving_ni_p13` [Trivial ORELSE DiffBufferPids]; lemma_cond_simp `leaving_ni_p15` [Trivial ORELSE DiffBufferPids]; lemma_cond_simp `leaving_ni_p16` [Trivial ORELSE DiffBufferPids] ] ;;
COMsci_inv_rw_4---- NonInterference Theorems for Visiting ---------------
THMvisiting_ni_m1n:. s:state. in_exec{}(sci_program{}(n); s) (q:P. visiting(action_m1{}s;q) visiting(s;q))
THMvisiting_ni_m2n:. s:state. in_exec{}(sci_program{}(n); s) (q:P. visiting(action_m2{}s;q) visiting(s;q))
THMvisiting_ni_m4n:. s:state. in_exec{}(sci_program{}(n); s) (q:P. visiting(action_m4{}s;q) visiting(s;q))
THMvisiting_ni_p1n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. visiting(action_p1{}(p)s;q) visiting(s;q))
THMvisiting_ni_p2n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. visiting(action_p2{}(p)s;q) visiting(s;q))
THMvisiting_ni_p3n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (visiting(action_p3{}(p)s;q) visiting(s;q)))
THMvisiting_ni_p4n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (visiting(action_p4{}(p)s;q) visiting(s;q)))
THMvisiting_ni_p5n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (visiting(action_p5{}(p)s;q) visiting(s;q)))
THMvisiting_ni_p6n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (visiting(action_p6{}(p)s;q) visiting(s;q)))
THMvisiting_ni_p7n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. visiting(action_p7{}(p)s;q) visiting(s;q))
THMvisiting_ni_p8n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. visiting(action_p8{}(p)s;q) visiting(s;q))
THMvisiting_ni_p9n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. visiting(action_p9{}(p)s;q) visiting(s;q))
THMvisiting_ni_p10n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (cs-q_ = invalid{}) (visiting(action_p10{}(p)s;q) visiting(s;q)))
THMvisiting_ni_p11n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (cs-q_ = invalid{}) (visiting(action_p11{}(p)s;q) visiting(s;q)))
THMvisiting_ni_p12n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. visiting(action_p12{}(p)s;q) visiting(s;q))
THMvisiting_ni_p13n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. visiting(action_p13{}(p)s;q) visiting(s;q))
THMvisiting_ni_p15n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. visiting(action_p15{}(p)s;q) visiting(s;q))
THMvisiting_ni_p16n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (p = q) (visiting(action_p16{}(p)s;q) visiting(s;q)))
THMvisiting_ni_p17n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. visiting(action_p17{}(p)s;q) visiting(s;q))
MLsci_visiting_ni_simpsetmap ((simpset_add `sci_visiting_ni`) o lemma_simp) ``visiting_ni_m1 visiting_ni_m2 visiting_ni_m4 visiting_ni_p1 visiting_ni_p2 visiting_ni_p7 visiting_ni_p8 visiting_ni_p9 visiting_ni_p12 visiting_ni_p13 visiting_ni_p15 visiting_ni_p17`` ;; map (simpset_add `sci_visiting_ni`) [lemma_cond_simp `visiting_ni_p3` [Trivial ORELSE DiffBufferPids]; lemma_cond_simp `visiting_ni_p4` [Trivial ORELSE DiffBufferPids]; lemma_cond_simp `visiting_ni_p5` [Trivial ORELSE DiffBufferPids]; lemma_cond_simp `visiting_ni_p6` [Trivial ORELSE DiffBufferPids]; lemma_cond_simp `visiting_ni_p10` [IdSimpCond]; lemma_cond_simp `visiting_ni_p11` [IdSimpCond]; lemma_cond_simp `visiting_ni_p16` [Trivial ORELSE DiffBufferPids] ] ;;
COMsci_inv_rw_5---- NonInterference Theorems for Rank -------------------
THMrank_ni_m4n:. s:state. q:P. in_exec{}(sci_program{}(n); s) rank(action_m4{}s;q) = rank(s;q)
THMrank_ni_p1n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) rank(action_p1{}(p)s;q) = rank(s;q)
THMrank_ni_p2n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) rank(action_p2{}(p)s;q) = rank(s;q)
THMrank_ni_p3n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) rank(action_p3{}(p)s;q) = rank(s;q)
THMrank_ni_p4n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) rank(action_p4{}(p)s;q) = rank(s;q)
THMrank_ni_p6n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) rank(action_p6{}(p)s;q) = rank(s;q)
THMrank_ni_p7n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) rank(action_p7{}(p)s;q) = rank(s;q)
THMrank_ni_p8n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) rank(action_p8{}(p)s;q) = rank(s;q)
THMrank_ni_p9n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) rank(action_p9{}(p)s;q) = rank(s;q)
THMrank_ni_p10n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) (cs-p_ = invalid{}) rank(action_p10{}(p)s;q) = rank(s;q)
THMrank_ni_p11n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) (cs-p_ = invalid{}) rank(action_p11{}(p)s;q) = rank(s;q)
THMrank_ni_p12n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) rank(action_p12{}(p)s;q) = rank(s;q)
THMrank_ni_p13n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) rank(action_p13{}(p)s;q) = rank(s;q)
THMrank_ni_p15n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) rank(action_p15{}(p)s;q) = rank(s;q)
THMrank_ni_p17n:. s:state. p:P. q:PId. in_exec{}(sci_program{}(n); s) rank(action_p17{}(p)s;q) = rank(s;q)
MLsci_rank_ni_simpsetmap ((simpset_add `sci_rank_ni`) o lemma_simp) ``rank_ni_m4 rank_ni_p1 rank_ni_p2 rank_ni_p3 rank_ni_p4 rank_ni_p6 rank_ni_p7 rank_ni_p8 rank_ni_p9 rank_ni_p12 rank_ni_p13 rank_ni_p15 rank_ni_p17`` ;; map (simpset_add `sci_rank_ni`) [lemma_cond_simp `rank_ni_p10` [IdSimpCond]; lemma_cond_simp `rank_ni_p11` [IdSimpCond] ] ;;
COMsci_inv_rw_6---- NonInterference Theorems for hasrank ----------------
THMhasrank_ni_m4n:. s:state. in_exec{}(sci_program{}(n); s) (q:P. hasrank(action_m4{}s;q) hasrank(s;q))
THMhasrank_ni_p1n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. hasrank(action_p1{}(p)s;q) hasrank(s;q))
THMhasrank_ni_p2n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. hasrank(action_p2{}(p)s;q) hasrank(s;q))
THMhasrank_ni_p3n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. hasrank(action_p3{}(p)s;q) hasrank(s;q))
THMhasrank_ni_p4n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. hasrank(action_p4{}(p)s;q) hasrank(s;q))
THMhasrank_ni_p6n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. hasrank(action_p6{}(p)s;q) hasrank(s;q))
THMhasrank_ni_p7n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. hasrank(action_p7{}(p)s;q) hasrank(s;q))
THMhasrank_ni_p8n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. hasrank(action_p8{}(p)s;q) hasrank(s;q))
THMhasrank_ni_p9n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. hasrank(action_p9{}(p)s;q) hasrank(s;q))
THMhasrank_ni_p10n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (cs-p_ = invalid{}) (hasrank(action_p10{}(p)s;q) hasrank(s;q)))
THMhasrank_ni_p11n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (cs-p_ = invalid{}) (hasrank(action_p11{}(p)s;q) hasrank(s;q)))
THMhasrank_ni_p12n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. hasrank(action_p12{}(p)s;q) hasrank(s;q))
THMhasrank_ni_p13n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. hasrank(action_p13{}(p)s;q) hasrank(s;q))
THMhasrank_ni_p15n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. hasrank(action_p15{}(p)s;q) hasrank(s;q))
THMhasrank_ni_p17n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. hasrank(action_p17{}(p)s;q) hasrank(s;q))
MLsci_hasrank_ni_simpsetmap ((simpset_add `sci_hasrank_ni`) o lemma_simp) ``hasrank_ni_m4 hasrank_ni_p1 hasrank_ni_p2 hasrank_ni_p3 hasrank_ni_p4 hasrank_ni_p6 hasrank_ni_p7 hasrank_ni_p8 hasrank_ni_p9 hasrank_ni_p12 hasrank_ni_p13 hasrank_ni_p15 hasrank_ni_p17`` ;; map (simpset_add `sci_hasrank_ni`) [lemma_cond_simp `hasrank_ni_p10` [IdSimpCond]; lemma_cond_simp `hasrank_ni_p11` [IdSimpCond] ] ;;
COMsci_inv_rw_7---- NonInterference Theorems for maxrank ----------------
THMmaxrank_ni_m4n:. s:state. q:P. in_exec{}(sci_program{}(n); s) (maxrank(n;action_m4{}s;q) maxrank(n;s;q))
THMmaxrank_ni_p1n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank(n;action_p1{}(p)s;q) maxrank(n;s;q))
THMmaxrank_ni_p2n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank(n;action_p2{}(p)s;q) maxrank(n;s;q))
THMmaxrank_ni_p3n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank(n;action_p3{}(p)s;q) maxrank(n;s;q))
THMmaxrank_ni_p4n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank(n;action_p4{}(p)s;q) maxrank(n;s;q))
THMmaxrank_ni_p6n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank(n;action_p6{}(p)s;q) maxrank(n;s;q))
THMmaxrank_ni_p7n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank(n;action_p7{}(p)s;q) maxrank(n;s;q))
THMmaxrank_ni_p8n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank(n;action_p8{}(p)s;q) maxrank(n;s;q))
THMmaxrank_ni_p9n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank(n;action_p9{}(p)s;q) maxrank(n;s;q))
THMmaxrank_ni_p10n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (cs-p_ = invalid{}) (maxrank(n;action_p10{}(p)s;q) maxrank(n;s;q)))
THMmaxrank_ni_p11n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (cs-p_ = invalid{}) (maxrank(n;action_p11{}(p)s;q) maxrank(n;s;q)))
THMmaxrank_ni_p12n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank(n;action_p12{}(p)s;q) maxrank(n;s;q))
THMmaxrank_ni_p13n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank(n;action_p13{}(p)s;q) maxrank(n;s;q))
THMmaxrank_ni_p15n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank(n;action_p15{}(p)s;q) maxrank(n;s;q))
THMmaxrank_ni_p17n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank(n;action_p17{}(p)s;q) maxrank(n;s;q))
MLsci_rank_ni1_simpset1map ((simpset_add `sci_rank_ni1`) o lemma_simp) ``maxrank_ni_m4 maxrank_ni_p1 maxrank_ni_p2 maxrank_ni_p3 maxrank_ni_p4 maxrank_ni_p6 maxrank_ni_p7 maxrank_ni_p8 maxrank_ni_p9 maxrank_ni_p12 maxrank_ni_p13 maxrank_ni_p15 maxrank_ni_p17`` ;; map (simpset_add `sci_rank_ni1`) [lemma_cond_simp `maxrank_ni_p10` [IdSimpCond]; lemma_cond_simp `maxrank_ni_p11` [IdSimpCond] ] ;;
COMsci_inv_rw_8---- NonInterference Theorems for maxrank_visiting -------
THMmaxrank_visiting_ni_m4n:. s:state. in_exec{}(sci_program{}(n); s) (q:P maxrank_visiting(n;action_m4{}s;q) maxrank_visiting(n;s;q))
THMmaxrank_visiting_ni_p1n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank_visiting(n;action_p1{}(p)s;q) maxrank_visiting(n;s;q))
THMmaxrank_visiting_ni_p2n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank_visiting(n;action_p2{}(p)s;q) maxrank_visiting(n;s;q))
THMmaxrank_visiting_ni_p7n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank_visiting(n;action_p7{}(p)s;q) maxrank_visiting(n;s;q))
THMmaxrank_visiting_ni_p8n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank_visiting(n;action_p8{}(p)s;q) maxrank_visiting(n;s;q))
THMmaxrank_visiting_ni_p9n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank_visiting(n;action_p9{}(p)s;q) maxrank_visiting(n;s;q))
THMmaxrank_visiting_ni_p10n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (cs-p_ = invalid{}) (maxrank_visiting(n;action_p10{}(p)s;q) maxrank_visiting(n;s;q)))
THMmaxrank_visiting_ni_p11n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. (cs-p_ = invalid{}) (maxrank_visiting(n;action_p11{}(p)s;q) maxrank_visiting(n;s;q)))
THMmaxrank_visiting_ni_p12n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank_visiting(n;action_p12{}(p)s;q) maxrank_visiting(n;s;q))
THMmaxrank_visiting_ni_p13n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank_visiting(n;action_p13{}(p)s;q) maxrank_visiting(n;s;q))
THMmaxrank_visiting_ni_p15n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank_visiting(n;action_p15{}(p)s;q) maxrank_visiting(n;s;q))
THMmaxrank_visiting_ni_p17n:. s:state. in_exec{}(sci_program{}(n); s) (p:P. q:PId. maxrank_visiting(n;action_p17{}(p)s;q) maxrank_visiting(n;s;q))
MLsci_rank_ni1_simpset2map ((simpset_add `sci_rank_ni1`) o lemma_simp) ``maxrank_visiting_ni_m4 maxrank_visiting_ni_p1 maxrank_visiting_ni_ p2 maxrank_visiting_ni_p7 maxrank_visiting_ni_p8 maxrank_visiting_ni_ p9 maxrank_visiting_ni_p12 maxrank_visiting_ni_p13 maxrank_visiting_ni_p15 maxrank_visiting_n i_p17`` ;; map (simpset_add `sci_rank_ni1`) [lemma_cond_simp `maxrank_visiting_ni_p10` [IdSimpCond]; lemma_cond_simp `maxrank_visiting_ni_p11` [IdSimpCond] ] ;;
COMsci_inv_rw_9---- NonInterference Theorems for smallrank --------------
COMsci_inv_rw_10---- NonInterference Theorems for maxrank_staying --------
COMsci_inv_rw_11---- NonInterference Theorems for maxrank_active ---------

the other theories