theory CSpaceAcc_C

lemma ccorres_pre_curDomain:
  assumes cc: "\<And>rv. ccorres r xf (P rv) (P' rv) hs (f rv) c"
  shows   "ccorres r xf
                  (\<lambda>s. (\<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s))
                  {s. \<forall>rv. ksCurDomain_' (globals s) = ucast rv
                                 \<longrightarrow> s \<in> P' rv }
                          hs (curDomain >>= (\<lambda>rv. f rv)) c" apply (rule ccorres_guard_imp) apply (rule ccorres_symb_exec_l) defer apply wp[1] apply (rule curDomain_sp) apply (clarsimp simp: empty_fail_def curDomain_def simpler_gets_def) apply assumption apply clarsimp defer apply (rule ccorres_guard_imp) apply (rule cc) apply clarsimp apply assumption apply (clarsimp simp: rf_sr_ksCurDomain) done

(* Proof state trace *)
proof (prove)
goal (1 subgoal):
 1. ccorres r xf (\<lambda>s. \<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s) {s. \<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv} hs (curDomain >>= f) c proof (prove)
goal (3 subgoals):
 1. ccorres r xf ?Q ?Q' hs (curDomain >>= f) c
 2. \<And>s. \<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s \<Longrightarrow> ?Q s
 3. \<And>s. s \<in> {s. \<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv} \<Longrightarrow> s \<in> ?Q' proof (prove)
goal (6 subgoals):
 1. \<And>rv. ccorres r xf (?Q4 rv) (?Q'4 rv) hs (f rv) c
 2. \<And>s. \<lbrace>(=) s\<rbrace> curDomain \<lbrace>\<lambda>r. (=) s\<rbrace>
 3. \<lbrace>?Q\<rbrace> curDomain \<lbrace>?Q4\<rbrace>
 4. empty_fail curDomain
 5. \<And>s. \<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s \<Longrightarrow> ?Q s
 6. \<And>s. s \<in> {s. \<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv} \<Longrightarrow> s \<in> {s'. \<forall>rv s. (s, s') \<in> rf_sr \<and> ?Q4 rv s \<longrightarrow> s' \<in> ?Q'4 rv} proof (prove)
goal (6 subgoals):
 1. \<And>s. \<lbrace>(=) s\<rbrace> curDomain \<lbrace>\<lambda>r. (=) s\<rbrace>
 2. \<lbrace>?Q\<rbrace> curDomain \<lbrace>?Q4\<rbrace>
 3. empty_fail curDomain
 4. \<And>s. \<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s \<Longrightarrow> ?Q s
 5. \<And>s. s \<in> {s. \<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv} \<Longrightarrow> s \<in> {s'. \<forall>rv s. (s, s') \<in> rf_sr \<and> ?Q4 rv s \<longrightarrow> s' \<in> ?Q'4 rv}
 6. \<And>rv. ccorres r xf (?Q4 rv) (?Q'4 rv) hs (f rv) c proof (prove)
goal (5 subgoals):
 1. \<lbrace>?Q\<rbrace> curDomain \<lbrace>?Q4\<rbrace>
 2. empty_fail curDomain
 3. \<And>s. \<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s \<Longrightarrow> ?Q s
 4. \<And>s. s \<in> {s. \<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv} \<Longrightarrow> s \<in> {s'. \<forall>rv s. (s, s') \<in> rf_sr \<and> ?Q4 rv s \<longrightarrow> s' \<in> ?Q'4 rv}
 5. \<And>rv. ccorres r xf (?Q4 rv) (?Q'4 rv) hs (f rv) c proof (prove)
goal (4 subgoals):
 1. empty_fail curDomain
 2. \<And>s. \<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s \<Longrightarrow> ?Q s
 3. \<And>s. s \<in> {s. \<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv} \<Longrightarrow> s \<in> {s'. \<forall>rv s. (s, s') \<in> rf_sr \<and> ksCurDomain s = rv \<and> ?Q s \<longrightarrow> s' \<in> ?Q'4 rv}
 4. \<And>rv. ccorres r xf (\<lambda>s. ksCurDomain s = rv \<and> ?Q s) (?Q'4 rv) hs (f rv) c proof (prove)
goal (3 subgoals):
 1. \<And>s. \<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s \<Longrightarrow> ?Q s
 2. \<And>s. s \<in> {s. \<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv} \<Longrightarrow> s \<in> {s'. \<forall>rv s. (s, s') \<in> rf_sr \<and> ksCurDomain s = rv \<and> ?Q s \<longrightarrow> s' \<in> ?Q'4 rv}
 3. \<And>rv. ccorres r xf (\<lambda>s. ksCurDomain s = rv \<and> ?Q s) (?Q'4 rv) hs (f rv) c proof (prove)
goal (2 subgoals):
 1. \<And>s. s \<in> {s. \<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv} \<Longrightarrow> s \<in> {s'. \<forall>rv s. (s, s') \<in> rf_sr \<and> ksCurDomain s = rv \<and> (\<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s) \<longrightarrow> s' \<in> ?Q'4 rv}
 2. \<And>rv. ccorres r xf (\<lambda>s. ksCurDomain s = rv \<and> (\<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s)) (?Q'4 rv) hs (f rv) c proof (prove)
goal (2 subgoals):
 1. \<And>s sa. \<lbrakk>\<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv; (sa, s) \<in> rf_sr; P (ksCurDomain sa) sa\<rbrakk> \<Longrightarrow> s \<in> ?Q'4 (ksCurDomain sa)
 2. \<And>rv. ccorres r xf (\<lambda>s. ksCurDomain s = rv \<and> (\<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s)) (?Q'4 rv) hs (f rv) c proof (prove)
goal (2 subgoals):
 1. \<And>rv. ccorres r xf (\<lambda>s. ksCurDomain s = rv \<and> (\<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s)) (?Q'4 rv) hs (f rv) c
 2. \<And>s sa. \<lbrakk>\<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv; (sa, s) \<in> rf_sr; P (ksCurDomain sa) sa\<rbrakk> \<Longrightarrow> s \<in> ?Q'4 (ksCurDomain sa) proof (prove)
goal (4 subgoals):
 1. \<And>rv. ccorres r xf (?Q22 rv) (?Q'22 rv) hs (f rv) c
 2. \<And>rv s. ksCurDomain s = rv \<and> (\<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s) \<Longrightarrow> ?Q22 rv s
 3. \<And>rv s. s \<in> ?Q'4 rv \<Longrightarrow> s \<in> ?Q'22 rv
 4. \<And>s sa. \<lbrakk>\<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv; (sa, s) \<in> rf_sr; P (ksCurDomain sa) sa\<rbrakk> \<Longrightarrow> s \<in> ?Q'4 (ksCurDomain sa) proof (prove)
goal (3 subgoals):
 1. \<And>rv s. ksCurDomain s = rv \<and> (\<forall>rv. ksCurDomain s = rv \<longrightarrow> P rv s) \<Longrightarrow> P rv s
 2. \<And>rv s. s \<in> ?Q'4 rv \<Longrightarrow> s \<in> P' rv
 3. \<And>s sa. \<lbrakk>\<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv; (sa, s) \<in> rf_sr; P (ksCurDomain sa) sa\<rbrakk> \<Longrightarrow> s \<in> ?Q'4 (ksCurDomain sa) proof (prove)
goal (2 subgoals):
 1. \<And>rv s. s \<in> ?Q'4 rv \<Longrightarrow> s \<in> P' rv
 2. \<And>s sa. \<lbrakk>\<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv; (sa, s) \<in> rf_sr; P (ksCurDomain sa) sa\<rbrakk> \<Longrightarrow> s \<in> ?Q'4 (ksCurDomain sa) proof (prove)
goal (1 subgoal):
 1. \<And>s sa. \<lbrakk>\<forall>rv. ksCurDomain_' (globals s) = UCAST(8 \<rightarrow> 32) rv \<longrightarrow> s \<in> P' rv; (sa, s) \<in> rf_sr; P (ksCurDomain sa) sa\<rbrakk> \<Longrightarrow> s \<in> P' (ksCurDomain sa) proof (prove)
goal:
No subgoals!