author  wenzelm 
Wed, 29 Jun 2011 18:12:34 +0200  
changeset 43595  7ae4a23b5be6 
parent 43594  ef1ddc59b825 
child 43654  3f1a44c2d645 
permissions  rwrr 
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 

43594  58 
simproc_setup unit_eq ("x::unit") = {* 
59 
fn _ => fn _ => fn ct => 

60 
if HOLogic.is_unit (term_of ct) then NONE 

61 
else SOME (mk_meta_eq @{thm unit_eq}) 

11838  62 
*} 
63 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
26975
diff
changeset

64 
rep_datatype "()" by simp 
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

65 

11838  66 
lemma unit_all_eq1: "(!!x::unit. PROP P x) == PROP P ()" 
67 
by simp 

68 

69 
lemma unit_all_eq2: "(!!x::unit. PROP P) == PROP P" 

70 
by (rule triv_forall_equality) 

71 

72 
text {* 

43594  73 
This rewrite counters the effect of simproc @{text unit_eq} on @{term 
11838  74 
[source] "%u::unit. f u"}, replacing it by @{term [source] 
75 
f} rather than by @{term [source] "%u. f ()"}. 

76 
*} 

77 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset

78 
lemma unit_abs_eta_conv [simp,no_atp]: "(%u::unit. f ()) = f" 
11838  79 
by (rule ext) simp 
10213  80 

30924  81 
instantiation unit :: default 
82 
begin 

83 

84 
definition "default = ()" 

85 

86 
instance .. 

87 

88 
end 

10213  89 

28562  90 
lemma [code]: 
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset

91 
"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

92 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

93 
code_type unit 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

94 
(SML "unit") 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

95 
(OCaml "unit") 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

96 
(Haskell "()") 
34886  97 
(Scala "Unit") 
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

98 

37166  99 
code_const Unity 
100 
(SML "()") 

101 
(OCaml "()") 

102 
(Haskell "()") 

103 
(Scala "()") 

104 

38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset

105 
code_instance unit :: equal 
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

106 
(Haskell ) 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

107 

38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset

108 
code_const "HOL.equal \<Colon> unit \<Rightarrow> unit \<Rightarrow> bool" 
39272  109 
(Haskell infix 4 "==") 
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

110 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

111 
code_reserved SML 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

112 
unit 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

113 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

114 
code_reserved OCaml 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

115 
unit 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

116 

34886  117 
code_reserved Scala 
118 
Unit 

119 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

120 

37166  121 
subsection {* The product type *} 
10213  122 

37166  123 
subsubsection {* Type definition *} 
124 

125 
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

126 
"Pair_Rep a b = (\<lambda>x y. x = a \<and> y = b)" 
10213  127 

37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset

128 
typedef ('a, 'b) prod (infixr "*" 20) 
37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset

129 
= "{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

130 
proof 
37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset

131 
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

132 
by rule+ 
11025
a70b796d9af8
converted to Isar therory, adding attributes complete_split and split_format
oheimb
parents:
10289
diff
changeset

133 
qed 
10213  134 

35427  135 
type_notation (xsymbols) 
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset

136 
"prod" ("(_ \<times>/ _)" [21, 20] 20) 
35427  137 
type_notation (HTML output) 
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset

138 
"prod" ("(_ \<times>/ _)" [21, 20] 20) 
10213  139 

37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset

140 
definition Pair :: "'a \<Rightarrow> 'b \<Rightarrow> 'a \<times> 'b" where 
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset

141 
"Pair a b = Abs_prod (Pair_Rep a b)" 
37166  142 

37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset

143 
rep_datatype Pair proof  
37166  144 
fix P :: "'a \<times> 'b \<Rightarrow> bool" and p 
145 
assume "\<And>a b. P (Pair a b)" 

37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset

146 
then show "P p" by (cases p) (auto simp add: prod_def Pair_def Pair_Rep_def) 
37166  147 
next 
148 
fix a c :: 'a and b d :: 'b 

149 
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

150 
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

151 
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

152 
by (auto simp add: prod_def) 
37166  153 
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

154 
by (simp add: Pair_def Abs_prod_inject) 
37166  155 
qed 
156 

37704
c6161bee8486
adapt Nitpick to "prod_case" and "*" > "sum" renaming;
blanchet
parents:
37678
diff
changeset

157 
declare prod.simps(2) [nitpick_simp del] 
c6161bee8486
adapt Nitpick to "prod_case" and "*" > "sum" renaming;
blanchet
parents:
37678
diff
changeset

158 

40929
7ff03a5e044f
theorem names generated by the (rep_)datatype command now have mandatory qualifiers
huffman
parents:
40702
diff
changeset

159 
declare prod.weak_case_cong [cong del] 
37411
c88c44156083
removed simplifier congruence rule of "prod_case"
haftmann
parents:
37389
diff
changeset

160 

37166  161 

162 
subsubsection {* Tuple syntax *} 

163 

37591  164 
abbreviation (input) split :: "('a \<Rightarrow> 'b \<Rightarrow> 'c) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'c" where 
165 
"split \<equiv> prod_case" 

19535  166 

11777  167 
text {* 
168 
Patterns  extends predefined type @{typ pttrn} used in 

169 
abstractions. 

170 
*} 

10213  171 

41229
d797baa3d57c
replaced command 'nonterminals' by slightly modernized version 'nonterminal';
wenzelm
parents:
40968
diff
changeset

172 
nonterminal tuple_args and patterns 
10213  173 

174 
syntax 

175 
"_tuple" :: "'a => tuple_args => 'a * 'b" ("(1'(_,/ _'))") 

176 
"_tuple_arg" :: "'a => tuple_args" ("_") 

177 
"_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

178 
"_pattern" :: "[pttrn, patterns] => pttrn" ("'(_,/ _')") 
a70b796d9af8
converted to Isar therory, adding attributes complete_split and split_format
oheimb
parents:
10289
diff
changeset

179 
"" :: "pttrn => patterns" ("_") 
a70b796d9af8
converted to Isar therory, adding attributes complete_split and split_format
oheimb
parents:
10289
diff
changeset

180 
"_patterns" :: "[pttrn, patterns] => patterns" ("_,/ _") 
10213  181 

182 
translations 

35115  183 
"(x, y)" == "CONST Pair x y" 
10213  184 
"_tuple x (_tuple_args y z)" == "_tuple x (_tuple_arg (_tuple y z))" 
37591  185 
"%(x, y, zs). b" == "CONST prod_case (%x (y, zs). b)" 
186 
"%(x, y). b" == "CONST prod_case (%x y. b)" 

