Download HOL-TestGen: User Guide
Transcript
using H apply(auto)
apply(cases s, simp_all)
apply(cases s, auto intro: is_processT9[rule_format])
done
} note 9 = this
show ?case by(rule 9, rule asm9)
qed
lemma Rep_Abs_Mp :
assumes H1 : "f = {(tr,ref). tr=[] ∧ ref ∩ (ev ‘ A) = {}} ∪
{(tr,ref). tr 6= [] ∧ hd tr ∈ (ev ‘ A) ∧ (∃ a. ev a = (hd tr) ∧ (tl tr,ref)
∈ F(P a))}"
and H2 : "d = {d. d 6= [] ∧ hd d ∈ (ev ‘ A) ∧ (∃ a. ev a = hd d ∧ tl d ∈ D(P a))}"
shows "Rep_Process (Abs_Process (f,d)) = (f,d)"
by(subst Abs_Process_inverse, simp_all only: H1 H2 CollectI Process_def is_process_REP_Mp)
Projections in Prefix
lemma F_Mprefix :
"F( x ∈ A → P x) = {(tr,ref). tr=[] ∧ ref ∩ (ev ‘ A) = {}} ∪
{(tr,ref). tr 6= [] ∧ hd tr ∈ (ev ‘ A) ∧ (∃ a. ev a = (hd tr) ∧ (tl tr,ref)
∈ F(P a))}"
by(simp add:Mprefix_def F_def Rep_Abs_Mp FAILURES_def)
lemma D_Mprefix:
"D( x ∈ A → P x) = {d. d 6= [] ∧ hd d ∈ (ev ‘ A) ∧ (∃ a. ev a = hd d
by(simp add:Mprefix_def D_def Rep_Abs_Mp DIVERGENCES_def)
∧ tl d ∈ D(P a))}"
lemma T_Mprefix:
"T( x ∈ A → P x)={s. s=[] ∨ (∃ a. a ∈ A & s6=[] ∧ hd s = ev a ∧ tl s ∈ T(P a))}"
by(auto simp: T_F_spec[symmetric] F_Mprefix)
Basic Properties
lemma tick_T_Mprefix [simp]: "[tick] ∈
/ T( x ∈ A → P x)"
by(simp add:T_Mprefix)
lemma Nil_Nin_D_Mprefix [simp]: "[] ∈
/ D( x ∈ A → P x)"
by(simp add: D_Mprefix)
Proof of Continuity Rule
lemma proc_ord2a :
"[[P v Q; s ∈
/ D P]] =⇒ ((s, X) ∈ F P) = ((s, X) ∈ F Q)"
by(auto simp: process_ord_def Ra_def)
lemma mono_Mprefix1:
"∀ a. P a v Q a =⇒ D (Mprefix A Q) ⊆ D (Mprefix A P)"
apply(auto simp: D_Mprefix)
apply(erule_tac x=xa in allE)
by(auto elim: proc_ord1 [THEN subsetD])
219