author | blanchet |
Wed, 26 Sep 2012 10:00:59 +0200 | |
changeset 49585 | 5c4a12550491 |
parent 49539 | be6cbf960aa7 |
child 49590 | 43e2d0e10876 |
permissions | -rw-r--r-- |
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 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49539
diff
changeset
|
17 |
lemma eq_sym_Unity_imp: "x = (() = ()) \<Longrightarrow> x" |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49539
diff
changeset
|
18 |
by blast |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49539
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 unit_case_Unity: "(case u of () => f) = f" |
49312 | 21 |
by (cases u) (hypsubst, rule unit.cases) |
22 |
||
49539
be6cbf960aa7
fixed bug in "fold" tactic with nested products (beyond the sum of product corresponding to constructors)
blanchet
parents:
49510
diff
changeset
|
23 |
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
|
24 |
by simp |
be6cbf960aa7
fixed bug in "fold" tactic with nested products (beyond the sum of product corresponding to constructors)
blanchet
parents:
49510
diff
changeset
|
25 |
|
49335 | 26 |
lemma unit_all_impI: "(P () \<Longrightarrow> Q ()) \<Longrightarrow> \<forall>x. P x \<longrightarrow> Q x" |
27 |
by simp |
|
28 |
||
29 |
lemma prod_all_impI: "(\<And>x y. P (x, y) \<Longrightarrow> Q (x, y)) \<Longrightarrow> \<forall>x. P x \<longrightarrow> Q x" |
|
30 |
by clarify |
|
31 |
||
32 |
lemma prod_all_impI_step: "(\<And>x. \<forall>y. P (x, y) \<longrightarrow> Q (x, y)) \<Longrightarrow> \<forall>x. P x \<longrightarrow> Q x" |
|
33 |
by auto |
|
34 |
||
49368 | 35 |
lemma all_unit_eq: "(\<And>x. PROP P x) \<equiv> PROP P ()" |
36 |
by simp |
|
49312 | 37 |
|
49368 | 38 |
lemma all_prod_eq: "(\<And>x. PROP P x) \<equiv> (\<And>a b. PROP P (a, b))" |
39 |
by clarsimp |
|
49312 | 40 |
|
41 |
lemma rev_bspec: "a \<in> A \<Longrightarrow> \<forall>z \<in> A. P z \<Longrightarrow> P a" |
|
42 |
by simp |
|
43 |
||
44 |
lemma Un_cong: "\<lbrakk>A = B; C = D\<rbrakk> \<Longrightarrow> A \<union> C = B \<union> D" |
|
45 |
by simp |
|
46 |
||
47 |
lemma pointfree_idE: "f o g = id \<Longrightarrow> f (g x) = x" |
|
48 |
unfolding o_def fun_eq_iff by simp |
|
49 |
||
50 |
lemma o_bij: |
|
51 |
assumes gf: "g o f = id" and fg: "f o g = id" |
|
52 |
shows "bij f" |
|
53 |
unfolding bij_def inj_on_def surj_def proof safe |
|
54 |
fix a1 a2 assume "f a1 = f a2" |
|
55 |
hence "g ( f a1) = g (f a2)" by simp |
|
56 |
thus "a1 = a2" using gf unfolding fun_eq_iff by simp |
|
57 |
next |
|
58 |
fix b |
|
59 |
have "b = f (g b)" |
|
60 |
using fg unfolding fun_eq_iff by simp |
|
61 |
thus "EX a. b = f a" by blast |
|
62 |
qed |
|
63 |
||
64 |
lemma ssubst_mem: "\<lbrakk>t = s; s \<in> X\<rbrakk> \<Longrightarrow> t \<in> X" by simp |
|
65 |
||
66 |
lemma sum_case_step: |
|
67 |
"sum_case (sum_case f' g') g (Inl p) = sum_case f' g' p" |
|
68 |
"sum_case f (sum_case f' g') (Inr p) = sum_case f' g' p" |
|
69 |
by auto |
|
70 |
||
71 |
lemma one_pointE: "\<lbrakk>\<And>x. s = x \<Longrightarrow> P\<rbrakk> \<Longrightarrow> P" |
|
72 |
by simp |
|
73 |
||
74 |
lemma obj_one_pointE: "\<forall>x. s = x \<longrightarrow> P \<Longrightarrow> P" |
|
75 |
by blast |
|
76 |
||
49325 | 77 |
lemma obj_sumE_f': |
78 |
"\<lbrakk>\<forall>x. s = f (Inl x) \<longrightarrow> P; \<forall>x. s = f (Inr x) \<longrightarrow> P\<rbrakk> \<Longrightarrow> s = f x \<longrightarrow> P" |
|
79 |
by (cases x) blast+ |
|
80 |
||
49312 | 81 |
lemma obj_sumE_f: |
82 |
"\<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 | 83 |
by (rule allI) (rule obj_sumE_f') |
49312 | 84 |
|
85 |
lemma obj_sumE: "\<lbrakk>\<forall>x. s = Inl x \<longrightarrow> P; \<forall>x. s = Inr x \<longrightarrow> P\<rbrakk> \<Longrightarrow> P" |
|
86 |
by (cases s) auto |
|
87 |
||
49325 | 88 |
lemma obj_sum_step': |
89 |
"\<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" |
|
90 |
by (cases x) blast+ |
|
91 |
||
49312 | 92 |
lemma obj_sum_step: |
49325 | 93 |
"\<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" |
94 |
by (rule allI) (rule obj_sum_step') |
|
49312 | 95 |
|
96 |
lemma sum_case_if: |
|
97 |
"sum_case f g (if p then Inl x else Inr y) = (if p then f x else g y)" |
|
98 |
by simp |
|
99 |
||
49428
93f158d59ead
handle the general case with more than two levels of nesting when discharging induction prem prems
blanchet
parents:
49427
diff
changeset
|
100 |
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
|
101 |
by blast |
93f158d59ead
handle the general case with more than two levels of nesting when discharging induction prem prems
blanchet
parents:
49427
diff
changeset
|
102 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49539
diff
changeset
|
103 |
lemma UN_compreh_eq_eq: |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49539
diff
changeset
|
104 |
"\<Union>{y. \<exists>x\<in>A. y = {}} = {}" |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49539
diff
changeset
|
105 |
"\<Union>{y. \<exists>x\<in>A. y = {x}} = A" |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49539
diff
changeset
|
106 |
by blast+ |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49539
diff
changeset
|
107 |
|
49429
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
108 |
lemma prod_set_simps: |
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
109 |
"fsts (x, y) = {x}" |
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
110 |
"snds (x, y) = {y}" |
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
111 |
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
|
112 |
|
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
113 |
lemma sum_set_simps: |
49451
7a28d22c33c6
renamed "sum_setl" to "setl" and similarly for r
blanchet
parents:
49430
diff
changeset
|
114 |
"setl (Inl x) = {x}" |
7a28d22c33c6
renamed "sum_setl" to "setl" and similarly for r
blanchet
parents:
49430
diff
changeset
|
115 |
"setl (Inr x) = {}" |
7a28d22c33c6
renamed "sum_setl" to "setl" and similarly for r
blanchet
parents:
49430
diff
changeset
|
116 |
"setr (Inl x) = {}" |
7a28d22c33c6
renamed "sum_setl" to "setl" and similarly for r
blanchet
parents:
49430
diff
changeset
|
117 |
"setr (Inr x) = {x}" |
7a28d22c33c6
renamed "sum_setl" to "setl" and similarly for r
blanchet
parents:
49430
diff
changeset
|
118 |
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
|
119 |
|
49457 | 120 |
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
|
121 |
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
|
122 |
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
|
123 |
|
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
diff
changeset
|
124 |
end |