35115  187 
"_abs (CONST Pair x y) t" => "%(x, y). t" 
37166  188 
 {* The last rule accommodates tuples in `case C ... (x,y) ... => ...' 
189 
The (x,y) is parsed as `Pair x y' because it is logic, not pttrn *} 

10213  190 

35115  191 
(*reconstruct pattern from (nested) splits, avoiding etacontraction of body; 
192 
works best with enclosing "let", if "let" does not avoid etacontraction*) 

14359  193 
print_translation {* 
35115  194 
let 
195 
fun split_tr' [Abs (x, T, t as (Abs abs))] = 

196 
(* split (%x y. t) => %(x,y) t *) 

197 
let 

42284  198 
val (y, t') = Syntax_Trans.atomic_abs_tr' abs; 
199 
val (x', t'') = Syntax_Trans.atomic_abs_tr' (x, T, t'); 

35115  200 
in 
201 
Syntax.const @{syntax_const "_abs"} $ 

202 
(Syntax.const @{syntax_const "_pattern"} $ x' $ y) $ t'' 

203 
end 

37591  204 
 split_tr' [Abs (x, T, (s as Const (@{const_syntax prod_case}, _) $ t))] = 
35115  205 
(* split (%x. (split (%y z. t))) => %(x,y,z). t *) 
206 
let 

207 
val Const (@{syntax_const "_abs"}, _) $ 

208 
(Const (@{syntax_const "_pattern"}, _) $ y $ z) $ t' = split_tr' [t]; 

42284  209 
val (x', t'') = Syntax_Trans.atomic_abs_tr' (x, T, t'); 
35115  210 
in 
211 
Syntax.const @{syntax_const "_abs"} $ 

212 
(Syntax.const @{syntax_const "_pattern"} $ x' $ 

213 
(Syntax.const @{syntax_const "_patterns"} $ y $ z)) $ t'' 

214 
end 

37591  215 
 split_tr' [Const (@{const_syntax prod_case}, _) $ t] = 
35115  216 
(* split (split (%x y z. t)) => %((x, y), z). t *) 
217 
split_tr' [(split_tr' [t])] (* inner split_tr' creates next pattern *) 

218 
 split_tr' [Const (@{syntax_const "_abs"}, _) $ x_y $ Abs abs] = 

219 
(* split (%pttrn z. t) => %(pttrn,z). t *) 

42284  220 
let val (z, t) = Syntax_Trans.atomic_abs_tr' abs in 
35115  221 
Syntax.const @{syntax_const "_abs"} $ 
222 
(Syntax.const @{syntax_const "_pattern"} $ x_y $ z) $ t 

223 
end 

224 
 split_tr' _ = raise Match; 

37591  225 
in [(@{const_syntax prod_case}, split_tr')] end 
14359  226 
*} 
227 

15422
cbdddc0efadf
added print translation for split: split f > %(x,y). f x y
schirmer
parents:
15404
diff
changeset

228 
(* 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

229 
typed_print_translation {* 
cbdddc0efadf
added print translation for split: split f > %(x,y). f x y
schirmer
parents:
15404
diff
changeset

230 
let 
42247
12fe41a92cd5
typed_print_translation: discontinued show_sorts argument;
wenzelm
parents:
42083
diff
changeset

231 
fun split_guess_names_tr' T [Abs (x, _, Abs _)] = raise Match 
12fe41a92cd5
typed_print_translation: discontinued show_sorts argument;
wenzelm
parents:
42083
diff
changeset

232 
 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

233 
(case (head_of t) of 
37591  234 
Const (@{const_syntax prod_case}, _) => raise Match 
35115  235 
 _ => 
236 
let 

237 
val (_ :: yT :: _) = binder_types (domain_type T) handle Bind => raise Match; 

42284  238 
val (y, t') = Syntax_Trans.atomic_abs_tr' ("y", yT, incr_boundvars 1 t $ Bound 0); 
239 
val (x', t'') = Syntax_Trans.atomic_abs_tr' (x, xT, t'); 

35115  240 
in 
241 
Syntax.const @{syntax_const "_abs"} $ 

242 
(Syntax.const @{syntax_const "_pattern"} $ x' $ y) $ t'' 

243 
end) 

42247
12fe41a92cd5
typed_print_translation: discontinued show_sorts argument;
wenzelm
parents:
42083
diff
changeset

244 
 split_guess_names_tr' T [t] = 
35115  245 
(case head_of t of 
37591  246 
Const (@{const_syntax prod_case}, _) => raise Match 
35115  247 
 _ => 
248 
let 

249 
val (xT :: yT :: _) = binder_types (domain_type T) handle Bind => raise Match; 

42284  250 
val (y, t') = 
251 
Syntax_Trans.atomic_abs_tr' ("y", yT, incr_boundvars 2 t $ Bound 1 $ Bound 0); 

252 
val (x', t'') = Syntax_Trans.atomic_abs_tr' ("x", xT, t'); 

35115  253 
in 
254 
Syntax.const @{syntax_const "_abs"} $ 

255 
(Syntax.const @{syntax_const "_pattern"} $ x' $ y) $ t'' 

256 
end) 

42247
12fe41a92cd5
typed_print_translation: discontinued show_sorts argument;
wenzelm
parents:
42083
diff
changeset

257 
 split_guess_names_tr' _ _ = raise Match; 
37591  258 
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

259 
*} 
cbdddc0efadf
added print translation for split: split f > %(x,y). f x y
schirmer
parents:
15404
diff
changeset

260 

42059
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset

261 
(* Force etacontraction 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

262 
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

263 
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

264 
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

265 
Otherwise prevent etacontraction. 
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset

266 
*) 
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset

267 
print_translation {* 
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset

268 
let 
83f3dc509068
fixed a printing problem for bounded quantifiers and bounded set operators in the case of tuples
nipkow
parents:
41792
diff
changeset

269 
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

270 
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

271 
[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

272 
=> 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

273 
 _ => 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 
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

275 
val pairs = 
42284  276 
[Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax Ball} @{syntax_const "_Ball"}, 
277 
Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax Bex} @{syntax_const "_Bex"}, 

278 
Syntax_Trans.preserve_binder_abs2_tr' @{const_syntax INFI} @{syntax_const "_INF"}, 

279 
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

280 
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

281 
*} 
10213  282 

37166  283 
subsubsection {* Code generator setup *} 
284 

37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset

285 
code_type prod 
37166  286 
(SML infix 2 "*") 
287 
(OCaml infix 2 "*") 

288 
(Haskell "!((_),/ (_))") 

289 
(Scala "((_),/ (_))") 

290 

291 
code_const Pair 

292 
(SML "!((_),/ (_))") 

293 
(OCaml "!((_),/ (_))") 

294 
(Haskell "!((_),/ (_))") 

295 
(Scala "!((_),/ (_))") 

296 

38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset

297 
code_instance prod :: equal 
37166  298 
(Haskell ) 
299 

38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38715
diff
changeset

300 
code_const "HOL.equal \<Colon> 'a \<times> 'b \<Rightarrow> 'a \<times> 'b \<Rightarrow> bool" 
39272  301 
(Haskell infix 4 "==") 
37166  302 

303 
types_code 

37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset

304 
"prod" ("(_ */ _)") 
37166  305 
attach (term_of) {* 
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset

306 
fun term_of_prod aF aT bF bT (x, y) = HOLogic.pair_const aT bT $ aF x $ bF y; 
37166  307 
*} 
308 
attach (test) {* 

37808
e604e5f9bb6a
correcting function name of generator for products of traditional code generator (introduced in 0040bafffdef)
bulwahn
parents:
37765
diff
changeset

309 
fun gen_prod aG aT bG bT i = 
37166  310 
let 
311 
val (x, t) = aG i; 

312 
val (y, u) = bG i 

313 
in ((x, y), fn () => HOLogic.pair_const aT bT $ t () $ u ()) end; 

314 
*} 

315 

316 
consts_code 

317 
"Pair" ("(_,/ _)") 

318 

319 
setup {* 

320 
let 

321 

322 
fun strip_abs_split 0 t = ([], t) 

323 
 strip_abs_split i (Abs (s, T, t)) = 

324 
let 

325 
val s' = Codegen.new_name t s; 

326 
val v = Free (s', T) 

327 
in apfst (cons v) (strip_abs_split (i1) (subst_bound (v, t))) end 

37591  328 
 strip_abs_split i (u as Const (@{const_name prod_case}, _) $ t) = 
37166  329 
(case strip_abs_split (i+1) t of 
330 
(v :: v' :: vs, u) => (HOLogic.mk_prod (v, v') :: vs, u) 

331 
 _ => ([], u)) 

332 
 strip_abs_split i t = 

333 
strip_abs_split i (Abs ("x", hd (binder_types (fastype_of t)), t $ Bound 0)); 

334 

42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset

335 
fun let_codegen thy mode defs dep thyname brack t gr = 
37166  336 
(case strip_comb t of 
337 
(t1 as Const (@{const_name Let}, _), t2 :: t3 :: ts) => 

338 
let 

339 
fun dest_let (l as Const (@{const_name Let}, _) $ t $ u) = 

340 
(case strip_abs_split 1 u of 

341 
([p], u') => apfst (cons (p, t)) (dest_let u') 

342 
 _ => ([], l)) 

343 
 dest_let t = ([], t); 

344 
fun mk_code (l, r) gr = 

345 
let 

42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset

346 
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

347 
val (pr, gr2) = Codegen.invoke_codegen thy mode defs dep thyname false r gr1; 
37166  348 
in ((pl, pr), gr2) end 
349 
in case dest_let (t1 $ t2 $ t3) of 

350 
([], _) => NONE 

351 
 (ps, u) => 

352 
let 

353 
val (qs, gr1) = fold_map mk_code ps gr; 

42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset

354 
val (pu, gr2) = Codegen.invoke_codegen thy mode defs dep thyname false u gr1; 
37166  355 
val (pargs, gr3) = fold_map 
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset

356 
(Codegen.invoke_codegen thy mode defs dep thyname true) ts gr2 
37166  357 
in 
358 
SOME (Codegen.mk_app brack 

359 
(Pretty.blk (0, [Codegen.str "let ", Pretty.blk (0, flat 

360 
(separate [Codegen.str ";", Pretty.brk 1] (map (fn (pl, pr) => 

361 
[Pretty.block [Codegen.str "val ", pl, Codegen.str " =", 

362 
Pretty.brk 1, pr]]) qs))), 

363 
Pretty.brk 1, Codegen.str "in ", pu, 

364 
Pretty.brk 1, Codegen.str "end"])) pargs, gr3) 

365 
end 

366 
end 

367 
 _ => NONE); 

368 

42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset

369 
fun split_codegen thy mode defs dep thyname brack t gr = (case strip_comb t of 
37591  370 
(t1 as Const (@{const_name prod_case}, _), t2 :: ts) => 
37166  371 
let 
372 
val ([p], u) = strip_abs_split 1 (t1 $ t2); 

42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset

373 
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

374 
val (pu, gr2) = Codegen.invoke_codegen thy mode defs dep thyname false u gr1; 
37166  375 
val (pargs, gr3) = fold_map 
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42284
diff
changeset

376 
(Codegen.invoke_codegen thy mode defs dep thyname true) ts gr2 
37166  377 
in 
378 
SOME (Codegen.mk_app brack 

379 
(Pretty.block [Codegen.str "(fn ", q, Codegen.str " =>", 

380 
Pretty.brk 1, pu, Codegen.str ")"]) pargs, gr2) 

381 
end 

382 
 _ => NONE); 

383 

384 
in 

385 

386 
Codegen.add_codegen "let_codegen" let_codegen 

387 
#> Codegen.add_codegen "split_codegen" split_codegen 

388 

389 
end 

390 
*} 

391 

392 

393 
subsubsection {* Fundamental operations and properties *} 

11838  394 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

395 
lemma surj_pair [simp]: "EX x y. p = (x, y)" 
37166  396 
by (cases p) simp 
10213  397 

37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset

398 
definition fst :: "'a \<times> 'b \<Rightarrow> 'a" where 
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset

399 
"fst p = (case p of (a, b) \<Rightarrow> a)" 
11838  400 

37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset

401 
definition snd :: "'a \<times> 'b \<Rightarrow> 'b" where 
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset

402 
"snd p = (case p of (a, b) \<Rightarrow> b)" 
11838  403 

22886  404 
lemma fst_conv [simp, code]: "fst (a, b) = a" 
37166  405 
unfolding fst_def by simp 
11838  406 

22886  407 
lemma snd_conv [simp, code]: "snd (a, b) = b" 
37166  408 
unfolding snd_def by simp 
11025
a70b796d9af8
converted to Isar therory, adding attributes complete_split and split_format
oheimb
parents:
10289
diff
changeset

409 

37166  410 
code_const fst and snd 
411 
(Haskell "fst" and "snd") 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

412 

41792
ff3cb0c418b7
renamed "nitpick\_def" to "nitpick_unfold" to reflect its new semantics
blanchet
parents:
41505
diff
changeset

413 
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

414 
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

415 

11838  416 
lemma fst_eqD: "fst (x, y) = a ==> x = a" 
417 
by simp 

418 

419 
lemma snd_eqD: "snd (x, y) = a ==> y = a" 

420 
by simp 

421 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

422 
lemma pair_collapse [simp]: "(fst p, snd p) = p" 
11838  423 
by (cases p) simp 
424 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

425 
lemmas surjective_pairing = pair_collapse [symmetric] 
11838  426 

37166  427 
lemma Pair_fst_snd_eq: "s = t \<longleftrightarrow> fst s = fst t \<and> snd s = snd t" 
428 
by (cases s, cases t) simp 

429 

430 
lemma prod_eqI [intro?]: "fst p = fst q \<Longrightarrow> snd p = snd q \<Longrightarrow> p = q" 

431 
by (simp add: Pair_fst_snd_eq) 

432 

433 
lemma split_conv [simp, code]: "split f (a, b) = f a b" 

37591  434 
by (fact prod.cases) 
37166  435 

436 
lemma splitI: "f a b \<Longrightarrow> split f (a, b)" 

437 
by (rule split_conv [THEN iffD2]) 

438 

439 
lemma splitD: "split f (a, b) \<Longrightarrow> f a b" 

440 
by (rule split_conv [THEN iffD1]) 

441 

442 
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

443 
by (simp add: fun_eq_iff split: prod.split) 
37166  444 

445 
lemma split_eta: "(\<lambda>(x, y). f (x, y)) = f" 

446 
 {* 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

447 
by (simp add: fun_eq_iff split: prod.split) 
37166  448 

449 
lemma split_comp: "split (f \<circ> g) x = f (g (fst x)) (snd x)" 

450 
by (cases x) simp 

451 

452 
lemma split_twice: "split f (split g p) = split (\<lambda>x y. split f (g x y)) p" 

453 
by (cases p) simp 

454 

455 
lemma The_split: "The (split P) = (THE xy. P (fst xy) (snd xy))" 

37591  456 
by (simp add: prod_case_unfold) 
37166  457 

458 
lemma split_weak_cong: "p = q \<Longrightarrow> split c p = split c q" 

459 
 {* 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

460 
by (fact prod.weak_case_cong) 
37166  461 

462 
lemma cond_split_eta: "(!!x y. f x y = g (x, y)) ==> (%(x, y). f x y) = g" 

463 
by (simp add: split_eta) 

464 

11838  465 
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

466 
proof 
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset

467 
fix a b 
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset

468 
assume "!!x. PROP P x" 
19535  469 
then show "PROP P (a, b)" . 
11820
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset

470 
next 
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset

471 
fix x 
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset

472 
assume "!!a b. PROP P (a, b)" 
19535  473 
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

474 
qed 
015a82d4ee96
proper proof of split_paired_all (presently unused);
wenzelm
parents:
11777
diff
changeset

475 

11838  476 
text {* 
477 
The rule @{thm [source] split_paired_all} does not work with the 

478 
Simplifier because it also affects premises in congrence rules, 

479 
where this can lead to premises of the form @{text "!!a b. ... = 

480 
?P(a, b)"} which cannot be solved by reflexivity. 

481 
*} 

482 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

483 
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

484 

26480  485 
ML {* 
11838  486 
(* replace parameters of product type by individual component parameters *) 
487 
val safe_full_simp_tac = generic_simp_tac true (true, false, false); 

488 
local (* filtering with exists_paired_all is an essential optimization *) 

16121  489 
fun exists_paired_all (Const ("all", _) $ Abs (_, T, t)) = 
11838  490 
can HOLogic.dest_prodT T orelse exists_paired_all t 
491 
 exists_paired_all (t $ u) = exists_paired_all t orelse exists_paired_all u 

492 
 exists_paired_all (Abs (_, _, t)) = exists_paired_all t 

493 
 exists_paired_all _ = false; 

494 
val ss = HOL_basic_ss 

26340  495 
addsimps [@{thm split_paired_all}, @{thm unit_all_eq2}, @{thm unit_abs_eta_conv}] 
43594  496 
addsimprocs [@{simproc unit_eq}]; 
11838  497 
in 
498 
val split_all_tac = SUBGOAL (fn (t, i) => 

499 
if exists_paired_all t then safe_full_simp_tac ss i else no_tac); 

500 
val unsafe_split_all_tac = SUBGOAL (fn (t, i) => 

501 
if exists_paired_all t then full_simp_tac ss i else no_tac); 

502 
fun split_all th = 

26340  503 
if exists_paired_all (Thm.prop_of th) then full_simplify ss th else th; 
11838  504 
end; 
26340  505 
*} 
11838  506 

26340  507 
declaration {* fn _ => 
508 
Classical.map_cs (fn cs => cs addSbefore ("split_all_tac", split_all_tac)) 

16121  509 
*} 
11838  510 

511 
lemma split_paired_All [simp]: "(ALL x. P x) = (ALL a b. P (a, b))" 

512 
 {* @{text "[iff]"} is not a good idea because it makes @{text blast} loop *} 

513 
by fast 

514 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

515 
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

516 
by fast 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

517 

11838  518 
lemma split_paired_The: "(THE x. P x) = (THE (a, b). P (a, b))" 
519 
 {* Can't be added to simpset: loops! *} 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

520 
by (simp add: split_eta) 
11838  521 

522 
text {* 

523 
Simplification procedure for @{thm [source] cond_split_eta}. Using 

524 
@{thm [source] split_eta} as a rewrite rule is not general enough, 

525 
and using @{thm [source] cond_split_eta} directly would render some 

526 
existing proofs very inefficient; similarly for @{text 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

527 
split_beta}. 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

528 
*} 
11838  529 

26480  530 
ML {* 
11838  531 
local 
35364  532 
val cond_split_eta_ss = HOL_basic_ss addsimps @{thms cond_split_eta}; 
533 
fun Pair_pat k 0 (Bound m) = (m = k) 

534 
 Pair_pat k i (Const (@{const_name Pair}, _) $ Bound m $ t) = 

535 
i > 0 andalso m = k + i andalso Pair_pat k (i  1) t 

536 
 Pair_pat _ _ _ = false; 

537 
fun no_args k i (Abs (_, _, t)) = no_args (k + 1) i t 

538 
 no_args k i (t $ u) = no_args k i t andalso no_args k i u 

539 
 no_args k i (Bound m) = m < k orelse m > k + i 

540 
 no_args _ _ _ = true; 

541 
fun split_pat tp i (Abs (_, _, t)) = if tp 0 i t then SOME (i, t) else NONE 

37591  542 
 split_pat tp i (Const (@{const_name prod_case}, _) $ Abs (_, _, t)) = split_pat tp (i + 1) t 
35364  543 
 split_pat tp i _ = NONE; 
20044
92cc2f4c7335
simprocs: no theory argument  use simpset context instead;
wenzelm
parents:
19656
diff
changeset

544 
fun metaeq ss lhs rhs = mk_meta_eq (Goal.prove (Simplifier.the_context ss) [] [] 
35364  545 
(HOLogic.mk_Trueprop (HOLogic.mk_eq (lhs, rhs))) 
18328  546 
(K (simp_tac (Simplifier.inherit_context ss cond_split_eta_ss) 1))); 
11838  547 

35364  548 
fun beta_term_pat k i (Abs (_, _, t)) = beta_term_pat (k + 1) i t 
549 
 beta_term_pat k i (t $ u) = 

550 
Pair_pat k i (t $ u) orelse (beta_term_pat k i t andalso beta_term_pat k i u) 

551 
 beta_term_pat k i t = no_args k i t; 

552 
fun eta_term_pat k i (f $ arg) = no_args k i f andalso Pair_pat k i arg 

553 
 eta_term_pat _ _ _ = false; 

11838  554 
fun subst arg k i (Abs (x, T, t)) = Abs (x, T, subst arg (k+1) i t) 
35364  555 
 subst arg k i (t $ u) = 
556 
if Pair_pat k i (t $ u) then incr_boundvars k arg 

557 
else (subst arg k i t $ subst arg k i u) 

558 
 subst arg k i t = t; 

43595  559 
in 
37591  560 
fun beta_proc ss (s as Const (@{const_name prod_case}, _) $ Abs (_, _, t) $ arg) = 
11838  561 
(case split_pat beta_term_pat 1 t of 
35364  562 
SOME (i, f) => SOME (metaeq ss s (subst arg 0 i f)) 
15531  563 
 NONE => NONE) 
35364  564 
 beta_proc _ _ = NONE; 
37591  565 
fun eta_proc ss (s as Const (@{const_name prod_case}, _) $ Abs (_, _, t)) = 
11838  566 
(case split_pat eta_term_pat 1 t of 
35364  567 
SOME (_, ft) => SOME (metaeq ss s (let val (f $ arg) = ft in f end)) 
15531  568 
 NONE => NONE) 
35364  569 
 eta_proc _ _ = NONE; 
11838  570 
end; 
571 
*} 

43595  572 
simproc_setup split_beta ("split f z") = {* fn _ => fn ss => fn ct => beta_proc ss (term_of ct) *} 
573 
simproc_setup split_eta ("split f") = {* fn _ => fn ss => fn ct => eta_proc ss (term_of ct) *} 

11838  574 

26798
a9134a089106
split_beta is now declared as monotonicity rule, to allow bounded
berghofe
parents:
26588
diff
changeset

575 
lemma split_beta [mono]: "(%(x, y). P x y) z = P (fst z) (snd z)" 
11838  576 
by (subst surjective_pairing, rule split_conv) 
577 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset

578 
lemma split_split [no_atp]: "R(split c p) = (ALL x y. p = (x, y) > R(c x y))" 
11838  579 
 {* For use with @{text split} and the Simplifier. *} 
15481  580 
by (insert surj_pair [of p], clarify, simp) 
11838  581 

582 
text {* 

583 
@{thm [source] split_split} could be declared as @{text "[split]"} 

584 
done after the Splitter has been speeded up significantly; 

585 
precompute the constants involved and don't do anything unless the 

586 
current goal contains one of those constants. 

587 
*} 

588 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset

589 
lemma split_split_asm [no_atp]: "R (split c p) = (~(EX x y. p = (x, y) & (~R (c x y))))" 
14208  590 
by (subst split_split, simp) 
11838  591 

592 
text {* 

593 
\medskip @{term split} used as a logical connective or set former. 

594 

595 
\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

596 
call @{text simp} using @{thm [source] prod.split} as rewrite. *} 
11838  597 

598 
lemma splitI2: "!!p. [ !!a b. p = (a, b) ==> c a b ] ==> split c p" 

599 
apply (simp only: split_tupled_all) 

600 
apply (simp (no_asm_simp)) 

601 
done 

602 

603 
lemma splitI2': "!!p. [ !!a b. (a, b) = p ==> c a b x ] ==> split c p x" 

604 
apply (simp only: split_tupled_all) 

605 
apply (simp (no_asm_simp)) 

606 
done 

607 

608 
lemma splitE: "split c p ==> (!!x y. p = (x, y) ==> c x y ==> Q) ==> Q" 

37591  609 
by (induct p) auto 
11838  610 

611 
lemma splitE': "split c p z ==> (!!x y. p = (x, y) ==> c x y z ==> Q) ==> Q" 

37591  612 
by (induct p) auto 
11838  613 

614 
lemma splitE2: 

615 
"[ Q (split P z); !!x y. [z = (x, y); Q (P x y)] ==> R ] ==> R" 

616 
proof  

617 
assume q: "Q (split P z)" 

618 
assume r: "!!x y. [z = (x, y); Q (P x y)] ==> R" 

619 
show R 

620 
apply (rule r surjective_pairing)+ 

621 
apply (rule split_beta [THEN subst], rule q) 

622 
done 

623 
qed 

624 

625 
lemma splitD': "split R (a,b) c ==> R a b c" 

626 
by simp 

627 

628 
lemma mem_splitI: "z: c a b ==> z: split c (a, b)" 

629 
by simp 

630 

631 
lemma mem_splitI2: "!!p. [ !!a b. p = (a, b) ==> z: c a b ] ==> z: split c p" 

14208  632 
by (simp only: split_tupled_all, simp) 
11838  633 

18372  634 
lemma mem_splitE: 
37166  635 
assumes major: "z \<in> split c p" 
636 
and cases: "\<And>x y. p = (x, y) \<Longrightarrow> z \<in> c x y \<Longrightarrow> Q" 

18372  637 
shows Q 
37591  638 
by (rule major [unfolded prod_case_unfold] cases surjective_pairing)+ 
11838  639 

640 
declare mem_splitI2 [intro!] mem_splitI [intro!] splitI2' [intro!] splitI2 [intro!] splitI [intro!] 

641 
declare mem_splitE [elim!] splitE' [elim!] splitE [elim!] 

642 

26340  643 
ML {* 
11838  644 
local (* filtering with exists_p_split is an essential optimization *) 
37591  645 
fun exists_p_split (Const (@{const_name prod_case},_) $ _ $ (Const (@{const_name Pair},_)$_$_)) = true 
11838  646 
 exists_p_split (t $ u) = exists_p_split t orelse exists_p_split u 
647 
 exists_p_split (Abs (_, _, t)) = exists_p_split t 

648 
 exists_p_split _ = false; 

35364  649 
val ss = HOL_basic_ss addsimps @{thms split_conv}; 
11838  650 
in 
651 
val split_conv_tac = SUBGOAL (fn (t, i) => 

652 
if exists_p_split t then safe_full_simp_tac ss i else no_tac); 

653 
end; 

26340  654 
*} 
655 

11838  656 
(* This prevents applications of splitE for already splitted arguments leading 
657 
to quite timeconsuming computations (in particular for nested tuples) *) 

26340  658 
declaration {* fn _ => 
659 
Classical.map_cs (fn cs => cs addSbefore ("split_conv_tac", split_conv_tac)) 

16121  660 
*} 
11838  661 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset

662 
lemma split_eta_SetCompr [simp,no_atp]: "(%u. EX x y. u = (x, y) & P (x, y)) = P" 
18372  663 
by (rule ext) fast 
11838  664 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset

665 
lemma split_eta_SetCompr2 [simp,no_atp]: "(%u. EX x y. u = (x, y) & P x y) = split P" 
18372  666 
by (rule ext) fast 
11838  667 

668 
lemma split_part [simp]: "(%(a,b). P & Q a b) = (%ab. P & split Q ab)" 

669 
 {* Allows simplifications of nested splits in case of independent predicates. *} 

18372  670 
by (rule ext) blast 
11838  671 

14337
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset

672 
(* 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

673 
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

674 
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

675 
*) 
e13731554e50
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
nipkow
parents:
14208
diff
changeset

676 
lemma split_comp_eq: 
20415  677 
fixes f :: "'a => 'b => 'c" and g :: "'d => 'a" 
678 
shows "(%u. f (g (fst u)) (snd u)) = (split (%x. f (g x)))" 

18372  679 
by (rule ext) auto 
14101  680 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

681 
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

682 
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

683 
apply auto 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

684 
done 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

685 

11838  686 
lemma The_split_eq [simp]: "(THE (x',y'). x = x' & y = y') = (x, y)" 
687 
by blast 

688 

689 
(* 

690 
the following would be slightly more general, 

691 
but cannot be used as rewrite rule: 

692 
### Cannot add premise as rewrite rule because it contains (type) unknowns: 

693 
### ?y = .x 

694 
Goal "[ P y; !!x. P x ==> x = y ] ==> (@(x',y). x = x' & P y) = (x,y)" 

14208  695 
by (rtac some_equality 1) 
696 
by ( Simp_tac 1) 

697 
by (split_all_tac 1) 

698 
by (Asm_full_simp_tac 1) 

11838  699 
qed "The_split_eq"; 
700 
*) 

701 

702 
text {* 

703 
Setup of internal @{text split_rule}. 

704 
*} 

705 

24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

706 
lemmas prod_caseI = prod.cases [THEN iffD2, standard] 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

707 

c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

708 
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

709 
by (fact splitI2) 
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

710 

c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

711 
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

712 
by (fact splitI2') 
24699
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_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

715 
by (fact splitE) 
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_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

718 
by (fact splitE') 
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

719 

37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset

720 
declare prod_caseI [intro!] 
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

721 

26143
314c0bcb7df7
Added useful general lemmas from the work with the HeapMonad
bulwahn
parents:
25885
diff
changeset

722 
lemma prod_case_beta: 
314c0bcb7df7
Added useful general lemmas from the work with the HeapMonad
bulwahn
parents:
25885
diff
changeset

723 
"prod_case f p = f (fst p) (snd p)" 
37591  724 
by (fact split_beta) 
26143
314c0bcb7df7
Added useful general lemmas from the work with the HeapMonad
bulwahn
parents:
25885
diff
changeset

725 

24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

726 
lemma prod_cases3 [cases type]: 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

727 
obtains (fields) a b c where "y = (a, b, c)" 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

728 
by (cases y, case_tac b) blast 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

729 

c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

730 
lemma prod_induct3 [case_names fields, induct type]: 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

731 
"(!!a b c. P (a, b, c)) ==> P x" 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

732 
by (cases x) blast 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

733 

c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

734 
lemma prod_cases4 [cases type]: 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

735 
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

736 
by (cases y, case_tac c) blast 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

737 

c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

738 
lemma prod_induct4 [case_names fields, induct type]: 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

739 
"(!!a b c d. P (a, b, c, d)) ==> P x" 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

740 
by (cases x) blast 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

741 

c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

742 
lemma prod_cases5 [cases type]: 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

743 
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

744 
by (cases y, case_tac d) blast 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

745 

c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

746 
lemma prod_induct5 [case_names fields, induct type]: 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

747 
"(!!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

748 
by (cases x) blast 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

749 

c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

750 
lemma prod_cases6 [cases type]: 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

751 
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

752 
by (cases y, case_tac e) blast 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

753 

c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

754 
lemma prod_induct6 [case_names fields, induct type]: 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

755 
"(!!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

756 
by (cases x) blast 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

757 

c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

758 
lemma prod_cases7 [cases type]: 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

759 
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

760 
by (cases y, case_tac f) blast 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

761 

c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

762 
lemma prod_induct7 [case_names fields, induct type]: 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

763 
"(!!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

764 
by (cases x) blast 
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

765 

37166  766 
lemma split_def: 
767 
"split = (\<lambda>c p. c (fst p) (snd p))" 

37591  768 
by (fact prod_case_unfold) 
37166  769 

770 
definition internal_split :: "('a \<Rightarrow> 'b \<Rightarrow> 'c) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'c" where 

771 
"internal_split == split" 

772 

773 
lemma internal_split_conv: "internal_split c (a, b) = c a b" 

774 
by (simp only: internal_split_def split_conv) 

775 

776 
use "Tools/split_rule.ML" 

777 
setup Split_Rule.setup 

778 

779 
hide_const internal_split 

780 

24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

781 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

782 
subsubsection {* Derived operations *} 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

783 

37387
3581483cca6c
qualified types "+" and nat; qualified constants Ball, Bex, Suc, curry; modernized some specifications
haftmann
parents:
37278
diff
changeset

784 
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

785 
"curry = (\<lambda>c x y. c (x, y))" 
37166  786 

787 
lemma curry_conv [simp, code]: "curry f a b = f (a, b)" 

788 
by (simp add: curry_def) 

789 

790 
lemma curryI [intro!]: "f (a, b) \<Longrightarrow> curry f a b" 

791 
by (simp add: curry_def) 

792 

793 
lemma curryD [dest!]: "curry f a b \<Longrightarrow> f (a, b)" 

794 
by (simp add: curry_def) 

795 

796 
lemma curryE: "curry f a b \<Longrightarrow> (f (a, b) \<Longrightarrow> Q) \<Longrightarrow> Q" 

797 
by (simp add: curry_def) 

798 

799 
lemma curry_split [simp]: "curry (split f) = f" 

800 
by (simp add: curry_def split_def) 

801 

802 
lemma split_curry [simp]: "split (curry f) = f" 

803 
by (simp add: curry_def split_def) 

804 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

805 
text {* 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

806 
The compositionuncurry combinator. 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

807 
*} 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

808 

37751  809 
notation fcomp (infixl "\<circ>>" 60) 
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

810 

37751  811 
definition scomp :: "('a \<Rightarrow> 'b \<times> 'c) \<Rightarrow> ('b \<Rightarrow> 'c \<Rightarrow> 'd) \<Rightarrow> 'a \<Rightarrow> 'd" (infixl "\<circ>\<rightarrow>" 60) where 
812 
"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

813 

37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset

814 
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

815 
by (simp add: fun_eq_iff scomp_def prod_case_unfold) 
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset

816 

37751  817 
lemma scomp_apply [simp]: "(f \<circ>\<rightarrow> g) x = prod_case g (f x)" 
818 
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

819 

37751  820 
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

821 
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

822 

37751  823 
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

824 
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

825 

37751  826 
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

827 
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

828 

37751  829 
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

830 
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

831 

37751  832 
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

833 
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

834 

31202
52d332f8f909
pretty printing of functional combinators for evaluation code
haftmann
parents:
30924
diff
changeset

835 
code_const scomp 
52d332f8f909
pretty printing of functional combinators for evaluation code
haftmann
parents:
30924
diff
changeset

836 
(Eval infixl 3 "#>") 
52d332f8f909
pretty printing of functional combinators for evaluation code
haftmann
parents:
30924
diff
changeset

837 

37751  838 
no_notation fcomp (infixl "\<circ>>" 60) 
839 
no_notation scomp (infixl "\<circ>\<rightarrow>" 60) 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

840 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

841 
text {* 
40607  842 
@{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

843 
functions. 
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

844 
*} 
21195  845 

40607  846 
definition map_pair :: "('a \<Rightarrow> 'c) \<Rightarrow> ('b \<Rightarrow> 'd) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'c \<times> 'd" where 
847 
"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

848 

40607  849 
lemma map_pair_simp [simp, code]: 
850 
"map_pair f g (a, b) = (f a, g b)" 

851 
by (simp add: map_pair_def) 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

852 

41505
6d19301074cf
"enriched_type" replaces less specific "type_lifting"
haftmann
parents:
41372
diff
changeset

853 
enriched_type map_pair: map_pair 
41372  854 
by (auto simp add: split_paired_all intro: ext) 
37278  855 

40607  856 
lemma fst_map_pair [simp]: 
857 
"fst (map_pair f g x) = f (fst x)" 

858 
by (cases x) simp_all 

37278  859 

40607  860 
lemma snd_prod_fun [simp]: 
861 
"snd (map_pair f g x) = g (snd x)" 

862 
by (cases x) simp_all 

37278  863 

40607  864 
lemma fst_comp_map_pair [simp]: 
865 
"fst \<circ> map_pair f g = f \<circ> fst" 

866 
by (rule ext) simp_all 

37278  867 

40607  868 
lemma snd_comp_map_pair [simp]: 
869 
"snd \<circ> map_pair f g = g \<circ> snd" 

870 
by (rule ext) simp_all 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

871 

40607  872 
lemma map_pair_compose: 
873 
"map_pair (f1 o f2) (g1 o g2) = (map_pair f1 g1 o map_pair f2 g2)" 

874 
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

875 

40607  876 
lemma map_pair_ident [simp]: 
877 
"map_pair (%x. x) (%y. y) = (%z. z)" 

878 
by (rule ext) (simp add: map_pair.identity) 

879 

880 
lemma map_pair_imageI [intro]: 

881 
"(a, b) \<in> R \<Longrightarrow> (f a, g b) \<in> map_pair f g ` R" 

882 
by (rule image_eqI) simp_all 

21195  883 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

884 
lemma prod_fun_imageE [elim!]: 
40607  885 
assumes major: "c \<in> map_pair f g ` R" 
886 
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

887 
shows P 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

888 
apply (rule major [THEN imageE]) 
37166  889 
apply (case_tac x) 
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

890 
apply (rule cases) 
40607  891 
apply simp_all 
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

892 
done 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

893 

37166  894 
definition apfst :: "('a \<Rightarrow> 'c) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'c \<times> 'b" where 
40607  895 
"apfst f = map_pair f id" 
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

896 

37166  897 
definition apsnd :: "('b \<Rightarrow> 'c) \<Rightarrow> 'a \<times> 'b \<Rightarrow> 'a \<times> 'c" where 
40607  898 
"apsnd f = map_pair id f" 
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

899 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

900 
lemma apfst_conv [simp, code]: 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

901 
"apfst f (x, y) = (f x, y)" 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

902 
by (simp add: apfst_def) 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

903 

33638
548a34929e98
Renamed upd_snd_conv to apsnd_conv to be consistent with apfst_conv; Added apsnd_apfst_commute
hoelzl
parents:
33594
diff
changeset

904 
lemma apsnd_conv [simp, code]: 
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

905 
"apsnd f (x, y) = (x, f y)" 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

906 
by (simp add: apsnd_def) 
21195  907 

33594  908 
lemma fst_apfst [simp]: 
909 
"fst (apfst f x) = f (fst x)" 

910 
by (cases x) simp 

911 

912 
lemma fst_apsnd [simp]: 

913 
"fst (apsnd f x) = fst x" 

914 
by (cases x) simp 

915 

916 
lemma snd_apfst [simp]: 

917 
"snd (apfst f x) = snd x" 

918 
by (cases x) simp 

919 

920 
lemma snd_apsnd [simp]: 

921 
"snd (apsnd f x) = f (snd x)" 

922 
by (cases x) simp 

923 

924 
lemma apfst_compose: 

925 
"apfst f (apfst g x) = apfst (f \<circ> g) x" 

926 
by (cases x) simp 

927 

928 
lemma apsnd_compose: 

929 
"apsnd f (apsnd g x) = apsnd (f \<circ> g) x" 

930 
by (cases x) simp 

931 

932 
lemma apfst_apsnd [simp]: 

933 
"apfst f (apsnd g x) = (f (fst x), g (snd x))" 

934 
by (cases x) simp 

935 

936 
lemma apsnd_apfst [simp]: 

937 
"apsnd f (apfst g x) = (g (fst x), f (snd x))" 

938 
by (cases x) simp 

939 

940 
lemma apfst_id [simp] : 

941 
"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

942 
by (simp add: fun_eq_iff) 
33594  943 

944 
lemma apsnd_id [simp] : 

945 
"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

946 
by (simp add: fun_eq_iff) 
33594  947 

948 
lemma apfst_eq_conv [simp]: 

949 
"apfst f x = apfst g x \<longleftrightarrow> f (fst x) = g (fst x)" 

950 
by (cases x) simp 

951 

952 
lemma apsnd_eq_conv [simp]: 

953 
"apsnd f x = apsnd g x \<longleftrightarrow> f (snd x) = g (snd x)" 

954 
by (cases x) simp 

955 

33638
548a34929e98
Renamed upd_snd_conv to apsnd_conv to be consistent with apfst_conv; Added apsnd_apfst_commute
hoelzl
parents:
33594
diff
changeset

956 
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

957 
"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

958 
by simp 
21195  959 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

960 
text {* 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

961 
Disjoint union of a family of sets  Sigma. 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

962 
*} 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

963 

40607  964 
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

965 
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

966 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

967 
abbreviation 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

968 
Times :: "['a set, 'b set] => ('a * 'b) set" 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

969 
(infixr "<*>" 80) where 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

970 
"A <*> B == Sigma A (%_. B)" 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

971 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

972 
notation (xsymbols) 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

973 
Times (infixr "\<times>" 80) 
15394  974 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

975 
notation (HTML output) 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

976 
Times (infixr "\<times>" 80) 
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 
syntax 
35115  979 
"_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

980 
translations 
35115  981 
"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

982 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

983 
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

984 
by (unfold Sigma_def) blast 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

985 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

986 
lemma SigmaE [elim!]: 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

987 
"[ c: Sigma A B; 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

988 
!!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

989 
] ==> P" 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

990 
 {* The general elimination rule. *} 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

991 
by (unfold Sigma_def) blast 
20588  992 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

993 
text {* 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

994 
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

995 
eigenvariables. 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

996 
*} 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

997 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

998 
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

999 
by blast 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1000 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1001 
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

1002 
by blast 
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 SigmaE2: 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1005 
"[ (a, b) : Sigma A B; 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1006 
[ a:A; b:B(a) ] ==> P 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1007 
] ==> P" 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1008 
by blast 
20588  1009 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1010 
lemma Sigma_cong: 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1011 
"\<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

1012 
\<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

1013 
by auto 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1014 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1015 
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

1016 
by blast 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1017 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1018 
lemma Sigma_empty1 [simp]: "Sigma {} B = {}" 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1019 
by blast 
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_empty2 [simp]: "A <*> {} = {}" 
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 UNIV_Times_UNIV [simp]: "UNIV <*> UNIV = UNIV" 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1025 
by auto 
21908  1026 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1027 
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

1028 
by auto 
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 Compl_Times_UNIV2 [simp]: " (A <*> UNIV) = (A) <*> UNIV" 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1031 
by auto 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1032 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1033 
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

1034 
by blast 
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 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

1037 
by blast 
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 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

1040 
by (blast elim: equalityE) 
20588  1041 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1042 
lemma SetCompr_Sigma_eq: 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1043 
"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

1044 
by blast 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1045 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1046 
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

1047 
by blast 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1048 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1049 
lemma UN_Times_distrib: 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1050 
"(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

1051 
 {* Suggested by Pierre Chartier *} 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1052 
by blast 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1053 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset

1054 
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

1055 
"(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

1056 
by blast 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1057 

35828
46cfc4b8112e
now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents:
35427
diff
changeset

1058 
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

1059 
"(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

1060 
by blast 
21908  1061 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1062 
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

1063 
by blast 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1064 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1065 
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

1066 
by blast 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1067 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1068 
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

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_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

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_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

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_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

1078 
by blast 
21908  1079 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1080 
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

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 
text {* 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1084 
Nondependent versions are needed to avoid the need for higherorder 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1085 
matching, especially when the rules are reoriented. 
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1086 
*} 
21908  1087 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1088 
lemma Times_Un_distrib1: "(A Un B) <*> C = (A <*> C) Un (B <*> C)" 
28719  1089 
by blast 
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1090 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1091 
lemma Times_Int_distrib1: "(A Int B) <*> C = (A <*> C) Int (B <*> C)" 
28719  1092 
by blast 
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1093 

d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1094 
lemma Times_Diff_distrib1: "(A  B) <*> C = (A <*> C)  (B <*> C)" 
28719  1095 
by blast 
26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1096 

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

1097 
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

1098 
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

1099 

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

1100 
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

1101 
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

1102 

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 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

1104 
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

1105 

28719  1106 
lemma insert_times_insert[simp]: 
1107 
"insert a A \<times> insert b B = 

1108 
insert (a,b) (A \<times> insert b B \<union> insert a A \<times> B)" 

1109 
by blast 

26358
d6a508c16908
Product_Type.apfst and Product_Type.apsnd; mbind combinator; tuned
haftmann
parents:
26340
diff
changeset

1110 

33271
7be66dee1a5a
New theory Probability, which contains a development of measure theory
paulson
parents:
33089
diff
changeset

1111 
lemma vimage_Times: "f ` (A \<times> B) = ((fst \<circ> f) ` A) \<inter> ((snd \<circ> f) ` B)" 
37166  1112 
by (auto, case_tac "f x", auto) 
33271
7be66dee1a5a
New theory Probability, which contains a development of measure theory
paulson
parents:
33089
diff
changeset

1113 

35822  1114 
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

1115 
"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

1116 
by (auto intro!: inj_onI) 
35822  1117 

1118 
lemma swap_product: 

1119 
"(%(i, j). (j, i)) ` (A \<times> B) = B \<times> A" 

1120 
by (simp add: split_def image_def) blast 

1121 

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

1122 
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

1123 
"(\<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

1124 
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

1125 
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

1126 
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

1127 
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

1128 
qed simp_all 
35822  1129 

40607  1130 
text {* The following @{const map_pair} lemmas are due to Joachim Breitner: *} 
1131 

1132 
lemma map_pair_inj_on: 

1133 
assumes "inj_on f A" and "inj_on g B" 

1134 
shows "inj_on (map_pair f g) (A \<times> B)" 

1135 
proof (rule inj_onI) 

1136 
fix x :: "'a \<times> 'c" and y :: "'a \<times> 'c" 

1137 
assume "x \<in> A \<times> B" hence "fst x \<in> A" and "snd x \<in> B" by auto 

1138 
assume "y \<in> A \<times> B" hence "fst y \<in> A" and "snd y \<in> B" by auto 

1139 
assume "map_pair f g x = map_pair f g y" 

1140 
hence "fst (map_pair f g x) = fst (map_pair f g y)" by (auto) 

1141 
hence "f (fst x) = f (fst y)" by (cases x,cases y,auto) 

1142 
with `inj_on f A` and `fst x \<in> A` and `fst y \<in> A` 

1143 
have "fst x = fst y" by (auto dest:dest:inj_onD) 

1144 
moreover from `map_pair f g x = map_pair f g y` 

1145 
have "snd (map_pair f g x) = snd (map_pair f g y)" by (auto) 

1146 
hence "g (snd x) = g (snd y)" by (cases x,cases y,auto) 

1147 
with `inj_on g B` and `snd x \<in> B` and `snd y \<in> B` 

1148 
have "snd x = snd y" by (auto dest:dest:inj_onD) 

1149 
ultimately show "x = y" by(rule prod_eqI) 

1150 
qed 

1151 

1152 
lemma map_pair_surj: 

40702  1153 
fixes f :: "'a \<Rightarrow> 'b" and g :: "'c \<Rightarrow> 'd" 
40607  1154 
assumes "surj f" and "surj g" 
1155 
shows "surj (map_pair f g)" 

1156 
unfolding surj_def 

1157 
proof 

1158 
fix y :: "'b \<times> 'd" 

1159 
from `surj f` obtain a where "fst y = f a" by (auto elim:surjE) 

1160 
moreover 

1161 
from `surj g` obtain b where "snd y = g b" by (auto elim:surjE) 

1162 
ultimately have "(fst y, snd y) = map_pair f g (a,b)" by auto 

1163 
thus "\<exists>x. y = map_pair f g x" by auto 

1164 
qed 

1165 

1166 
lemma map_pair_surj_on: 

1167 
assumes "f ` A = A'" and "g ` B = B'" 

1168 
shows "map_pair f g ` (A \<times> B) = A' \<times> B'" 

1169 
unfolding image_def 

1170 
proof(rule set_eqI,rule iffI) 

1171 
fix x :: "'a \<times> 'c" 

1172 
assume "x \<in> {y\<Colon>'a \<times> 'c. \<exists>x\<Colon>'b \<times> 'd\<in>A \<times> B. y = map_pair f g x}" 

1173 
then obtain y where "y \<in> A \<times> B" and "x = map_pair f g y" by blast 

1174 
from `image f A = A'` and `y \<in> A \<times> B` have "f (fst y) \<in> A'" by auto 

1175 
moreover from `image g B = B'` and `y \<in> A \<times> B` have "g (snd y) \<in> B'" by auto 

1176 
ultimately have "(f (fst y), g (snd y)) \<in> (A' \<times> B')" by auto 

1177 
with `x = map_pair f g y` show "x \<in> A' \<times> B'" by (cases y, auto) 

1178 
next 

1179 
fix x :: "'a \<times> 'c" 

1180 
assume "x \<in> A' \<times> B'" hence "fst x \<in> A'" and "snd x \<in> B'" by auto 

1181 
from `image f A = A'` and `fst x \<in> A'` have "fst x \<in> image f A" by auto 

1182 
then obtain a where "a \<in> A" and "fst x = f a" by (rule imageE) 

1183 
moreover from `image g B = B'` and `snd x \<in> B'` 

1184 
obtain b where "b \<in> B" and "snd x = g b" by auto 

1185 
ultimately have "(fst x, snd x) = map_pair f g (a,b)" by auto 

1186 
moreover from `a \<in> A` and `b \<in> B` have "(a , b) \<in> A \<times> B" by auto 

1187 
ultimately have "\<exists>y \<in> A \<times> B. x = map_pair f g y" by auto 

1188 
thus "x \<in> {x. \<exists>y \<in> A \<times> B. x = map_pair f g y}" by auto 

1189 
qed 

1190 

21908  1191 

37166  1192 
subsection {* Inductively defined sets *} 
15394  1193 

37389
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset

1194 
use "Tools/inductive_codegen.ML" 
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset

1195 
setup Inductive_Codegen.setup 
09467cdfa198
qualified type "*"; qualified constants Pair, fst, snd, split
haftmann
parents:
37387
diff
changeset

1196 

31723
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31667
diff
changeset

1197 
use "Tools/inductive_set.ML" 
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31667
diff
changeset

1198 
setup Inductive_Set.setup 
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24286
diff
changeset

1199 

37166  1200 

1201 
subsection {* Legacy theorem bindings and duplicates *} 

1202 

1203 
lemma PairE: 

1204 
obtains x y where "p = (x, y)" 

1205 
by (fact prod.exhaust) 

1206 

1207 
lemma Pair_inject: 

1208 
assumes "(a, b) = (a', b')" 

1209 
and "a = a' ==> b = b' ==> R" 

1210 
shows R 

1211 
using assms by simp 

1212 

1213 
lemmas Pair_eq = prod.inject 

1214 

1215 
lemmas split = split_conv  {* for backwards compatibility *} 

1216 

10213  1217 
end 