src/HOL/BNF/BNF_FP.thy
author blanchet
Sun, 23 Sep 2012 14:52:53 +0200
changeset 49539 be6cbf960aa7
parent 49510 ba50d204095e
child 49585 5c4a12550491
permissions -rw-r--r--
fixed bug in "fold" tactic with nested products (beyond the sum of product corresponding to constructors)
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
49509
163914705f8d renamed top-level theory from "Codatatype" to "BNF"
blanchet
parents: 49495
diff changeset
     1
(*  Title:      HOL/BNF/BNF_FP.thy
49308
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
     2
    Author:     Dmitriy Traytel, TU Muenchen
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
     3
    Author:     Jasmin Blanchette, TU Muenchen
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
     4
    Copyright   2012
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
     5
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
     6
Composition of bounded natural functors.
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
     7
*)
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
     8
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
     9
header {* Composition of Bounded Natural Functors *}
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
    10
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
    11
theory BNF_FP
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
    12
imports BNF_Comp BNF_Wrap
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
    13
keywords
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
    14
  "defaults"
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
    15
begin
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
    16
49539
be6cbf960aa7 fixed bug in "fold" tactic with nested products (beyond the sum of product corresponding to constructors)
blanchet
parents: 49510
diff changeset
    17
lemma unit_case_Unity: "(case u of () => f) = f"
49312
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    18
by (cases u) (hypsubst, rule unit.cases)
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    19
49539
be6cbf960aa7 fixed bug in "fold" tactic with nested products (beyond the sum of product corresponding to constructors)
blanchet
parents: 49510
diff changeset
    20
lemma prod_case_Pair_iden: "(case p of (x, y) \<Rightarrow> (x, y)) = p"
be6cbf960aa7 fixed bug in "fold" tactic with nested products (beyond the sum of product corresponding to constructors)
blanchet
parents: 49510
diff changeset
    21
by simp
be6cbf960aa7 fixed bug in "fold" tactic with nested products (beyond the sum of product corresponding to constructors)
blanchet
parents: 49510
diff changeset
    22
49335
096967bf3940 added sumEN_tupled_balanced
blanchet
parents: 49325
diff changeset
    23
lemma unit_all_impI: "(P () \<Longrightarrow> Q ()) \<Longrightarrow> \<forall>x. P x \<longrightarrow> Q x"
096967bf3940 added sumEN_tupled_balanced
blanchet
parents: 49325
diff changeset
    24
by simp
096967bf3940 added sumEN_tupled_balanced
blanchet
parents: 49325
diff changeset
    25
096967bf3940 added sumEN_tupled_balanced
blanchet
parents: 49325
diff changeset
    26
lemma prod_all_impI: "(\<And>x y. P (x, y) \<Longrightarrow> Q (x, y)) \<Longrightarrow> \<forall>x. P x \<longrightarrow> Q x"
096967bf3940 added sumEN_tupled_balanced
blanchet
parents: 49325
diff changeset
    27
by clarify
096967bf3940 added sumEN_tupled_balanced
blanchet
parents: 49325
diff changeset
    28
096967bf3940 added sumEN_tupled_balanced
blanchet
parents: 49325
diff changeset
    29
lemma prod_all_impI_step: "(\<And>x. \<forall>y. P (x, y) \<longrightarrow> Q (x, y)) \<Longrightarrow> \<forall>x. P x \<longrightarrow> Q x"
096967bf3940 added sumEN_tupled_balanced
blanchet
parents: 49325
diff changeset
    30
by auto
096967bf3940 added sumEN_tupled_balanced
blanchet
parents: 49325
diff changeset
    31
49368
df359ce891ac added induct tactic
blanchet
parents: 49335
diff changeset
    32
lemma all_unit_eq: "(\<And>x. PROP P x) \<equiv> PROP P ()"
df359ce891ac added induct tactic
blanchet
parents: 49335
diff changeset
    33
by simp
49312
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    34
49368
df359ce891ac added induct tactic
blanchet
parents: 49335
diff changeset
    35
