src/HOL/BNF_FP_Base.thy
author traytel
Fri Feb 28 17:54:52 2014 +0100 (2014-02-28)
changeset 55811 aa1acc25126b
parent 55803 74d3fe9031d8
child 55854 ee270328a781
permissions -rw-r--r--
load Metis a little later
blanchet@55059
     1
(*  Title:      HOL/BNF_FP_Base.thy
blanchet@53311
     2
    Author:     Lorenz Panny, TU Muenchen
blanchet@49308
     3
    Author:     Dmitriy Traytel, TU Muenchen
blanchet@49308
     4
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@53311
     5
    Copyright   2012, 2013
blanchet@49308
     6
blanchet@55059
     7
Shared fixed point operations on bounded natural functors.
blanchet@49308
     8
*)
blanchet@49308
     9
blanchet@53311
    10
header {* Shared Fixed Point Operations on Bounded Natural Functors *}
blanchet@49308
    11
blanchet@53311
    12
theory BNF_FP_Base
blanchet@55083
    13
imports BNF_Comp
blanchet@49308
    14
begin
blanchet@49308
    15
blanchet@49590
    16
lemma mp_conj: "(P \<longrightarrow> Q) \<and> R \<Longrightarrow> P \<Longrightarrow> R \<and> Q"
blanchet@49590
    17
by auto
blanchet@49590
    18
blanchet@49591
    19
lemma eq_sym_Unity_conv: "(x = (() = ())) = x"
blanchet@49585
    20
by blast
blanchet@49585
    21
blanchet@55414
    22
lemma case_unit_Unity: "(case u of () \<Rightarrow> f) = f"
blanchet@55642
    23
by (cases u) (hypsubst, rule unit.case)
blanchet@49312
    24
blanchet@55414
    25
lemma case_prod_Pair_iden: "(case p of (x, y) \<Rightarrow> (x, y)) = p"
blanchet@49539
    26
by simp
blanchet@49539
    27
blanchet@49335
    28
lemma unit_all_impI: "(P () \<Longrightarrow> Q ()) \<Longrightarrow> \<forall>x. P x \<longrightarrow> Q x"
blanchet@49335
    29
by simp
blanchet@49335
    30
blanchet@49335
    31
lemma prod_all_impI: "(\<And>x y. P (x, y) \<Longrightarrow> Q (x, y)) \<Longrightarrow> \<forall>x. P x \<longrightarrow> Q x"
blanchet@49335
    32
by clarify
blanchet@49335
    33
blanchet@49335
    34
lemma prod_all_impI_step: "(\<And>x. \<forall>y. P (x, y) \<longrightarrow> Q (x, y)) \<Longrightarrow> \<forall>x. P x \<longrightarrow> Q x"
blanchet@49335
    35
by auto
blanchet@49335
    36
blanchet@49683
    37
lemma pointfree_idE: "f \<circ> g = id \<Longrightarrow> f (g x) = x"
blanchet@55066
    38
unfolding comp_def fun_eq_iff by simp
blanchet@49312
    39
blanchet@49312
    40
lemma o_bij:
blanchet@49683
    41
  assumes gf: "g \<circ> f = id" and fg: "f \<circ> g = id"
blanchet@49312
    42
  shows "bij f"
blanchet@49312
    43
unfolding bij_def inj_on_def surj_def proof safe
blanchet@49312
    44
  fix a1 a2 assume "f a1 = f a2"
blanchet@49312
    45
  hence "g ( f a1) = g (f a2)" by simp
blanchet@49312
    46
  thus "a1 = a2" using gf unfolding fun_eq_iff by simp
blanchet@49312
    47
next
blanchet@49312
    48
  fix b
blanchet@49312
    49
  have "b = f (g b)"
blanchet@49312
    50
  using fg unfolding fun_eq_iff by simp
blanchet@49312
    51
  thus "EX a. b = f a" by blast
blanchet@49312
    52
qed
blanchet@49312
    53
blanchet@49312
    54
lemma ssubst_mem: "\<lbrakk>t = s; s \<in> X\<rbrakk> \<Longrightarrow> t \<in> X" by simp
blanchet@49312
    55
blanchet@55414
    56
lemma case_sum_step:
blanchet@55414
    57
"case_sum (case_sum f' g') g (Inl p) = case_sum f' g' p"
blanchet@55414
    58
"case_sum f (case_sum f' g') (Inr p) = case_sum f' g' p"
blanchet@49312
    59
by auto
blanchet@49312
    60
blanchet@49312
    61
lemma one_pointE: "\<lbrakk>\<And>x. s = x \<Longrightarrow> P\<rbrakk> \<Longrightarrow> P"
blanchet@49312
    62
by simp
blanchet@49312
    63
blanchet@49312
    64
lemma obj_one_pointE: "\<forall>x. s = x \<longrightarrow> P \<Longrightarrow> P"
blanchet@49312
    65
by blast
blanchet@49312
    66
traytel@55803
    67
