src/HOL/BNF_FP_Base.thy
author blanchet
Sun Feb 23 22:51:11 2014 +0100 (2014-02-23)
changeset 55702 63c80031d8dd
parent 55700 cf6a029b28d8
child 55803 74d3fe9031d8
permissions -rw-r--r--
improved accounting for dead variables when naming set functions (refines d71c2737ee21)
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
blanchet@49312
    67
lemma obj_sumE_f:
blanchet@49312
    68
"\<lbrakk>\<forall>x. s = f (Inl x) \<longrightarrow> P; \<forall>x. s = f (Inr x) \<longrightarrow> P\<rbrakk> \<Longrightarrow> \<forall>x. s = f x \<longrightarrow> P"
traytel@52660
    69
by (rule allI) (metis sumE)
blanchet@49312
    70
blanchet@49312
    71
lemma obj_sumE: "\<lbrakk>\<forall>x. s = Inl x \<longrightarrow> P; \<forall>x. s = Inr x \<longrightarrow> P\<rbrakk> \<Longrightarrow> P"
blanchet@49312
    72
by (cases s) auto
blanchet@49312
    73
blanchet@55414
    74
lemma case_sum_if:
blanchet@55414
    75
"case_sum f g (if p then Inl x else Inr y) = (if p then f x else g y)"
blanchet@49312
    76
by simp
blanchet@49312
    77
blanchet@49428
    78
lemma mem_UN_compreh_eq: "(z : \<Union>{y. \<exists>x\<in>A. y = F x}) = (\<exists>x\<in>A. z : F x)"
blanchet@49428
    79
by blast
blanchet@49428
    80
blanchet@49585
    81
lemma UN_compreh_eq_eq:
blanchet@49585
    82
"\<Union>{y. \<exists>x\<in>A. y = {}} = {}"
blanchet@49585
    83
"\<Union>{y. \<exists>x\<in>A. y = {x}} = A"
blanchet@49585
    84
by blast+
blanchet@49585
    85
blanchet@51745
    86
lemma Inl_Inr_False: "(Inl x = Inr y) = False"
blanchet@51745
    87
by simp
blanchet@51745
    88
blanchet@49429
    89
lemma prod_set_simps:
blanchet@49429
    90
"fsts (x, y) = {x}"
blanchet@49429
    91
"snds (x, y) = {y}"
blanchet@49429
    92
unfolding fsts_def snds_def by simp+
blanchet@49429
    93
blanchet@49429
    94
lemma sum_set_simps:
blanchet@49451
    95
"setl (Inl x) = {x}"
blanchet@49451
    96
"setl (Inr x) = {}"
blanchet@49451
    97
"setr (Inl x) = {}"
blanchet@49451
    98
"setr (Inr x) = {x}"
blanchet@49451
    99
unfolding sum_set_defs by simp+
blanchet@49429
   100
traytel@52505
   101
lemma spec2: "\<forall>x y. P x y \<Longrightarrow> P x y"
traytel@52505
   102
by blast
traytel@52505
   103
traytel@52913
   104
lemma rewriteR_comp_comp: "\<lbrakk>g o h = r\<rbrakk> \<Longrightarrow> f o g o h = f o r"
blanchet@55066
   105
  unfolding comp_def fun_eq_iff by auto
traytel@52913
   106
traytel@52913
   107
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
   108
  unfolding comp_def fun_eq_iff by auto
traytel@52913
   109
traytel@52913
   110
lemma rewriteL_comp_comp: "\<lbrakk>f o g = l\<rbrakk> \<Longrightarrow> f o (g o h) = l o h"
blanchet@55066
   111
  unfolding comp_def fun_eq_iff by auto
traytel@52913
   112
traytel@52913
   113
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
   114
  unfolding comp_def fun_eq_iff by auto
traytel@52913
   115
traytel@52913
   116
lemma convol_o: "<f, g> o h = <f o h, g o h>"
traytel@52913
   117
  unfolding convol_def by auto
traytel@52913
   118
traytel@52913
   119
lemma map_pair_o_convol: "map_pair h1 h2 o <f, g> = <h1 o f, h2 o g>"
traytel@52913
   120
  unfolding convol_def by auto
traytel@52913
   121
traytel@52913
   122
lemma map_pair_o_convol_id: "(map_pair f id \<circ> <id , g>) x = <id \<circ> f , g> x"
blanchet@55066
   123
  unfolding map_pair_o_convol id_comp comp_id ..
traytel@52913
   124
blanchet@55414
   125
lemma o_case_sum: "h o case_sum f g = case_sum (h o f) (h o g)"
blanchet@55066
   126
  unfolding comp_def by (auto split: sum.splits)
traytel@52913
   127
blanchet@55414
   128
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
   129
  unfolding comp_def by (auto split: sum.splits)
traytel@52913
   130
blanchet@55414
   131
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
   132
  unfolding case_sum_o_sum_map id_comp comp_id ..
traytel@52913
   133
traytel@52731
   134
lemma fun_rel_def_butlast:
traytel@52731
   135
  "(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
   136
  unfolding fun_rel_def ..
traytel@52731
   137
traytel@53105
   138
lemma subst_eq_imp: "(\<forall>a b. a = b \<longrightarrow> P a b) \<equiv> (\<forall>a. P a a)"
traytel@53105
   139
  by auto
traytel@53105
   140
traytel@53105
   141
lemma eq_subset: "op = \<le> (\<lambda>a b. P a b \<or> a = b)"
traytel@53105
   142
  by auto
traytel@53105
   143
blanchet@53308
   144
lemma eq_le_Grp_id_iff: "(op = \<le> Grp (Collect R) id) = (All R)"
blanchet@53308
   145
  unfolding Grp_def id_apply by blast
blanchet@53308
   146
blanchet@53308
   147
lemma Grp_id_mono_subst: "(\<And>x y. Grp P id x y \<Longrightarrow> Grp Q id (f x) (f y)) \<equiv>
blanchet@53308
   148
   (\<And>x. x \<in> P \<Longrightarrow> f x \<in> Q)"
blanchet@53308
   149
  unfolding Grp_def by rule auto
blanchet@53308
   150
blanchet@55062
   151
ML_file "Tools/BNF/bnf_fp_util.ML"
blanchet@55062
   152
ML_file "Tools/BNF/bnf_fp_def_sugar_tactics.ML"
blanchet@55062
   153
ML_file "Tools/BNF/bnf_fp_def_sugar.ML"
blanchet@55062
   154
ML_file "Tools/BNF/bnf_fp_n2m_tactics.ML"
blanchet@55062
   155
ML_file "Tools/BNF/bnf_fp_n2m.ML"
blanchet@55062
   156
ML_file "Tools/BNF/bnf_fp_n2m_sugar.ML"
blanchet@55702
   157
blanchet@49308
   158
end