lemma all_prod_eq: "(\<And>x. PROP P x) \<equiv> (\<And>a b. PROP P (a, b))"
df359ce891ac added induct tactic
blanchet
parents: 49335
diff changeset
    36
by clarsimp
49312
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    37
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    38
lemma rev_bspec: "a \<in> A \<Longrightarrow> \<forall>z \<in> A. P z \<Longrightarrow> P a"
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    39
by simp
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    40
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    41
lemma Un_cong: "\<lbrakk>A = B; C = D\<rbrakk> \<Longrightarrow> A \<union> C = B \<union> D"
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    42
by simp
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    43
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    44
lemma pointfree_idE: "f o g = id \<Longrightarrow> f (g x) = x"
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    45
unfolding o_def fun_eq_iff by simp
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    46
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    47
lemma o_bij:
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    48
  assumes gf: "g o f = id" and fg: "f o g = id"
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    49
  shows "bij f"
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    50
unfolding bij_def inj_on_def surj_def proof safe
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    51
  fix a1 a2 assume "f a1 = f a2"
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    52
  hence "g ( f a1) = g (f a2)" by simp
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    53
  thus "a1 = a2" using gf unfolding fun_eq_iff by simp
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    54
next
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    55
  fix b
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    56
  have "b = f (g b)"
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    57
  using fg unfolding fun_eq_iff by simp
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    58
  thus "EX a. b = f a" by blast
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    59
qed
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    60
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    61
lemma ssubst_mem: "\<lbrakk>t = s; s \<in> X\<rbrakk> \<Longrightarrow> t \<in> X" by simp
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    62
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    63
lemma sum_case_step:
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    64
  "sum_case (sum_case f' g') g (Inl p) = sum_case f' g' p"
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    65
  "sum_case f (sum_case f' g') (Inr p) = sum_case f' g' p"
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    66
by auto
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    67
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    68
lemma one_pointE: "\<lbrakk>\<And>x. s = x \<Longrightarrow> P\<rbrakk> \<Longrightarrow> P"
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    69
by simp
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    70
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    71
lemma obj_one_pointE: "\<forall>x. s = x \<longrightarrow> P \<Longrightarrow> P"
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    72
by blast
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    73
49325
blanchet
parents: 49312
diff changeset
    74
lemma obj_sumE_f':
blanchet
parents: 49312
diff changeset
    75
"\<lbrakk>\<forall>x. s = f (Inl x) \<longrightarrow> P; \<forall>x. s = f (Inr x) \<longrightarrow> P\<rbrakk> \<Longrightarrow> s = f x \<longrightarrow> P"
blanchet
parents: 49312
diff changeset
    76
by (cases x) blast+
blanchet
parents: 49312
diff changeset
    77
49312
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    78
lemma obj_sumE_f:
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    79
"\<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"
49325
blanchet
parents: 49312
diff changeset
    80