lemma type_copy_obj_one_point_absE:
traytel@55811
    68
  assumes "type_definition Rep Abs UNIV" "\<forall>x. s = Abs x \<longrightarrow> P" shows P
traytel@55811
    69
  using type_definition.Rep_inverse[OF assms(1)]
traytel@55811
    70
  by (intro mp[OF spec[OF assms(2), of "Rep s"]]) simp
traytel@55803
    71
blanchet@49312
    72
lemma obj_sumE_f:
traytel@55811
    73
  assumes "\<forall>x. s = f (Inl x) \<longrightarrow> P" "\<forall>x. s = f (Inr x) \<longrightarrow> P"
traytel@55811
    74
  shows "\<forall>x. s = f x \<longrightarrow> P"
traytel@55811
    75
proof
traytel@55811
    76
  fix x from assms show "s = f x \<longrightarrow> P" by (cases x) auto
traytel@55811
    77
qed
blanchet@49312
    78
blanchet@49312
    79
lemma obj_sumE: "\<lbrakk>\<forall>x. s = Inl x \<longrightarrow> P; \<forall>x. s = Inr x \<longrightarrow> P\<rbrakk> \<Longrightarrow> P"
blanchet@49312
    80
by (cases s) auto
blanchet@49312
    81
blanchet@55414
    82
lemma case_sum_if:
blanchet@55414
    83
"case_sum f g (if p then Inl x else Inr y) = (if p then f x else g y)"
blanchet@49312
    84
by simp
blanchet@49312
    85
blanchet@49428
    86
lemma mem_UN_compreh_eq: "(z : \<Union>{y. \<exists>x\<in>A. y = F x}) = (\<exists>x\<in>A. z : F x)"
blanchet@49428
    87
by blast
blanchet@49428
    88
blanchet@49585
    89
lemma UN_compreh_eq_eq:
blanchet@49585
    90
"\<Union>{y. \<exists>x\<in>A. y = {}} = {}"
blanchet@49585
    91
"\<Union>{y. \<exists>x\<in>A. y = {x}} = A"
blanchet@49585
    92
by blast+
blanchet@49585
    93
blanchet@51745
    94
lemma Inl_Inr_False: "(Inl x = Inr y) = False"
blanchet@51745
    95
by simp
blanchet@51745
    96
blanchet@49429
    97
lemma prod_set_simps:
blanchet@49429
    98
"fsts (x, y) = {x}"
blanchet@49429
    99
"snds (x, y) = {y}"
blanchet@49429
   100
unfolding fsts_def snds_def by simp+
blanchet@49429
   101
blanchet@49429
   102
lemma sum_set_simps:
blanchet@49451
   103
"setl (Inl x) = {x}"
blanchet@49451
   104
"setl (Inr x) = {}"
blanchet@49451
   105
"setr (Inl x) = {}"
blanchet@49451
   106
"setr (Inr x) = {x}"
blanchet@49451
   107
unfolding sum_set_defs by simp+
blanchet@49429
   108
traytel@52505
   109
lemma spec2: "\<forall>x y. P x y \<Longrightarrow> P x y"
traytel@52505
   110
by blast
traytel@52505
   111
traytel@52913
   112
lemma rewriteR_comp_comp: "\<lbrakk>g o h = r\<rbrakk> \<Longrightarrow> f o g o h = f o r"
blanchet@55066
   113
  unfolding comp_def fun_eq_iff by auto
traytel@52913
   114
traytel@52913
   115
lemma rewriteR_comp_comp2: "\<lbrakk>g o h = r1 o r2; f o r1 = l\<rbrakk> \<Longrightarrow> f o g o h = l o r2"
blanchet@55066
   116
  unfolding comp_def fun_eq_iff by auto
traytel@52913
   117
traytel@52913
   118
lemma rewriteL_comp_comp: "\<lbrakk>f o g = l\<rbrakk> \<Longrightarrow> f o (g o h) = l o h"
blanchet@55066
   119
  unfolding comp_def fun_eq_iff by auto
traytel@52913
   120
traytel@52913
   121
lemma rewriteL_comp_comp2: "\<lbrakk>f o g = l1 o l2; l2 o h = r\<rbrakk> \<Longrightarrow> f o (g o h) = l1 o r"
blanchet@55066
   122
  unfolding comp_def fun_eq_iff by auto
traytel@52913
   123
traytel@52913
   124
lemma convol_o: "<f, g> o h = <f o h, g o h>"
traytel@52913
   125
  unfolding convol_def by auto
traytel@52913
   126
traytel@52913
   127
lemma map_pair_o_convol: "map_pair h1 h2 o <f, g> = <h1 o f, h2 o g>"
traytel@52913
   128
  unfolding convol_def by auto
traytel@52913
   129
traytel@52913
   130
lemma map_pair_o_convol_id: "(map_pair f id \<circ> <id , g>) x = <id \<circ> f , g> x"
blanchet@55066
   131
  unfolding map_pair_o_convol id_comp comp_id ..
traytel@52913
   132
blanchet@55414
   133
