author | blanchet |
Fri, 27 May 2011 10:30:08 +0200 | |
changeset 43016 | 42330f25142c |
parent 42411 | ff997038e8eb |
child 43594 | ef1ddc59b825 |
permissions | -rw-r--r-- |
10213 | 1 |
(* Title: HOL/Product_Type.thy |
2 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
3 |
Copyright 1992 University of Cambridge |
|
11777 | 4 |
*) |
10213 | 5 |
|
11838 | 6 |
header {* Cartesian products *} |
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 |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
10 |
uses |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
11 |
("Tools/split_rule.ML") |
37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
12 |
("Tools/inductive_codegen.ML") |
31723
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31667
diff
changeset
|
13 |
("Tools/inductive_set.ML") |
15131 | 14 |
begin |
11838 | 15 |
|
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
16 |
subsection {* @{typ bool} is a datatype *} |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
17 |
|
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
26975
diff
changeset
|
18 |
rep_datatype True False by (auto intro: bool_induct) |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
19 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
20 |
declare case_split [cases type: bool] |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
21 |
-- "prefer plain propositional version" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
22 |
|
28346
b8390cd56b8f
discontinued special treatment of op = vs. eq_class.eq
haftmann
parents:
28262
diff
changeset
|
23 |
lemma |
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
24 |
shows [code]: "HOL.equal False P \<longleftrightarrow> \<not> P" |
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
25 |
and [code]: "HOL.equal True P \<longleftrightarrow> P" |
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
26 |
and [code]: "HOL.equal P False \<longleftrightarrow> \<not> P" |
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
27 |
and [code]: "HOL.equal P True \<longleftrightarrow> P" |
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
28 |
and [code nbe]: "HOL.equal P P \<longleftrightarrow> True" |
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
29 |
by (simp_all add: equal) |
25534
d0b74fdd6067
simplified infrastructure for code generator operational equality
haftmann
parents:
25511
diff
changeset
|
30 |
|
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
31 |
code_const "HOL.equal \<Colon> bool \<Rightarrow> bool \<Rightarrow> bool" |
39272 | 32 |
(Haskell infix 4 "==") |
25534
d0b74fdd6067
simplified infrastructure for code generator operational equality
haftmann
parents:
25511
diff
changeset
|
33 |
|
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
34 |
code_instance bool :: equal |
25534
d0b74fdd6067
simplified infrastructure for code generator operational equality
haftmann
parents:
25511
diff
changeset
|
35 |
(Haskell -) |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
36 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
37 |
|
37166 | 38 |
subsection {* The @{text unit} type *} |
11838 | 39 |
|
40590 | 40 |
typedef (open) unit = "{True}" |
11838 | 41 |
proof |
20588 | 42 |
show "True : ?unit" .. |
11838 | 43 |
qed |
44 |
||
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
45 |
definition |
11838 | 46 |
Unity :: unit ("'(')") |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
47 |
where |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
48 |
"() = Abs_unit True" |
11838 | 49 |
|
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset
|
50 |
lemma unit_eq [no_atp]: "u = ()" |
40590 | 51 |
by (induct u) (simp add: Unity_def) |
11838 | 52 |
|
53 |
text {* |
|
54 |
Simplification procedure for @{thm [source] unit_eq}. Cannot use |
|
55 |
this rule directly --- it loops! |
|
56 |
*} |
|
57 |
||
26480 | 58 |
ML {* |
13462 | 59 |
val unit_eq_proc = |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
60 |
let val unit_meta_eq = mk_meta_eq @{thm unit_eq} in |
38715
6513ea67d95d
renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
wenzelm
parents:
37808
diff
changeset
|
61 |
Simplifier.simproc_global @{theory} "unit_eq" ["x::unit"] |
15531 | 62 |
(fn _ => fn _ => fn t => if HOLogic.is_unit t then NONE else SOME unit_meta_eq) |
13462 | 63 |
end; |
11838 | 64 |
|
65 |
Addsimprocs [unit_eq_proc]; |
|
66 |
*} |
|
67 |
||
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
26975
diff
changeset
|
68 |
rep_datatype "()" by simp |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
69 |
|
11838 | 70 |
lemma unit_all_eq1: "(!!x::unit. PROP P x) == PROP P ()" |
71 |
by simp |
|
72 |
||
73 |
lemma unit_all_eq2: "(!!x::unit. PROP P) == PROP P" |
|
74 |
by (rule triv_forall_equality) |
|
75 |
||
76 |
text {* |
|
77 |
This rewrite counters the effect of @{text unit_eq_proc} on @{term |
|
78 |
[source] "%u::unit. f u"}, replacing it by @{term [source] |
|
79 |
f} rather than by @{term [source] "%u. f ()"}. |
|
80 |
*} |
|
81 |
||
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset
|
82 |
lemma unit_abs_eta_conv [simp,no_atp]: "(%u::unit. f ()) = f" |
11838 | 83 |
by (rule ext) simp |
10213 | 84 |
|
30924 | 85 |
instantiation unit :: default |
86 |
begin |
|
87 |
||
88 |
definition "default = ()" |
|
89 |
||
90 |
instance .. |
|
91 |
||
92 |
end |
|
10213 | 93 |
|
28562 | 94 |
lemma [code]: |
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
95 |
"HOL.equal (u\<Colon>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
|
96 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
97 |
code_type unit |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
98 |
(SML "unit") |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
99 |
(OCaml "unit") |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
100 |
(Haskell "()") |
34886 | 101 |
(Scala "Unit") |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
102 |
|
37166 | 103 |
code_const Unity |
104 |
(SML "()") |
|
105 |
(OCaml "()") |
|
106 |
(Haskell "()") |
|
107 |
(Scala "()") |
|
108 |
||
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
109 |
code_instance unit :: equal |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
110 |
(Haskell -) |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
111 |
|
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
112 |
code_const "HOL.equal \<Colon> unit \<Rightarrow> unit \<Rightarrow> bool" |
39272 | 113 |
(Haskell infix 4 "==") |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
114 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
115 |
code_reserved SML |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
116 |
unit |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
117 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
118 |
code_reserved OCaml |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
119 |
unit |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
120 |
|
34886 | 121 |
code_reserved Scala |
122 |
Unit |
|
123 |
||
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
124 |
|
37166 | 125 |
subsection {* The product type *} |
10213 | 126 |
|
37166 | 127 |
subsubsection {* Type definition *} |
128 |
||
129 |
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
|
130 |
"Pair_Rep a b = (\<lambda>x y. x = a \<and> y = b)" |
10213 | 131 |
|
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
132 |
typedef ('a, 'b) prod (infixr "*" 20) |
37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
133 |
= "{f. \<exists>a b. f = Pair_Rep (a\<Colon>'a) (b\<Colon>'b)}" |
11025
a70b796d9af8
converted to Isar therory, adding attributes complete_split and split_format
oheimb
parents:
10289
diff
changeset
|
134 |
proof |
37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
135 |
fix a b show "Pair_Rep a b \<in> ?prod" |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
136 |
by rule+ |
11025
a70b796d9af8
converted to Isar therory, adding attributes complete_split and split_format
oheimb
parents:
10289
diff
changeset
|
137 |
qed |
10213 | 138 |
|
35427 | 139 |
type_notation (xsymbols) |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
140 |
"prod" ("(_ \<times>/ _)" [21, 20] 20) |
35427 | 141 |
type_notation (HTML output) |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
142 |
"prod" ("(_ \<times>/ _)" [21, 20] 20) |
10213 | 143 |
|
37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
144 |
definition Pair :: "'a \<Rightarrow> 'b \<Rightarrow> 'a \<times> 'b" where |
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
145 |
"Pair a b = Abs_prod (Pair_Rep a b)" |
37166 | 146 |
|
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
147 |
rep_datatype Pair proof - |
37166 | 148 |
fix P :: "'a \<times> 'b \<Rightarrow> bool" and p |
149 |
assume "\<And>a b. P (Pair a b)" |
|
37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
150 |
then show "P p" by (cases p) (auto simp add: prod_def Pair_def Pair_Rep_def) |
37166 | 151 |
next |
152 |
fix a c :: 'a and b d :: 'b |
|
153 |
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
|
154 |
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
|
155 |
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
|
156 |
by (auto simp add: prod_def) |
37166 | 157 |
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
|
158 |
by (simp add: Pair_def Abs_prod_inject) |
37166 | 159 |
qed |
160 |
||
37704
c6161bee8486
adapt Nitpick to "prod_case" and "*" -> "sum" renaming;
blanchet
parents:
37678
diff
changeset
|
161 |
declare prod.simps(2) [nitpick_simp del] |
c6161bee8486
adapt Nitpick to "prod_case" and "*" -> "sum" renaming;
blanchet
parents:
37678
diff
changeset
|
162 |
|
40929
7ff03a5e044f
theorem names generated by the (rep_)datatype command now have mandatory qualifiers
huffman
parents:
40702
diff
changeset
|
163 |
declare prod.weak_case_cong [cong del] |
37411
c88c44156083
removed simplifier congruence rule of "prod_case"
haftmann
parents:
37389
diff
changeset
|
164 |
|
37166 | 165 |
|
166 |
subsubsection {* Tuple syntax *} |
|
167 |
||
37591 | 168 |
abbreviation (input) split :: "('a \<Rightarrow> 'b \<Rightarrow> 'c) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'c" where |
169 |
"split \<equiv> prod_case" |
|
19535 | 170 |
|
11777 | 171 |
text {* |
172 |
Patterns -- extends pre-defined type @{typ pttrn} used in |
|
173 |
abstractions. |
|
174 |
*} |
|
10213 | 175 |
|
41229
d797baa3d57c
replaced command 'nonterminals' by slightly modernized version 'nonterminal';
wenzelm
parents:
40968
diff
changeset
|
176 |
nonterminal tuple_args and patterns |
10213 | 177 |
|
178 |
syntax |
|
179 |
"_tuple" :: "'a => tuple_args => 'a * 'b" ("(1'(_,/ _'))") |
|
180 |
"_tuple_arg" :: "'a => tuple_args" ("_") |
|
181 |
"_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
|
182 |
"_pattern" :: "[pttrn, patterns] => pttrn" ("'(_,/ _')") |
a70b796d9af8
converted to Isar therory, adding attributes complete_split and split_format
oheimb
parents:
10289
diff
changeset
|
183 |
"" :: "pttrn => patterns" ("_") |
a70b796d9af8
converted to Isar therory, adding attributes complete_split and split_format
oheimb
parents:
10289
diff
changeset
|
184 |
"_patterns" :: "[pttrn, patterns] => patterns" ("_,/ _") |
10213 | 185 |
|
186 |
translations |
|
35115 | 187 |
"(x, y)" == "CONST Pair x y" |
10213 | 188 |
"_tuple x (_tuple_args y z)" == "_tuple x (_tuple_arg (_tuple y z))" |
37591 | 189 |
"%(x, y, zs). b" == "CONST prod_case (%x (y, zs). b)" |
190 |
"%(x, y). b" == "CONST prod_case (%x y. b)" |
|
35115 | 191 |
"_abs (CONST Pair x y) t" => "%(x, y). t" |
37166 | 192 |
-- {* The last rule accommodates tuples in `case C ... (x,y) ... => ...' |
193 |
The (x,y) is parsed as `Pair x y' because it is logic, not pttrn *} |
|
10213 | 194 |
|
35115 | 195 |
(*reconstruct pattern from (nested) splits, avoiding eta-contraction of body; |
196 |
works best with enclosing "let", if "let" does not avoid eta-contraction*) |
|
14359 | 197 |
print_translation {* |
35115 | 198 |
let |
199 |
fun split_tr' [Abs (x, T, t as (Abs abs))] = |
|
200 |
(* split (%x y. t) => %(x,y) t *) |
|
201 |
let |
|
42284 | 202 |
val (y, t') = Syntax_Trans.atomic_abs_tr' abs; |
203 |
val (x', t'') = Syntax_Trans.atomic_abs_tr' (x, T, t'); |
|
35115 | 204 |
in |
205 |
Syntax.const @{syntax_const "_abs"} $ |
|
206 |
(Syntax.const @{syntax_const "_pattern"} $ x' $ y) $ t'' |
|
207 |
end |
|
37591 | 208 |
| split_tr' [Abs (x, T, (s as Const (@{const_syntax prod_case}, _) $ t))] = |
35115 | 209 |
(* split (%x. (split (%y z. t))) => %(x,y,z). t *) |
210 |
let |
|
211 |
val Const (@{syntax_const "_abs"}, _) $ |
|
212 |
(Const (@{syntax_const "_pattern"}, _) $ y $ z) $ t' = split_tr' [t]; |
|
42284 | 213 |
val (x', t'') = Syntax_Trans.atomic_abs_tr' (x, T, t'); |
35115 | 214 |
in |
215 |
Syntax.const @{syntax_const "_abs"} $ |
|
216 |
(Syntax.const @{syntax_const "_pattern"} $ x' $ |
|
217 |
(Syntax.const @{syntax_const "_patterns"} $ y $ z)) $ t'' |
|
218 |
end |
|
37591 | 219 |
| split_tr' [Const (@{const_syntax prod_case}, _) $ t] = |
35115 | 220 |
(* split (split (%x y z. t)) => %((x, y), z). t *) |
221 |
split_tr' [(split_tr' [t])] (* inner split_tr' creates next pattern *) |
|
222 |
| split_tr' [Const (@{syntax_const "_abs"}, _) $ x_y $ Abs abs] = |
|
223 |
(* split (%pttrn z. t) => %(pttrn,z). t *) |
|
42284 | 224 |
let val (z, t) = Syntax_Trans.atomic_abs_tr' abs in |
35115 | 225 |
Syntax.const @{syntax_const "_abs"} $ |
226 |
(Syntax.const @{syntax_const "_pattern"} $ x_y $ z) $ t |
|
227 |
end |
|
228 |
| split_tr' _ = raise Match; |
|
37591 | 229 |
in [(@{const_syntax prod_case}, split_tr')] end |
14359 | 230 |
*} |
231 |
||
15422
cbdddc0efadf
added print translation for split: split f --> %(x,y). f x y
schirmer
parents:
15404
diff
changeset
|
232 |
(* print "split f" as "\<lambda>(x,y). f x y" and "split (\<lambda>x. f x)" as "\<lambda>(x,y). f x y" *) |
cbdddc0efadf
added print translation for split: split f --> %(x,y). f x y
schirmer
parents:
15404
diff
changeset
|
233 |
typed_print_translation {* |
cbdddc0efadf
added print translation for split: split f --> %(x,y). f x y
schirmer
parents:
15404
diff
changeset
|
234 |
let |
42247
12fe41a92cd5
typed_print_translation: discontinued show_sorts argument;
wenzelm
parents:
42083
diff
changeset
|
235 |
fun split_guess_names_tr' T [Abs (x, _, Abs _)] = raise Match |
12fe41a92cd5
typed_print_translation: discontinued show_sorts argument;
wenzelm
parents:
42083
diff
changeset
|
236 |
| split_guess_names_tr' T [Abs (x, xT, t)] = |
15422
cbdddc0efadf
added print translation for split: split f --> %(x,y). f x y
schirmer
parents:
15404
diff
changeset
|
237 |
(case (head_of t) of |
37591 | 238 |
Const (@{const_syntax prod_case}, _) => raise Match |
35115 | 239 |
| _ => |
240 |
let |
|
241 |
val (_ :: yT :: _) = binder_types (domain_type T) handle Bind => raise Match; |
|
42284 | 242 |
val (y, t') = Syntax_Trans.atomic_abs_tr' ("y", yT, incr_boundvars 1 t $ Bound 0); |
243 |
val (x', t'') = Syntax_Trans.atomic_abs_tr' (x, xT, t'); |
|
35115 | 244 |
in |
245 |
Syntax.const @{syntax_const "_abs"} $ |
|
246 |
(Syntax.const @{syntax_const "_pattern"} $ x' $ y) $ t'' |
|
247 |
end) |
|
42247
12fe41a92cd5
typed_print_translation: discontinued show_sorts argument;
wenzelm
parents:
42083
diff
changeset
|
248 |
| split_guess_names_tr' T [t] = |
35115 | 249 |
(case head_of t of |
37591 | 250 |
Const (@{const_syntax prod_case}, _) => raise Match |
35115 | 251 |
| _ => |
252 |
let |
|
253 |
val (xT :: yT :: _) = binder_types (domain_type T) handle Bind => raise Match; |
|
42284 | 254 |
val (y, t') = |
255 |
Syntax_Trans.atomic_abs_tr' ("y", yT, incr_boundvars 2 t $ Bound 1 $ Bound 0); |
|
256 |
val (x', t'') = Syntax_Trans.atomic_abs_tr' ("x", xT, t'); |
|
35115 | 257 |
in |
258 |
Syntax.const @{syntax_const "_abs"} $ |
|
259 |
(Syntax.const @{syntax_const "_pattern"} $ x' $ y) $ t'' |
|
260 |
end) |
|
42247
12fe41a92cd5
typed_print_translation: discontinued show_sorts argument;
wenzelm
parents:
42083
diff
changeset
|
261 |
| split_guess_names_tr' _ _ = raise Match; |
37591 | 262 |
in [(@{const_syntax prod_case}, split_guess_names_tr')] end |
15422
cbdddc0efadf
added print translation for split: split f --> %(x,y). f x y
schirmer
parents:
15404
diff
changeset
|
263 |
*} |
cbdddc0efadf
added print translation for split: split f --> %(x,y). f x y
schirmer
parents:
15404
diff
changeset
|
264 |
|
42059
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
265 |
(* Force eta-contraction for terms of the form "Q A (%p. prod_case P p)" |
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
266 |
where Q is some bounded quantifier or set operator. |
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
267 |
Reason: the above prints as "Q p : A. case p of (x,y) \<Rightarrow> P x y" |
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
268 |
whereas we want "Q (x,y):A. P x y". |
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
269 |
Otherwise prevent eta-contraction. |
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
270 |
*) |
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
271 |
print_translation {* |
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
272 |
let |
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
273 |
fun contract Q f ts = |
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
274 |
case ts of |
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
275 |
[A, Abs(_, _, (s as Const (@{const_syntax prod_case},_) $ t) $ Bound 0)] |
42083
e1209fc7ecdc
added Term.is_open and Term.is_dependent convenience, to cover common situations of loose bounds;
wenzelm
parents:
42059
diff
changeset
|
276 |
=> if Term.is_dependent t then f ts else Syntax.const Q $ A $ s |
42059
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
277 |
| _ => f ts; |
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
278 |
fun contract2 (Q,f) = (Q, contract Q f); |
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
279 |
val pairs = |
42284 | 280 |
[Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax Ball} @{syntax_const "_Ball"}, |
281 |
Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax Bex} @{syntax_const "_Bex"}, |
|
282 |
Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax INFI} @{syntax_const "_INF"}, |
|
283 |
Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax SUPR} @{syntax_const "_SUP"}] |
|
42059
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
284 |
in map contract2 pairs end |
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset
|
285 |
*} |
10213 | 286 |
|
37166 | 287 |
subsubsection {* Code generator setup *} |
288 |
||
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
289 |
code_type prod |
37166 | 290 |
(SML infix 2 "*") |
291 |
(OCaml infix 2 "*") |
|
292 |
(Haskell "!((_),/ (_))") |
|
293 |
(Scala "((_),/ (_))") |
|
294 |
||
295 |
code_const Pair |
|
296 |
(SML "!((_),/ (_))") |
|
297 |
(OCaml "!((_),/ (_))") |
|
298 |
(Haskell "!((_),/ (_))") |
|
299 |
(Scala "!((_),/ (_))") |
|
300 |
||
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
301 |
code_instance prod :: equal |
37166 | 302 |
(Haskell -) |
303 |
||
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset
|
304 |
code_const "HOL.equal \<Colon> 'a \<times> 'b \<Rightarrow> 'a \<times> 'b \<Rightarrow> bool" |
39272 | 305 |
(Haskell infix 4 "==") |
37166 | 306 |
|
307 |
types_code |
|
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
308 |
"prod" ("(_ */ _)") |
37166 | 309 |
attach (term_of) {* |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
310 |
fun term_of_prod aF aT bF bT (x, y) = HOLogic.pair_const aT bT $ aF x $ bF y; |
37166 | 311 |
*} |
312 |
attach (test) {* |
|
37808
e604e5f9bb6a
correcting function name of generator for products of traditional code generator (introduced in 0040bafffdef)
bulwahn
parents:
37765
diff
changeset
|
313 |
fun gen_prod aG aT bG bT i = |
37166 | 314 |
let |
315 |
val (x, t) = aG i; |
|
316 |
val (y, u) = bG i |
|
317 |
in ((x, y), fn () => HOLogic.pair_const aT bT $ t () $ u ()) end; |
|
318 |
*} |
|
319 |
||
320 |
consts_code |
|
321 |
"Pair" ("(_,/ _)") |
|
322 |
||
323 |
setup {* |
|
324 |
let |
|
325 |
||
326 |
fun strip_abs_split 0 t = ([], t) |
|
327 |
| strip_abs_split i (Abs (s, T, t)) = |
|
328 |
let |
|
329 |
val s' = Codegen.new_name t s; |
|
330 |
val v = Free (s', T) |
|
331 |
in apfst (cons v) (strip_abs_split (i-1) (subst_bound (v, t))) end |
|
37591 | 332 |
| strip_abs_split i (u as Const (@{const_name prod_case}, _) $ t) = |
37166 | 333 |
(case strip_abs_split (i+1) t of |
334 |
(v :: v' :: vs, u) => (HOLogic.mk_prod (v, v') :: vs, u) |
|
335 |
| _ => ([], u)) |
|
336 |
| strip_abs_split i t = |
|
337 |
strip_abs_split i (Abs ("x", hd (binder_types (fastype_of t)), t $ Bound 0)); |
|
338 |
||
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset
|
339 |
fun let_codegen thy mode defs dep thyname brack t gr = |
37166 | 340 |
(case strip_comb t of |
341 |
(t1 as Const (@{const_name Let}, _), t2 :: t3 :: ts) => |
|
342 |
let |
|
343 |
fun dest_let (l as Const (@{const_name Let}, _) $ t $ u) = |
|
344 |
(case strip_abs_split 1 u of |
|
345 |
([p], u') => apfst (cons (p, t)) (dest_let u') |
|
346 |
| _ => ([], l)) |
|
347 |
| dest_let t = ([], t); |
|
348 |
fun mk_code (l, r) gr = |
|
349 |
let |
|
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset
|
350 |
val (pl, gr1) = Codegen.invoke_codegen thy mode defs dep thyname false l gr; |
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset
|
351 |
val (pr, gr2) = Codegen.invoke_codegen thy mode defs dep thyname false r gr1; |
37166 | 352 |
in ((pl, pr), gr2) end |
353 |
in case dest_let (t1 $ t2 $ t3) of |
|
354 |
([], _) => NONE |
|
355 |
| (ps, u) => |
|
356 |
let |
|
357 |
val (qs, gr1) = fold_map mk_code ps gr; |
|
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset
|
358 |
val (pu, gr2) = Codegen.invoke_codegen thy mode defs dep thyname false u gr1; |
37166 | 359 |
val (pargs, gr3) = fold_map |
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset
|
360 |
(Codegen.invoke_codegen thy mode defs dep thyname true) ts gr2 |
37166 | 361 |
in |
362 |
SOME (Codegen.mk_app brack |
|
363 |
(Pretty.blk (0, [Codegen.str "let ", Pretty.blk (0, flat |
|
364 |
(separate [Codegen.str ";", Pretty.brk 1] (map (fn (pl, pr) => |
|
365 |
[Pretty.block [Codegen.str "val ", pl, Codegen.str " =", |
|
366 |
Pretty.brk 1, pr]]) qs))), |
|
367 |
Pretty.brk 1, Codegen.str "in ", pu, |
|
368 |
Pretty.brk 1, Codegen.str "end"])) pargs, gr3) |
|
369 |
end |
|
370 |
end |
|
371 |
| _ => NONE); |
|
372 |
||
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset
|
373 |
fun split_codegen thy mode defs dep thyname brack t gr = (case strip_comb t of |
37591 | 374 |
(t1 as Const (@{const_name prod_case}, _), t2 :: ts) => |
37166 | 375 |
let |
376 |
val ([p], u) = strip_abs_split 1 (t1 $ t2); |
|
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset
|
377 |
val (q, gr1) = Codegen.invoke_codegen thy mode defs dep thyname false p gr; |
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset
|
378 |
val (pu, gr2) = Codegen.invoke_codegen thy mode defs dep thyname false u gr1; |
37166 | 379 |
val (pargs, gr3) = fold_map |
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset
|
380 |
(Codegen.invoke_codegen thy mode defs dep thyname true) ts gr2 |
37166 | 381 |
in |
382 |
SOME (Codegen.mk_app brack |
|
383 |
(Pretty.block [Codegen.str "(fn ", q, Codegen.str " =>", |
|
384 |
Pretty.brk 1, pu, Codegen.str ")"]) pargs, gr2) |
|
385 |
end |
|
386 |
| _ => NONE); |
|
387 |
||
388 |
in |
|
389 |
||
390 |
Codegen.add_codegen "let_codegen" let_codegen |
|
391 |
#> Codegen.add_codegen "split_codegen" split_codegen |
|
392 |
||
393 |
end |
|
394 |
*} |
|
395 |
||
396 |
||
397 |
subsubsection {* Fundamental operations and properties *} |
|
11838 | 398 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
399 |
lemma surj_pair [simp]: "EX x y. p = (x, y)" |
37166 | 400 |
by (cases p) simp |
10213 | 401 |
|
37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
402 |
definition fst :: "'a \<times> 'b \<Rightarrow> 'a" where |
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
403 |
"fst p = (case p of (a, b) \<Rightarrow> a)" |
11838 | 404 |
|
37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
405 |
definition snd :: "'a \<times> 'b \<Rightarrow> 'b" where |
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
406 |
"snd p = (case p of (a, b) \<Rightarrow> b)" |
11838 | 407 |
|
22886 | 408 |
lemma fst_conv [simp, code]: "fst (a, b) = a" |
37166 | 409 |
unfolding fst_def by simp |
11838 | 410 |
|
22886 | 411 |
lemma snd_conv [simp, code]: "snd (a, b) = b" |
37166 | 412 |
unfolding snd_def by simp |
11025
a70b796d9af8
converted to Isar therory, adding attributes complete_split and split_format
oheimb
parents:
10289
diff
changeset
|
413 |
|
37166 | 414 |
code_const fst and snd |
415 |
(Haskell "fst" and "snd") |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
416 |
|
41792
ff3cb0c418b7
renamed "nitpick\_def" to "nitpick_unfold" to reflect its new semantics
blanchet
parents:
41505
diff
changeset
|
417 |
lemma prod_case_unfold [nitpick_unfold]: "prod_case = (%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
|
418 |
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
|
419 |
|
11838 | 420 |
lemma fst_eqD: "fst (x, y) = a ==> x = a" |
421 |
by simp |
|
422 |
||
423 |
lemma snd_eqD: "snd (x, y) = a ==> y = a" |
|
424 |
by simp |
|
425 |
||
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
426 |
lemma pair_collapse [simp]: "(fst p, snd p) = p" |
11838 | 427 |
by (cases p) simp |
428 |
||
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
429 |
lemmas surjective_pairing = pair_collapse [symmetric] |
11838 | 430 |
|
37166 | 431 |
lemma Pair_fst_snd_eq: "s = t \<longleftrightarrow> fst s = fst t \<and> snd s = snd t" |
432 |
by (cases s, cases t) simp |
|
433 |
||
434 |
lemma prod_eqI [intro?]: "fst p = fst q \<Longrightarrow> snd p = snd q \<Longrightarrow> p = q" |
|
435 |
by (simp add: Pair_fst_snd_eq) |
|
436 |
||
437 |
lemma split_conv [simp, code]: "split f (a, b) = f a b" |
|
37591 | 438 |
by (fact prod.cases) |
37166 | 439 |
|
440 |
lemma splitI: "f a b \<Longrightarrow> split f (a, b)" |
|
441 |
by (rule split_conv [THEN iffD2]) |
|
442 |
||
443 |
lemma splitD: "split f (a, b) \<Longrightarrow> f a b" |
|
444 |
by (rule split_conv [THEN iffD1]) |
|
445 |
||
446 |
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
|
447 |
by (simp add: fun_eq_iff split: prod.split) |
37166 | 448 |
|
449 |
lemma split_eta: "(\<lambda>(x, y). f (x, y)) = f" |
|
450 |
-- {* Subsumes the old @{text split_Pair} when @{term f} is the identity function. *} |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39272
diff
changeset
|
451 |
by (simp add: fun_eq_iff split: prod.split) |
37166 | 452 |
|
453 |
lemma split_comp: "split (f \<circ> g) x = f (g (fst x)) (snd x)" |
|
454 |
by (cases x) simp |
|
455 |
||
456 |
lemma split_twice: "split f (split g p) = split (\<lambda>x y. split f (g x y)) p" |
|
457 |
by (cases p) simp |
|
458 |
||
459 |
lemma The_split: "The (split P) = (THE xy. P (fst xy) (snd xy))" |
|
37591 | 460 |
by (simp add: prod_case_unfold) |
37166 | 461 |
|
462 |
lemma split_weak_cong: "p = q \<Longrightarrow> split c p = split c q" |
|
463 |
-- {* Prevents simplification of @{term c}: much faster *} |
|
40929
7ff03a5e044f
theorem names generated by the (rep_)datatype command now have mandatory qualifiers
huffman
parents:
40702
diff
changeset
|
464 |
by (fact prod.weak_case_cong) |
37166 | 465 |
|
466 |
lemma cond_split_eta: "(!!x y. f x y = g (x, y)) ==> (%(x, y). f x y) = g" |
|
467 |
by (simp add: split_eta) |
|
468 |
||
11838 | 469 |
lemma split_paired_all: "(!!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
|
470 |
proof |
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
471 |
fix a b |
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
472 |
assume "!!x. PROP P x" |
19535 | 473 |
then show "PROP P (a, b)" . |
11820
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
474 |
next |
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
475 |
fix x |
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
476 |
assume "!!a b. PROP P (a, b)" |
19535 | 477 |
from `PROP P (fst x, snd x)` show "PROP P x" by simp |
11820
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
478 |
qed |
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset
|
479 |
|
11838 | 480 |
text {* |
481 |
The rule @{thm [source] split_paired_all} does not work with the |
|
482 |
Simplifier because it also affects premises in congrence rules, |
|
483 |
where this can lead to premises of the form @{text "!!a b. ... = |
|
484 |
?P(a, b)"} which cannot be solved by reflexivity. |
|
485 |
*} |
|
486 |
||
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
487 |
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
|
488 |
|
26480 | 489 |
ML {* |
11838 | 490 |
(* replace parameters of product type by individual component parameters *) |
491 |
val safe_full_simp_tac = generic_simp_tac true (true, false, false); |
|
492 |
local (* filtering with exists_paired_all is an essential optimization *) |
|
16121 | 493 |
fun exists_paired_all (Const ("all", _) $ Abs (_, T, t)) = |
11838 | 494 |
can HOLogic.dest_prodT T orelse exists_paired_all t |
495 |
| exists_paired_all (t $ u) = exists_paired_all t orelse exists_paired_all u |
|
496 |
| exists_paired_all (Abs (_, _, t)) = exists_paired_all t |
|
497 |
| exists_paired_all _ = false; |
|
498 |
val ss = HOL_basic_ss |
|
26340 | 499 |
addsimps [@{thm split_paired_all}, @{thm unit_all_eq2}, @{thm unit_abs_eta_conv}] |
11838 | 500 |
addsimprocs [unit_eq_proc]; |
501 |
in |
|
502 |
val split_all_tac = SUBGOAL (fn (t, i) => |
|
503 |
if exists_paired_all t then safe_full_simp_tac ss i else no_tac); |
|
504 |
val unsafe_split_all_tac = SUBGOAL (fn (t, i) => |
|
505 |
if exists_paired_all t then full_simp_tac ss i else no_tac); |
|
506 |
fun split_all th = |
|
26340 | 507 |
if exists_paired_all (Thm.prop_of th) then full_simplify ss th else th; |
11838 | 508 |
end; |
26340 | 509 |
*} |
11838 | 510 |
|
26340 | 511 |
declaration {* fn _ => |
512 |
Classical.map_cs (fn cs => cs addSbefore ("split_all_tac", split_all_tac)) |
|
16121 | 513 |
*} |
11838 | 514 |
|
515 |
lemma split_paired_All [simp]: "(ALL x. P x) = (ALL a b. P (a, b))" |
|
516 |
-- {* @{text "[iff]"} is not a good idea because it makes @{text blast} loop *} |
|
517 |
by fast |
|
518 |
||
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
519 |
lemma split_paired_Ex [simp]: "(EX x. P x) = (EX a b. P (a, b))" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
520 |
by fast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
521 |
|
11838 | 522 |
lemma split_paired_The: "(THE x. P x) = (THE (a, b). P (a, b))" |
523 |
-- {* Can't be added to simpset: loops! *} |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
524 |
by (simp add: split_eta) |
11838 | 525 |
|
526 |
text {* |
|
527 |
Simplification procedure for @{thm [source] cond_split_eta}. Using |
|
528 |
@{thm [source] split_eta} as a rewrite rule is not general enough, |
|
529 |
and using @{thm [source] cond_split_eta} directly would render some |
|
530 |
existing proofs very inefficient; similarly for @{text |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
531 |
split_beta}. |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
532 |
*} |
11838 | 533 |
|
26480 | 534 |
ML {* |
11838 | 535 |
local |
35364 | 536 |
val cond_split_eta_ss = HOL_basic_ss addsimps @{thms cond_split_eta}; |
537 |
fun Pair_pat k 0 (Bound m) = (m = k) |
|
538 |
| Pair_pat k i (Const (@{const_name Pair}, _) $ Bound m $ t) = |
|
539 |
i > 0 andalso m = k + i andalso Pair_pat k (i - 1) t |
|
540 |
| Pair_pat _ _ _ = false; |
|
541 |
fun no_args k i (Abs (_, _, t)) = no_args (k + 1) i t |
|
542 |
| no_args k i (t $ u) = no_args k i t andalso no_args k i u |
|
543 |
| no_args k i (Bound m) = m < k orelse m > k + i |
|
544 |
| no_args _ _ _ = true; |
|
545 |
fun split_pat tp i (Abs (_, _, t)) = if tp 0 i t then SOME (i, t) else NONE |
|
37591 | 546 |
| split_pat tp i (Const (@{const_name prod_case}, _) $ Abs (_, _, t)) = split_pat tp (i + 1) t |
35364 | 547 |
| split_pat tp i _ = NONE; |
20044
92cc2f4c7335
simprocs: no theory argument -- use simpset context instead;
wenzelm
parents:
19656
diff
changeset
|
548 |
fun metaeq ss lhs rhs = mk_meta_eq (Goal.prove (Simplifier.the_context ss) [] [] |
35364 | 549 |
(HOLogic.mk_Trueprop (HOLogic.mk_eq (lhs, rhs))) |
18328 | 550 |
(K (simp_tac (Simplifier.inherit_context ss cond_split_eta_ss) 1))); |
11838 | 551 |
|
35364 | 552 |
fun beta_term_pat k i (Abs (_, _, t)) = beta_term_pat (k + 1) i t |
553 |
| beta_term_pat k i (t $ u) = |
|
554 |
Pair_pat k i (t $ u) orelse (beta_term_pat k i t andalso beta_term_pat k i u) |
|
555 |
| beta_term_pat k i t = no_args k i t; |
|
556 |
fun eta_term_pat k i (f $ arg) = no_args k i f andalso Pair_pat k i arg |
|
557 |
| eta_term_pat _ _ _ = false; |
|
11838 | 558 |
fun subst arg k i (Abs (x, T, t)) = Abs (x, T, subst arg (k+1) i t) |
35364 | 559 |
| subst arg k i (t $ u) = |
560 |
if Pair_pat k i (t $ u) then incr_boundvars k arg |
|
561 |
else (subst arg k i t $ subst arg k i u) |
|
562 |
| subst arg k i t = t; |
|
37591 | 563 |
fun beta_proc ss (s as Const (@{const_name prod_case}, _) $ Abs (_, _, t) $ arg) = |
11838 | 564 |
(case split_pat beta_term_pat 1 t of |
35364 | 565 |
SOME (i, f) => SOME (metaeq ss s (subst arg 0 i f)) |
15531 | 566 |
| NONE => NONE) |
35364 | 567 |
| beta_proc _ _ = NONE; |
37591 | 568 |
fun eta_proc ss (s as Const (@{const_name prod_case}, _) $ Abs (_, _, t)) = |
11838 | 569 |
(case split_pat eta_term_pat 1 t of |
35364 | 570 |
SOME (_, ft) => SOME (metaeq ss s (let val (f $ arg) = ft in f end)) |
15531 | 571 |
| NONE => NONE) |
35364 | 572 |
| eta_proc _ _ = NONE; |
11838 | 573 |
in |
38715
6513ea67d95d
renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
wenzelm
parents:
37808
diff
changeset
|
574 |
val split_beta_proc = Simplifier.simproc_global @{theory} "split_beta" ["split f z"] (K beta_proc); |
6513ea67d95d
renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
wenzelm
parents:
37808
diff
changeset
|
575 |
val split_eta_proc = Simplifier.simproc_global @{theory} "split_eta" ["split f"] (K eta_proc); |
11838 | 576 |
end; |
577 |
||
578 |
Addsimprocs [split_beta_proc, split_eta_proc]; |
|
579 |
*} |
|
580 |
||
26798
a9134a089106
split_beta is now declared as monotonicity rule, to allow bounded
berghofe
parents:
26588
diff
changeset
|
581 |
lemma split_beta [mono]: "(%(x, y). P x y) z = P (fst z) (snd z)" |
11838 | 582 |
by (subst surjective_pairing, rule split_conv) |
583 |
||
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset
|
584 |
lemma split_split [no_atp]: "R(split c p) = (ALL x y. p = (x, y) --> R(c x y))" |
11838 | 585 |
-- {* For use with @{text split} and the Simplifier. *} |
15481 | 586 |
by (insert surj_pair [of p], clarify, simp) |
11838 | 587 |
|
588 |
text {* |
|
589 |
@{thm [source] split_split} could be declared as @{text "[split]"} |
|
590 |
done after the Splitter has been speeded up significantly; |
|
591 |
precompute the constants involved and don't do anything unless the |
|
592 |
current goal contains one of those constants. |
|
593 |
*} |
|
594 |
||
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset
|
595 |
lemma split_split_asm [no_atp]: "R (split c p) = (~(EX x y. p = (x, y) & (~R (c x y))))" |
14208 | 596 |
by (subst split_split, simp) |
11838 | 597 |
|
598 |
text {* |
|
599 |
\medskip @{term split} used as a logical connective or set former. |
|
600 |
||
601 |
\medskip These rules are for use with @{text blast}; could instead |
|
40929
7ff03a5e044f
theorem names generated by the (rep_)datatype command now have mandatory qualifiers
huffman
parents:
40702
diff
changeset
|
602 |
call @{text simp} using @{thm [source] prod.split} as rewrite. *} |
11838 | 603 |
|
604 |
lemma splitI2: "!!p. [| !!a b. p = (a, b) ==> c a b |] ==> split c p" |
|
605 |
apply (simp only: split_tupled_all) |
|
606 |
apply (simp (no_asm_simp)) |
|
607 |
done |
|
608 |
||
609 |
lemma splitI2': "!!p. [| !!a b. (a, b) = p ==> c a b x |] ==> split c p x" |
|
610 |
apply (simp only: split_tupled_all) |
|
611 |
apply (simp (no_asm_simp)) |
|
612 |
done |
|
613 |
||
614 |
lemma splitE: "split c p ==> (!!x y. p = (x, y) ==> c x y ==> Q) ==> Q" |
|
37591 | 615 |
by (induct p) auto |
11838 | 616 |
|
617 |
lemma splitE': "split c p z ==> (!!x y. p = (x, y) ==> c x y z ==> Q) ==> Q" |
|
37591 | 618 |
by (induct p) auto |
11838 | 619 |
|
620 |
lemma splitE2: |
|
621 |
"[| Q (split P z); !!x y. [|z = (x, y); Q (P x y)|] ==> R |] ==> R" |
|
622 |
proof - |
|
623 |
assume q: "Q (split P z)" |
|
624 |
assume r: "!!x y. [|z = (x, y); Q (P x y)|] ==> R" |
|
625 |
show R |
|
626 |
apply (rule r surjective_pairing)+ |
|
627 |
apply (rule split_beta [THEN subst], rule q) |
|
628 |
done |
|
629 |
qed |
|
630 |
||
631 |
lemma splitD': "split R (a,b) c ==> R a b c" |
|
632 |
by simp |
|
633 |
||
634 |
lemma mem_splitI: "z: c a b ==> z: split c (a, b)" |
|
635 |
by simp |
|
636 |
||
637 |
lemma mem_splitI2: "!!p. [| !!a b. p = (a, b) ==> z: c a b |] ==> z: split c p" |
|
14208 | 638 |
by (simp only: split_tupled_all, simp) |
11838 | 639 |
|
18372 | 640 |
lemma mem_splitE: |
37166 | 641 |
assumes major: "z \<in> split c p" |
642 |
and cases: "\<And>x y. p = (x, y) \<Longrightarrow> z \<in> c x y \<Longrightarrow> Q" |
|
18372 | 643 |
shows Q |
37591 | 644 |
by (rule major [unfolded prod_case_unfold] cases surjective_pairing)+ |
11838 | 645 |
|
646 |
declare mem_splitI2 [intro!] mem_splitI [intro!] splitI2' [intro!] splitI2 [intro!] splitI [intro!] |
|
647 |
declare mem_splitE [elim!] splitE' [elim!] splitE [elim!] |
|
648 |
||
26340 | 649 |
ML {* |
11838 | 650 |
local (* filtering with exists_p_split is an essential optimization *) |
37591 | 651 |
fun exists_p_split (Const (@{const_name prod_case},_) $ _ $ (Const (@{const_name Pair},_)$_$_)) = true |
11838 | 652 |
| exists_p_split (t $ u) = exists_p_split t orelse exists_p_split u |
653 |
| exists_p_split (Abs (_, _, t)) = exists_p_split t |
|
654 |
| exists_p_split _ = false; |
|
35364 | 655 |
val ss = HOL_basic_ss addsimps @{thms split_conv}; |
11838 | 656 |
in |
657 |
val split_conv_tac = SUBGOAL (fn (t, i) => |
|
658 |
if exists_p_split t then safe_full_simp_tac ss i else no_tac); |
|
659 |
end; |
|
26340 | 660 |
*} |
661 |
||
11838 | 662 |
(* This prevents applications of splitE for already splitted arguments leading |
663 |
to quite time-consuming computations (in particular for nested tuples) *) |
|
26340 | 664 |
declaration {* fn _ => |
665 |
Classical.map_cs (fn cs => cs addSbefore ("split_conv_tac", split_conv_tac)) |
|
16121 | 666 |
*} |
11838 | 667 |
|
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset
|
668 |
lemma split_eta_SetCompr [simp,no_atp]: "(%u. EX x y. u = (x, y) & P (x, y)) = P" |
18372 | 669 |
by (rule ext) fast |
11838 | 670 |
|
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset
|
671 |
lemma split_eta_SetCompr2 [simp,no_atp]: "(%u. EX x y. u = (x, y) & P x y) = split P" |
18372 | 672 |
by (rule ext) fast |
11838 | 673 |
|
674 |
lemma split_part [simp]: "(%(a,b). P & Q a b) = (%ab. P & split Q ab)" |
|
675 |
-- {* Allows simplifications of nested splits in case of independent predicates. *} |
|
18372 | 676 |
by (rule ext) blast |
11838 | 677 |
|
14337
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset
|
678 |
(* 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
|
679 |
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
|
680 |
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
|
681 |
*) |
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset
|
682 |
lemma split_comp_eq: |
20415 | 683 |
fixes f :: "'a => 'b => 'c" and g :: "'d => 'a" |
684 |
shows "(%u. f (g (fst u)) (snd u)) = (split (%x. f (g x)))" |
|
18372 | 685 |
by (rule ext) auto |
14101 | 686 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
687 |
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
|
688 |
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
|
689 |
apply auto |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
690 |
done |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
691 |
|
11838 | 692 |
lemma The_split_eq [simp]: "(THE (x',y'). x = x' & y = y') = (x, y)" |
693 |
by blast |
|
694 |
||
695 |
(* |
|
696 |
the following would be slightly more general, |
|
697 |
but cannot be used as rewrite rule: |
|
698 |
### Cannot add premise as rewrite rule because it contains (type) unknowns: |
|
699 |
### ?y = .x |
|
700 |
Goal "[| P y; !!x. P x ==> x = y |] ==> (@(x',y). x = x' & P y) = (x,y)" |
|
14208 | 701 |
by (rtac some_equality 1) |
702 |
by ( Simp_tac 1) |
|
703 |
by (split_all_tac 1) |
|
704 |
by (Asm_full_simp_tac 1) |
|
11838 | 705 |
qed "The_split_eq"; |
706 |
*) |
|
707 |
||
708 |
text {* |
|
709 |
Setup of internal @{text split_rule}. |
|
710 |
*} |
|
711 |
||
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
712 |
lemmas prod_caseI = prod.cases [THEN iffD2, standard] |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
713 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
714 |
lemma prod_caseI2: "!!p. [| !!a b. p = (a, b) ==> c a b |] ==> prod_case c p" |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
715 |
by (fact splitI2) |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
716 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
717 |
lemma prod_caseI2': "!!p. [| !!a b. (a, b) = p ==> c a b x |] ==> prod_case c p x" |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
718 |
by (fact splitI2') |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
719 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
720 |
lemma prod_caseE: "prod_case 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
|
721 |
by (fact splitE) |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
722 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
723 |
lemma prod_caseE': "prod_case 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
|
724 |
by (fact splitE') |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
725 |
|
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
726 |
declare prod_caseI [intro!] |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
727 |
|
26143
314c0bcb7df7
Added useful general lemmas from the work with the HeapMonad
bulwahn
parents:
25885
diff
changeset
|
728 |
lemma prod_case_beta: |
314c0bcb7df7
Added useful general lemmas from the work with the HeapMonad
bulwahn
parents:
25885
diff
changeset
|
729 |
"prod_case f p = f (fst p) (snd p)" |
37591 | 730 |
by (fact split_beta) |
26143
314c0bcb7df7
Added useful general lemmas from the work with the HeapMonad
bulwahn
parents:
25885
diff
changeset
|
731 |
|
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
732 |
lemma prod_cases3 [cases type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
733 |
obtains (fields) a b c where "y = (a, b, c)" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
734 |
by (cases y, case_tac b) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
735 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
736 |
lemma prod_induct3 [case_names fields, induct type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
737 |
"(!!a b c. P (a, b, c)) ==> P x" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
738 |
by (cases x) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
739 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
740 |
lemma prod_cases4 [cases type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
741 |
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
|
742 |
by (cases y, case_tac c) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
743 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
744 |
lemma prod_induct4 [case_names fields, induct type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
745 |
"(!!a b c d. P (a, b, c, d)) ==> P x" |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
746 |
by (cases x) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
747 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
748 |
lemma prod_cases5 [cases type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
749 |
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
|
750 |
by (cases y, case_tac d) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
751 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
752 |
lemma prod_induct5 [case_names fields, induct type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
753 |
"(!!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
|
754 |
by (cases x) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
755 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
756 |
lemma prod_cases6 [cases type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
757 |
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
|
758 |
by (cases y, case_tac e) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
759 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
760 |
lemma prod_induct6 [case_names fields, induct type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
761 |
"(!!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
|
762 |
by (cases x) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
763 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
764 |
lemma prod_cases7 [cases type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
765 |
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
|
766 |
by (cases y, case_tac f) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
767 |
|
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
768 |
lemma prod_induct7 [case_names fields, induct type]: |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
769 |
"(!!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
|
770 |
by (cases x) blast |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
771 |
|
37166 | 772 |
lemma split_def: |
773 |
"split = (\<lambda>c p. c (fst p) (snd p))" |
|
37591 | 774 |
by (fact prod_case_unfold) |
37166 | 775 |
|
776 |
definition internal_split :: "('a \<Rightarrow> 'b \<Rightarrow> 'c) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'c" where |
|
777 |
"internal_split == split" |
|
778 |
||
779 |
lemma internal_split_conv: "internal_split c (a, b) = c a b" |
|
780 |
by (simp only: internal_split_def split_conv) |
|
781 |
||
782 |
use "Tools/split_rule.ML" |
|
783 |
setup Split_Rule.setup |
|
784 |
||
785 |
hide_const internal_split |
|
786 |
||
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
787 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
788 |
subsubsection {* Derived operations *} |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
789 |
|
37387
3581483cca6c
qualified types "+" and nat; qualified constants Ball, Bex, Suc, curry; modernized some specifications
haftmann
parents:
37278
diff
changeset
|
790 |
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
|
791 |
"curry = (\<lambda>c x y. c (x, y))" |
37166 | 792 |
|
793 |
lemma curry_conv [simp, code]: "curry f a b = f (a, b)" |
|
794 |
by (simp add: curry_def) |
|
795 |
||
796 |
lemma curryI [intro!]: "f (a, b) \<Longrightarrow> curry f a b" |
|
797 |
by (simp add: curry_def) |
|
798 |
||
799 |
lemma curryD [dest!]: "curry f a b \<Longrightarrow> f (a, b)" |
|
800 |
by (simp add: curry_def) |
|
801 |
||
802 |
lemma curryE: "curry f a b \<Longrightarrow> (f (a, b) \<Longrightarrow> Q) \<Longrightarrow> Q" |
|
803 |
by (simp add: curry_def) |
|
804 |
||
805 |
lemma curry_split [simp]: "curry (split f) = f" |
|
806 |
by (simp add: curry_def split_def) |
|
807 |
||
808 |
lemma split_curry [simp]: "split (curry f) = f" |
|
809 |
by (simp add: curry_def split_def) |
|
810 |
||
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
811 |
text {* |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
812 |
The composition-uncurry combinator. |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
813 |
*} |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
814 |
|
37751 | 815 |
notation fcomp (infixl "\<circ>>" 60) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
816 |
|
37751 | 817 |
definition scomp :: "('a \<Rightarrow> 'b \<times> 'c) \<Rightarrow> ('b \<Rightarrow> 'c \<Rightarrow> 'd) \<Rightarrow> 'a \<Rightarrow> 'd" (infixl "\<circ>\<rightarrow>" 60) where |
818 |
"f \<circ>\<rightarrow> g = (\<lambda>x. prod_case g (f x))" |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
819 |
|
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
820 |
lemma scomp_unfold: "scomp = (\<lambda>f g x. g (fst (f x)) (snd (f x)))" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39272
diff
changeset
|
821 |
by (simp add: fun_eq_iff scomp_def prod_case_unfold) |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
822 |
|
37751 | 823 |
lemma scomp_apply [simp]: "(f \<circ>\<rightarrow> g) x = prod_case g (f x)" |
824 |
by (simp add: scomp_unfold prod_case_unfold) |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
825 |
|
37751 | 826 |
lemma Pair_scomp: "Pair x \<circ>\<rightarrow> f = f x" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39272
diff
changeset
|
827 |
by (simp add: fun_eq_iff scomp_apply) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
828 |
|
37751 | 829 |
lemma scomp_Pair: "x \<circ>\<rightarrow> Pair = x" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39272
diff
changeset
|
830 |
by (simp add: fun_eq_iff scomp_apply) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
831 |
|
37751 | 832 |
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
|
833 |
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
|
834 |
|
37751 | 835 |
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
|
836 |
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
|
837 |
|
37751 | 838 |
lemma fcomp_scomp: "(f \<circ>> g) \<circ>\<rightarrow> h = f \<circ>> (g \<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
|
839 |
by (simp add: fun_eq_iff scomp_unfold fcomp_apply) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
840 |
|
31202
52d332f8f909
pretty printing of functional combinators for evaluation code
haftmann
parents:
30924
diff
changeset
|
841 |
code_const scomp |
52d332f8f909
pretty printing of functional combinators for evaluation code
haftmann
parents:
30924
diff
changeset
|
842 |
(Eval infixl 3 "#->") |
52d332f8f909
pretty printing of functional combinators for evaluation code
haftmann
parents:
30924
diff
changeset
|
843 |
|
37751 | 844 |
no_notation fcomp (infixl "\<circ>>" 60) |
845 |
no_notation scomp (infixl "\<circ>\<rightarrow>" 60) |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
846 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
847 |
text {* |
40607 | 848 |
@{term map_pair} --- action of the product functor upon |
36664
6302f9ad7047
repaired comments where SOMEthing went utterly wrong (cf. 2b04504fcb69)
krauss
parents:
36622
diff
changeset
|
849 |
functions. |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
850 |
*} |
21195 | 851 |
|
40607 | 852 |
definition map_pair :: "('a \<Rightarrow> 'c) \<Rightarrow> ('b \<Rightarrow> 'd) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'c \<times> 'd" where |
853 |
"map_pair 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
|
854 |
|
40607 | 855 |
lemma map_pair_simp [simp, code]: |
856 |
"map_pair f g (a, b) = (f a, g b)" |
|
857 |
by (simp add: map_pair_def) |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
858 |
|
41505
6d19301074cf
"enriched_type" replaces less specific "type_lifting"
haftmann
parents:
41372
diff
changeset
|
859 |
enriched_type map_pair: map_pair |
41372 | 860 |
by (auto simp add: split_paired_all intro: ext) |
37278 | 861 |
|
40607 | 862 |
lemma fst_map_pair [simp]: |
863 |
"fst (map_pair f g x) = f (fst x)" |
|
864 |
by (cases x) simp_all |
|
37278 | 865 |
|
40607 | 866 |
lemma snd_prod_fun [simp]: |
867 |
"snd (map_pair f g x) = g (snd x)" |
|
868 |
by (cases x) simp_all |
|
37278 | 869 |
|
40607 | 870 |
lemma fst_comp_map_pair [simp]: |
871 |
"fst \<circ> map_pair f g = f \<circ> fst" |
|
872 |
by (rule ext) simp_all |
|
37278 | 873 |
|
40607 | 874 |
lemma snd_comp_map_pair [simp]: |
875 |
"snd \<circ> map_pair f g = g \<circ> snd" |
|
876 |
by (rule ext) simp_all |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
877 |
|
40607 | 878 |
lemma map_pair_compose: |
879 |
"map_pair (f1 o f2) (g1 o g2) = (map_pair f1 g1 o map_pair f2 g2)" |
|
880 |
by (rule ext) (simp add: map_pair.compositionality comp_def) |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
881 |
|
40607 | 882 |
lemma map_pair_ident [simp]: |
883 |
"map_pair (%x. x) (%y. y) = (%z. z)" |
|
884 |
by (rule ext) (simp add: map_pair.identity) |
|
885 |
||
886 |
lemma map_pair_imageI [intro]: |
|
887 |
"(a, b) \<in> R \<Longrightarrow> (f a, g b) \<in> map_pair f g ` R" |
|
888 |
by (rule image_eqI) simp_all |
|
21195 | 889 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
890 |
lemma prod_fun_imageE [elim!]: |
40607 | 891 |
assumes major: "c \<in> map_pair f g ` R" |
892 |
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
|
893 |
shows P |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
894 |
apply (rule major [THEN imageE]) |
37166 | 895 |
apply (case_tac x) |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
896 |
apply (rule cases) |
40607 | 897 |
apply simp_all |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
898 |
done |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
899 |
|
37166 | 900 |
definition apfst :: "('a \<Rightarrow> 'c) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'c \<times> 'b" where |
40607 | 901 |
"apfst f = map_pair f id" |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
902 |
|
37166 | 903 |
definition apsnd :: "('b \<Rightarrow> 'c) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'a \<times> 'c" where |
40607 | 904 |
"apsnd f = map_pair id f" |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
905 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
906 |
lemma apfst_conv [simp, code]: |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
907 |
"apfst f (x, y) = (f x, y)" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
908 |
by (simp add: apfst_def) |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
909 |
|
33638
548a34929e98
Renamed upd_snd_conv to apsnd_conv to be consistent with apfst_conv; Added apsnd_apfst_commute
hoelzl
parents:
33594
diff
changeset
|
910 |
lemma apsnd_conv [simp, code]: |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
911 |
"apsnd f (x, y) = (x, f y)" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
912 |
by (simp add: apsnd_def) |
21195 | 913 |
|
33594 | 914 |
lemma fst_apfst [simp]: |
915 |
"fst (apfst f x) = f (fst x)" |
|
916 |
by (cases x) simp |
|
917 |
||
918 |
lemma fst_apsnd [simp]: |
|
919 |
"fst (apsnd f x) = fst x" |
|
920 |
by (cases x) simp |
|
921 |
||
922 |
lemma snd_apfst [simp]: |
|
923 |
"snd (apfst f x) = snd x" |
|
924 |
by (cases x) simp |
|
925 |
||
926 |
lemma snd_apsnd [simp]: |
|
927 |
"snd (apsnd f x) = f (snd x)" |
|
928 |
by (cases x) simp |
|
929 |
||
930 |
lemma apfst_compose: |
|
931 |
"apfst f (apfst g x) = apfst (f \<circ> g) x" |
|
932 |
by (cases x) simp |
|
933 |
||
934 |
lemma apsnd_compose: |
|
935 |
"apsnd f (apsnd g x) = apsnd (f \<circ> g) x" |
|
936 |
by (cases x) simp |
|
937 |
||
938 |
lemma apfst_apsnd [simp]: |
|
939 |
"apfst f (apsnd g x) = (f (fst x), g (snd x))" |
|
940 |
by (cases x) simp |
|
941 |
||
942 |
lemma apsnd_apfst [simp]: |
|
943 |
"apsnd f (apfst g x) = (g (fst x), f (snd x))" |
|
944 |
by (cases x) simp |
|
945 |
||
946 |
lemma apfst_id [simp] : |
|
947 |
"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
|
948 |
by (simp add: fun_eq_iff) |
33594 | 949 |
|
950 |
lemma apsnd_id [simp] : |
|
951 |
"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
|
952 |
by (simp add: fun_eq_iff) |
33594 | 953 |
|
954 |
lemma apfst_eq_conv [simp]: |
|
955 |
"apfst f x = apfst g x \<longleftrightarrow> f (fst x) = g (fst x)" |
|
956 |
by (cases x) simp |
|
957 |
||
958 |
lemma apsnd_eq_conv [simp]: |
|
959 |
"apsnd f x = apsnd g x \<longleftrightarrow> f (snd x) = g (snd x)" |
|
960 |
by (cases x) simp |
|
961 |
||
33638
548a34929e98
Renamed upd_snd_conv to apsnd_conv to be consistent with apfst_conv; Added apsnd_apfst_commute
hoelzl
parents:
33594
diff
changeset
|
962 |
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
|
963 |
"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
|
964 |
by simp |
21195 | 965 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
966 |
text {* |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
967 |
Disjoint union of a family of sets -- Sigma. |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
968 |
*} |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
969 |
|
40607 | 970 |
definition Sigma :: "['a set, 'a => 'b set] => ('a \<times> 'b) set" where |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
971 |
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
|
972 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
973 |
abbreviation |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
974 |
Times :: "['a set, 'b set] => ('a * 'b) set" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
975 |
(infixr "<*>" 80) where |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
976 |
"A <*> B == Sigma A (%_. B)" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
977 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
978 |
notation (xsymbols) |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
979 |
Times (infixr "\<times>" 80) |
15394 | 980 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
981 |
notation (HTML output) |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
982 |
Times (infixr "\<times>" 80) |
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 |
syntax |
35115 | 985 |
"_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
|
986 |
translations |
35115 | 987 |
"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
|
988 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
989 |
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
|
990 |
by (unfold Sigma_def) blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
991 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
992 |
lemma SigmaE [elim!]: |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
993 |
"[| c: Sigma A B; |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
994 |
!!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
|
995 |
|] ==> P" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
996 |
-- {* The general elimination rule. *} |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
997 |
by (unfold Sigma_def) blast |
20588 | 998 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
999 |
text {* |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1000 |
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
|
1001 |
eigenvariables. |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1002 |
*} |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1003 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1004 |
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
|
1005 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1006 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1007 |
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
|
1008 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1009 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1010 |
lemma SigmaE2: |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1011 |
"[| (a, b) : Sigma A B; |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1012 |
[| a:A; b:B(a) |] ==> P |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1013 |
|] ==> P" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1014 |
by blast |
20588 | 1015 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1016 |
lemma Sigma_cong: |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1017 |
"\<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
|
1018 |
\<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
|
1019 |
by auto |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1020 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1021 |
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
|
1022 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1023 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1024 |
lemma Sigma_empty1 [simp]: "Sigma {} B = {}" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1025 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1026 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1027 |
lemma Sigma_empty2 [simp]: "A <*> {} = {}" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1028 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1029 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1030 |
lemma UNIV_Times_UNIV [simp]: "UNIV <*> UNIV = UNIV" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1031 |
by auto |
21908 | 1032 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1033 |
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
|
1034 |
by auto |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1035 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1036 |
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
|
1037 |
by auto |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1038 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1039 |
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
|
1040 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1041 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1042 |
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
|
1043 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1044 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1045 |
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
|
1046 |
by (blast elim: equalityE) |
20588 | 1047 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1048 |
lemma SetCompr_Sigma_eq: |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1049 |
"Collect (split (%x y. P x & Q x y)) = (SIGMA x:Collect P. Collect (Q x))" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1050 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1051 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1052 |
lemma Collect_split [simp]: "{(a,b). P a & Q b} = Collect P <*> Collect Q" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1053 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1054 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1055 |
lemma UN_Times_distrib: |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1056 |
"(UN (a,b):(A <*> B). E a <*> F b) = (UNION A E) <*> (UNION B F)" |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1057 |
-- {* Suggested by Pierre Chartier *} |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1058 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1059 |
|
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset
|
1060 |
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
|
1061 |
"(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
|
1062 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1063 |
|
35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset
|
1064 |
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
|
1065 |
"(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
|
1066 |
by blast |
21908 | 1067 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1068 |
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
|
1069 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1070 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1071 |
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
|
1072 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1073 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1074 |
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
|
1075 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1076 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1077 |
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
|
1078 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1079 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1080 |
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
|
1081 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1082 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1083 |
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
|
1084 |
by blast |
21908 | 1085 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1086 |
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
|
1087 |
by blast |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1088 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1089 |
text {* |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1090 |
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
|
1091 |
matching, especially when the rules are re-oriented. |
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1092 |
*} |
21908 | 1093 |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1094 |
lemma Times_Un_distrib1: "(A Un B) <*> C = (A <*> C) Un (B <*> C)" |
28719 | 1095 |
by blast |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1096 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1097 |
lemma Times_Int_distrib1: "(A Int B) <*> C = (A <*> C) Int (B <*> C)" |
28719 | 1098 |
by blast |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1099 |
|
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1100 |
lemma Times_Diff_distrib1: "(A - B) <*> C = (A <*> C) - (B <*> C)" |
28719 | 1101 |
by blast |
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1102 |
|
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
|
1103 |
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
|
1104 |
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
|
1105 |
|
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
|
1106 |
lemma fst_image_times[simp]: "fst ` (A \<times> B) = (if B = {} then {} else 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
|
1107 |
by (auto intro!: image_eqI) |
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
|
1108 |
|
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 |
lemma snd_image_times[simp]: "snd ` (A \<times> B) = (if A = {} then {} else 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
|
1110 |
by (auto intro!: image_eqI) |
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
|
1111 |
|
28719 | 1112 |
lemma insert_times_insert[simp]: |
1113 |
"insert a A \<times> insert b B = |
|
1114 |
insert (a,b) (A \<times> insert b B \<union> insert a A \<times> B)" |
|
1115 |
by blast |
|
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset
|
1116 |
|
33271
7be66dee1a5a
New theory Probability, which contains a development of measure theory
paulson
parents:
33089
diff
changeset
|
1117 |
lemma vimage_Times: "f -` (A \<times> B) = ((fst \<circ> f) -` A) \<inter> ((snd \<circ> f) -` B)" |
37166 | 1118 |
by (auto, case_tac "f x", auto) |
33271
7be66dee1a5a
New theory Probability, which contains a development of measure theory
paulson
parents:
33089
diff
changeset
|
1119 |
|
35822 | 1120 |
lemma swap_inj_on: |
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
|
1121 |
"inj_on (\<lambda>(i, j). (j, i)) 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
|
1122 |
by (auto intro!: inj_onI) |
35822 | 1123 |
|
1124 |
lemma swap_product: |
|
1125 |
"(%(i, j). (j, i)) ` (A \<times> B) = B \<times> A" |
|
1126 |
by (simp add: split_def image_def) blast |
|
1127 |
||
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
|
1128 |
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
|
1129 |
"(\<lambda>x. (f x, g x)) ` A = Sigma (f ` A) (\<lambda>x. g ` (f -` {x} \<inter> 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
|
1130 |
proof (safe intro!: imageI vimageI) |
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
|
1131 |
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
|
1132 |
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
|
1133 |
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
|
1134 |
qed simp_all |
35822 | 1135 |
|
40607 | 1136 |
text {* The following @{const map_pair} lemmas are due to Joachim Breitner: *} |
1137 |
||
1138 |
lemma map_pair_inj_on: |
|
1139 |
assumes "inj_on f A" and "inj_on g B" |
|
1140 |
shows "inj_on (map_pair f g) (A \<times> B)" |
|
1141 |
proof (rule inj_onI) |
|
1142 |
fix x :: "'a \<times> 'c" and y :: "'a \<times> 'c" |
|
1143 |
assume "x \<in> A \<times> B" hence "fst x \<in> A" and "snd x \<in> B" by auto |
|
1144 |
assume "y \<in> A \<times> B" hence "fst y \<in> A" and "snd y \<in> B" by auto |
|
1145 |
assume "map_pair f g x = map_pair f g y" |
|
1146 |
hence "fst (map_pair f g x) = fst (map_pair f g y)" by (auto) |
|
1147 |
hence "f (fst x) = f (fst y)" by (cases x,cases y,auto) |
|
1148 |
with `inj_on f A` and `fst x \<in> A` and `fst y \<in> A` |
|
1149 |
have "fst x = fst y" by (auto dest:dest:inj_onD) |
|
1150 |
moreover from `map_pair f g x = map_pair f g y` |
|
1151 |
have "snd (map_pair f g x) = snd (map_pair f g y)" by (auto) |
|
1152 |
hence "g (snd x) = g (snd y)" by (cases x,cases y,auto) |
|
1153 |
with `inj_on g B` and `snd x \<in> B` and `snd y \<in> B` |
|
1154 |
have "snd x = snd y" by (auto dest:dest:inj_onD) |
|
1155 |
ultimately show "x = y" by(rule prod_eqI) |
|
1156 |
qed |
|
1157 |
||
1158 |
lemma map_pair_surj: |
|
40702 | 1159 |
fixes f :: "'a \<Rightarrow> 'b" and g :: "'c \<Rightarrow> 'd" |
40607 | 1160 |
assumes "surj f" and "surj g" |
1161 |
shows "surj (map_pair f g)" |
|
1162 |
unfolding surj_def |
|
1163 |
proof |
|
1164 |
fix y :: "'b \<times> 'd" |
|
1165 |
from `surj f` obtain a where "fst y = f a" by (auto elim:surjE) |
|
1166 |
moreover |
|
1167 |
from `surj g` obtain b where "snd y = g b" by (auto elim:surjE) |
|
1168 |
ultimately have "(fst y, snd y) = map_pair f g (a,b)" by auto |
|
1169 |
thus "\<exists>x. y = map_pair f g x" by auto |
|
1170 |
qed |
|
1171 |
||
1172 |
lemma map_pair_surj_on: |
|
1173 |
assumes "f ` A = A'" and "g ` B = B'" |
|
1174 |
shows "map_pair f g ` (A \<times> B) = A' \<times> B'" |
|
1175 |
unfolding image_def |
|
1176 |
proof(rule set_eqI,rule iffI) |
|
1177 |
fix x :: "'a \<times> 'c" |
|
1178 |
assume "x \<in> {y\<Colon>'a \<times> 'c. \<exists>x\<Colon>'b \<times> 'd\<in>A \<times> B. y = map_pair f g x}" |
|
1179 |
then obtain y where "y \<in> A \<times> B" and "x = map_pair f g y" by blast |
|
1180 |
from `image f A = A'` and `y \<in> A \<times> B` have "f (fst y) \<in> A'" by auto |
|
1181 |
moreover from `image g B = B'` and `y \<in> A \<times> B` have "g (snd y) \<in> B'" by auto |
|
1182 |
ultimately have "(f (fst y), g (snd y)) \<in> (A' \<times> B')" by auto |
|
1183 |
with `x = map_pair f g y` show "x \<in> A' \<times> B'" by (cases y, auto) |
|
1184 |
next |
|
1185 |
fix x :: "'a \<times> 'c" |
|
1186 |
assume "x \<in> A' \<times> B'" hence "fst x \<in> A'" and "snd x \<in> B'" by auto |
|
1187 |
from `image f A = A'` and `fst x \<in> A'` have "fst x \<in> image f A" by auto |
|
1188 |
then obtain a where "a \<in> A" and "fst x = f a" by (rule imageE) |
|
1189 |
moreover from `image g B = B'` and `snd x \<in> B'` |
|
1190 |
obtain b where "b \<in> B" and "snd x = g b" by auto |
|
1191 |
ultimately have "(fst x, snd x) = map_pair f g (a,b)" by auto |
|
1192 |
moreover from `a \<in> A` and `b \<in> B` have "(a , b) \<in> A \<times> B" by auto |
|
1193 |
ultimately have "\<exists>y \<in> A \<times> B. x = map_pair f g y" by auto |
|
1194 |
thus "x \<in> {x. \<exists>y \<in> A \<times> B. x = map_pair f g y}" by auto |
|
1195 |
qed |
|
1196 |
||
21908 | 1197 |
|
37166 | 1198 |
subsection {* Inductively defined sets *} |
15394 | 1199 |
|
37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
1200 |
use "Tools/inductive_codegen.ML" |
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
1201 |
setup Inductive_Codegen.setup |
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset
|
1202 |
|
31723
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31667
diff
changeset
|
1203 |
use "Tools/inductive_set.ML" |
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31667
diff
changeset
|
1204 |
setup Inductive_Set.setup |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset
|
1205 |
|
37166 | 1206 |
|
1207 |
subsection {* Legacy theorem bindings and duplicates *} |
|
1208 |
||
1209 |
lemma PairE: |
|
1210 |
obtains x y where "p = (x, y)" |
|
1211 |
by (fact prod.exhaust) |
|
1212 |
||
1213 |
lemma Pair_inject: |
|
1214 |
assumes "(a, b) = (a', b')" |
|
1215 |
and "a = a' ==> b = b' ==> R" |
|
1216 |
shows R |
|
1217 |
using assms by simp |
|
1218 |
||
1219 |
lemmas Pair_eq = prod.inject |
|
1220 |
||
1221 |
lemmas split = split_conv -- {* for backwards compatibility *} |
|
1222 |
||
10213 | 1223 |
end |