by (rule allI) (rule obj_sumE_f')
49312
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    81
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    82
lemma obj_sumE: "\<lbrakk>\<forall>x. s = Inl x \<longrightarrow> P; \<forall>x. s = Inr x \<longrightarrow> P\<rbrakk> \<Longrightarrow> P"
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    83
by (cases s) auto
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    84
49325
blanchet
parents: 49312
diff changeset
    85
lemma obj_sum_step':
blanchet
parents: 49312
diff changeset
    86
"\<lbrakk>\<forall>x. s = f (Inr (Inl x)) \<longrightarrow> P; \<forall>x. s = f (Inr (Inr x)) \<longrightarrow> P\<rbrakk> \<Longrightarrow> s = f (Inr x) \<longrightarrow> P"
blanchet
parents: 49312
diff changeset
    87
by (cases x) blast+
blanchet
parents: 49312
diff changeset
    88
49312
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    89
lemma obj_sum_step:
49325
blanchet
parents: 49312
diff changeset
    90
"\<lbrakk>\<forall>x. s = f (Inr (Inl x)) \<longrightarrow> P; \<forall>x. s = f (Inr (Inr x)) \<longrightarrow> P\<rbrakk> \<Longrightarrow> \<forall>x. s = f (Inr x) \<longrightarrow> P"
blanchet
parents: 49312
diff changeset
    91
by (rule allI) (rule obj_sum_step')
49312
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    92
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    93
lemma sum_case_if:
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    94
"sum_case f g (if p then Inl x else Inr y) = (if p then f x else g y)"
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    95
by simp
c874ff5658dc moved theorems closer to where they are used
blanchet
parents: 49309
diff changeset
    96
49428
93f158d59ead handle the general case with more than two levels of nesting when discharging induction prem prems
blanchet
parents: 49427
diff changeset
    97
lemma mem_UN_compreh_eq: "(z : \<Union>{y. \<exists>x\<in>A. y = F x}) = (\<exists>x\<in>A. z : F x)"
93f158d59ead handle the general case with more than two levels of nesting when discharging induction prem prems
blanchet
parents: 49427
diff changeset
    98
by blast
93f158d59ead handle the general case with more than two levels of nesting when discharging induction prem prems
blanchet
parents: 49427
diff changeset
    99
49429
64ac3471005a cleaner way of dealing with the set functions of sums and products
blanchet
parents: 49428
diff changeset
   100
lemma prod_set_simps:
64ac3471005a cleaner way of dealing with the set functions of sums and products
blanchet
parents: 49428
diff changeset
   101
"fsts (x, y) = {x}"
64ac3471005a cleaner way of dealing with the set functions of sums and products
blanchet
parents: 49428
diff changeset
   102
"snds (x, y) = {y}"
64ac3471005a cleaner way of dealing with the set functions of sums and products
blanchet
parents: 49428
diff changeset
   103
unfolding fsts_def snds_def by simp+
64ac3471005a cleaner way of dealing with the set functions of sums and products
blanchet
parents: 49428
diff changeset
   104
64ac3471005a cleaner way of dealing with the set functions of sums and products
blanchet
parents: 49428
diff changeset
   105
lemma sum_set_simps:
49451
7a28d22c33c6 renamed "sum_setl" to "setl" and similarly for r
blanchet
parents: 49430
diff changeset
   106
"setl (Inl x) = {x}"
7a28d22c33c6 renamed "sum_setl" to "setl" and similarly for r
blanchet
parents: 49430
diff changeset
   107
"setl (Inr x) = {}"
7a28d22c33c6 renamed "sum_setl" to "setl" and similarly for r
blanchet
parents: 49430
diff changeset
   108
"setr (Inl x) = {}"
7a28d22c33c6 renamed "sum_setl" to "setl" and similarly for r
blanchet
parents: 49430
diff changeset
   109
"setr (Inr x) = {x}"
7a28d22c33c6 renamed "sum_setl" to "setl" and similarly for r
blanchet
parents: 49430
diff changeset
   110
unfolding sum_set_defs by simp+
49429
64ac3471005a cleaner way of dealing with the set functions of sums and products
blanchet
parents: 49428
diff changeset
   111
49457
1d2825673cec renamed "bnf_fp_util.ML" to "bnf_fp.ML"
blanchet
parents: 49451
diff changeset
   112
ML_file "Tools/bnf_fp.ML"
49309
f20b24214ac2 split basic BNFs into really basic ones and others, and added Andreas Lochbihler's "option" BNF
blanchet
parents: 49308
diff changeset
   113
ML_file "Tools/bnf_fp_sugar_tactics.ML"
f20b24214ac2 split basic BNFs into really basic ones and others, and added Andreas Lochbihler's "option" BNF
blanchet
parents: 49308
diff changeset
   114
ML_file "Tools/bnf_fp_sugar.ML"
f20b24214ac2 split basic BNFs into really basic ones and others, and added Andreas Lochbihler's "option" BNF
blanchet
parents: 49308
diff changeset
   115
49308
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff changeset
   116
end