lemma o_case_sum: "h o case_sum f g = case_sum (h o f) (h o g)"
blanchet@55066
   134
  unfolding comp_def by (auto split: sum.splits)
traytel@52913
   135
blanchet@55414
   136
lemma case_sum_o_sum_map: "case_sum f g o sum_map h1 h2 = case_sum (f o h1) (g o h2)"
blanchet@55066
   137
  unfolding comp_def by (auto split: sum.splits)
traytel@52913
   138
blanchet@55414
   139
lemma case_sum_o_sum_map_id: "(case_sum id g o sum_map f id) x = case_sum (f o id) g x"
blanchet@55414
   140
  unfolding case_sum_o_sum_map id_comp comp_id ..
traytel@52913
   141
traytel@52731
   142
lemma fun_rel_def_butlast:
traytel@55803
   143
  "fun_rel R (fun_rel S T) f g = (\<forall>x y. R x y \<longrightarrow> (fun_rel S T) (f x) (g y))"
traytel@52731
   144
  unfolding fun_rel_def ..
traytel@52731
   145
traytel@53105
   146
lemma subst_eq_imp: "(\<forall>a b. a = b \<longrightarrow> P a b) \<equiv> (\<forall>a. P a a)"
traytel@53105
   147
  by auto
traytel@53105
   148
traytel@53105
   149
lemma eq_subset: "op = \<le> (\<lambda>a b. P a b \<or> a = b)"
traytel@53105
   150
  by auto
traytel@53105
   151
blanchet@53308
   152
lemma eq_le_Grp_id_iff: "(op = \<le> Grp (Collect R) id) = (All R)"
blanchet@53308
   153
  unfolding Grp_def id_apply by blast
blanchet@53308
   154
blanchet@53308
   155
lemma Grp_id_mono_subst: "(\<And>x y. Grp P id x y \<Longrightarrow> Grp Q id (f x) (f y)) \<equiv>
blanchet@53308
   156
   (\<And>x. x \<in> P \<Longrightarrow> f x \<in> Q)"
blanchet@53308
   157
  unfolding Grp_def by rule auto
blanchet@53308
   158
traytel@55803
   159
lemma vimage2p_mono: "vimage2p f g R x y \<Longrightarrow> R \<le> S \<Longrightarrow> vimage2p f g S x y"
traytel@55803
   160
  unfolding vimage2p_def by blast
traytel@55803
   161
traytel@55803
   162
lemma vimage2p_refl: "(\<And>x. R x x) \<Longrightarrow> vimage2p f f R x x"
traytel@55803
   163
  unfolding vimage2p_def by auto
traytel@55803
   164
traytel@55803
   165
lemma
traytel@55803
   166
  assumes "type_definition Rep Abs UNIV"
traytel@55803
   167
  shows type_copy_Rep_o_Abs: "Rep \<circ> Abs = id" and type_copy_Abs_o_Rep: "Abs o Rep = id"
traytel@55803
   168
  unfolding fun_eq_iff comp_apply id_apply
traytel@55803
   169
    type_definition.Abs_inverse[OF assms UNIV_I] type_definition.Rep_inverse[OF assms] by simp_all
traytel@55803
   170
traytel@55803
   171
lemma type_copy_map_comp0_undo:
traytel@55803
   172
  assumes "type_definition Rep Abs UNIV"
traytel@55803
   173
          "type_definition Rep' Abs' UNIV"
traytel@55803
   174
          "type_definition Rep'' Abs'' UNIV"
traytel@55803
   175
  shows "Abs' o M o Rep'' = (Abs' o M1 o Rep) o (Abs o M2 o Rep'') \<Longrightarrow> M1 o M2 = M"
traytel@55803
   176
  by (rule sym) (auto simp: fun_eq_iff type_definition.Abs_inject[OF assms(2) UNIV_I UNIV_I]
traytel@55803
   177
    type_definition.Abs_inverse[OF assms(1) UNIV_I]
traytel@55803
   178
    type_definition.Abs_inverse[OF assms(3) UNIV_I] dest: spec[of _ "Abs'' x" for x])
traytel@55803
   179
traytel@55803
   180
lemma vimage2p_comp: "vimage2p (f1 o f2) (g1 o g2) = vimage2p f2 g2 o vimage2p f1 g1"
traytel@55803
   181
  unfolding fun_eq_iff vimage2p_def o_apply by simp
traytel@55803
   182
blanchet@55062
   183
ML_file "Tools/BNF/bnf_fp_util.ML"
blanchet@55062
   184
ML_file "Tools/BNF/bnf_fp_def_sugar_tactics.ML"
blanchet@55062
   185
ML_file "Tools/BNF/bnf_fp_def_sugar.ML"
blanchet@55062
   186
ML_file "Tools/BNF/bnf_fp_n2m_tactics.ML"
blanchet@55062
   187
ML_file "Tools/BNF/bnf_fp_n2m.ML"
blanchet@55062
   188
ML_file "Tools/BNF/bnf_fp_n2m_sugar.ML"
blanchet@55702
   189
blanchet@49308
   190
end