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