1 (* Title: HOLCF/Domain.thy
6 header {* Domain package *}
9 imports Ssum Sprod Up One Tr Fixrec
15 subsection {* Continuous isomorphisms *}
17 text {* A locale for continuous isomorphisms *}
20 fixes abs :: "'a \<rightarrow> 'b"
21 fixes rep :: "'b \<rightarrow> 'a"
22 assumes abs_iso [simp]: "rep\<cdot>(abs\<cdot>x) = x"
23 assumes rep_iso [simp]: "abs\<cdot>(rep\<cdot>y) = y"
26 lemma swap: "iso rep abs"
27 by (rule iso.intro [OF rep_iso abs_iso])
29 lemma abs_less: "(abs\<cdot>x \<sqsubseteq> abs\<cdot>y) = (x \<sqsubseteq> y)"
31 assume "abs\<cdot>x \<sqsubseteq> abs\<cdot>y"
32 then have "rep\<cdot>(abs\<cdot>x) \<sqsubseteq> rep\<cdot>(abs\<cdot>y)" by (rule monofun_cfun_arg)
33 then show "x \<sqsubseteq> y" by simp
35 assume "x \<sqsubseteq> y"
36 then show "abs\<cdot>x \<sqsubseteq> abs\<cdot>y" by (rule monofun_cfun_arg)
39 lemma rep_less: "(rep\<cdot>x \<sqsubseteq> rep\<cdot>y) = (x \<sqsubseteq> y)"
40 by (rule iso.abs_less [OF swap])
42 lemma abs_eq: "(abs\<cdot>x = abs\<cdot>y) = (x = y)"
43 by (simp add: po_eq_conv abs_less)
45 lemma rep_eq: "(rep\<cdot>x = rep\<cdot>y) = (x = y)"
46 by (rule iso.abs_eq [OF swap])
48 lemma abs_strict: "abs\<cdot>\<bottom> = \<bottom>"
50 have "\<bottom> \<sqsubseteq> rep\<cdot>\<bottom>" ..
51 then have "abs\<cdot>\<bottom> \<sqsubseteq> abs\<cdot>(rep\<cdot>\<bottom>)" by (rule monofun_cfun_arg)
52 then have "abs\<cdot>\<bottom> \<sqsubseteq> \<bottom>" by simp
53 then show ?thesis by (rule UU_I)
56 lemma rep_strict: "rep\<cdot>\<bottom> = \<bottom>"
57 by (rule iso.abs_strict [OF swap])
59 lemma abs_defin': "abs\<cdot>x = \<bottom> \<Longrightarrow> x = \<bottom>"
61 have "x = rep\<cdot>(abs\<cdot>x)" by simp
62 also assume "abs\<cdot>x = \<bottom>"
64 finally show "x = \<bottom>" .
67 lemma rep_defin': "rep\<cdot>z = \<bottom> \<Longrightarrow> z = \<bottom>"
68 by (rule iso.abs_defin' [OF swap])
70 lemma abs_defined: "z \<noteq> \<bottom> \<Longrightarrow> abs\<cdot>z \<noteq> \<bottom>"
71 by (erule contrapos_nn, erule abs_defin')
73 lemma rep_defined: "z \<noteq> \<bottom> \<Longrightarrow> rep\<cdot>z \<noteq> \<bottom>"
74 by (rule iso.abs_defined [OF iso.swap]) (rule iso_axioms)
76 lemma abs_defined_iff: "(abs\<cdot>x = \<bottom>) = (x = \<bottom>)"
77 by (auto elim: abs_defin' intro: abs_strict)
79 lemma rep_defined_iff: "(rep\<cdot>x = \<bottom>) = (x = \<bottom>)"
80 by (rule iso.abs_defined_iff [OF iso.swap]) (rule iso_axioms)
82 lemma (in iso) compact_abs_rev: "compact (abs\<cdot>x) \<Longrightarrow> compact x"
83 proof (unfold compact_def)
84 assume "adm (\<lambda>y. \<not> abs\<cdot>x \<sqsubseteq> y)"
86 have "adm (\<lambda>y. \<not> abs\<cdot>x \<sqsubseteq> abs\<cdot>y)" by (rule adm_subst)
87 then show "adm (\<lambda>y. \<not> x \<sqsubseteq> y)" using abs_less by simp
90 lemma compact_rep_rev: "compact (rep\<cdot>x) \<Longrightarrow> compact x"
91 by (rule iso.compact_abs_rev [OF iso.swap]) (rule iso_axioms)
93 lemma compact_abs: "compact x \<Longrightarrow> compact (abs\<cdot>x)"
94 by (rule compact_rep_rev) simp
96 lemma compact_rep: "compact x \<Longrightarrow> compact (rep\<cdot>x)"
97 by (rule iso.compact_abs [OF iso.swap]) (rule iso_axioms)
99 lemma iso_swap: "(x = abs\<cdot>y) = (rep\<cdot>x = y)"
101 assume "x = abs\<cdot>y"
102 then have "rep\<cdot>x = rep\<cdot>(abs\<cdot>y)" by simp
103 then show "rep\<cdot>x = y" by simp
105 assume "rep\<cdot>x = y"
106 then have "abs\<cdot>(rep\<cdot>x) = abs\<cdot>y" by simp
107 then show "x = abs\<cdot>y" by simp
113 subsection {* Casedist *}
115 lemma ex_one_defined_iff:
116 "(\<exists>x. P x \<and> x \<noteq> \<bottom>) = P ONE"
118 apply (rule_tac p=x in oneE)
124 lemma ex_up_defined_iff:
125 "(\<exists>x. P x \<and> x \<noteq> \<bottom>) = (\<exists>x. P (up\<cdot>x))"
127 apply (rule_tac p=x in upE)
130 apply (force intro!: up_defined)
133 lemma ex_sprod_defined_iff:
134 "(\<exists>y. P y \<and> y \<noteq> \<bottom>) =
135 (\<exists>x y. (P (:x, y:) \<and> x \<noteq> \<bottom>) \<and> y \<noteq> \<bottom>)"
137 apply (rule_tac p=y in sprodE)
140 apply (force intro!: spair_defined)
143 lemma ex_sprod_up_defined_iff:
144 "(\<exists>y. P y \<and> y \<noteq> \<bottom>) =
145 (\<exists>x y. P (:up\<cdot>x, y:) \<and> y \<noteq> \<bottom>)"
147 apply (rule_tac p=y in sprodE)
149 apply (rule_tac p=x in upE)
152 apply (force intro!: spair_defined)
155 lemma ex_ssum_defined_iff:
156 "(\<exists>x. P x \<and> x \<noteq> \<bottom>) =
157 ((\<exists>x. P (sinl\<cdot>x) \<and> x \<noteq> \<bottom>) \<or>
158 (\<exists>x. P (sinr\<cdot>x) \<and> x \<noteq> \<bottom>))"
162 apply (rule_tac p=x in ssumE)
164 apply (rule disjI1, fast)
165 apply (rule disjI2, fast)
171 lemma exh_start: "p = \<bottom> \<or> (\<exists>x. p = x \<and> x \<noteq> \<bottom>)"
174 lemmas ex_defined_iffs =
176 ex_sprod_up_defined_iff
181 text {* Rules for turning exh into casedist *}
183 lemma exh_casedist0: "\<lbrakk>R; R \<Longrightarrow> P\<rbrakk> \<Longrightarrow> P" (* like make_elim *)
186 lemma exh_casedist1: "((P \<or> Q \<Longrightarrow> R) \<Longrightarrow> S) \<equiv> (\<lbrakk>P \<Longrightarrow> R; Q \<Longrightarrow> R\<rbrakk> \<Longrightarrow> S)"
189 lemma exh_casedist2: "(\<exists>x. P x \<Longrightarrow> Q) \<equiv> (\<And>x. P x \<Longrightarrow> Q)"
192 lemma exh_casedist3: "(P \<and> Q \<Longrightarrow> R) \<equiv> (P \<Longrightarrow> Q \<Longrightarrow> R)"
195 lemmas exh_casedists = exh_casedist1 exh_casedist2 exh_casedist3