theory PolicySystemSAC

lemma ntfn3_affects : "subjectAffects SACAuthGraph (partition_label NTFN3) = {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD}" apply (rule subset_antisym) defer 
  (* backward *)
   apply (rule subsetI, erule UnE) apply (erule insertE, simp only:, rule affects_lrefl) apply (erule insertE, simp only:, rule ntfn3_affects_r, simp) apply (auto simp:ntfn3_affects_bd)[1] 
  (* forward *)
   apply (rule subsetI) apply (erule subjectAffects.induct) apply (simp add:SACAuthGraph_def, blast?)+ done

(* Proof state trace *)
proof (prove)
goal (1 subgoal):
 1. subjectAffects SACAuthGraph (partition_label NTFN3) = {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD} proof (prove)
goal (2 subgoals):
 1. subjectAffects SACAuthGraph (partition_label NTFN3) \<subseteq> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD}
 2. {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD} \<subseteq> subjectAffects SACAuthGraph (partition_label NTFN3) proof (prove)
goal (2 subgoals):
 1. {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD} \<subseteq> subjectAffects SACAuthGraph (partition_label NTFN3)
 2. subjectAffects SACAuthGraph (partition_label NTFN3) \<subseteq> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD} proof (prove)
goal (2 subgoals):
 1. {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD} \<subseteq> subjectAffects SACAuthGraph (partition_label NTFN3)
 2. subjectAffects SACAuthGraph (partition_label NTFN3) \<subseteq> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD} proof (prove)
goal (3 subgoals):
 1. \<And>x. x \<in> {partition_label NTFN3, partition_label R} \<Longrightarrow> x \<in> subjectAffects SACAuthGraph (partition_label NTFN3)
 2. \<And>x. x \<in> {partition_label NicB, partition_label NicD} \<Longrightarrow> x \<in> subjectAffects SACAuthGraph (partition_label NTFN3)
 3. subjectAffects SACAuthGraph (partition_label NTFN3) \<subseteq> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD} proof (prove)
goal (3 subgoals):
 1. \<And>x. x \<in> {partition_label R} \<Longrightarrow> x \<in> subjectAffects SACAuthGraph (partition_label NTFN3)
 2. \<And>x. x \<in> {partition_label NicB, partition_label NicD} \<Longrightarrow> x \<in> subjectAffects SACAuthGraph (partition_label NTFN3)
 3. subjectAffects SACAuthGraph (partition_label NTFN3) \<subseteq> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD} proof (prove)
goal (2 subgoals):
 1. \<And>x. x \<in> {partition_label NicB, partition_label NicD} \<Longrightarrow> x \<in> subjectAffects SACAuthGraph (partition_label NTFN3)
 2. subjectAffects SACAuthGraph (partition_label NTFN3) \<subseteq> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD} proof (prove)
goal (1 subgoal):
 1. subjectAffects SACAuthGraph (partition_label NTFN3) \<subseteq> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD} proof (prove)
goal (1 subgoal):
 1. subjectAffects SACAuthGraph (partition_label NTFN3) \<subseteq> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD} proof (prove)
goal (1 subgoal):
 1. \<And>x. x \<in> subjectAffects SACAuthGraph (partition_label NTFN3) \<Longrightarrow> x \<in> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD} proof (prove)
goal (12 subgoals):
 1. \<And>x. partition_label NTFN3 \<in> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD}
 2. \<And>x auth l'. \<lbrakk>(partition_label NTFN3, auth, l') \<in> SACAuthGraph; auth \<in> {Control, Write}\<rbrakk> \<Longrightarrow> l' \<in> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD}
 3. \<And>x auth l'. \<lbrakk>(partition_label NTFN3, auth, l') \<in> SACAuthGraph; auth \<in> {Receive, Notify, SyncSend, Call, Reset}\<rbrakk> \<Longrightarrow> l' \<in> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD}
 4. \<And>x auth ep l' l''. \<lbrakk>(partition_label NTFN3, auth, ep) \<in> SACAuthGraph; auth \<in> {SyncSend, Notify, Call}; (l', Receive, ep) \<in> SACAuthGraph; (l', Write, l'') \<in> SACAuthGraph\<rbrakk> \<Longrightarrow> l'' \<in> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD}
 5. \<And>x ep l'. \<lbrakk>(partition_label NTFN3, Receive, ep) \<in> SACAuthGraph; (l', SyncSend, ep) \<in> SACAuthGraph\<rbrakk> \<Longrightarrow> l' \<in> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD}
 6. \<And>x l'. (l', Reply, partition_label NTFN3) \<in> SACAuthGraph \<Longrightarrow> l' \<in> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD}
 7. \<And>x l' l''. \<lbrakk>(partition_label NTFN3, Reply, l') \<in> SACAuthGraph; (l', Write, l'') \<in> SACAuthGraph\<rbrakk> \<Longrightarrow> l'' \<in> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD}
 8. \<And>x l'. (partition_label NTFN3, DeleteDerived, l') \<in> SACAuthGraph \<Longrightarrow> l' \<in> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD}
 9. \<And>x l' l''. \<lbrakk>(partition_label NTFN3, DeleteDerived, l') \<in> SACAuthGraph; (l'', DeleteDerived, l') \<in> SACAuthGraph\<rbrakk> \<Longrightarrow> l'' \<in> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD}
 10. \<And>x ep l' auth l''. \<lbrakk>(partition_label NTFN3, Reset, ep) \<in> SACAuthGraph; (l', auth, ep) \<in> SACAuthGraph; auth \<in> {SyncSend, Receive}; (l', Write, l'') \<in> SACAuthGraph\<rbrakk> \<Longrightarrow> l'' \<in> {partition_label NTFN3, partition_label R} \<union> {partition_label NicB, partition_label NicD}
A total of 12 subgoals... proof (prove)
goal:
No subgoals!