author | haftmann |
Sun, 06 Sep 2015 22:14:51 +0200 | |
changeset 61126 | e6b1236f9b3d |
parent 61125 | 4c68426800de |
child 61127 | 76cd7f1ec257 |
permissions | -rw-r--r-- |
58469 | 1 |
(* Title: HOL/Product_Type.thy |
10213 | 2 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
3 |
Copyright 1992 University of Cambridge |
|
11777 | 4 |
*) |
10213 | 5 |
|
60758 | 6 |
section \<open>Cartesian products\<close> |
10213 | 7 |
|
15131 | 8 |
theory Product_Type |
33959
2afc55e8ed27
bootstrap datatype_rep_proofs in Datatype.thy (avoids unchecked dynamic name references)
haftmann
parents:
33638
diff
changeset
|
9 |
imports Typedef Inductive Fun |
46950
d0181abdbdac
declare command keywords via theory header, including strict checking outside Pure;
wenzelm
parents:
46630
diff
changeset
|
10 |
keywords "inductive_set" "coinductive_set" :: thy_decl |
15131 | 11 |
begin |
11838 | 12 |
|
60758 | 13 |
subsection \<open>@{typ bool} is a datatype\<close> |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
14 |
|
57091 | 15 |
free_constructors case_bool for True | False |
58189
9d714be4f028
added 'plugins' option to control which hooks are enabled
blanchet
parents:
57983
diff
changeset
|
16 |
by auto |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
17 |
|
60758 | 18 |
text \<open>Avoid name clashes by prefixing the output of @{text old_rep_datatype} with @{text old}.\<close> |
55442 | 19 |
|
60758 | 20 |
setup \<open>Sign.mandatory_path "old"\<close> |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
21 |
|
58306
117ba6cbe414
renamed 'rep_datatype' to 'old_rep_datatype' (HOL)
blanchet
parents:
58292
diff
changeset
|
22 |
old_rep_datatype True False by (auto intro: bool_induct) |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
23 |
|
60758 | 24 |
setup \<open>Sign.parent_path\<close> |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
25 |
|
60758 | 26 |
text \<open>But erase the prefix for properties that are not generated by @{text free_constructors}.\<close> |
55442 | 27 |
|
60758 | 28 |
setup \<open>Sign.mandatory_path "bool"\<close> |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
29 |
|
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
30 |
lemmas induct = old.bool.induct |
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
31 |
lemmas inducts = old.bool.inducts |
55642
63beb38e9258
adapted to renaming of datatype 'cases' and 'recs' to 'case' and 'rec'
blanchet
parents:
55469
diff
changeset
|
32 |
lemmas rec = old.bool.rec |
63beb38e9258
adapted to renaming of datatype 'cases' and 'recs' to 'case' and 'rec'
blanchet
parents:
55469
diff
changeset
|
33 |
lemmas simps = bool.distinct bool.case bool.rec |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
34 |
|
60758 | 35 |
setup \<open>Sign.parent_path\<close> |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
36 |
|
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
37 |
declare case_split [cases type: bool] |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
38 |
-- "prefer plain propositional version" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
39 |
|
28346
b8390cd56b8f
discontinued special treatment of op = vs. eq_class.eq
haftmann
parents:
28262
diff
changeset
|
40 |
lemma |
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
41 |
shows [code]: "HOL.equal False P \<longleftrightarrow> \<not> P" |
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
42 |
and [code]: "HOL.equal True P \<longleftrightarrow> P" |
46630 | 43 |
and [code]: "HOL.equal P False \<longleftrightarrow> \<not> P" |
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
44 |
and [code]: "HOL.equal P True \<longleftrightarrow> P" |
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
45 |
and [code nbe]: "HOL.equal P P \<longleftrightarrow> True" |
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
46 |
by (simp_all add: equal) |
25534
d0b74fdd6067
simplified infrastructure for code generator operational equality
haftmann
parents:
25511
diff
changeset
|
47 |
|
43654
3f1a44c2d645
install case certificate for If after code_datatype declaration for bool
haftmann
parents:
43595
diff
changeset
|
48 |
lemma If_case_cert: |
3f1a44c2d645
install case certificate for If after code_datatype declaration for bool
haftmann
parents:
43595
diff
changeset
|
49 |
assumes "CASE \<equiv> (\<lambda>b. If b f g)" |
3f1a44c2d645
install case certificate for If after code_datatype declaration for bool
haftmann
parents:
43595
diff
changeset
|
50 |
shows "(CASE True \<equiv> f) &&& (CASE False \<equiv> g)" |
3f1a44c2d645
install case certificate for If after code_datatype declaration for bool
haftmann
parents:
43595
diff
changeset
|
51 |
using assms by simp_all |
3f1a44c2d645
install case certificate for If after code_datatype declaration for bool
haftmann
parents:
43595
diff
changeset
|
52 |
|
60758 | 53 |
setup \<open>Code.add_case @{thm If_case_cert}\<close> |
43654
3f1a44c2d645
install case certificate for If after code_datatype declaration for bool
haftmann
parents:
43595
diff
changeset
|
54 |
|
52435
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
55 |
code_printing |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
56 |
constant "HOL.equal :: bool \<Rightarrow> bool \<Rightarrow> bool" \<rightharpoonup> (Haskell) infix 4 "==" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
57 |
| class_instance "bool" :: "equal" \<rightharpoonup> (Haskell) - |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
58 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
59 |
|
60758 | 60 |
subsection \<open>The @{text unit} type\<close> |
11838 | 61 |
|
49834 | 62 |
typedef unit = "{True}" |
45694
4a8743618257
prefer typedef without extra definition and alternative name;
wenzelm
parents:
45662
diff
changeset
|
63 |
by auto |
11838 | 64 |
|
45694
4a8743618257
prefer typedef without extra definition and alternative name;
wenzelm
parents:
45662
diff
changeset
|
65 |
definition Unity :: unit ("'(')") |
4a8743618257
prefer typedef without extra definition and alternative name;
wenzelm
parents:
45662
diff
changeset
|
66 |
where "() = Abs_unit True" |
11838 | 67 |
|
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset
|
68 |
lemma unit_eq [no_atp]: "u = ()" |
40590 | 69 |
by (induct u) (simp add: Unity_def) |
11838 | 70 |
|
60758 | 71 |
text \<open> |
11838 | 72 |
Simplification procedure for @{thm [source] unit_eq}. Cannot use |
73 |
this rule directly --- it loops! |
|
60758 | 74 |
\<close> |
11838 | 75 |
|
60758 | 76 |
simproc_setup unit_eq ("x::unit") = \<open> |
43594 | 77 |
fn _ => fn _ => fn ct => |
59582 | 78 |
if HOLogic.is_unit (Thm.term_of ct) then NONE |
43594 | 79 |
else SOME (mk_meta_eq @{thm unit_eq}) |
60758 | 80 |
\<close> |
11838 | 81 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
82 |
free_constructors case_unit for "()" |
58189
9d714be4f028
added 'plugins' option to control which hooks are enabled
blanchet
parents:
57983
diff
changeset
|
83 |
by auto |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
84 |
|
60758 | 85 |
text \<open>Avoid name clashes by prefixing the output of @{text old_rep_datatype} with @{text old}.\<close> |
55442 | 86 |
|
60758 | 87 |
setup \<open>Sign.mandatory_path "old"\<close> |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
88 |
|
58306
117ba6cbe414
renamed 'rep_datatype' to 'old_rep_datatype' (HOL)
blanchet
parents:
58292
diff
changeset
|
89 |
old_rep_datatype "()" by simp |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
90 |
|
60758 | 91 |
setup \<open>Sign.parent_path\<close> |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
92 |
|
60758 | 93 |
text \<open>But erase the prefix for properties that are not generated by @{text free_constructors}.\<close> |
55442 | 94 |
|
60758 | 95 |
setup \<open>Sign.mandatory_path "unit"\<close> |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
96 |
|
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
97 |
lemmas induct = old.unit.induct |
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
98 |
lemmas inducts = old.unit.inducts |
55642
63beb38e9258
adapted to renaming of datatype 'cases' and 'recs' to 'case' and 'rec'
blanchet
parents:
55469
diff
changeset
|
99 |
lemmas rec = old.unit.rec |
63beb38e9258
adapted to renaming of datatype 'cases' and 'recs' to 'case' and 'rec'
blanchet
parents:
55469
diff
changeset
|
100 |
lemmas simps = unit.case unit.rec |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
101 |
|
60758 | 102 |
setup \<open>Sign.parent_path\<close> |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
103 |
|
11838 | 104 |
lemma unit_all_eq1: "(!!x::unit. PROP P x) == PROP P ()" |
105 |
by simp |
|
106 |
||
107 |
lemma unit_all_eq2: "(!!x::unit. PROP P) == PROP P" |
|
108 |
by (rule triv_forall_equality) |
|
109 |
||
60758 | 110 |
text \<open> |
43594 | 111 |
This rewrite counters the effect of simproc @{text unit_eq} on @{term |
11838 | 112 |
[source] "%u::unit. f u"}, replacing it by @{term [source] |
113 |
f} rather than by @{term [source] "%u. f ()"}. |
|
60758 | 114 |
\<close> |
11838 | 115 |
|
54147
97a8ff4e4ac9
killed most "no_atp", to make Sledgehammer more complete
blanchet
parents:
52435
diff
changeset
|
116 |
lemma unit_abs_eta_conv [simp]: "(%u::unit. f ()) = f" |
11838 | 117 |
by (rule ext) simp |
10213 | 118 |
|
54147
97a8ff4e4ac9
killed most "no_atp", to make Sledgehammer more complete
blanchet
parents:
52435
diff
changeset
|
119 |
lemma UNIV_unit: |
43866
8a50dc70cbff
moving UNIV = ... equations to their proper theories
haftmann
parents:
43654
diff
changeset
|
120 |
"UNIV = {()}" by auto |
8a50dc70cbff
moving UNIV = ... equations to their proper theories
haftmann
parents:
43654
diff
changeset
|
121 |
|
30924 | 122 |
instantiation unit :: default |
123 |
begin |
|
124 |
||
125 |
definition "default = ()" |
|
126 |
||
127 |
instance .. |
|
128 |
||
129 |
end |
|
10213 | 130 |
|
57233
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
131 |
instantiation unit :: "{complete_boolean_algebra, complete_linorder, wellorder}" |
57016 | 132 |
begin |
133 |
||
57233
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
134 |
definition less_eq_unit :: "unit \<Rightarrow> unit \<Rightarrow> bool" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
135 |
where |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
136 |
"(_::unit) \<le> _ \<longleftrightarrow> True" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
137 |
|
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
138 |
lemma less_eq_unit [iff]: |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
139 |
"(u::unit) \<le> v" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
140 |
by (simp add: less_eq_unit_def) |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
141 |
|
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
142 |
definition less_unit :: "unit \<Rightarrow> unit \<Rightarrow> bool" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
143 |
where |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
144 |
"(_::unit) < _ \<longleftrightarrow> False" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
145 |
|
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
146 |
lemma less_unit [iff]: |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
147 |
"\<not> (u::unit) < v" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
148 |
by (simp_all add: less_eq_unit_def less_unit_def) |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
149 |
|
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
150 |
definition bot_unit :: unit |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
151 |
where |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
152 |
[code_unfold]: "\<bottom> = ()" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
153 |
|
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
154 |
definition top_unit :: unit |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
155 |
where |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
156 |
[code_unfold]: "\<top> = ()" |
57016 | 157 |
|
57233
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
158 |
definition inf_unit :: "unit \<Rightarrow> unit \<Rightarrow> unit" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
159 |
where |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
160 |
[simp]: "_ \<sqinter> _ = ()" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
161 |
|
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
162 |
definition sup_unit :: "unit \<Rightarrow> unit \<Rightarrow> unit" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
163 |
where |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
164 |
[simp]: "_ \<squnion> _ = ()" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
165 |
|
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
166 |
definition Inf_unit :: "unit set \<Rightarrow> unit" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
167 |
where |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
168 |
[simp]: "\<Sqinter>_ = ()" |
57016 | 169 |
|
57233
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
170 |
definition Sup_unit :: "unit set \<Rightarrow> unit" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
171 |
where |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
172 |
[simp]: "\<Squnion>_ = ()" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
173 |
|
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
174 |
definition uminus_unit :: "unit \<Rightarrow> unit" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
175 |
where |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
176 |
[simp]: "- _ = ()" |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
177 |
|
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
178 |
declare less_eq_unit_def [abs_def, code_unfold] |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
179 |
less_unit_def [abs_def, code_unfold] |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
180 |
inf_unit_def [abs_def, code_unfold] |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
181 |
sup_unit_def [abs_def, code_unfold] |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
182 |
Inf_unit_def [abs_def, code_unfold] |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
183 |
Sup_unit_def [abs_def, code_unfold] |
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
184 |
uminus_unit_def [abs_def, code_unfold] |
57016 | 185 |
|
186 |
instance |
|
57233
8fcbfce2a2a9
uniform treatment of trivial unit instances: simplify by default, unfold in code preprocessor
haftmann
parents:
57201
diff
changeset
|
187 |
by intro_classes auto |
57016 | 188 |
|
189 |
end |
|
190 |
||
28562 | 191 |
lemma [code]: |
61076 | 192 |
"HOL.equal (u::unit) v \<longleftrightarrow> True" unfolding equal unit_eq [of u] unit_eq [of v] by rule+ |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
193 |
|
52435
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
194 |
code_printing |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
195 |
type_constructor unit \<rightharpoonup> |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
196 |
(SML) "unit" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
197 |
and (OCaml) "unit" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
198 |
and (Haskell) "()" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
199 |
and (Scala) "Unit" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
200 |
| constant Unity \<rightharpoonup> |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
201 |
(SML) "()" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
202 |
and (OCaml) "()" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
203 |
and (Haskell) "()" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
204 |
and (Scala) "()" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
205 |
| class_instance unit :: equal \<rightharpoonup> |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
206 |
(Haskell) - |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
207 |
| constant "HOL.equal :: unit \<Rightarrow> unit \<Rightarrow> bool" \<rightharpoonup> |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
208 |
(Haskell) infix 4 "==" |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
209 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
210 |
code_reserved SML |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
211 |
unit |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
212 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
213 |
code_reserved OCaml |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
214 |
unit |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
215 |
|
34886 | 216 |
code_reserved Scala |
217 |
Unit |
|
218 |
||
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
219 |
|
60758 | 220 |
subsection \<open>The product type\<close> |
10213 | 221 |
|
60758 | 222 |
subsubsection \<open>Type definition\<close> |
37166 | 223 |
|
224 |
definition Pair_Rep :: "'a \<Rightarrow> 'b \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> bool" where |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
225 |
"Pair_Rep a b = (\<lambda>x y. x = a \<and> y = b)" |
10213 | 226 |
|
61076 | 227 |
definition "prod = {f. \<exists>a b. f = Pair_Rep (a::'a) (b::'b)}" |
45696 | 228 |
|
49834 | 229 |
typedef ('a, 'b) prod (infixr "*" 20) = "prod :: ('a \<Rightarrow> 'b \<Rightarrow> bool) set" |
45696 | 230 |
unfolding prod_def by auto |
10213 | 231 |
|
35427 | 232 |
type_notation (xsymbols) |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
233 |
"prod" ("(_ \<times>/ _)" [21, 20] 20) |
35427 | 234 |
type_notation (HTML output) |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
235 |
"prod" ("(_ \<times>/ _)" [21, 20] 20) |
10213 | 236 |
|
37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
237 |
definition Pair :: "'a \<Rightarrow> 'b \<Rightarrow> 'a \<times> 'b" where |
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
238 |
"Pair a b = Abs_prod (Pair_Rep a b)" |
37166 | 239 |
|
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
240 |
lemma prod_cases: "(\<And>a b. P (Pair a b)) \<Longrightarrow> P p" |
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
241 |
by (cases p) (auto simp add: prod_def Pair_def Pair_Rep_def) |
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
242 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
243 |
free_constructors uncurry for Pair fst snd |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
244 |
proof - |
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
245 |
fix P :: bool and p :: "'a \<times> 'b" |
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
246 |
show "(\<And>x1 x2. p = Pair x1 x2 \<Longrightarrow> P) \<Longrightarrow> P" |
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
247 |
by (cases p) (auto simp add: prod_def Pair_def Pair_Rep_def) |
37166 | 248 |
next |
249 |
fix a c :: 'a and b d :: 'b |
|
250 |
have "Pair_Rep a b = Pair_Rep c d \<longleftrightarrow> a = c \<and> b = d" |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39272
diff
changeset
|
251 |
by (auto simp add: Pair_Rep_def fun_eq_iff) |
37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
252 |
moreover have "Pair_Rep a b \<in> prod" and "Pair_Rep c d \<in> prod" |
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
253 |
by (auto simp add: prod_def) |
37166 | 254 |
ultimately show "Pair a b = Pair c d \<longleftrightarrow> a = c \<and> b = d" |
37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
255 |
by (simp add: Pair_def Abs_prod_inject) |
37166 | 256 |
qed |
257 |
||
60758 | 258 |
text \<open>Avoid name clashes by prefixing the output of @{text old_rep_datatype} with @{text old}.\<close> |
55442 | 259 |
|
60758 | 260 |
setup \<open>Sign.mandatory_path "old"\<close> |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
261 |
|
58306
117ba6cbe414
renamed 'rep_datatype' to 'old_rep_datatype' (HOL)
blanchet
parents:
58292
diff
changeset
|
262 |
old_rep_datatype Pair |
55403
677569668824
avoid duplicate 'case' definitions by first looking up 'Ctr_Sugar'
blanchet
parents:
55393
diff
changeset
|
263 |
by (erule prod_cases) (rule prod.inject) |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
264 |
|
60758 | 265 |
setup \<open>Sign.parent_path\<close> |
37704
c6161bee8486
adapt Nitpick to "prod_case" and "*" -> "sum" renaming;
blanchet
parents:
37678
diff
changeset
|
266 |
|
60758 | 267 |
text \<open>But erase the prefix for properties that are not generated by @{text free_constructors}.\<close> |
55442 | 268 |
|
60758 | 269 |
setup \<open>Sign.mandatory_path "prod"\<close> |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
270 |
|
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
271 |
declare |
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
272 |
old.prod.inject[iff del] |
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
273 |
|
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
274 |
lemmas induct = old.prod.induct |
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
275 |
lemmas inducts = old.prod.inducts |
55642
63beb38e9258
adapted to renaming of datatype 'cases' and 'recs' to 'case' and 'rec'
blanchet
parents:
55469
diff
changeset
|
276 |
lemmas rec = old.prod.rec |
63beb38e9258
adapted to renaming of datatype 'cases' and 'recs' to 'case' and 'rec'
blanchet
parents:
55469
diff
changeset
|
277 |
lemmas simps = prod.inject prod.case prod.rec |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
278 |
|
60758 | 279 |
setup \<open>Sign.parent_path\<close> |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
280 |
|
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
281 |
declare prod.case [nitpick_simp del] |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57233
diff
changeset
|
282 |
declare prod.case_cong_weak [cong del] |
37411
c88c44156083
removed simplifier congruence rule of "prod_case"
haftmann
parents:
37389
diff
changeset
|
283 |
|
37166 | 284 |
|
60758 | 285 |
subsubsection \<open>Tuple syntax\<close> |
37166 | 286 |
|
60758 | 287 |
text \<open> |
11777 | 288 |
Patterns -- extends pre-defined type @{typ pttrn} used in |
289 |
abstractions. |
|
60758 | 290 |
\<close> |
10213 | 291 |
|
41229
d797baa3d57c
replaced command 'nonterminals' by slightly modernized version 'nonterminal';
wenzelm
parents:
40968
diff
changeset
|
292 |
nonterminal tuple_args and patterns |
10213 | 293 |
|
294 |
syntax |
|
295 |
"_tuple" :: "'a => tuple_args => 'a * 'b" ("(1'(_,/ _'))") |
|
296 |
"_tuple_arg" :: "'a => tuple_args" ("_") |
|
297 |
"_tuple_args" :: "'a => tuple_args => tuple_args" ("_,/ _") |
|
11025
a70b796d9af8
converted to Isar therory, adding attributes complete_split and split_format
oheimb
parents:
10289
diff
changeset
|
298 |
"_pattern" :: "[pttrn, patterns] => pttrn" ("'(_,/ _')") |
a70b796d9af8
converted to Isar therory, adding attributes complete_split and split_format
oheimb
parents:
10289
diff
changeset
|
299 |
"" :: "pttrn => patterns" ("_") |
a70b796d9af8
converted to Isar therory, adding attributes complete_split and split_format
oheimb
parents:
10289
diff
changeset
|
300 |
"_patterns" :: "[pttrn, patterns] => patterns" ("_,/ _") |
10213 | 301 |
|
302 |
translations |
|
61124 | 303 |
"(x, y)" \<rightleftharpoons> "CONST Pair x y" |
304 |
"_pattern x y" \<rightleftharpoons> "CONST Pair x y" |
|
305 |
"_patterns x y" \<rightleftharpoons> "CONST Pair x y" |
|
306 |
"_tuple x (_tuple_args y z)" \<rightleftharpoons> "_tuple x (_tuple_arg (_tuple y z))" |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
307 |
"\<lambda>(x, y, zs). b" \<rightleftharpoons> "CONST uncurry (\<lambda>x (y, zs). b)" |
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
308 |
"\<lambda>(x, y). b" \<rightleftharpoons> "CONST uncurry (\<lambda>x y. b)" |
61124 | 309 |
"_abs (CONST Pair x y) t" \<rightharpoonup> "\<lambda>(x, y). t" |
310 |
-- \<open>This rule accommodates tuples in @{text "case C \<dots> (x, y) \<dots> \<Rightarrow> \<dots>"}: |
|
311 |
The @{text "(x, y)"} is parsed as @{text "Pair x y"} because it is @{text logic}, |
|
312 |
not @{text pttrn}.\<close> |
|
10213 | 313 |
|
314 |
||
60758 | 315 |
subsubsection \<open>Code generator setup\<close> |
37166 | 316 |
|
52435
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
317 |
code_printing |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
318 |
type_constructor prod \<rightharpoonup> |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
319 |
(SML) infix 2 "*" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
320 |
and (OCaml) infix 2 "*" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
321 |
and (Haskell) "!((_),/ (_))" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
322 |
and (Scala) "((_),/ (_))" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
323 |
| constant Pair \<rightharpoonup> |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
324 |
(SML) "!((_),/ (_))" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
325 |
and (OCaml) "!((_),/ (_))" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
326 |
and (Haskell) "!((_),/ (_))" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
327 |
and (Scala) "!((_),/ (_))" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
328 |
| class_instance prod :: equal \<rightharpoonup> |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
329 |
(Haskell) - |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
330 |
| constant "HOL.equal :: 'a \<times> 'b \<Rightarrow> 'a \<times> 'b \<Rightarrow> bool" \<rightharpoonup> |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
331 |
(Haskell) infix 4 "==" |
37166 | 332 |
|
333 |
||
60758 | 334 |
subsubsection \<open>Fundamental operations and properties\<close> |
11838 | 335 |
|
49897
cc69be3c8f87
moving Pair_inject from legacy and duplicate section to general section, as Pair_inject was considered a duplicate in e8400e31528a by mistake (cf. communication on dev mailing list)
bulwahn
parents:
49834
diff
changeset
|
336 |
lemma Pair_inject: |
cc69be3c8f87
moving Pair_inject from legacy and duplicate section to general section, as Pair_inject was considered a duplicate in e8400e31528a by mistake (cf. communication on dev mailing list)
bulwahn
parents:
49834
diff
changeset
|
337 |
assumes "(a, b) = (a', b')" |
cc69be3c8f87
moving Pair_inject from legacy and duplicate section to general section, as Pair_inject was considered a duplicate in e8400e31528a by mistake (cf. communication on dev mailing list)
bulwahn
parents:
49834
diff
changeset
|
338 |
and "a = a' ==> b = b' ==> R" |
cc69be3c8f87
moving Pair_inject from legacy and duplicate section to general section, as Pair_inject was considered a duplicate in e8400e31528a by mistake (cf. communication on dev mailing list)
bulwahn
parents:
49834
diff
changeset
|
339 |
shows R |
cc69be3c8f87
moving Pair_inject from legacy and duplicate section to general section, as Pair_inject was considered a duplicate in e8400e31528a by mistake (cf. communication on dev mailing list)
bulwahn
parents:
49834
diff
changeset
|
340 |
using assms by simp |
cc69be3c8f87
moving Pair_inject from legacy and duplicate section to general section, as Pair_inject was considered a duplicate in e8400e31528a by mistake (cf. communication on dev mailing list)
bulwahn
parents:
49834
diff
changeset
|
341 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
342 |
lemma surj_pair [simp]: "EX x y. p = (x, y)" |
37166 | 343 |
by (cases p) simp |
10213 | 344 |
|
52435
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
345 |
code_printing |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
346 |
constant fst \<rightharpoonup> (Haskell) "fst" |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
347 |
| constant snd \<rightharpoonup> (Haskell) "snd" |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
348 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
349 |
lemma case_prod_unfold [nitpick_unfold]: "uncurry = (%c p. c (fst p) (snd p))" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39272
diff
changeset
|
350 |
by (simp add: fun_eq_iff split: prod.split) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
351 |
|
11838 | 352 |
lemma fst_eqD: "fst (x, y) = a ==> x = a" |
353 |
by simp |
|
354 |
||
355 |
lemma snd_eqD: "snd (x, y) = a ==> y = a" |
|
356 |
by simp |
|
357 |
||
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
358 |
lemmas surjective_pairing = prod.collapse [symmetric] |
11838 | 359 |
|
44066
d74182c93f04
rename Pair_fst_snd_eq to prod_eq_iff (keeping old name too)
huffman
parents:
43866
diff
changeset
|
360 |
lemma prod_eq_iff: "s = t \<longleftrightarrow> fst s = fst t \<and> snd s = snd t" |
37166 | 361 |
by (cases s, cases t) simp |
362 |
||
363 |
lemma prod_eqI [intro?]: "fst p = fst q \<Longrightarrow> snd p = snd q \<Longrightarrow> p = q" |
|
44066
d74182c93f04
rename Pair_fst_snd_eq to prod_eq_iff (keeping old name too)
huffman
parents:
43866
diff
changeset
|
364 |
by (simp add: prod_eq_iff) |
37166 | 365 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
366 |
lemma split_conv [simp, code]: "uncurry f (a, b) = f a b" |
55642
63beb38e9258
adapted to renaming of datatype 'cases' and 'recs' to 'case' and 'rec'
blanchet
parents:
55469
diff
changeset
|
367 |
by (fact prod.case) |
37166 | 368 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
369 |
lemma splitI: "f a b \<Longrightarrow> uncurry f (a, b)" |
37166 | 370 |
by (rule split_conv [THEN iffD2]) |
371 |
||
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
372 |
lemma splitD: "uncurry f (a, b) \<Longrightarrow> f a b" |
37166 | 373 |
by (rule split_conv [THEN iffD1]) |
374 |
||
375 |
lemma split_Pair [simp]: "(\<lambda>(x, y). (x, y)) = id" |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39272
diff
changeset
|
376 |
by (simp add: fun_eq_iff split: prod.split) |
37166 | 377 |
|
378 |
lemma split_eta: "(\<lambda>(x, y). f (x, y)) = f" |
|
60758 | 379 |
-- \<open>Subsumes the old @{text split_Pair} when @{term f} is the identity function.\<close> |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39272
diff
changeset
|
380 |
by (simp add: fun_eq_iff split: prod.split) |
37166 | 381 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
382 |
lemma split_comp: "uncurry (f \<circ> g) x = f (g (fst x)) (snd x)" |
37166 | 383 |
by (cases x) simp |
384 |
||
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
385 |
lemma split_twice: "uncurry f (uncurry g p) = uncurry (\<lambda>x y. uncurry f (g x y)) p" |
61032
b57df8eecad6
standardized some occurences of ancient "split" alias
haftmann
parents:
60758
diff
changeset
|
386 |
by (fact prod.case_distrib) |
37166 | 387 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
388 |
lemma The_split: "The (uncurry P) = (THE xy. P (fst xy) (snd xy))" |
55414
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
55403
diff
changeset
|
389 |
by (simp add: case_prod_unfold) |
37166 | 390 |
|
58468 | 391 |
lemmas split_weak_cong = prod.case_cong_weak |
60758 | 392 |
-- \<open>Prevents simplification of @{term c}: much faster\<close> |
37166 | 393 |
|
394 |
lemma cond_split_eta: "(!!x y. f x y = g (x, y)) ==> (%(x, y). f x y) = g" |
|
395 |
by (simp add: split_eta) |
|
396 |
||
47740
a8989fe9a3a5
added "no_atp"s for extremely prolific, useless facts for ATPs
blanchet
parents:
46950
diff
changeset
|
397 |
lemma split_paired_all [no_atp]: "(!!x. PROP P x) == (!!a b. PROP P (a, b))" |
11820
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
398 |
proof |
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
399 |
fix a b |
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
400 |
assume "!!x. PROP P x" |
19535 | 401 |
then show "PROP P (a, b)" . |
11820
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
402 |
next |
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
403 |
fix x |
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
404 |
assume "!!a b. PROP P (a, b)" |
60758 | 405 |
from \<open>PROP P (fst x, snd x)\<close> show "PROP P x" by simp |
11820
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
406 |
qed |
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
407 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
408 |
lemma uncurry_distrib: "f (case x of (x, y) \<Rightarrow> g x y) = (case x of (x, y) \<Rightarrow> f (g x y))" |
50104 | 409 |
by (cases x) simp |
410 |
||
60758 | 411 |
text \<open> |
11838 | 412 |
The rule @{thm [source] split_paired_all} does not work with the |
413 |
Simplifier because it also affects premises in congrence rules, |
|
414 |
where this can lead to premises of the form @{text "!!a b. ... = |
|
415 |
?P(a, b)"} which cannot be solved by reflexivity. |
|
60758 | 416 |
\<close> |
11838 | 417 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
418 |
lemmas split_tupled_all = split_paired_all unit_all_eq2 |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
419 |
|
60758 | 420 |
ML \<open> |
11838 | 421 |
(* replace parameters of product type by individual component parameters *) |
422 |
local (* filtering with exists_paired_all is an essential optimization *) |
|
56245 | 423 |
fun exists_paired_all (Const (@{const_name Pure.all}, _) $ Abs (_, T, t)) = |
11838 | 424 |
can HOLogic.dest_prodT T orelse exists_paired_all t |
425 |
| exists_paired_all (t $ u) = exists_paired_all t orelse exists_paired_all u |
|
426 |
| exists_paired_all (Abs (_, _, t)) = exists_paired_all t |
|
427 |
| exists_paired_all _ = false; |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
428 |
val ss = |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
429 |
simpset_of |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
430 |
(put_simpset HOL_basic_ss @{context} |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
431 |
addsimps [@{thm split_paired_all}, @{thm unit_all_eq2}, @{thm unit_abs_eta_conv}] |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
432 |
addsimprocs [@{simproc unit_eq}]); |
11838 | 433 |
in |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
434 |
fun split_all_tac ctxt = SUBGOAL (fn (t, i) => |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
435 |
if exists_paired_all t then safe_full_simp_tac (put_simpset ss ctxt) i else no_tac); |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
436 |
|
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
437 |
fun unsafe_split_all_tac ctxt = SUBGOAL (fn (t, i) => |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
438 |
if exists_paired_all t then full_simp_tac (put_simpset ss ctxt) i else no_tac); |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
439 |
|
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
440 |
fun split_all ctxt th = |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
441 |
if exists_paired_all (Thm.prop_of th) |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
442 |
then full_simplify (put_simpset ss ctxt) th else th; |
11838 | 443 |
end; |
60758 | 444 |
\<close> |
11838 | 445 |
|
60758 | 446 |
setup \<open>map_theory_claset (fn ctxt => ctxt addSbefore ("split_all_tac", split_all_tac))\<close> |
11838 | 447 |
|
47740
a8989fe9a3a5
added "no_atp"s for extremely prolific, useless facts for ATPs
blanchet
parents:
46950
diff
changeset
|
448 |
lemma split_paired_All [simp, no_atp]: "(ALL x. P x) = (ALL a b. P (a, b))" |
60758 | 449 |
-- \<open>@{text "[iff]"} is not a good idea because it makes @{text blast} loop\<close> |
11838 | 450 |
by fast |
451 |
||
47740
a8989fe9a3a5
added "no_atp"s for extremely prolific, useless facts for ATPs
blanchet
parents:
46950
diff
changeset
|
452 |
lemma split_paired_Ex [simp, no_atp]: "(EX x. P x) = (EX a b. P (a, b))" |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
453 |
by fast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
454 |
|
47740
a8989fe9a3a5
added "no_atp"s for extremely prolific, useless facts for ATPs
blanchet
parents:
46950
diff
changeset
|
455 |
lemma split_paired_The [no_atp]: "(THE x. P x) = (THE (a, b). P (a, b))" |
60758 | 456 |
-- \<open>Can't be added to simpset: loops!\<close> |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
457 |
by (simp add: split_eta) |
11838 | 458 |
|
60758 | 459 |
text \<open> |
11838 | 460 |
Simplification procedure for @{thm [source] cond_split_eta}. Using |
461 |
@{thm [source] split_eta} as a rewrite rule is not general enough, |
|
462 |
and using @{thm [source] cond_split_eta} directly would render some |
|
463 |
existing proofs very inefficient; similarly for @{text |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
464 |
split_beta}. |
60758 | 465 |
\<close> |
11838 | 466 |
|
60758 | 467 |
ML \<open> |
11838 | 468 |
local |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
469 |
val cond_split_eta_ss = |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
470 |
simpset_of (put_simpset HOL_basic_ss @{context} addsimps @{thms cond_split_eta}); |
35364 | 471 |
fun Pair_pat k 0 (Bound m) = (m = k) |
472 |
| Pair_pat k i (Const (@{const_name Pair}, _) $ Bound m $ t) = |
|
473 |
i > 0 andalso m = k + i andalso Pair_pat k (i - 1) t |
|
474 |
| Pair_pat _ _ _ = false; |
|
475 |
fun no_args k i (Abs (_, _, t)) = no_args (k + 1) i t |
|
476 |
| no_args k i (t $ u) = no_args k i t andalso no_args k i u |
|
477 |
| no_args k i (Bound m) = m < k orelse m > k + i |
|
478 |
| no_args _ _ _ = true; |
|
479 |
fun split_pat tp i (Abs (_, _, t)) = if tp 0 i t then SOME (i, t) else NONE |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
480 |
| split_pat tp i (Const (@{const_name uncurry}, _) $ Abs (_, _, t)) = split_pat tp (i + 1) t |
35364 | 481 |
| split_pat tp i _ = NONE; |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
482 |
fun metaeq ctxt lhs rhs = mk_meta_eq (Goal.prove ctxt [] [] |
35364 | 483 |
(HOLogic.mk_Trueprop (HOLogic.mk_eq (lhs, rhs))) |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
484 |
(K (simp_tac (put_simpset cond_split_eta_ss ctxt) 1))); |
11838 | 485 |
|
35364 | 486 |
fun beta_term_pat k i (Abs (_, _, t)) = beta_term_pat (k + 1) i t |
487 |
| beta_term_pat k i (t $ u) = |
|
488 |
Pair_pat k i (t $ u) orelse (beta_term_pat k i t andalso beta_term_pat k i u) |
|
489 |
| beta_term_pat k i t = no_args k i t; |
|
490 |
fun eta_term_pat k i (f $ arg) = no_args k i f andalso Pair_pat k i arg |
|
491 |
| eta_term_pat _ _ _ = false; |
|
11838 | 492 |
fun subst arg k i (Abs (x, T, t)) = Abs (x, T, subst arg (k+1) i t) |
35364 | 493 |
| subst arg k i (t $ u) = |
494 |
if Pair_pat k i (t $ u) then incr_boundvars k arg |
|
495 |
else (subst arg k i t $ subst arg k i u) |
|
496 |
| subst arg k i t = t; |
|
43595 | 497 |
in |
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
498 |
fun beta_proc ctxt (s as Const (@{const_name uncurry}, _) $ Abs (_, _, t) $ arg) = |
11838 | 499 |
(case split_pat beta_term_pat 1 t of |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
500 |
SOME (i, f) => SOME (metaeq ctxt s (subst arg 0 i f)) |
15531 | 501 |
| NONE => NONE) |
35364 | 502 |
| beta_proc _ _ = NONE; |
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
503 |
fun eta_proc ctxt (s as Const (@{const_name uncurry}, _) $ Abs (_, _, t)) = |
11838 | 504 |
(case split_pat eta_term_pat 1 t of |
58468 | 505 |
SOME (_, ft) => SOME (metaeq ctxt s (let val f $ _ = ft in f end)) |
15531 | 506 |
| NONE => NONE) |
35364 | 507 |
| eta_proc _ _ = NONE; |
11838 | 508 |
end; |
60758 | 509 |
\<close> |
59582 | 510 |
simproc_setup split_beta ("split f z") = |
60758 | 511 |
\<open>fn _ => fn ctxt => fn ct => beta_proc ctxt (Thm.term_of ct)\<close> |
59582 | 512 |
simproc_setup split_eta ("split f") = |
60758 | 513 |
\<open>fn _ => fn ctxt => fn ct => eta_proc ctxt (Thm.term_of ct)\<close> |
11838 | 514 |
|
58468 | 515 |
lemmas split_beta [mono] = prod.case_eq_if |
11838 | 516 |
|
50104 | 517 |
lemma split_beta': "(\<lambda>(x,y). f x y) = (\<lambda>x. f (fst x) (snd x))" |
518 |
by (auto simp: fun_eq_iff) |
|
519 |
||
58468 | 520 |
lemmas split_split [no_atp] = prod.split |
60758 | 521 |
-- \<open>For use with @{text split} and the Simplifier.\<close> |
11838 | 522 |
|
60758 | 523 |
text \<open> |
11838 | 524 |
@{thm [source] split_split} could be declared as @{text "[split]"} |
525 |
done after the Splitter has been speeded up significantly; |
|
526 |
precompute the constants involved and don't do anything unless the |
|
527 |
current goal contains one of those constants. |
|
60758 | 528 |
\<close> |
11838 | 529 |
|
58468 | 530 |
lemmas split_split_asm [no_atp] = prod.split_asm |
11838 | 531 |
|
60758 | 532 |
text \<open> |
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
533 |
\medskip @{const uncurry} used as a logical connective or set former. |
11838 | 534 |
|
535 |
\medskip These rules are for use with @{text blast}; could instead |
|
60758 | 536 |
call @{text simp} using @{thm [source] prod.split} as rewrite.\<close> |
11838 | 537 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
538 |
lemma splitI2: "!!p. [| !!a b. p = (a, b) ==> c a b |] ==> uncurry c p" |
11838 | 539 |
apply (simp only: split_tupled_all) |
540 |
apply (simp (no_asm_simp)) |
|
541 |
done |
|
542 |
||
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
543 |
lemma splitI2': "!!p. [| !!a b. (a, b) = p ==> c a b x |] ==> uncurry c p x" |
11838 | 544 |
apply (simp only: split_tupled_all) |
545 |
apply (simp (no_asm_simp)) |
|
546 |
done |
|
547 |
||
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
548 |
lemma splitE: "uncurry c p ==> (!!x y. p = (x, y) ==> c x y ==> Q) ==> Q" |
37591 | 549 |
by (induct p) auto |
11838 | 550 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
551 |
lemma splitE': "uncurry c p z ==> (!!x y. p = (x, y) ==> c x y z ==> Q) ==> Q" |
37591 | 552 |
by (induct p) auto |
11838 | 553 |
|
554 |
lemma splitE2: |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
555 |
"[| Q (uncurry P z); !!x y. [|z = (x, y); Q (P x y)|] ==> R |] ==> R" |
11838 | 556 |
proof - |
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
557 |
assume q: "Q (uncurry P z)" |
11838 | 558 |
assume r: "!!x y. [|z = (x, y); Q (P x y)|] ==> R" |
559 |
show R |
|
560 |
apply (rule r surjective_pairing)+ |
|
561 |
apply (rule split_beta [THEN subst], rule q) |
|
562 |
done |
|
563 |
qed |
|
564 |
||
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
565 |
lemma splitD': "uncurry R (a,b) c ==> R a b c" |
11838 | 566 |
by simp |
567 |
||
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
568 |
lemma mem_splitI: "z: c a b ==> z: uncurry c (a, b)" |
11838 | 569 |
by simp |
570 |
||
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
571 |
lemma mem_splitI2: "!!p. [| !!a b. p = (a, b) ==> z: c a b |] ==> z: uncurry c p" |
14208 | 572 |
by (simp only: split_tupled_all, simp) |
11838 | 573 |
|
18372 | 574 |
lemma mem_splitE: |
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
575 |
assumes "z \<in> uncurry c p" |
58468 | 576 |
obtains x y where "p = (x, y)" and "z \<in> c x y" |
577 |
using assms by (rule splitE2) |
|
11838 | 578 |
|
579 |
declare mem_splitI2 [intro!] mem_splitI [intro!] splitI2' [intro!] splitI2 [intro!] splitI [intro!] |
|
580 |
declare mem_splitE [elim!] splitE' [elim!] splitE [elim!] |
|
581 |
||
60758 | 582 |
ML \<open> |
11838 | 583 |
local (* filtering with exists_p_split is an essential optimization *) |
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
584 |
fun exists_p_split (Const (@{const_name uncurry},_) $ _ $ (Const (@{const_name Pair},_)$_$_)) = true |
11838 | 585 |
| exists_p_split (t $ u) = exists_p_split t orelse exists_p_split u |
586 |
| exists_p_split (Abs (_, _, t)) = exists_p_split t |
|
587 |
| exists_p_split _ = false; |
|
588 |
in |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
589 |
fun split_conv_tac ctxt = SUBGOAL (fn (t, i) => |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
590 |
if exists_p_split t |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
591 |
then safe_full_simp_tac (put_simpset HOL_basic_ss ctxt addsimps @{thms split_conv}) i |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
592 |
else no_tac); |
11838 | 593 |
end; |
60758 | 594 |
\<close> |
26340 | 595 |
|
11838 | 596 |
(* This prevents applications of splitE for already splitted arguments leading |
597 |
to quite time-consuming computations (in particular for nested tuples) *) |
|
60758 | 598 |
setup \<open>map_theory_claset (fn ctxt => ctxt addSbefore ("split_conv_tac", split_conv_tac))\<close> |
11838 | 599 |
|
54147
97a8ff4e4ac9
killed most "no_atp", to make Sledgehammer more complete
blanchet
parents:
52435
diff
changeset
|
600 |
lemma split_eta_SetCompr [simp, no_atp]: "(%u. EX x y. u = (x, y) & P (x, y)) = P" |
18372 | 601 |
by (rule ext) fast |
11838 | 602 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
603 |
lemma split_eta_SetCompr2 [simp, no_atp]: "(%u. EX x y. u = (x, y) & P x y) = uncurry P" |
18372 | 604 |
by (rule ext) fast |
11838 | 605 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
606 |
lemma split_part [simp]: "(%(a,b). P & Q a b) = (%ab. P & uncurry Q ab)" |
60758 | 607 |
-- \<open>Allows simplifications of nested splits in case of independent predicates.\<close> |
18372 | 608 |
by (rule ext) blast |
11838 | 609 |
|
14337
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset
|
610 |
(* Do NOT make this a simp rule as it |
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset
|
611 |
a) only helps in special situations |
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset
|
612 |
b) can lead to nontermination in the presence of split_def |
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset
|
613 |
*) |
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset
|
614 |
lemma split_comp_eq: |
20415 | 615 |
fixes f :: "'a => 'b => 'c" and g :: "'d => 'a" |
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
616 |
shows "(%u. f (g (fst u)) (snd u)) = (uncurry (%x. f (g x)))" |
18372 | 617 |
by (rule ext) auto |
14101 | 618 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
619 |
lemma pair_imageI [intro]: "(a, b) : A ==> f a b : (%(a, b). f a b) ` A" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
620 |
apply (rule_tac x = "(a, b)" in image_eqI) |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
621 |
apply auto |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
622 |
done |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
623 |
|
11838 | 624 |
lemma The_split_eq [simp]: "(THE (x',y'). x = x' & y = y') = (x, y)" |
625 |
by blast |
|
626 |
||
627 |
(* |
|
628 |
the following would be slightly more general, |
|
629 |
but cannot be used as rewrite rule: |
|
630 |
### Cannot add premise as rewrite rule because it contains (type) unknowns: |
|
631 |
### ?y = .x |
|
632 |
Goal "[| P y; !!x. P x ==> x = y |] ==> (@(x',y). x = x' & P y) = (x,y)" |
|
14208 | 633 |
by (rtac some_equality 1) |
634 |
by ( Simp_tac 1) |
|
635 |
by (split_all_tac 1) |
|
636 |
by (Asm_full_simp_tac 1) |
|
11838 | 637 |
qed "The_split_eq"; |
638 |
*) |
|
639 |
||
60758 | 640 |
text \<open> |
11838 | 641 |
Setup of internal @{text split_rule}. |
60758 | 642 |
\<close> |
11838 | 643 |
|
55642
63beb38e9258
adapted to renaming of datatype 'cases' and 'recs' to 'case' and 'rec'
blanchet
parents:
55469
diff
changeset
|
644 |
lemmas case_prodI = prod.case [THEN iffD2] |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
645 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
646 |
lemma case_prodI2: "!!p. [| !!a b. p = (a, b) ==> c a b |] ==> uncurry c p" |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
647 |
by (fact splitI2) |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
648 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
649 |
lemma case_prodI2': "!!p. [| !!a b. (a, b) = p ==> c a b x |] ==> uncurry c p x" |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
650 |
by (fact splitI2') |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
651 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
652 |
lemma case_prodE: "uncurry c p ==> (!!x y. p = (x, y) ==> c x y ==> Q) ==> Q" |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
653 |
by (fact splitE) |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
654 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
655 |
lemma case_prodE': "uncurry c p z ==> (!!x y. p = (x, y) ==> c x y z ==> Q) ==> Q" |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
656 |
by (fact splitE') |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
657 |
|
55414
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
55403
diff
changeset
|
658 |
declare case_prodI [intro!] |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
659 |
|
55414
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
55403
diff
changeset
|
660 |
lemma case_prod_beta: |
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
661 |
"uncurry f p = f (fst p) (snd p)" |
37591 | 662 |
by (fact split_beta) |
26143
314c0bcb7df7
Added useful general lemmas from the work with the HeapMonad
bulwahn
parents:
25885
diff
changeset
|
663 |
|
55417
01fbfb60c33e
adapted to 'xxx_{case,rec}' renaming, to new theorem names, and to new variable names in theorems
blanchet
parents:
55414
diff
changeset
|
664 |
lemma prod_cases3 [cases type]: |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
665 |
obtains (fields) a b c where "y = (a, b, c)" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
666 |
by (cases y, case_tac b) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
667 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
668 |
lemma prod_induct3 [case_names fields, induct type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
669 |
"(!!a b c. P (a, b, c)) ==> P x" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
670 |
by (cases x) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
671 |
|
55417
01fbfb60c33e
adapted to 'xxx_{case,rec}' renaming, to new theorem names, and to new variable names in theorems
blanchet
parents:
55414
diff
changeset
|
672 |
lemma prod_cases4 [cases type]: |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
673 |
obtains (fields) a b c d where "y = (a, b, c, d)" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
674 |
by (cases y, case_tac c) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
675 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
676 |
lemma prod_induct4 [case_names fields, induct type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
677 |
"(!!a b c d. P (a, b, c, d)) ==> P x" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
678 |
by (cases x) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
679 |
|
55417
01fbfb60c33e
adapted to 'xxx_{case,rec}' renaming, to new theorem names, and to new variable names in theorems
blanchet
parents:
55414
diff
changeset
|
680 |
lemma prod_cases5 [cases type]: |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
681 |
obtains (fields) a b c d e where "y = (a, b, c, d, e)" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
682 |
by (cases y, case_tac d) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
683 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
684 |
lemma prod_induct5 [case_names fields, induct type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
685 |
"(!!a b c d e. P (a, b, c, d, e)) ==> P x" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
686 |
by (cases x) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
687 |
|
55417
01fbfb60c33e
adapted to 'xxx_{case,rec}' renaming, to new theorem names, and to new variable names in theorems
blanchet
parents:
55414
diff
changeset
|
688 |
lemma prod_cases6 [cases type]: |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
689 |
obtains (fields) a b c d e f where "y = (a, b, c, d, e, f)" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
690 |
by (cases y, case_tac e) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
691 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
692 |
lemma prod_induct6 [case_names fields, induct type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
693 |
"(!!a b c d e f. P (a, b, c, d, e, f)) ==> P x" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
694 |
by (cases x) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
695 |
|
55417
01fbfb60c33e
adapted to 'xxx_{case,rec}' renaming, to new theorem names, and to new variable names in theorems
blanchet
parents:
55414
diff
changeset
|
696 |
lemma prod_cases7 [cases type]: |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
697 |
obtains (fields) a b c d e f g where "y = (a, b, c, d, e, f, g)" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
698 |
by (cases y, case_tac f) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
699 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
700 |
lemma prod_induct7 [case_names fields, induct type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
701 |
"(!!a b c d e f g. P (a, b, c, d, e, f, g)) ==> P x" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
702 |
by (cases x) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
703 |
|
37166 | 704 |
definition internal_split :: "('a \<Rightarrow> 'b \<Rightarrow> 'c) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'c" where |
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
705 |
"internal_split == uncurry" |
37166 | 706 |
|
707 |
lemma internal_split_conv: "internal_split c (a, b) = c a b" |
|
708 |
by (simp only: internal_split_def split_conv) |
|
709 |
||
48891 | 710 |
ML_file "Tools/split_rule.ML" |
37166 | 711 |
|
712 |
hide_const internal_split |
|
713 |
||
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
714 |
|
60758 | 715 |
subsubsection \<open>Derived operations\<close> |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
716 |
|
37387
3581483cca6c
qualified types "+" and nat; qualified constants Ball, Bex, Suc, curry; modernized some specifications
haftmann
parents:
37278
diff
changeset
|
717 |
definition curry :: "('a \<times> 'b \<Rightarrow> 'c) \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'c" where |
3581483cca6c
qualified types "+" and nat; qualified constants Ball, Bex, Suc, curry; modernized some specifications
haftmann
parents:
37278
diff
changeset
|
718 |
"curry = (\<lambda>c x y. c (x, y))" |
37166 | 719 |
|
720 |
lemma curry_conv [simp, code]: "curry f a b = f (a, b)" |
|
721 |
by (simp add: curry_def) |
|
722 |
||
723 |
lemma curryI [intro!]: "f (a, b) \<Longrightarrow> curry f a b" |
|
724 |
by (simp add: curry_def) |
|
725 |
||
726 |
lemma curryD [dest!]: "curry f a b \<Longrightarrow> f (a, b)" |
|
727 |
by (simp add: curry_def) |
|
728 |
||
729 |
lemma curryE: "curry f a b \<Longrightarrow> (f (a, b) \<Longrightarrow> Q) \<Longrightarrow> Q" |
|
730 |
by (simp add: curry_def) |
|
731 |
||
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
732 |
lemma curry_split [simp]: "curry (uncurry f) = f" |
61032
b57df8eecad6
standardized some occurences of ancient "split" alias
haftmann
parents:
60758
diff
changeset
|
733 |
by (simp add: curry_def case_prod_unfold) |
37166 | 734 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
735 |
lemma split_curry [simp]: "uncurry (curry f) = f" |
61032
b57df8eecad6
standardized some occurences of ancient "split" alias
haftmann
parents:
60758
diff
changeset
|
736 |
by (simp add: curry_def case_prod_unfold) |
37166 | 737 |
|
54630
9061af4d5ebc
restrict admissibility to non-empty chains to allow more syntax-directed proof rules
Andreas Lochbihler
parents:
54147
diff
changeset
|
738 |
lemma curry_K: "curry (\<lambda>x. c) = (\<lambda>x y. c)" |
9061af4d5ebc
restrict admissibility to non-empty chains to allow more syntax-directed proof rules
Andreas Lochbihler
parents:
54147
diff
changeset
|
739 |
by(simp add: fun_eq_iff) |
9061af4d5ebc
restrict admissibility to non-empty chains to allow more syntax-directed proof rules
Andreas Lochbihler
parents:
54147
diff
changeset
|
740 |
|
60758 | 741 |
text \<open> |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
742 |
The composition-uncurry combinator. |
60758 | 743 |
\<close> |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
744 |
|
37751 | 745 |
notation fcomp (infixl "\<circ>>" 60) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
746 |
|
37751 | 747 |
definition scomp :: "('a \<Rightarrow> 'b \<times> 'c) \<Rightarrow> ('b \<Rightarrow> 'c \<Rightarrow> 'd) \<Rightarrow> 'a \<Rightarrow> 'd" (infixl "\<circ>\<rightarrow>" 60) where |
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
748 |
"f \<circ>\<rightarrow> g = (\<lambda>x. uncurry g (f x))" |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
749 |
|
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
750 |
lemma scomp_unfold: "scomp = (\<lambda>f g x. g (fst (f x)) (snd (f x)))" |
55414
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
55403
diff
changeset
|
751 |
by (simp add: fun_eq_iff scomp_def case_prod_unfold) |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
752 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
753 |
lemma scomp_apply [simp]: "(f \<circ>\<rightarrow> g) x = uncurry g (f x)" |
55414
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
55403
diff
changeset
|
754 |
by (simp add: scomp_unfold case_prod_unfold) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
755 |
|
37751 | 756 |
lemma Pair_scomp: "Pair x \<circ>\<rightarrow> f = f x" |
44921 | 757 |
by (simp add: fun_eq_iff) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
758 |
|
37751 | 759 |
lemma scomp_Pair: "x \<circ>\<rightarrow> Pair = x" |
44921 | 760 |
by (simp add: fun_eq_iff) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
761 |
|
37751 | 762 |
lemma scomp_scomp: "(f \<circ>\<rightarrow> g) \<circ>\<rightarrow> h = f \<circ>\<rightarrow> (\<lambda>x. g x \<circ>\<rightarrow> h)" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39272
diff
changeset
|
763 |
by (simp add: fun_eq_iff scomp_unfold) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
764 |
|
37751 | 765 |
lemma scomp_fcomp: "(f \<circ>\<rightarrow> g) \<circ>> h = f \<circ>\<rightarrow> (\<lambda>x. g x \<circ>> h)" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39272
diff
changeset
|
766 |
by (simp add: fun_eq_iff scomp_unfold fcomp_def) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
767 |
|
37751 | 768 |
lemma fcomp_scomp: "(f \<circ>> g) \<circ>\<rightarrow> h = f \<circ>> (g \<circ>\<rightarrow> h)" |
44921 | 769 |
by (simp add: fun_eq_iff scomp_unfold) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
770 |
|
52435
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
771 |
code_printing |
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52143
diff
changeset
|
772 |
constant scomp \<rightharpoonup> (Eval) infixl 3 "#->" |
31202
52d332f8f909
pretty printing of functional combinators for evaluation code
haftmann
parents:
30924
diff
changeset
|
773 |
|
37751 | 774 |
no_notation fcomp (infixl "\<circ>>" 60) |
775 |
no_notation scomp (infixl "\<circ>\<rightarrow>" 60) |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
776 |
|
60758 | 777 |
text \<open> |
55932 | 778 |
@{term map_prod} --- action of the product functor upon |
36664
6302f9ad7047
repaired comments where SOMEthing went utterly wrong (cf. 2b04504fcb69)
krauss
parents:
36622
diff
changeset
|
779 |
functions. |
60758 | 780 |
\<close> |
21195 | 781 |
|
55932 | 782 |
definition map_prod :: "('a \<Rightarrow> 'c) \<Rightarrow> ('b \<Rightarrow> 'd) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'c \<times> 'd" where |
783 |
"map_prod f g = (\<lambda>(x, y). (f x, g y))" |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
784 |
|
55932 | 785 |
lemma map_prod_simp [simp, code]: |
786 |
"map_prod f g (a, b) = (f a, g b)" |
|
787 |
by (simp add: map_prod_def) |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
788 |
|
55932 | 789 |
functor map_prod: map_prod |
44921 | 790 |
by (auto simp add: split_paired_all) |
37278 | 791 |
|
55932 | 792 |
lemma fst_map_prod [simp]: |
793 |
"fst (map_prod f g x) = f (fst x)" |
|
40607 | 794 |
by (cases x) simp_all |
37278 | 795 |
|
58916 | 796 |
lemma snd_map_prod [simp]: |
55932 | 797 |
"snd (map_prod f g x) = g (snd x)" |
40607 | 798 |
by (cases x) simp_all |
37278 | 799 |
|
55932 | 800 |
lemma fst_comp_map_prod [simp]: |
801 |
"fst \<circ> map_prod f g = f \<circ> fst" |
|
40607 | 802 |
by (rule ext) simp_all |
37278 | 803 |
|
55932 | 804 |
lemma snd_comp_map_prod [simp]: |
805 |
"snd \<circ> map_prod f g = g \<circ> snd" |
|
40607 | 806 |
by (rule ext) simp_all |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
807 |
|
55932 | 808 |
lemma map_prod_compose: |
809 |
"map_prod (f1 o f2) (g1 o g2) = (map_prod f1 g1 o map_prod f2 g2)" |
|
810 |
by (rule ext) (simp add: map_prod.compositionality comp_def) |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
811 |
|
55932 | 812 |
lemma map_prod_ident [simp]: |
813 |
"map_prod (%x. x) (%y. y) = (%z. z)" |
|
814 |
by (rule ext) (simp add: map_prod.identity) |
|
40607 | 815 |
|
55932 | 816 |
lemma map_prod_imageI [intro]: |
817 |
"(a, b) \<in> R \<Longrightarrow> (f a, g b) \<in> map_prod f g ` R" |
|
40607 | 818 |
by (rule image_eqI) simp_all |
21195 | 819 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
820 |
lemma prod_fun_imageE [elim!]: |
55932 | 821 |
assumes major: "c \<in> map_prod f g ` R" |
40607 | 822 |
and cases: "\<And>x y. c = (f x, g y) \<Longrightarrow> (x, y) \<in> R \<Longrightarrow> P" |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
823 |
shows P |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
824 |
apply (rule major [THEN imageE]) |
37166 | 825 |
apply (case_tac x) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
826 |
apply (rule cases) |
40607 | 827 |
apply simp_all |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
828 |
done |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
829 |
|
37166 | 830 |
definition apfst :: "('a \<Rightarrow> 'c) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'c \<times> 'b" where |
55932 | 831 |
"apfst f = map_prod f id" |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
832 |
|
37166 | 833 |
definition apsnd :: "('b \<Rightarrow> 'c) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'a \<times> 'c" where |
55932 | 834 |
"apsnd f = map_prod id f" |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
835 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
836 |
lemma apfst_conv [simp, code]: |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
837 |
"apfst f (x, y) = (f x, y)" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
838 |
by (simp add: apfst_def) |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
839 |
|
33638
548a34929e98
Renamed upd_snd_conv to apsnd_conv to be consistent with apfst_conv; Added apsnd_apfst_commute
hoelzl
parents:
33594
diff
changeset
|
840 |
lemma apsnd_conv [simp, code]: |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
841 |
"apsnd f (x, y) = (x, f y)" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
842 |
by (simp add: apsnd_def) |
21195 | 843 |
|
33594 | 844 |
lemma fst_apfst [simp]: |
845 |
"fst (apfst f x) = f (fst x)" |
|
846 |
by (cases x) simp |
|
847 |
||
51173 | 848 |
lemma fst_comp_apfst [simp]: |
849 |
"fst \<circ> apfst f = f \<circ> fst" |
|
850 |
by (simp add: fun_eq_iff) |
|
851 |
||
33594 | 852 |
lemma fst_apsnd [simp]: |
853 |
"fst (apsnd f x) = fst x" |
|
854 |
by (cases x) simp |
|
855 |
||
51173 | 856 |
lemma fst_comp_apsnd [simp]: |
857 |
"fst \<circ> apsnd f = fst" |
|
858 |
by (simp add: fun_eq_iff) |
|
859 |
||
33594 | 860 |
lemma snd_apfst [simp]: |
861 |
"snd (apfst f x) = snd x" |
|
862 |
by (cases x) simp |
|
863 |
||
51173 | 864 |
lemma snd_comp_apfst [simp]: |
865 |
"snd \<circ> apfst f = snd" |
|
866 |
by (simp add: fun_eq_iff) |
|
867 |
||
33594 | 868 |
lemma snd_apsnd [simp]: |
869 |
"snd (apsnd f x) = f (snd x)" |
|
870 |
by (cases x) simp |
|
871 |
||
51173 | 872 |
lemma snd_comp_apsnd [simp]: |
873 |
"snd \<circ> apsnd f = f \<circ> snd" |
|
874 |
by (simp add: fun_eq_iff) |
|
875 |
||
33594 | 876 |
lemma apfst_compose: |
877 |
"apfst f (apfst g x) = apfst (f \<circ> g) x" |
|
878 |
by (cases x) simp |
|
879 |
||
880 |
lemma apsnd_compose: |
|
881 |
"apsnd f (apsnd g x) = apsnd (f \<circ> g) x" |
|
882 |
by (cases x) simp |
|
883 |
||
884 |
lemma apfst_apsnd [simp]: |
|
885 |
"apfst f (apsnd g x) = (f (fst x), g (snd x))" |
|
886 |
by (cases x) simp |
|
887 |
||
888 |
lemma apsnd_apfst [simp]: |
|
889 |
"apsnd f (apfst g x) = (g (fst x), f (snd x))" |
|
890 |
by (cases x) simp |
|
891 |
||
892 |
lemma apfst_id [simp] : |
|
893 |
"apfst id = id" |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39272
diff
changeset
|
894 |
by (simp add: fun_eq_iff) |
33594 | 895 |
|
896 |
lemma apsnd_id [simp] : |
|
897 |
"apsnd id = id" |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39272
diff
changeset
|
898 |
by (simp add: fun_eq_iff) |
33594 | 899 |
|
900 |
lemma apfst_eq_conv [simp]: |
|
901 |
"apfst f x = apfst g x \<longleftrightarrow> f (fst x) = g (fst x)" |
|
902 |
by (cases x) simp |
|
903 |
||
904 |
lemma apsnd_eq_conv [simp]: |
|
905 |
"apsnd f x = apsnd g x \<longleftrightarrow> f (snd x) = g (snd x)" |
|
906 |
by (cases x) simp |
|
907 |
||
33638
548a34929e98
Renamed upd_snd_conv to apsnd_conv to be consistent with apfst_conv; Added apsnd_apfst_commute
hoelzl
parents:
33594
diff
changeset
|
908 |
lemma apsnd_apfst_commute: |
548a34929e98
Renamed upd_snd_conv to apsnd_conv to be consistent with apfst_conv; Added apsnd_apfst_commute
hoelzl
parents:
33594
diff
changeset
|
909 |
"apsnd f (apfst g p) = apfst g (apsnd f p)" |
548a34929e98
Renamed upd_snd_conv to apsnd_conv to be consistent with apfst_conv; Added apsnd_apfst_commute
hoelzl
parents:
33594
diff
changeset
|
910 |
by simp |
21195 | 911 |
|
56626 | 912 |
context |
913 |
begin |
|
914 |
||
60758 | 915 |
local_setup \<open>Local_Theory.map_background_naming (Name_Space.mandatory_path "prod")\<close> |
56626 | 916 |
|
56545 | 917 |
definition swap :: "'a \<times> 'b \<Rightarrow> 'b \<times> 'a" |
918 |
where |
|
919 |
"swap p = (snd p, fst p)" |
|
920 |
||
56626 | 921 |
end |
922 |
||
56545 | 923 |
lemma swap_simp [simp]: |
56626 | 924 |
"prod.swap (x, y) = (y, x)" |
925 |
by (simp add: prod.swap_def) |
|
56545 | 926 |
|
58195 | 927 |
lemma swap_swap [simp]: |
928 |
"prod.swap (prod.swap p) = p" |
|
929 |
by (cases p) simp |
|
930 |
||
931 |
lemma swap_comp_swap [simp]: |
|
932 |
"prod.swap \<circ> prod.swap = id" |
|
933 |
by (simp add: fun_eq_iff) |
|
934 |
||
56545 | 935 |
lemma pair_in_swap_image [simp]: |
56626 | 936 |
"(y, x) \<in> prod.swap ` A \<longleftrightarrow> (x, y) \<in> A" |
56545 | 937 |
by (auto intro!: image_eqI) |
938 |
||
939 |
lemma inj_swap [simp]: |
|
56626 | 940 |
"inj_on prod.swap A" |
941 |
by (rule inj_onI) auto |
|
942 |
||
943 |
lemma swap_inj_on: |
|
944 |
"inj_on (\<lambda>(i, j). (j, i)) A" |
|
945 |
by (rule inj_onI) auto |
|
56545 | 946 |
|
58195 | 947 |
lemma surj_swap [simp]: |
948 |
"surj prod.swap" |
|
949 |
by (rule surjI [of _ prod.swap]) simp |
|
950 |
||
951 |
lemma bij_swap [simp]: |
|
952 |
"bij prod.swap" |
|
953 |
by (simp add: bij_def) |
|
954 |
||
56545 | 955 |
lemma case_swap [simp]: |
56626 | 956 |
"(case prod.swap p of (y, x) \<Rightarrow> f x y) = (case p of (x, y) \<Rightarrow> f x y)" |
56545 | 957 |
by (cases p) simp |
958 |
||
60758 | 959 |
text \<open> |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
960 |
Disjoint union of a family of sets -- Sigma. |
60758 | 961 |
\<close> |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
962 |
|
45986
c9e50153e5ae
moved various set operations to theory Set (resp. Product_Type)
haftmann
parents:
45696
diff
changeset
|
963 |
definition Sigma :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b set) \<Rightarrow> ('a \<times> 'b) set" where |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
964 |
Sigma_def: "Sigma A B == UN x:A. UN y:B x. {Pair x y}" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
965 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
966 |
abbreviation |
45986
c9e50153e5ae
moved various set operations to theory Set (resp. Product_Type)
haftmann
parents:
45696
diff
changeset
|
967 |
Times :: "'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<times> 'b) set" |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
968 |
(infixr "<*>" 80) where |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
969 |
"A <*> B == Sigma A (%_. B)" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
970 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
971 |
notation (xsymbols) |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
972 |
Times (infixr "\<times>" 80) |
15394 | 973 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
974 |
notation (HTML output) |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
975 |
Times (infixr "\<times>" 80) |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
976 |
|
45662
4f7c05990420
Hide Product_Type.Times - too precious an identifier
nipkow
parents:
45607
diff
changeset
|
977 |
hide_const (open) Times |
4f7c05990420
Hide Product_Type.Times - too precious an identifier
nipkow
parents:
45607
diff
changeset
|
978 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
979 |
syntax |
35115 | 980 |
"_Sigma" :: "[pttrn, 'a set, 'b set] => ('a * 'b) set" ("(3SIGMA _:_./ _)" [0, 0, 10] 10) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
981 |
translations |
35115 | 982 |
"SIGMA x:A. B" == "CONST Sigma A (%x. B)" |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
983 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
984 |
lemma SigmaI [intro!]: "[| a:A; b:B(a) |] ==> (a,b) : Sigma A B" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
985 |
by (unfold Sigma_def) blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
986 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
987 |
lemma SigmaE [elim!]: |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
988 |
"[| c: Sigma A B; |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
989 |
!!x y.[| x:A; y:B(x); c=(x,y) |] ==> P |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
990 |
|] ==> P" |
60758 | 991 |
-- \<open>The general elimination rule.\<close> |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
992 |
by (unfold Sigma_def) blast |
20588 | 993 |
|
60758 | 994 |
text \<open> |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
995 |
Elimination of @{term "(a, b) : A \<times> B"} -- introduces no |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
996 |
eigenvariables. |
60758 | 997 |
\<close> |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
998 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
999 |
lemma SigmaD1: "(a, b) : Sigma A B ==> a : A" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1000 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1001 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1002 |
lemma SigmaD2: "(a, b) : Sigma A B ==> b : B a" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1003 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1004 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1005 |
lemma SigmaE2: |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1006 |
"[| (a, b) : Sigma A B; |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1007 |
[| a:A; b:B(a) |] ==> P |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1008 |
|] ==> P" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1009 |
by blast |
20588 | 1010 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1011 |
lemma Sigma_cong: |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1012 |
"\<lbrakk>A = B; !!x. x \<in> B \<Longrightarrow> C x = D x\<rbrakk> |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1013 |
\<Longrightarrow> (SIGMA x: A. C x) = (SIGMA x: B. D x)" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1014 |
by auto |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1015 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1016 |
lemma Sigma_mono: "[| A <= C; !!x. x:A ==> B x <= D x |] ==> Sigma A B <= Sigma C D" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1017 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1018 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1019 |
lemma Sigma_empty1 [simp]: "Sigma {} B = {}" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1020 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1021 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1022 |
lemma Sigma_empty2 [simp]: "A <*> {} = {}" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1023 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1024 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1025 |
lemma UNIV_Times_UNIV [simp]: "UNIV <*> UNIV = UNIV" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1026 |
by auto |
21908 | 1027 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1028 |
lemma Compl_Times_UNIV1 [simp]: "- (UNIV <*> A) = UNIV <*> (-A)" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1029 |
by auto |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1030 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1031 |
lemma Compl_Times_UNIV2 [simp]: "- (A <*> UNIV) = (-A) <*> UNIV" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1032 |
by auto |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1033 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1034 |
lemma mem_Sigma_iff [iff]: "((a,b): Sigma A B) = (a:A & b:B(a))" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1035 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1036 |
|
59000 | 1037 |
lemma Sigma_empty_iff: "(SIGMA i:I. X i) = {} \<longleftrightarrow> (\<forall>i\<in>I. X i = {})" |
1038 |
by auto |
|
1039 |
||
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1040 |
lemma Times_subset_cancel2: "x:C ==> (A <*> C <= B <*> C) = (A <= B)" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1041 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1042 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1043 |
lemma Times_eq_cancel2: "x:C ==> (A <*> C = B <*> C) = (A = B)" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1044 |
by (blast elim: equalityE) |
20588 | 1045 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1046 |
lemma SetCompr_Sigma_eq: |
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
1047 |
"Collect (uncurry (%x y. P x & Q x y)) = (SIGMA x:Collect P. Collect (Q x))" |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1048 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1049 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1050 |
lemma Collect_split [simp]: "{(a,b). P a & Q b} = Collect P <*> Collect Q" |
61032
b57df8eecad6
standardized some occurences of ancient "split" alias
haftmann
parents:
60758
diff
changeset
|
1051 |
by (fact SetCompr_Sigma_eq) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1052 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1053 |
lemma UN_Times_distrib: |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1054 |
"(UN (a,b):(A <*> B). E a <*> F b) = (UNION A E) <*> (UNION B F)" |
60758 | 1055 |
-- \<open>Suggested by Pierre Chartier\<close> |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1056 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1057 |
|
47740
a8989fe9a3a5
added "no_atp"s for extremely prolific, useless facts for ATPs
blanchet
parents:
46950
diff
changeset
|
1058 |
lemma split_paired_Ball_Sigma [simp, no_atp]: |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1059 |
"(ALL z: Sigma A B. P z) = (ALL x:A. ALL y: B x. P(x,y))" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1060 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1061 |
|
47740
a8989fe9a3a5
added "no_atp"s for extremely prolific, useless facts for ATPs
blanchet
parents:
46950
diff
changeset
|
1062 |
lemma split_paired_Bex_Sigma [simp, no_atp]: |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1063 |
"(EX z: Sigma A B. P z) = (EX x:A. EX y: B x. P(x,y))" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1064 |
by blast |
21908 | 1065 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1066 |
lemma Sigma_Un_distrib1: "(SIGMA i:I Un J. C(i)) = (SIGMA i:I. C(i)) Un (SIGMA j:J. C(j))" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1067 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1068 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1069 |
lemma Sigma_Un_distrib2: "(SIGMA i:I. A(i) Un B(i)) = (SIGMA i:I. A(i)) Un (SIGMA i:I. B(i))" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1070 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1071 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1072 |
lemma Sigma_Int_distrib1: "(SIGMA i:I Int J. C(i)) = (SIGMA i:I. C(i)) Int (SIGMA j:J. C(j))" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1073 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1074 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1075 |
lemma Sigma_Int_distrib2: "(SIGMA i:I. A(i) Int B(i)) = (SIGMA i:I. A(i)) Int (SIGMA i:I. B(i))" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1076 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1077 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1078 |
lemma Sigma_Diff_distrib1: "(SIGMA i:I - J. C(i)) = (SIGMA i:I. C(i)) - (SIGMA j:J. C(j))" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1079 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1080 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1081 |
lemma Sigma_Diff_distrib2: "(SIGMA i:I. A(i) - B(i)) = (SIGMA i:I. A(i)) - (SIGMA i:I. B(i))" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1082 |
by blast |
21908 | 1083 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1084 |
lemma Sigma_Union: "Sigma (Union X) B = (UN A:X. Sigma A B)" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1085 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1086 |
|
60758 | 1087 |
text \<open> |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1088 |
Non-dependent versions are needed to avoid the need for higher-order |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1089 |
matching, especially when the rules are re-oriented. |
60758 | 1090 |
\<close> |
21908 | 1091 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1092 |
lemma Times_Un_distrib1: "(A Un B) <*> C = (A <*> C) Un (B <*> C)" |
56545 | 1093 |
by (fact Sigma_Un_distrib1) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1094 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1095 |
lemma Times_Int_distrib1: "(A Int B) <*> C = (A <*> C) Int (B <*> C)" |
56545 | 1096 |
by (fact Sigma_Int_distrib1) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1097 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1098 |
lemma Times_Diff_distrib1: "(A - B) <*> C = (A <*> C) - (B <*> C)" |
56545 | 1099 |
by (fact Sigma_Diff_distrib1) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1100 |
|
36622
e393a91f86df
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl
parents:
36176
diff
changeset
|
1101 |
lemma Times_empty[simp]: "A \<times> B = {} \<longleftrightarrow> A = {} \<or> B = {}" |
e393a91f86df
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl
parents:
36176
diff
changeset
|
1102 |
by auto |
e393a91f86df
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl
parents:
36176
diff
changeset
|
1103 |
|
50104 | 1104 |
lemma times_eq_iff: "A \<times> B = C \<times> D \<longleftrightarrow> A = C \<and> B = D \<or> ((A = {} \<or> B = {}) \<and> (C = {} \<or> D = {}))" |
1105 |
by auto |
|
1106 |
||
36622
e393a91f86df
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl
parents:
36176
diff
changeset
|
1107 |
lemma fst_image_times[simp]: "fst ` (A \<times> B) = (if B = {} then {} else A)" |
44921 | 1108 |
by force |
36622
e393a91f86df
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl
parents:
36176
diff
changeset
|
1109 |
|
e393a91f86df
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl
parents:
36176
diff
changeset
|
1110 |
lemma snd_image_times[simp]: "snd ` (A \<times> B) = (if A = {} then {} else B)" |
44921 | 1111 |
by force |
36622
e393a91f86df
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl
parents:
36176
diff
changeset
|
1112 |
|
56545 | 1113 |
lemma vimage_fst: |
1114 |
"fst -` A = A \<times> UNIV" |
|
1115 |
by auto |
|
1116 |
||
1117 |
lemma vimage_snd: |
|
1118 |
"snd -` A = UNIV \<times> A" |
|
1119 |
by auto |
|
1120 |
||
28719 | 1121 |
lemma insert_times_insert[simp]: |
1122 |
"insert a A \<times> insert b B = |
|
1123 |
insert (a,b) (A \<times> insert b B \<union> insert a A \<times> B)" |
|
1124 |
by blast |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1125 |
|
33271
7be66dee1a5a
New theory Probability, which contains a development of measure theory
paulson
parents:
33089
diff
changeset
|
1126 |
lemma vimage_Times: "f -` (A \<times> B) = ((fst \<circ> f) -` A) \<inter> ((snd \<circ> f) -` B)" |
47988 | 1127 |
apply auto |
1128 |
apply (case_tac "f x") |
|
1129 |
apply auto |
|
1130 |
done |
|
33271
7be66dee1a5a
New theory Probability, which contains a development of measure theory
paulson
parents:
33089
diff
changeset
|
1131 |
|
50104 | 1132 |
lemma times_Int_times: "A \<times> B \<inter> C \<times> D = (A \<inter> C) \<times> (B \<inter> D)" |
1133 |
by auto |
|
1134 |
||
56626 | 1135 |
lemma product_swap: |
1136 |
"prod.swap ` (A \<times> B) = B \<times> A" |
|
1137 |
by (auto simp add: set_eq_iff) |
|
35822 | 1138 |
|
1139 |
lemma swap_product: |
|
56626 | 1140 |
"(\<lambda>(i, j). (j, i)) ` (A \<times> B) = B \<times> A" |
1141 |
by (auto simp add: set_eq_iff) |
|
35822 | 1142 |
|
36622
e393a91f86df
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl
parents:
36176
diff
changeset
|
1143 |
lemma image_split_eq_Sigma: |
e393a91f86df
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl
parents:
36176
diff
changeset
|
1144 |
"(\<lambda>x. (f x, g x)) ` A = Sigma (f ` A) (\<lambda>x. g ` (f -` {x} \<inter> A))" |
46128
53e7cc599f58
interaction of set operations for execution and membership predicate
haftmann
parents:
46028
diff
changeset
|
1145 |
proof (safe intro!: imageI) |
36622
e393a91f86df
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl
parents:
36176
diff
changeset
|
1146 |
fix a b assume *: "a \<in> A" "b \<in> A" and eq: "f a = f b" |
e393a91f86df
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl
parents:
36176
diff
changeset
|
1147 |
show "(f b, g a) \<in> (\<lambda>x. (f x, g x)) ` A" |
e393a91f86df
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl
parents:
36176
diff
changeset
|
1148 |
using * eq[symmetric] by auto |
e393a91f86df
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl
parents:
36176
diff
changeset
|
1149 |
qed simp_all |
35822 | 1150 |
|
60057 | 1151 |
lemma inj_on_apfst [simp]: "inj_on (apfst f) (A \<times> UNIV) \<longleftrightarrow> inj_on f A" |
1152 |
by(auto simp add: inj_on_def) |
|
1153 |
||
1154 |
lemma inj_apfst [simp]: "inj (apfst f) \<longleftrightarrow> inj f" |
|
1155 |
using inj_on_apfst[of f UNIV] by simp |
|
1156 |
||
1157 |
lemma inj_on_apsnd [simp]: "inj_on (apsnd f) (UNIV \<times> A) \<longleftrightarrow> inj_on f A" |
|
1158 |
by(auto simp add: inj_on_def) |
|
1159 |
||
1160 |
lemma inj_apsnd [simp]: "inj (apsnd f) \<longleftrightarrow> inj f" |
|
1161 |
using inj_on_apsnd[of f UNIV] by simp |
|
1162 |
||
46128
53e7cc599f58
interaction of set operations for execution and membership predicate
haftmann
parents:
46028
diff
changeset
|
1163 |
definition product :: "'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<times> 'b) set" where |
53e7cc599f58
interaction of set operations for execution and membership predicate
haftmann
parents:
46028
diff
changeset
|
1164 |
[code_abbrev]: "product A B = A \<times> B" |
53e7cc599f58
interaction of set operations for execution and membership predicate
haftmann
parents:
46028
diff
changeset
|
1165 |
|
53e7cc599f58
interaction of set operations for execution and membership predicate
haftmann
parents:
46028
diff
changeset
|
1166 |
hide_const (open) product |
53e7cc599f58
interaction of set operations for execution and membership predicate
haftmann
parents:
46028
diff
changeset
|
1167 |
|
53e7cc599f58
interaction of set operations for execution and membership predicate
haftmann
parents:
46028
diff
changeset
|
1168 |
lemma member_product: |
53e7cc599f58
interaction of set operations for execution and membership predicate
haftmann
parents:
46028
diff
changeset
|
1169 |
"x \<in> Product_Type.product A B \<longleftrightarrow> x \<in> A \<times> B" |
53e7cc599f58
interaction of set operations for execution and membership predicate
haftmann
parents:
46028
diff
changeset
|
1170 |
by (simp add: product_def) |
53e7cc599f58
interaction of set operations for execution and membership predicate
haftmann
parents:
46028
diff
changeset
|
1171 |
|
60758 | 1172 |
text \<open>The following @{const map_prod} lemmas are due to Joachim Breitner:\<close> |
40607 | 1173 |
|
55932 | 1174 |
lemma map_prod_inj_on: |
40607 | 1175 |
assumes "inj_on f A" and "inj_on g B" |
55932 | 1176 |
shows "inj_on (map_prod f g) (A \<times> B)" |
40607 | 1177 |
proof (rule inj_onI) |
1178 |
fix x :: "'a \<times> 'c" and y :: "'a \<times> 'c" |
|
1179 |
assume "x \<in> A \<times> B" hence "fst x \<in> A" and "snd x \<in> B" by auto |
|
1180 |
assume "y \<in> A \<times> B" hence "fst y \<in> A" and "snd y \<in> B" by auto |
|
55932 | 1181 |
assume "map_prod f g x = map_prod f g y" |
1182 |
hence "fst (map_prod f g x) = fst (map_prod f g y)" by (auto) |
|
40607 | 1183 |
hence "f (fst x) = f (fst y)" by (cases x,cases y,auto) |
60758 | 1184 |
with \<open>inj_on f A\<close> and \<open>fst x \<in> A\<close> and \<open>fst y \<in> A\<close> |
40607 | 1185 |
have "fst x = fst y" by (auto dest:dest:inj_onD) |
60758 | 1186 |
moreover from \<open>map_prod f g x = map_prod f g y\<close> |
55932 | 1187 |
have "snd (map_prod f g x) = snd (map_prod f g y)" by (auto) |
40607 | 1188 |
hence "g (snd x) = g (snd y)" by (cases x,cases y,auto) |
60758 | 1189 |
with \<open>inj_on g B\<close> and \<open>snd x \<in> B\<close> and \<open>snd y \<in> B\<close> |
40607 | 1190 |
have "snd x = snd y" by (auto dest:dest:inj_onD) |
1191 |
ultimately show "x = y" by(rule prod_eqI) |
|
1192 |
qed |
|
1193 |
||
55932 | 1194 |
lemma map_prod_surj: |
40702 | 1195 |
fixes f :: "'a \<Rightarrow> 'b" and g :: "'c \<Rightarrow> 'd" |
40607 | 1196 |
assumes "surj f" and "surj g" |
55932 | 1197 |
shows "surj (map_prod f g)" |
40607 | 1198 |
unfolding surj_def |
1199 |
proof |
|
1200 |
fix y :: "'b \<times> 'd" |
|
60758 | 1201 |
from \<open>surj f\<close> obtain a where "fst y = f a" by (auto elim:surjE) |
40607 | 1202 |
moreover |
60758 | 1203 |
from \<open>surj g\<close> obtain b where "snd y = g b" by (auto elim:surjE) |
55932 | 1204 |
ultimately have "(fst y, snd y) = map_prod f g (a,b)" by auto |
1205 |
thus "\<exists>x. y = map_prod f g x" by auto |
|
40607 | 1206 |
qed |
1207 |
||
55932 | 1208 |
lemma map_prod_surj_on: |
40607 | 1209 |
assumes "f ` A = A'" and "g ` B = B'" |
55932 | 1210 |
shows "map_prod f g ` (A \<times> B) = A' \<times> B'" |
40607 | 1211 |
unfolding image_def |
1212 |
proof(rule set_eqI,rule iffI) |
|
1213 |
fix x :: "'a \<times> 'c" |
|
61076 | 1214 |
assume "x \<in> {y::'a \<times> 'c. \<exists>x::'b \<times> 'd\<in>A \<times> B. y = map_prod f g x}" |
55932 | 1215 |
then obtain y where "y \<in> A \<times> B" and "x = map_prod f g y" by blast |
60758 | 1216 |
from \<open>image f A = A'\<close> and \<open>y \<in> A \<times> B\<close> have "f (fst y) \<in> A'" by auto |
1217 |
moreover from \<open>image g B = B'\<close> and \<open>y \<in> A \<times> B\<close> have "g (snd y) \<in> B'" by auto |
|
40607 | 1218 |
ultimately have "(f (fst y), g (snd y)) \<in> (A' \<times> B')" by auto |
60758 | 1219 |
with \<open>x = map_prod f g y\<close> show "x \<in> A' \<times> B'" by (cases y, auto) |
40607 | 1220 |
next |
1221 |
fix x :: "'a \<times> 'c" |
|
1222 |
assume "x \<in> A' \<times> B'" hence "fst x \<in> A'" and "snd x \<in> B'" by auto |
|
60758 | 1223 |
from \<open>image f A = A'\<close> and \<open>fst x \<in> A'\<close> have "fst x \<in> image f A" by auto |
40607 | 1224 |
then obtain a where "a \<in> A" and "fst x = f a" by (rule imageE) |
60758 | 1225 |
moreover from \<open>image g B = B'\<close> and \<open>snd x \<in> B'\<close> |
40607 | 1226 |
obtain b where "b \<in> B" and "snd x = g b" by auto |
55932 | 1227 |
ultimately have "(fst x, snd x) = map_prod f g (a,b)" by auto |
60758 | 1228 |
moreover from \<open>a \<in> A\<close> and \<open>b \<in> B\<close> have "(a , b) \<in> A \<times> B" by auto |
55932 | 1229 |
ultimately have "\<exists>y \<in> A \<times> B. x = map_prod f g y" by auto |
1230 |
thus "x \<in> {x. \<exists>y \<in> A \<times> B. x = map_prod f g y}" by auto |
|
40607 | 1231 |
qed |
1232 |
||
21908 | 1233 |
|
60758 | 1234 |
subsection \<open>Simproc for rewriting a set comprehension into a pointfree expression\<close> |
49764
9979d64b8016
moving simproc from Finite_Set to more appropriate Product_Type theory
bulwahn
parents:
48891
diff
changeset
|
1235 |
|
9979d64b8016
moving simproc from Finite_Set to more appropriate Product_Type theory
bulwahn
parents:
48891
diff
changeset
|
1236 |
ML_file "Tools/set_comprehension_pointfree.ML" |
9979d64b8016
moving simproc from Finite_Set to more appropriate Product_Type theory
bulwahn
parents:
48891
diff
changeset
|
1237 |
|
60758 | 1238 |
setup \<open> |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset
|
1239 |
Code_Preproc.map_pre (fn ctxt => ctxt addsimprocs |
49764
9979d64b8016
moving simproc from Finite_Set to more appropriate Product_Type theory
bulwahn
parents:
48891
diff
changeset
|
1240 |
[Raw_Simplifier.make_simproc {name = "set comprehension", lhss = [@{cpat "Collect ?P"}], |
9979d64b8016
moving simproc from Finite_Set to more appropriate Product_Type theory
bulwahn
parents:
48891
diff
changeset
|
1241 |
proc = K Set_Comprehension_Pointfree.code_simproc, identifier = []}]) |
60758 | 1242 |
\<close> |
49764
9979d64b8016
moving simproc from Finite_Set to more appropriate Product_Type theory
bulwahn
parents:
48891
diff
changeset
|
1243 |
|
9979d64b8016
moving simproc from Finite_Set to more appropriate Product_Type theory
bulwahn
parents:
48891
diff
changeset
|
1244 |
|
60758 | 1245 |
subsection \<open>Inductively defined sets\<close> |
15394 | 1246 |
|
56512 | 1247 |
(* simplify {(x1, ..., xn). (x1, ..., xn) : S} to S *) |
60758 | 1248 |
simproc_setup Collect_mem ("Collect t") = \<open> |
56512 | 1249 |
fn _ => fn ctxt => fn ct => |
59582 | 1250 |
(case Thm.term_of ct of |
56512 | 1251 |
S as Const (@{const_name Collect}, Type (@{type_name fun}, [_, T])) $ t => |
1252 |
let val (u, _, ps) = HOLogic.strip_psplits t in |
|
1253 |
(case u of |
|
1254 |
(c as Const (@{const_name Set.member}, _)) $ q $ S' => |
|
1255 |
(case try (HOLogic.strip_ptuple ps) q of |
|
1256 |
NONE => NONE |
|
1257 |
| SOME ts => |
|
1258 |
if not (Term.is_open S') andalso |
|
1259 |
ts = map Bound (length ps downto 0) |
|
1260 |
then |
|
1261 |
let val simp = |
|
1262 |
full_simp_tac (put_simpset HOL_basic_ss ctxt |
|
1263 |
addsimps [@{thm split_paired_all}, @{thm split_conv}]) 1 |
|
1264 |
in |
|
1265 |
SOME (Goal.prove ctxt [] [] |
|
1266 |
(Const (@{const_name Pure.eq}, T --> T --> propT) $ S $ S') |
|
1267 |
(K (EVERY |
|
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59000
diff
changeset
|
1268 |
[resolve_tac ctxt [eq_reflection] 1, |
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59000
diff
changeset
|
1269 |
resolve_tac ctxt @{thms subset_antisym} 1, |
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59000
diff
changeset
|
1270 |
resolve_tac ctxt [subsetI] 1, dresolve_tac ctxt [CollectD] 1, simp, |
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59000
diff
changeset
|
1271 |
resolve_tac ctxt [subsetI] 1, resolve_tac ctxt [CollectI] 1, simp]))) |
56512 | 1272 |
end |
1273 |
else NONE) |
|
1274 |
| _ => NONE) |
|
1275 |
end |
|
1276 |
| _ => NONE) |
|
60758 | 1277 |
\<close> |
58389 | 1278 |
|
48891 | 1279 |
ML_file "Tools/inductive_set.ML" |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
1280 |
|
37166 | 1281 |
|
60758 | 1282 |
subsection \<open>Legacy theorem bindings and duplicates\<close> |
37166 | 1283 |
|
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
1284 |
abbreviation (input) case_prod :: "('a \<Rightarrow> 'b \<Rightarrow> 'c) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'c" where |
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
1285 |
"case_prod \<equiv> uncurry" |
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
1286 |
|
61032
b57df8eecad6
standardized some occurences of ancient "split" alias
haftmann
parents:
60758
diff
changeset
|
1287 |
abbreviation (input) split :: "('a \<Rightarrow> 'b \<Rightarrow> 'c) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'c" where |
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61124
diff
changeset
|
1288 |
"split \<equiv> uncurry" |
37166 | 1289 |
|
61032
b57df8eecad6
standardized some occurences of ancient "split" alias
haftmann
parents:
60758
diff
changeset
|
1290 |
lemmas PairE = prod.exhaust |
37166 | 1291 |
lemmas Pair_eq = prod.inject |
55393
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
1292 |
lemmas fst_conv = prod.sel(1) |
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
1293 |
lemmas snd_conv = prod.sel(2) |
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
1294 |
lemmas pair_collapse = prod.collapse |
ce5cebfaedda
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
blanchet
parents:
54630
diff
changeset
|
1295 |
lemmas split = split_conv |
44066
d74182c93f04
rename Pair_fst_snd_eq to prod_eq_iff (keeping old name too)
huffman
parents:
43866
diff
changeset
|
1296 |
lemmas Pair_fst_snd_eq = prod_eq_iff |
61032
b57df8eecad6
standardized some occurences of ancient "split" alias
haftmann
parents:
60758
diff
changeset
|
1297 |
lemmas split_def = case_prod_unfold |
44066
d74182c93f04
rename Pair_fst_snd_eq to prod_eq_iff (keeping old name too)
huffman
parents:
43866
diff
changeset
|
1298 |
|
45204
5e4a1270c000
hide typedef-generated constants Product_Type.prod and Sum_Type.sum
huffman
parents:
44921
diff
changeset
|
1299 |
hide_const (open) prod |
5e4a1270c000
hide typedef-generated constants Product_Type.prod and Sum_Type.sum
huffman
parents:
44921
diff
changeset
|
1300 |
|
10213 | 1301 |
end |