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