src/HOL/Product_Type.thy
author wenzelm
Sat Jul 08 12:54:30 2006 +0200 (2006-07-08)
changeset 20044 92cc2f4c7335
parent 19656 09be06943252
child 20105 454f4be984b7
permissions -rw-r--r--
simprocs: no theory argument -- use simpset context instead;
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
nipkow@15140
    10
imports Fun
haftmann@16417
    11
uses ("Tools/split_rule.ML")
nipkow@15131
    12
begin
wenzelm@11838
    13
wenzelm@11838
    14
subsection {* Unit *}
wenzelm@11838
    15
wenzelm@11838
    16
typedef unit = "{True}"
wenzelm@11838
    17
proof
wenzelm@11838
    18
  show "True : ?unit" by blast
wenzelm@11838
    19
qed
wenzelm@11838
    20
wenzelm@11838
    21
constdefs
wenzelm@11838
    22
  Unity :: unit    ("'(')")
wenzelm@11838
    23
  "() == Abs_unit True"
wenzelm@11838
    24
wenzelm@11838
    25
lemma unit_eq: "u = ()"
wenzelm@11838
    26
  by (induct u) (simp add: unit_def Unity_def)
wenzelm@11838
    27
wenzelm@11838
    28
text {*
wenzelm@11838
    29
  Simplification procedure for @{thm [source] unit_eq}.  Cannot use
wenzelm@11838
    30
  this rule directly --- it loops!
wenzelm@11838
    31
*}
wenzelm@11838
    32
wenzelm@11838
    33
ML_setup {*
wenzelm@13462
    34
  val unit_eq_proc =
wenzelm@13462
    35
    let val unit_meta_eq = mk_meta_eq (thm "unit_eq") in
wenzelm@13462
    36
      Simplifier.simproc (Theory.sign_of (the_context ())) "unit_eq" ["x::unit"]
skalberg@15531
    37
      (fn _ => fn _ => fn t => if HOLogic.is_unit t then NONE else SOME unit_meta_eq)
wenzelm@13462
    38
    end;
wenzelm@11838
    39
wenzelm@11838
    40
  Addsimprocs [unit_eq_proc];
wenzelm@11838
    41
*}
wenzelm@11838
    42
wenzelm@11838
    43
lemma unit_all_eq1: "(!!x::unit. PROP P x) == PROP P ()"
wenzelm@11838
    44
  by simp
wenzelm@11838
    45
wenzelm@11838
    46
lemma unit_all_eq2: "(!!x::unit. PROP P) == PROP P"
wenzelm@11838
    47
  by (rule triv_forall_equality)
wenzelm@11838
    48
wenzelm@11838
    49
lemma unit_induct [induct type: unit]: "P () ==> P x"
wenzelm@11838
    50
  by simp
wenzelm@11838
    51
wenzelm@11838
    52
text {*
wenzelm@11838
    53
  This rewrite counters the effect of @{text unit_eq_proc} on @{term
wenzelm@11838
    54
  [source] "%u::unit. f u"}, replacing it by @{term [source]
wenzelm@11838
    55
  f} rather than by @{term [source] "%u. f ()"}.
wenzelm@11838
    56
*}
wenzelm@11838
    57
wenzelm@11838
    58
lemma unit_abs_eta_conv [simp]: "(%u::unit. f ()) = f"
wenzelm@11838
    59
  by (rule ext) simp
nipkow@10213
    60
nipkow@10213
    61
wenzelm@11838
    62
subsection {* Pairs *}
nipkow@10213
    63
wenzelm@11777
    64
subsubsection {* Type definition *}
nipkow@10213
    65
nipkow@10213
    66
constdefs
oheimb@11025
    67
  Pair_Rep :: "['a, 'b] => ['a, 'b] => bool"
wenzelm@11032
    68
  "Pair_Rep == (%a b. %x y. x=a & y=b)"
nipkow@10213
    69
nipkow@10213
    70
global
nipkow@10213
    71
nipkow@10213
    72
typedef (Prod)
wenzelm@11838
    73
  ('a, 'b) "*"    (infixr 20)
wenzelm@11032
    74
    = "{f. EX a b. f = Pair_Rep (a::'a) (b::'b)}"
oheimb@11025
    75
proof
oheimb@11025
    76
  fix a b show "Pair_Rep a b : ?Prod"
oheimb@11025
    77
    by blast
oheimb@11025
    78
qed
nipkow@10213
    79
wenzelm@12114
    80
syntax (xsymbols)
schirmer@15422
    81
  "*"      :: "[type, type] => type"         ("(_ \<times>/ _)" [21, 20] 20)
nipkow@10213
    82
syntax (HTML output)
schirmer@15422
    83
  "*"      :: "[type, type] => type"         ("(_ \<times>/ _)" [21, 20] 20)
nipkow@10213
    84
wenzelm@11777
    85
local
nipkow@10213
    86
wenzelm@11777
    87
wenzelm@19535
    88
subsubsection {* Definitions *}
wenzelm@11777
    89
wenzelm@11777
    90
global
nipkow@10213
    91
nipkow@10213
    92
consts
oheimb@11025
    93
  fst      :: "'a * 'b => 'a"
oheimb@11025
    94
  snd      :: "'a * 'b => 'b"
oheimb@11025
    95
  split    :: "[['a, 'b] => 'c, 'a * 'b] => 'c"
skalberg@14189
    96
  curry    :: "['a * 'b => 'c, 'a, 'b] => 'c"
oheimb@11025
    97
  prod_fun :: "['a => 'b, 'c => 'd, 'a * 'c] => 'b * 'd"
oheimb@11025
    98
  Pair     :: "['a, 'b] => 'a * 'b"
oheimb@11025
    99
  Sigma    :: "['a set, 'a => 'b set] => ('a * 'b) set"
nipkow@10213
   100
wenzelm@11777
   101
local
nipkow@10213
   102
wenzelm@19535
   103
defs
wenzelm@19535
   104
  Pair_def:     "Pair a b == Abs_Prod (Pair_Rep a b)"
wenzelm@19535
   105
  fst_def:      "fst p == THE a. EX b. p = Pair a b"
wenzelm@19535
   106
  snd_def:      "snd p == THE b. EX a. p = Pair a b"
wenzelm@19535
   107
  split_def:    "split == (%c p. c (fst p) (snd p))"
wenzelm@19535
   108
  curry_def:    "curry == (%c x y. c (Pair x y))"
wenzelm@19535
   109
  prod_fun_def: "prod_fun f g == split (%x y. Pair (f x) (g y))"
wenzelm@19535
   110
  Sigma_def:    "Sigma A B == UN x:A. UN y:B x. {Pair x y}"
wenzelm@19535
   111
wenzelm@19535
   112
abbreviation
wenzelm@19535
   113
  Times :: "['a set, 'b set] => ('a * 'b) set"  (infixr "<*>" 80)
wenzelm@19535
   114
  "A <*> B == Sigma A (%_. B)"
wenzelm@19535
   115
wenzelm@19656
   116
const_syntax (xsymbols)
wenzelm@19656
   117
  Times  (infixr "\<times>" 80)
wenzelm@19535
   118
wenzelm@19656
   119
const_syntax (HTML output)
wenzelm@19656
   120
  Times  (infixr "\<times>" 80)
wenzelm@19535
   121
wenzelm@19535
   122
wenzelm@19535
   123
subsubsection {* Concrete syntax *}
wenzelm@19535
   124
wenzelm@11777
   125
text {*
wenzelm@11777
   126
  Patterns -- extends pre-defined type @{typ pttrn} used in
wenzelm@11777
   127
  abstractions.
wenzelm@11777
   128
*}
nipkow@10213
   129
nipkow@10213
   130
nonterminals
nipkow@10213
   131
  tuple_args patterns
nipkow@10213
   132
nipkow@10213
   133
syntax
nipkow@10213
   134
  "_tuple"      :: "'a => tuple_args => 'a * 'b"        ("(1'(_,/ _'))")
nipkow@10213
   135
  "_tuple_arg"  :: "'a => tuple_args"                   ("_")
nipkow@10213
   136
  "_tuple_args" :: "'a => tuple_args => tuple_args"     ("_,/ _")
oheimb@11025
   137
  "_pattern"    :: "[pttrn, patterns] => pttrn"         ("'(_,/ _')")
oheimb@11025
   138
  ""            :: "pttrn => patterns"                  ("_")
oheimb@11025
   139
  "_patterns"   :: "[pttrn, patterns] => patterns"      ("_,/ _")
oheimb@11025
   140
  "@Sigma" ::"[pttrn, 'a set, 'b set] => ('a * 'b) set" ("(3SIGMA _:_./ _)" 10)
nipkow@10213
   141
nipkow@10213
   142
translations
nipkow@10213
   143
  "(x, y)"       == "Pair x y"
nipkow@10213
   144
  "_tuple x (_tuple_args y z)" == "_tuple x (_tuple_arg (_tuple y z))"
nipkow@10213
   145
  "%(x,y,zs).b"  == "split(%x (y,zs).b)"
nipkow@10213
   146
  "%(x,y).b"     == "split(%x y. b)"
nipkow@10213
   147
  "_abs (Pair x y) t" => "%(x,y).t"
nipkow@10213
   148
  (* The last rule accommodates tuples in `case C ... (x,y) ... => ...'
nipkow@10213
   149
     The (x,y) is parsed as `Pair x y' because it is logic, not pttrn *)
wenzelm@19535
   150
  "SIGMA x:A. B" == "Sigma A (%x. B)"
nipkow@10213
   151
schirmer@14359
   152
(* reconstructs pattern from (nested) splits, avoiding eta-contraction of body*)
schirmer@14359
   153
(* works best with enclosing "let", if "let" does not avoid eta-contraction   *)
schirmer@14359
   154
print_translation {*
schirmer@14359
   155
let fun split_tr' [Abs (x,T,t as (Abs abs))] =
schirmer@14359
   156
      (* split (%x y. t) => %(x,y) t *)
schirmer@14359
   157
      let val (y,t') = atomic_abs_tr' abs;
schirmer@14359
   158
          val (x',t'') = atomic_abs_tr' (x,T,t');
schirmer@14359
   159
    
schirmer@14359
   160
      in Syntax.const "_abs" $ (Syntax.const "_pattern" $x'$y) $ t'' end
schirmer@14359
   161
    | split_tr' [Abs (x,T,(s as Const ("split",_)$t))] =
schirmer@14359
   162
       (* split (%x. (split (%y z. t))) => %(x,y,z). t *)
schirmer@14359
   163
       let val (Const ("_abs",_)$(Const ("_pattern",_)$y$z)$t') = split_tr' [t];
schirmer@14359
   164
           val (x',t'') = atomic_abs_tr' (x,T,t');
schirmer@14359
   165
       in Syntax.const "_abs"$ 
schirmer@14359
   166
           (Syntax.const "_pattern"$x'$(Syntax.const "_patterns"$y$z))$t'' end
schirmer@14359
   167
    | split_tr' [Const ("split",_)$t] =
schirmer@14359
   168
       (* split (split (%x y z. t)) => %((x,y),z). t *)   
schirmer@14359
   169
       split_tr' [(split_tr' [t])] (* inner split_tr' creates next pattern *)
schirmer@14359
   170
    | split_tr' [Const ("_abs",_)$x_y$(Abs abs)] =
schirmer@14359
   171
       (* split (%pttrn z. t) => %(pttrn,z). t *)
schirmer@14359
   172
       let val (z,t) = atomic_abs_tr' abs;
schirmer@14359
   173
       in Syntax.const "_abs" $ (Syntax.const "_pattern" $x_y$z) $ t end
schirmer@14359
   174
    | split_tr' _ =  raise Match;
schirmer@14359
   175
in [("split", split_tr')]
schirmer@14359
   176
end
schirmer@14359
   177
*}
schirmer@14359
   178
schirmer@15422
   179
(* 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
   180
typed_print_translation {*
schirmer@15422
   181
let
schirmer@15422
   182
  fun split_guess_names_tr' _ T [Abs (x,_,Abs _)] = raise Match
schirmer@15422
   183
    | split_guess_names_tr' _ T  [Abs (x,xT,t)] =
schirmer@15422
   184
        (case (head_of t) of
schirmer@15422
   185
           Const ("split",_) => raise Match
schirmer@15422
   186
         | _ => let 
schirmer@15422
   187
                  val (_::yT::_) = binder_types (domain_type T) handle Bind => raise Match;
schirmer@15422
   188
                  val (y,t') = atomic_abs_tr' ("y",yT,(incr_boundvars 1 t)$Bound 0); 
schirmer@15422
   189
                  val (x',t'') = atomic_abs_tr' (x,xT,t');
schirmer@15422
   190
                in Syntax.const "_abs" $ (Syntax.const "_pattern" $x'$y) $ t'' end)
schirmer@15422
   191
    | split_guess_names_tr' _ T [t] =
schirmer@15422
   192
       (case (head_of t) of
schirmer@15422
   193
           Const ("split",_) => raise Match 
schirmer@15422
   194
         | _ => let 
schirmer@15422
   195
                  val (xT::yT::_) = binder_types (domain_type T) handle Bind => raise Match;
schirmer@15422
   196
                  val (y,t') = 
schirmer@15422
   197
                        atomic_abs_tr' ("y",yT,(incr_boundvars 2 t)$Bound 1$Bound 0); 
schirmer@15422
   198
                  val (x',t'') = atomic_abs_tr' ("x",xT,t');
schirmer@15422
   199
                in Syntax.const "_abs" $ (Syntax.const "_pattern" $x'$y) $ t'' end)
schirmer@15422
   200
    | split_guess_names_tr' _ _ _ = raise Match;
schirmer@15422
   201
in [("split", split_guess_names_tr')]
schirmer@15422
   202
end 
schirmer@15422
   203
*}
schirmer@15422
   204
nipkow@10213
   205
wenzelm@11966
   206
subsubsection {* Lemmas and proof tool setup *}
wenzelm@11838
   207
wenzelm@11838
   208
lemma ProdI: "Pair_Rep a b : Prod"
wenzelm@19535
   209
  unfolding Prod_def by blast
wenzelm@11838
   210
wenzelm@11838
   211
lemma Pair_Rep_inject: "Pair_Rep a b = Pair_Rep a' b' ==> a = a' & b = b'"
wenzelm@11838
   212
  apply (unfold Pair_Rep_def)
paulson@14208
   213
  apply (drule fun_cong [THEN fun_cong], blast)
wenzelm@11838
   214
  done
nipkow@10213
   215
wenzelm@11838
   216
lemma inj_on_Abs_Prod: "inj_on Abs_Prod Prod"
wenzelm@11838
   217
  apply (rule inj_on_inverseI)
wenzelm@11838
   218
  apply (erule Abs_Prod_inverse)
wenzelm@11838
   219
  done
wenzelm@11838
   220
wenzelm@11838
   221
lemma Pair_inject:
wenzelm@18372
   222
  assumes "(a, b) = (a', b')"
wenzelm@18372
   223
    and "a = a' ==> b = b' ==> R"
wenzelm@18372
   224
  shows R
wenzelm@18372
   225
  apply (insert prems [unfolded Pair_def])
wenzelm@18372
   226
  apply (rule inj_on_Abs_Prod [THEN inj_onD, THEN Pair_Rep_inject, THEN conjE])
wenzelm@18372
   227
  apply (assumption | rule ProdI)+
wenzelm@18372
   228
  done
nipkow@10213
   229
wenzelm@11838
   230
lemma Pair_eq [iff]: "((a, b) = (a', b')) = (a = a' & b = b')"
wenzelm@11838
   231
  by (blast elim!: Pair_inject)
wenzelm@11838
   232
wenzelm@11838
   233
lemma fst_conv [simp]: "fst (a, b) = a"
wenzelm@19535
   234
  unfolding fst_def by blast
wenzelm@11838
   235
wenzelm@11838
   236
lemma snd_conv [simp]: "snd (a, b) = b"
wenzelm@19535
   237
  unfolding snd_def by blast
oheimb@11025
   238
wenzelm@11838
   239
lemma fst_eqD: "fst (x, y) = a ==> x = a"
wenzelm@11838
   240
  by simp
wenzelm@11838
   241
wenzelm@11838
   242
lemma snd_eqD: "snd (x, y) = a ==> y = a"
wenzelm@11838
   243
  by simp
wenzelm@11838
   244
wenzelm@11838
   245
lemma PairE_lemma: "EX x y. p = (x, y)"
wenzelm@11838
   246
  apply (unfold Pair_def)
wenzelm@11838
   247
  apply (rule Rep_Prod [unfolded Prod_def, THEN CollectE])
wenzelm@11838
   248
  apply (erule exE, erule exE, rule exI, rule exI)
wenzelm@11838
   249
  apply (rule Rep_Prod_inverse [symmetric, THEN trans])
wenzelm@11838
   250
  apply (erule arg_cong)
wenzelm@11838
   251
  done
wenzelm@11032
   252
wenzelm@11838
   253
lemma PairE [cases type: *]: "(!!x y. p = (x, y) ==> Q) ==> Q"
wenzelm@19535
   254
  using PairE_lemma [of p] by blast
wenzelm@11838
   255
wenzelm@16121
   256
ML {*
wenzelm@11838
   257
  local val PairE = thm "PairE" in
wenzelm@11838
   258
    fun pair_tac s =
wenzelm@11838
   259
      EVERY' [res_inst_tac [("p", s)] PairE, hyp_subst_tac, K prune_params_tac];
wenzelm@11838
   260
  end;
wenzelm@11838
   261
*}
wenzelm@11032
   262
wenzelm@11838
   263
lemma surjective_pairing: "p = (fst p, snd p)"
wenzelm@11838
   264
  -- {* Do not add as rewrite rule: invalidates some proofs in IMP *}
wenzelm@11838
   265
  by (cases p) simp
wenzelm@11838
   266
paulson@17085
   267
lemmas pair_collapse = surjective_pairing [symmetric]
paulson@17085
   268
declare pair_collapse [simp]
oheimb@11025
   269
wenzelm@11838
   270
lemma surj_pair [simp]: "EX x y. z = (x, y)"
wenzelm@11838
   271
  apply (rule exI)
wenzelm@11838
   272
  apply (rule exI)
wenzelm@11838
   273
  apply (rule surjective_pairing)
wenzelm@11838
   274
  done
wenzelm@11838
   275
wenzelm@11838
   276
lemma split_paired_all: "(!!x. PROP P x) == (!!a b. PROP P (a, b))"
wenzelm@11820
   277
proof
wenzelm@11820
   278
  fix a b
wenzelm@11820
   279
  assume "!!x. PROP P x"
wenzelm@19535
   280
  then show "PROP P (a, b)" .
wenzelm@11820
   281
next
wenzelm@11820
   282
  fix x
wenzelm@11820
   283
  assume "!!a b. PROP P (a, b)"
wenzelm@19535
   284
  from `PROP P (fst x, snd x)` show "PROP P x" by simp
wenzelm@11820
   285
qed
wenzelm@11820
   286
wenzelm@11838
   287
lemmas split_tupled_all = split_paired_all unit_all_eq2
wenzelm@11838
   288
wenzelm@11838
   289
text {*
wenzelm@11838
   290
  The rule @{thm [source] split_paired_all} does not work with the
wenzelm@11838
   291
  Simplifier because it also affects premises in congrence rules,
wenzelm@11838
   292
  where this can lead to premises of the form @{text "!!a b. ... =
wenzelm@11838
   293
  ?P(a, b)"} which cannot be solved by reflexivity.
wenzelm@11838
   294
*}
wenzelm@11838
   295
wenzelm@16121
   296
ML_setup {*
wenzelm@11838
   297
  (* replace parameters of product type by individual component parameters *)
wenzelm@11838
   298
  val safe_full_simp_tac = generic_simp_tac true (true, false, false);
wenzelm@11838
   299
  local (* filtering with exists_paired_all is an essential optimization *)
wenzelm@16121
   300
    fun exists_paired_all (Const ("all", _) $ Abs (_, T, t)) =
wenzelm@11838
   301
          can HOLogic.dest_prodT T orelse exists_paired_all t
wenzelm@11838
   302
      | exists_paired_all (t $ u) = exists_paired_all t orelse exists_paired_all u
wenzelm@11838
   303
      | exists_paired_all (Abs (_, _, t)) = exists_paired_all t
wenzelm@11838
   304
      | exists_paired_all _ = false;
wenzelm@11838
   305
    val ss = HOL_basic_ss
wenzelm@16121
   306
      addsimps [thm "split_paired_all", thm "unit_all_eq2", thm "unit_abs_eta_conv"]
wenzelm@11838
   307
      addsimprocs [unit_eq_proc];
wenzelm@11838
   308
  in
wenzelm@11838
   309
    val split_all_tac = SUBGOAL (fn (t, i) =>
wenzelm@11838
   310
      if exists_paired_all t then safe_full_simp_tac ss i else no_tac);
wenzelm@11838
   311
    val unsafe_split_all_tac = SUBGOAL (fn (t, i) =>
wenzelm@11838
   312
      if exists_paired_all t then full_simp_tac ss i else no_tac);
wenzelm@11838
   313
    fun split_all th =
wenzelm@11838
   314
   if exists_paired_all (#prop (Thm.rep_thm th)) then full_simplify ss th else th;
wenzelm@11838
   315
  end;
wenzelm@11838
   316
wenzelm@17875
   317
change_claset (fn cs => cs addSbefore ("split_all_tac", split_all_tac));
wenzelm@16121
   318
*}
wenzelm@11838
   319
wenzelm@11838
   320
lemma split_paired_All [simp]: "(ALL x. P x) = (ALL a b. P (a, b))"
wenzelm@11838
   321
  -- {* @{text "[iff]"} is not a good idea because it makes @{text blast} loop *}
wenzelm@11838
   322
  by fast
wenzelm@11838
   323
skalberg@14189
   324
lemma curry_split [simp]: "curry (split f) = f"
skalberg@14189
   325
  by (simp add: curry_def split_def)
skalberg@14189
   326
skalberg@14189
   327
lemma split_curry [simp]: "split (curry f) = f"
skalberg@14189
   328
  by (simp add: curry_def split_def)
skalberg@14189
   329
skalberg@14189
   330
lemma curryI [intro!]: "f (a,b) ==> curry f a b"
skalberg@14189
   331
  by (simp add: curry_def)
skalberg@14189
   332
skalberg@14190
   333
lemma curryD [dest!]: "curry f a b ==> f (a,b)"
skalberg@14189
   334
  by (simp add: curry_def)
skalberg@14189
   335
skalberg@14190
   336
lemma curryE: "[| curry f a b ; f (a,b) ==> Q |] ==> Q"
skalberg@14189
   337
  by (simp add: curry_def)
skalberg@14189
   338
skalberg@14189
   339
lemma curry_conv [simp]: "curry f a b = f (a,b)"
skalberg@14189
   340
  by (simp add: curry_def)
skalberg@14189
   341
wenzelm@11838
   342
lemma prod_induct [induct type: *]: "!!x. (!!a b. P (a, b)) ==> P x"
wenzelm@11838
   343
  by fast
wenzelm@11838
   344
wenzelm@11838
   345
lemma split_paired_Ex [simp]: "(EX x. P x) = (EX a b. P (a, b))"
wenzelm@11838
   346
  by fast
wenzelm@11838
   347
wenzelm@11838
   348
lemma split_conv [simp]: "split c (a, b) = c a b"
wenzelm@11838
   349
  by (simp add: split_def)
wenzelm@11838
   350
wenzelm@11838
   351
lemmas split = split_conv  -- {* for backwards compatibility *}
wenzelm@11838
   352
wenzelm@11838
   353
lemmas splitI = split_conv [THEN iffD2, standard]
wenzelm@11838
   354
lemmas splitD = split_conv [THEN iffD1, standard]
wenzelm@11838
   355
wenzelm@11838
   356
lemma split_Pair_apply: "split (%x y. f (x, y)) = f"
wenzelm@11838
   357
  -- {* Subsumes the old @{text split_Pair} when @{term f} is the identity function. *}
wenzelm@11838
   358
  apply (rule ext)
paulson@14208
   359
  apply (tactic {* pair_tac "x" 1 *}, simp)
wenzelm@11838
   360
  done
wenzelm@11838
   361
wenzelm@11838
   362
lemma split_paired_The: "(THE x. P x) = (THE (a, b). P (a, b))"
wenzelm@11838
   363
  -- {* Can't be added to simpset: loops! *}
wenzelm@11838
   364
  by (simp add: split_Pair_apply)
wenzelm@11838
   365
wenzelm@11838
   366
lemma The_split: "The (split P) = (THE xy. P (fst xy) (snd xy))"
wenzelm@11838
   367
  by (simp add: split_def)
wenzelm@11838
   368
wenzelm@11838
   369
lemma Pair_fst_snd_eq: "!!s t. (s = t) = (fst s = fst t & snd s = snd t)"
paulson@14208
   370
by (simp only: split_tupled_all, simp)
wenzelm@11838
   371
wenzelm@11838
   372
lemma prod_eqI [intro?]: "fst p = fst q ==> snd p = snd q ==> p = q"
wenzelm@11838
   373
  by (simp add: Pair_fst_snd_eq)
wenzelm@11838
   374
wenzelm@11838
   375
lemma split_weak_cong: "p = q ==> split c p = split c q"
wenzelm@11838
   376
  -- {* Prevents simplification of @{term c}: much faster *}
wenzelm@11838
   377
  by (erule arg_cong)
wenzelm@11838
   378
wenzelm@11838
   379
lemma split_eta: "(%(x, y). f (x, y)) = f"
wenzelm@11838
   380
  apply (rule ext)
wenzelm@11838
   381
  apply (simp only: split_tupled_all)
wenzelm@11838
   382
  apply (rule split_conv)
wenzelm@11838
   383
  done
wenzelm@11838
   384
wenzelm@11838
   385
lemma cond_split_eta: "(!!x y. f x y = g (x, y)) ==> (%(x, y). f x y) = g"
wenzelm@11838
   386
  by (simp add: split_eta)
wenzelm@11838
   387
wenzelm@11838
   388
text {*
wenzelm@11838
   389
  Simplification procedure for @{thm [source] cond_split_eta}.  Using
wenzelm@11838
   390
  @{thm [source] split_eta} as a rewrite rule is not general enough,
wenzelm@11838
   391
  and using @{thm [source] cond_split_eta} directly would render some
wenzelm@11838
   392
  existing proofs very inefficient; similarly for @{text
wenzelm@11838
   393
  split_beta}. *}
wenzelm@11838
   394
wenzelm@11838
   395
ML_setup {*
wenzelm@11838
   396
wenzelm@11838
   397
local
wenzelm@18328
   398
  val cond_split_eta_ss = HOL_basic_ss addsimps [thm "cond_split_eta"]
wenzelm@11838
   399
  fun  Pair_pat k 0 (Bound m) = (m = k)
wenzelm@11838
   400
  |    Pair_pat k i (Const ("Pair",  _) $ Bound m $ t) = i > 0 andalso
wenzelm@11838
   401
                        m = k+i andalso Pair_pat k (i-1) t
wenzelm@11838
   402
  |    Pair_pat _ _ _ = false;
wenzelm@11838
   403
  fun no_args k i (Abs (_, _, t)) = no_args (k+1) i t
wenzelm@11838
   404
  |   no_args k i (t $ u) = no_args k i t andalso no_args k i u
wenzelm@11838
   405
  |   no_args k i (Bound m) = m < k orelse m > k+i
wenzelm@11838
   406
  |   no_args _ _ _ = true;
skalberg@15531
   407
  fun split_pat tp i (Abs  (_,_,t)) = if tp 0 i t then SOME (i,t) else NONE
wenzelm@11838
   408
  |   split_pat tp i (Const ("split", _) $ Abs (_, _, t)) = split_pat tp (i+1) t
skalberg@15531
   409
  |   split_pat tp i _ = NONE;
wenzelm@20044
   410
  fun metaeq ss lhs rhs = mk_meta_eq (Goal.prove (Simplifier.the_context ss) [] []
wenzelm@13480
   411
        (HOLogic.mk_Trueprop (HOLogic.mk_eq (lhs,rhs)))
wenzelm@18328
   412
        (K (simp_tac (Simplifier.inherit_context ss cond_split_eta_ss) 1)));
wenzelm@11838
   413
wenzelm@11838
   414
  fun beta_term_pat k i (Abs (_, _, t)) = beta_term_pat (k+1) i t
wenzelm@11838
   415
  |   beta_term_pat k i (t $ u) = Pair_pat k i (t $ u) orelse
wenzelm@11838
   416
                        (beta_term_pat k i t andalso beta_term_pat k i u)
wenzelm@11838
   417
  |   beta_term_pat k i t = no_args k i t;
wenzelm@11838
   418
  fun  eta_term_pat k i (f $ arg) = no_args k i f andalso Pair_pat k i arg
wenzelm@11838
   419
  |    eta_term_pat _ _ _ = false;
wenzelm@11838
   420
  fun subst arg k i (Abs (x, T, t)) = Abs (x, T, subst arg (k+1) i t)
wenzelm@11838
   421
  |   subst arg k i (t $ u) = if Pair_pat k i (t $ u) then incr_boundvars k arg
wenzelm@11838
   422
                              else (subst arg k i t $ subst arg k i u)
wenzelm@11838
   423
  |   subst arg k i t = t;
wenzelm@20044
   424
  fun beta_proc ss (s as Const ("split", _) $ Abs (_, _, t) $ arg) =
wenzelm@11838
   425
        (case split_pat beta_term_pat 1 t of
wenzelm@20044
   426
        SOME (i,f) => SOME (metaeq ss s (subst arg 0 i f))
skalberg@15531
   427
        | NONE => NONE)
wenzelm@20044
   428
  |   beta_proc _ _ = NONE;
wenzelm@20044
   429
  fun eta_proc ss (s as Const ("split", _) $ Abs (_, _, t)) =
wenzelm@11838
   430
        (case split_pat eta_term_pat 1 t of
wenzelm@20044
   431
          SOME (_,ft) => SOME (metaeq ss s (let val (f $ arg) = ft in f end))
skalberg@15531
   432
        | NONE => NONE)
wenzelm@20044
   433
  |   eta_proc _ _ = NONE;
wenzelm@11838
   434
in
wenzelm@13462
   435
  val split_beta_proc = Simplifier.simproc (Theory.sign_of (the_context ()))
wenzelm@20044
   436
    "split_beta" ["split f z"] (K beta_proc);
wenzelm@13462
   437
  val split_eta_proc = Simplifier.simproc (Theory.sign_of (the_context ()))
wenzelm@20044
   438
    "split_eta" ["split f"] (K eta_proc);
wenzelm@11838
   439
end;
wenzelm@11838
   440
wenzelm@11838
   441
Addsimprocs [split_beta_proc, split_eta_proc];
wenzelm@11838
   442
*}
wenzelm@11838
   443
wenzelm@11838
   444
lemma split_beta: "(%(x, y). P x y) z = P (fst z) (snd z)"
wenzelm@11838
   445
  by (subst surjective_pairing, rule split_conv)
wenzelm@11838
   446
wenzelm@11838
   447
lemma split_split: "R (split c p) = (ALL x y. p = (x, y) --> R (c x y))"
wenzelm@11838
   448
  -- {* For use with @{text split} and the Simplifier. *}
paulson@15481
   449
  by (insert surj_pair [of p], clarify, simp)
wenzelm@11838
   450
wenzelm@11838
   451
text {*
wenzelm@11838
   452
  @{thm [source] split_split} could be declared as @{text "[split]"}
wenzelm@11838
   453
  done after the Splitter has been speeded up significantly;
wenzelm@11838
   454
  precompute the constants involved and don't do anything unless the
wenzelm@11838
   455
  current goal contains one of those constants.
wenzelm@11838
   456
*}
wenzelm@11838
   457
wenzelm@11838
   458
lemma split_split_asm: "R (split c p) = (~(EX x y. p = (x, y) & (~R (c x y))))"
paulson@14208
   459
by (subst split_split, simp)
wenzelm@11838
   460
wenzelm@11838
   461
wenzelm@11838
   462
text {*
wenzelm@11838
   463
  \medskip @{term split} used as a logical connective or set former.
wenzelm@11838
   464
wenzelm@11838
   465
  \medskip These rules are for use with @{text blast}; could instead
wenzelm@11838
   466
  call @{text simp} using @{thm [source] split} as rewrite. *}
wenzelm@11838
   467
wenzelm@11838
   468
lemma splitI2: "!!p. [| !!a b. p = (a, b) ==> c a b |] ==> split c p"
wenzelm@11838
   469
  apply (simp only: split_tupled_all)
wenzelm@11838
   470
  apply (simp (no_asm_simp))
wenzelm@11838
   471
  done
wenzelm@11838
   472
wenzelm@11838
   473
lemma splitI2': "!!p. [| !!a b. (a, b) = p ==> c a b x |] ==> split c p x"
wenzelm@11838
   474
  apply (simp only: split_tupled_all)
wenzelm@11838
   475
  apply (simp (no_asm_simp))
wenzelm@11838
   476
  done
wenzelm@11838
   477
wenzelm@11838
   478
lemma splitE: "split c p ==> (!!x y. p = (x, y) ==> c x y ==> Q) ==> Q"
wenzelm@11838
   479
  by (induct p) (auto simp add: split_def)
wenzelm@11838
   480
wenzelm@11838
   481
lemma splitE': "split c p z ==> (!!x y. p = (x, y) ==> c x y z ==> Q) ==> Q"
wenzelm@11838
   482
  by (induct p) (auto simp add: split_def)
wenzelm@11838
   483
wenzelm@11838
   484
lemma splitE2:
wenzelm@11838
   485
  "[| Q (split P z);  !!x y. [|z = (x, y); Q (P x y)|] ==> R |] ==> R"
wenzelm@11838
   486
proof -
wenzelm@11838
   487
  assume q: "Q (split P z)"
wenzelm@11838
   488
  assume r: "!!x y. [|z = (x, y); Q (P x y)|] ==> R"
wenzelm@11838
   489
  show R
wenzelm@11838
   490
    apply (rule r surjective_pairing)+
wenzelm@11838
   491
    apply (rule split_beta [THEN subst], rule q)
wenzelm@11838
   492
    done
wenzelm@11838
   493
qed
wenzelm@11838
   494
wenzelm@11838
   495
lemma splitD': "split R (a,b) c ==> R a b c"
wenzelm@11838
   496
  by simp
wenzelm@11838
   497
wenzelm@11838
   498
lemma mem_splitI: "z: c a b ==> z: split c (a, b)"
wenzelm@11838
   499
  by simp
wenzelm@11838
   500
wenzelm@11838
   501
lemma mem_splitI2: "!!p. [| !!a b. p = (a, b) ==> z: c a b |] ==> z: split c p"
paulson@14208
   502
by (simp only: split_tupled_all, simp)
wenzelm@11838
   503
wenzelm@18372
   504
lemma mem_splitE:
wenzelm@18372
   505
  assumes major: "z: split c p"
wenzelm@18372
   506
    and cases: "!!x y. [| p = (x,y); z: c x y |] ==> Q"
wenzelm@18372
   507
  shows Q
wenzelm@18372
   508
  by (rule major [unfolded split_def] cases surjective_pairing)+
wenzelm@11838
   509
wenzelm@11838
   510
declare mem_splitI2 [intro!] mem_splitI [intro!] splitI2' [intro!] splitI2 [intro!] splitI [intro!]
wenzelm@11838
   511
declare mem_splitE [elim!] splitE' [elim!] splitE [elim!]
wenzelm@11838
   512
wenzelm@16121
   513
ML_setup {*
wenzelm@11838
   514
local (* filtering with exists_p_split is an essential optimization *)
wenzelm@16121
   515
  fun exists_p_split (Const ("split",_) $ _ $ (Const ("Pair",_)$_$_)) = true
wenzelm@11838
   516
    | exists_p_split (t $ u) = exists_p_split t orelse exists_p_split u
wenzelm@11838
   517
    | exists_p_split (Abs (_, _, t)) = exists_p_split t
wenzelm@11838
   518
    | exists_p_split _ = false;
wenzelm@16121
   519
  val ss = HOL_basic_ss addsimps [thm "split_conv"];
wenzelm@11838
   520
in
wenzelm@11838
   521
val split_conv_tac = SUBGOAL (fn (t, i) =>
wenzelm@11838
   522
    if exists_p_split t then safe_full_simp_tac ss i else no_tac);
wenzelm@11838
   523
end;
wenzelm@11838
   524
(* This prevents applications of splitE for already splitted arguments leading
wenzelm@11838
   525
   to quite time-consuming computations (in particular for nested tuples) *)
wenzelm@17875
   526
change_claset (fn cs => cs addSbefore ("split_conv_tac", split_conv_tac));
wenzelm@16121
   527
*}
wenzelm@11838
   528
wenzelm@11838
   529
lemma split_eta_SetCompr [simp]: "(%u. EX x y. u = (x, y) & P (x, y)) = P"
wenzelm@18372
   530
  by (rule ext) fast
wenzelm@11838
   531
wenzelm@11838
   532
lemma split_eta_SetCompr2 [simp]: "(%u. EX x y. u = (x, y) & P x y) = split P"
wenzelm@18372
   533
  by (rule ext) fast
wenzelm@11838
   534
wenzelm@11838
   535
lemma split_part [simp]: "(%(a,b). P & Q a b) = (%ab. P & split Q ab)"
wenzelm@11838
   536
  -- {* Allows simplifications of nested splits in case of independent predicates. *}
wenzelm@18372
   537
  by (rule ext) blast
wenzelm@11838
   538
nipkow@14337
   539
(* Do NOT make this a simp rule as it
nipkow@14337
   540
   a) only helps in special situations
nipkow@14337
   541
   b) can lead to nontermination in the presence of split_def
nipkow@14337
   542
*)
nipkow@14337
   543
lemma split_comp_eq: 
oheimb@14101
   544
"(%u. f (g (fst u)) (snd u)) = (split (%x. f (g x)))"
wenzelm@18372
   545
  by (rule ext) auto
oheimb@14101
   546
wenzelm@11838
   547
lemma The_split_eq [simp]: "(THE (x',y'). x = x' & y = y') = (x, y)"
wenzelm@11838
   548
  by blast
wenzelm@11838
   549
wenzelm@11838
   550
(*
wenzelm@11838
   551
the following  would be slightly more general,
wenzelm@11838
   552
but cannot be used as rewrite rule:
wenzelm@11838
   553
### Cannot add premise as rewrite rule because it contains (type) unknowns:
wenzelm@11838
   554
### ?y = .x
wenzelm@11838
   555
Goal "[| P y; !!x. P x ==> x = y |] ==> (@(x',y). x = x' & P y) = (x,y)"
paulson@14208
   556
by (rtac some_equality 1)
paulson@14208
   557
by ( Simp_tac 1)
paulson@14208
   558
by (split_all_tac 1)
paulson@14208
   559
by (Asm_full_simp_tac 1)
wenzelm@11838
   560
qed "The_split_eq";
wenzelm@11838
   561
*)
wenzelm@11838
   562
wenzelm@11838
   563
lemma injective_fst_snd: "!!x y. [|fst x = fst y; snd x = snd y|] ==> x = y"
wenzelm@11838
   564
  by auto
wenzelm@11838
   565
wenzelm@11838
   566
wenzelm@11838
   567
text {*
wenzelm@11838
   568
  \bigskip @{term prod_fun} --- action of the product functor upon
wenzelm@11838
   569
  functions.
wenzelm@11838
   570
*}
wenzelm@11838
   571
wenzelm@11838
   572
lemma prod_fun [simp]: "prod_fun f g (a, b) = (f a, g b)"
wenzelm@11838
   573
  by (simp add: prod_fun_def)
wenzelm@11838
   574
wenzelm@11838
   575
lemma prod_fun_compose: "prod_fun (f1 o f2) (g1 o g2) = (prod_fun f1 g1 o prod_fun f2 g2)"
wenzelm@11838
   576
  apply (rule ext)
paulson@14208
   577
  apply (tactic {* pair_tac "x" 1 *}, simp)
wenzelm@11838
   578
  done
wenzelm@11838
   579
wenzelm@11838
   580
lemma prod_fun_ident [simp]: "prod_fun (%x. x) (%y. y) = (%z. z)"
wenzelm@11838
   581
  apply (rule ext)
paulson@14208
   582
  apply (tactic {* pair_tac "z" 1 *}, simp)
wenzelm@11838
   583
  done
wenzelm@11838
   584
wenzelm@11838
   585
lemma prod_fun_imageI [intro]: "(a, b) : r ==> (f a, g b) : prod_fun f g ` r"
wenzelm@11838
   586
  apply (rule image_eqI)
paulson@14208
   587
  apply (rule prod_fun [symmetric], assumption)
wenzelm@11838
   588
  done
wenzelm@11838
   589
wenzelm@11838
   590
lemma prod_fun_imageE [elim!]:
wenzelm@18372
   591
  assumes major: "c: (prod_fun f g)`r"
wenzelm@18372
   592
    and cases: "!!x y. [| c=(f(x),g(y));  (x,y):r |] ==> P"
wenzelm@18372
   593
  shows P
wenzelm@18372
   594
  apply (rule major [THEN imageE])
wenzelm@18372
   595
  apply (rule_tac p = x in PairE)
wenzelm@18372
   596
  apply (rule cases)
wenzelm@18372
   597
   apply (blast intro: prod_fun)
wenzelm@18372
   598
  apply blast
wenzelm@18372
   599
  done
wenzelm@11838
   600
wenzelm@11838
   601
oheimb@14101
   602
constdefs
oheimb@14101
   603
  upd_fst :: "('a => 'c) => 'a * 'b => 'c * 'b"
oheimb@14101
   604
 "upd_fst f == prod_fun f id"
oheimb@14101
   605
oheimb@14101
   606
  upd_snd :: "('b => 'c) => 'a * 'b => 'a * 'c"
oheimb@14101
   607
 "upd_snd f == prod_fun id f"
oheimb@14101
   608
oheimb@14101
   609
lemma upd_fst_conv [simp]: "upd_fst f (x,y) = (f x,y)" 
wenzelm@18372
   610
  by (simp add: upd_fst_def)
oheimb@14101
   611
oheimb@14101
   612
lemma upd_snd_conv [simp]: "upd_snd f (x,y) = (x,f y)" 
wenzelm@18372
   613
  by (simp add: upd_snd_def)
oheimb@14101
   614
wenzelm@11838
   615
text {*
wenzelm@11838
   616
  \bigskip Disjoint union of a family of sets -- Sigma.
wenzelm@11838
   617
*}
wenzelm@11838
   618
wenzelm@11838
   619
lemma SigmaI [intro!]: "[| a:A;  b:B(a) |] ==> (a,b) : Sigma A B"
wenzelm@11838
   620
  by (unfold Sigma_def) blast
wenzelm@11838
   621
paulson@14952
   622
lemma SigmaE [elim!]:
wenzelm@11838
   623
    "[| c: Sigma A B;
wenzelm@11838
   624
        !!x y.[| x:A;  y:B(x);  c=(x,y) |] ==> P
wenzelm@11838
   625
     |] ==> P"
wenzelm@11838
   626
  -- {* The general elimination rule. *}
wenzelm@11838
   627
  by (unfold Sigma_def) blast
wenzelm@11838
   628
wenzelm@11838
   629
text {*
schirmer@15422
   630
  Elimination of @{term "(a, b) : A \<times> B"} -- introduces no
wenzelm@11838
   631
  eigenvariables.
wenzelm@11838
   632
*}
wenzelm@11838
   633
wenzelm@11838
   634
lemma SigmaD1: "(a, b) : Sigma A B ==> a : A"
wenzelm@18372
   635
  by blast
wenzelm@11838
   636
wenzelm@11838
   637
lemma SigmaD2: "(a, b) : Sigma A B ==> b : B a"
wenzelm@18372
   638
  by blast
wenzelm@11838
   639
wenzelm@11838
   640
lemma SigmaE2:
wenzelm@11838
   641
    "[| (a, b) : Sigma A B;
wenzelm@11838
   642
        [| a:A;  b:B(a) |] ==> P
wenzelm@11838
   643
     |] ==> P"
paulson@14952
   644
  by blast
wenzelm@11838
   645
paulson@14952
   646
lemma Sigma_cong:
schirmer@15422
   647
     "\<lbrakk>A = B; !!x. x \<in> B \<Longrightarrow> C x = D x\<rbrakk>
schirmer@15422
   648
      \<Longrightarrow> (SIGMA x: A. C x) = (SIGMA x: B. D x)"
wenzelm@18372
   649
  by auto
wenzelm@11838
   650
wenzelm@11838
   651
lemma Sigma_mono: "[| A <= C; !!x. x:A ==> B x <= D x |] ==> Sigma A B <= Sigma C D"
wenzelm@11838
   652
  by blast
wenzelm@11838
   653
wenzelm@11838
   654
lemma Sigma_empty1 [simp]: "Sigma {} B = {}"
wenzelm@11838
   655
  by blast
wenzelm@11838
   656
wenzelm@11838
   657
lemma Sigma_empty2 [simp]: "A <*> {} = {}"
wenzelm@11838
   658
  by blast
wenzelm@11838
   659
wenzelm@11838
   660
lemma UNIV_Times_UNIV [simp]: "UNIV <*> UNIV = UNIV"
wenzelm@11838
   661
  by auto
wenzelm@11838
   662
wenzelm@11838
   663
lemma Compl_Times_UNIV1 [simp]: "- (UNIV <*> A) = UNIV <*> (-A)"
wenzelm@11838
   664
  by auto
wenzelm@11838
   665
wenzelm@11838
   666
lemma Compl_Times_UNIV2 [simp]: "- (A <*> UNIV) = (-A) <*> UNIV"
wenzelm@11838
   667
  by auto
wenzelm@11838
   668
wenzelm@11838
   669
lemma mem_Sigma_iff [iff]: "((a,b): Sigma A B) = (a:A & b:B(a))"
wenzelm@11838
   670
  by blast
wenzelm@11838
   671
wenzelm@11838
   672
lemma Times_subset_cancel2: "x:C ==> (A <*> C <= B <*> C) = (A <= B)"
wenzelm@11838
   673
  by blast
wenzelm@11838
   674
wenzelm@11838
   675
lemma Times_eq_cancel2: "x:C ==> (A <*> C = B <*> C) = (A = B)"
wenzelm@11838
   676
  by (blast elim: equalityE)
wenzelm@11838
   677
wenzelm@11838
   678
lemma SetCompr_Sigma_eq:
wenzelm@11838
   679
    "Collect (split (%x y. P x & Q x y)) = (SIGMA x:Collect P. Collect (Q x))"
wenzelm@11838
   680
  by blast
wenzelm@11838
   681
wenzelm@11838
   682
text {*
wenzelm@11838
   683
  \bigskip Complex rules for Sigma.
wenzelm@11838
   684
*}
wenzelm@11838
   685
wenzelm@11838
   686
lemma Collect_split [simp]: "{(a,b). P a & Q b} = Collect P <*> Collect Q"
wenzelm@11838
   687
  by blast
wenzelm@11838
   688
wenzelm@11838
   689
lemma UN_Times_distrib:
wenzelm@11838
   690
  "(UN (a,b):(A <*> B). E a <*> F b) = (UNION A E) <*> (UNION B F)"
wenzelm@11838
   691
  -- {* Suggested by Pierre Chartier *}
wenzelm@11838
   692
  by blast
wenzelm@11838
   693
wenzelm@11838
   694
lemma split_paired_Ball_Sigma [simp]:
wenzelm@11838
   695
    "(ALL z: Sigma A B. P z) = (ALL x:A. ALL y: B x. P(x,y))"
wenzelm@11838
   696
  by blast
wenzelm@11838
   697
wenzelm@11838
   698
lemma split_paired_Bex_Sigma [simp]:
wenzelm@11838
   699
    "(EX z: Sigma A B. P z) = (EX x:A. EX y: B x. P(x,y))"
wenzelm@11838
   700
  by blast
wenzelm@11838
   701
wenzelm@11838
   702
lemma Sigma_Un_distrib1: "(SIGMA i:I Un J. C(i)) = (SIGMA i:I. C(i)) Un (SIGMA j:J. C(j))"
wenzelm@11838
   703
  by blast
wenzelm@11838
   704
wenzelm@11838
   705
lemma Sigma_Un_distrib2: "(SIGMA i:I. A(i) Un B(i)) = (SIGMA i:I. A(i)) Un (SIGMA i:I. B(i))"
wenzelm@11838
   706
  by blast
wenzelm@11838
   707
wenzelm@11838
   708
lemma Sigma_Int_distrib1: "(SIGMA i:I Int J. C(i)) = (SIGMA i:I. C(i)) Int (SIGMA j:J. C(j))"
wenzelm@11838
   709
  by blast
wenzelm@11838
   710
wenzelm@11838
   711
lemma Sigma_Int_distrib2: "(SIGMA i:I. A(i) Int B(i)) = (SIGMA i:I. A(i)) Int (SIGMA i:I. B(i))"
wenzelm@11838
   712
  by blast
wenzelm@11838
   713
wenzelm@11838
   714
lemma Sigma_Diff_distrib1: "(SIGMA i:I - J. C(i)) = (SIGMA i:I. C(i)) - (SIGMA j:J. C(j))"
wenzelm@11838
   715
  by blast
wenzelm@11838
   716
wenzelm@11838
   717
lemma Sigma_Diff_distrib2: "(SIGMA i:I. A(i) - B(i)) = (SIGMA i:I. A(i)) - (SIGMA i:I. B(i))"
wenzelm@11838
   718
  by blast
wenzelm@11838
   719
wenzelm@11838
   720
lemma Sigma_Union: "Sigma (Union X) B = (UN A:X. Sigma A B)"
wenzelm@11838
   721
  by blast
wenzelm@11838
   722
wenzelm@11838
   723
text {*
wenzelm@11838
   724
  Non-dependent versions are needed to avoid the need for higher-order
wenzelm@11838
   725
  matching, especially when the rules are re-oriented.
wenzelm@11838
   726
*}
wenzelm@11838
   727
wenzelm@11838
   728
lemma Times_Un_distrib1: "(A Un B) <*> C = (A <*> C) Un (B <*> C)"
wenzelm@11838
   729
  by blast
wenzelm@11838
   730
wenzelm@11838
   731
lemma Times_Int_distrib1: "(A Int B) <*> C = (A <*> C) Int (B <*> C)"
wenzelm@11838
   732
  by blast
wenzelm@11838
   733
wenzelm@11838
   734
lemma Times_Diff_distrib1: "(A - B) <*> C = (A <*> C) - (B <*> C)"
wenzelm@11838
   735
  by blast
wenzelm@11838
   736
wenzelm@11838
   737
oheimb@11493
   738
lemma pair_imageI [intro]: "(a, b) : A ==> f a b : (%(a, b). f a b) ` A"
wenzelm@11777
   739
  apply (rule_tac x = "(a, b)" in image_eqI)
wenzelm@11777
   740
   apply auto
wenzelm@11777
   741
  done
wenzelm@11777
   742
oheimb@11493
   743
wenzelm@11838
   744
text {*
wenzelm@11838
   745
  Setup of internal @{text split_rule}.
wenzelm@11838
   746
*}
wenzelm@11838
   747
wenzelm@11032
   748
constdefs
wenzelm@11425
   749
  internal_split :: "('a => 'b => 'c) => 'a * 'b => 'c"
wenzelm@11032
   750
  "internal_split == split"
wenzelm@11032
   751
wenzelm@11032
   752
lemma internal_split_conv: "internal_split c (a, b) = c a b"
wenzelm@11032
   753
  by (simp only: internal_split_def split_conv)
wenzelm@11032
   754
wenzelm@11032
   755
hide const internal_split
wenzelm@11032
   756
oheimb@11025
   757
use "Tools/split_rule.ML"
wenzelm@11032
   758
setup SplitRule.setup
nipkow@10213
   759
berghofe@15394
   760
berghofe@15394
   761
subsection {* Code generator setup *}
berghofe@15394
   762
berghofe@15394
   763
types_code
berghofe@15394
   764
  "*"     ("(_ */ _)")
berghofe@16770
   765
attach (term_of) {*
berghofe@16770
   766
fun term_of_id_42 f T g U (x, y) = HOLogic.pair_const T U $ f x $ g y;
berghofe@16770
   767
*}
berghofe@16770
   768
attach (test) {*
berghofe@16770
   769
fun gen_id_42 aG bG i = (aG i, bG i);
berghofe@16770
   770
*}
berghofe@15394
   771
berghofe@18706
   772
consts_code
berghofe@18706
   773
  "Pair"    ("(_,/ _)")
berghofe@18706
   774
haftmann@18702
   775
code_alias
haftmann@19008
   776
  "*" "Product_Type.pair"
haftmann@18702
   777
  "Pair" "Product_Type.Pair"
haftmann@18702
   778
  "fst" "Product_Type.fst"
haftmann@18702
   779
  "snd" "Product_Type.snd"
haftmann@18702
   780
berghofe@15394
   781
ML {*
haftmann@18013
   782
haftmann@19039
   783
fun strip_abs_split 0 t = ([], t)
haftmann@19039
   784
  | strip_abs_split i (Abs (s, T, t)) =
haftmann@18013
   785
      let
haftmann@18013
   786
        val s' = Codegen.new_name t s;
haftmann@18013
   787
        val v = Free (s', T)
haftmann@19039
   788
      in apfst (cons v) (strip_abs_split (i-1) (subst_bound (v, t))) end
haftmann@19039
   789
  | strip_abs_split i (u as Const ("split", _) $ t) = (case strip_abs_split (i+1) t of
berghofe@15394
   790
        (v :: v' :: vs, u) => (HOLogic.mk_prod (v, v') :: vs, u)
berghofe@15394
   791
      | _ => ([], u))
haftmann@19039
   792
  | strip_abs_split i t = ([], t);
haftmann@18013
   793
berghofe@16634
   794
fun let_codegen thy defs gr dep thyname brack t = (case strip_comb t of
berghofe@16634
   795
    (t1 as Const ("Let", _), t2 :: t3 :: ts) =>
berghofe@15394
   796
    let
berghofe@15394
   797
      fun dest_let (l as Const ("Let", _) $ t $ u) =
haftmann@19039
   798
          (case strip_abs_split 1 u of
berghofe@15394
   799
             ([p], u') => apfst (cons (p, t)) (dest_let u')
berghofe@15394
   800
           | _ => ([], l))
berghofe@15394
   801
        | dest_let t = ([], t);
berghofe@15394
   802
      fun mk_code (gr, (l, r)) =
berghofe@15394
   803
        let
berghofe@16634
   804
          val (gr1, pl) = Codegen.invoke_codegen thy defs dep thyname false (gr, l);
berghofe@16634
   805
          val (gr2, pr) = Codegen.invoke_codegen thy defs dep thyname false (gr1, r);
berghofe@15394
   806
        in (gr2, (pl, pr)) end
berghofe@16634
   807
    in case dest_let (t1 $ t2 $ t3) of
skalberg@15531
   808
        ([], _) => NONE
berghofe@15394
   809
      | (ps, u) =>
berghofe@15394
   810
          let
berghofe@15394
   811
            val (gr1, qs) = foldl_map mk_code (gr, ps);
berghofe@16634
   812
            val (gr2, pu) = Codegen.invoke_codegen thy defs dep thyname false (gr1, u);
berghofe@16634
   813
            val (gr3, pargs) = foldl_map
berghofe@17021
   814
              (Codegen.invoke_codegen thy defs dep thyname true) (gr2, ts)
berghofe@15394
   815
          in
berghofe@16634
   816
            SOME (gr3, Codegen.mk_app brack
berghofe@16634
   817
              (Pretty.blk (0, [Pretty.str "let ", Pretty.blk (0, List.concat
berghofe@16634
   818
                  (separate [Pretty.str ";", Pretty.brk 1] (map (fn (pl, pr) =>
berghofe@16634
   819
                    [Pretty.block [Pretty.str "val ", pl, Pretty.str " =",
berghofe@16634
   820
                       Pretty.brk 1, pr]]) qs))),
berghofe@16634
   821
                Pretty.brk 1, Pretty.str "in ", pu,
berghofe@16634
   822
                Pretty.brk 1, Pretty.str "end"])) pargs)
berghofe@15394
   823
          end
berghofe@15394
   824
    end
berghofe@16634
   825
  | _ => NONE);
berghofe@15394
   826
berghofe@16634
   827
fun split_codegen thy defs gr dep thyname brack t = (case strip_comb t of
berghofe@16634
   828
    (t1 as Const ("split", _), t2 :: ts) =>
haftmann@19039
   829
      (case strip_abs_split 1 (t1 $ t2) of
berghofe@16634
   830
         ([p], u) =>
berghofe@16634
   831
           let
berghofe@16634
   832
             val (gr1, q) = Codegen.invoke_codegen thy defs dep thyname false (gr, p);
berghofe@16634
   833
             val (gr2, pu) = Codegen.invoke_codegen thy defs dep thyname false (gr1, u);
berghofe@16634
   834
             val (gr3, pargs) = foldl_map
berghofe@17021
   835
               (Codegen.invoke_codegen thy defs dep thyname true) (gr2, ts)
berghofe@16634
   836
           in
berghofe@16634
   837
             SOME (gr2, Codegen.mk_app brack
berghofe@16634
   838
               (Pretty.block [Pretty.str "(fn ", q, Pretty.str " =>",
berghofe@16634
   839
                 Pretty.brk 1, pu, Pretty.str ")"]) pargs)
berghofe@16634
   840
           end
berghofe@16634
   841
       | _ => NONE)
berghofe@16634
   842
  | _ => NONE);
berghofe@15394
   843
wenzelm@18708
   844
val prod_codegen_setup =
wenzelm@18708
   845
  Codegen.add_codegen "let_codegen" let_codegen #>
wenzelm@18708
   846
  Codegen.add_codegen "split_codegen" split_codegen #>
haftmann@18518
   847
  CodegenPackage.add_appconst
haftmann@19039
   848
    ("Let", ((2, 2), CodegenPackage.appgen_let strip_abs_split)) #>
haftmann@18518
   849
  CodegenPackage.add_appconst
haftmann@19039
   850
    ("split", ((1, 1), CodegenPackage.appgen_split strip_abs_split));
berghofe@15394
   851
berghofe@15394
   852
*}
berghofe@15394
   853
berghofe@15394
   854
setup prod_codegen_setup
berghofe@15394
   855
paulson@15404
   856
ML
paulson@15404
   857
{*
paulson@15404
   858
val Collect_split = thm "Collect_split";
paulson@15404
   859
val Compl_Times_UNIV1 = thm "Compl_Times_UNIV1";
paulson@15404
   860
val Compl_Times_UNIV2 = thm "Compl_Times_UNIV2";
paulson@15404
   861
val PairE = thm "PairE";
paulson@15404
   862
val PairE_lemma = thm "PairE_lemma";
paulson@15404
   863
val Pair_Rep_inject = thm "Pair_Rep_inject";
paulson@15404
   864
val Pair_def = thm "Pair_def";
paulson@15404
   865
val Pair_eq = thm "Pair_eq";
paulson@15404
   866
val Pair_fst_snd_eq = thm "Pair_fst_snd_eq";
paulson@15404
   867
val Pair_inject = thm "Pair_inject";
paulson@15404
   868
val ProdI = thm "ProdI";
paulson@15404
   869
val SetCompr_Sigma_eq = thm "SetCompr_Sigma_eq";
paulson@15404
   870
val SigmaD1 = thm "SigmaD1";
paulson@15404
   871
val SigmaD2 = thm "SigmaD2";
paulson@15404
   872
val SigmaE = thm "SigmaE";
paulson@15404
   873
val SigmaE2 = thm "SigmaE2";
paulson@15404
   874
val SigmaI = thm "SigmaI";
paulson@15404
   875
val Sigma_Diff_distrib1 = thm "Sigma_Diff_distrib1";
paulson@15404
   876
val Sigma_Diff_distrib2 = thm "Sigma_Diff_distrib2";
paulson@15404
   877
val Sigma_Int_distrib1 = thm "Sigma_Int_distrib1";
paulson@15404
   878
val Sigma_Int_distrib2 = thm "Sigma_Int_distrib2";
paulson@15404
   879
val Sigma_Un_distrib1 = thm "Sigma_Un_distrib1";
paulson@15404
   880
val Sigma_Un_distrib2 = thm "Sigma_Un_distrib2";
paulson@15404
   881
val Sigma_Union = thm "Sigma_Union";
paulson@15404
   882
val Sigma_def = thm "Sigma_def";
paulson@15404
   883
val Sigma_empty1 = thm "Sigma_empty1";
paulson@15404
   884
val Sigma_empty2 = thm "Sigma_empty2";
paulson@15404
   885
val Sigma_mono = thm "Sigma_mono";
paulson@15404
   886
val The_split = thm "The_split";
paulson@15404
   887
val The_split_eq = thm "The_split_eq";
paulson@15404
   888
val The_split_eq = thm "The_split_eq";
paulson@15404
   889
val Times_Diff_distrib1 = thm "Times_Diff_distrib1";
paulson@15404
   890
val Times_Int_distrib1 = thm "Times_Int_distrib1";
paulson@15404
   891
val Times_Un_distrib1 = thm "Times_Un_distrib1";
paulson@15404
   892
val Times_eq_cancel2 = thm "Times_eq_cancel2";
paulson@15404
   893
val Times_subset_cancel2 = thm "Times_subset_cancel2";
paulson@15404
   894
val UNIV_Times_UNIV = thm "UNIV_Times_UNIV";
paulson@15404
   895
val UN_Times_distrib = thm "UN_Times_distrib";
paulson@15404
   896
val Unity_def = thm "Unity_def";
paulson@15404
   897
val cond_split_eta = thm "cond_split_eta";
paulson@15404
   898
val fst_conv = thm "fst_conv";
paulson@15404
   899
val fst_def = thm "fst_def";
paulson@15404
   900
val fst_eqD = thm "fst_eqD";
paulson@15404
   901
val inj_on_Abs_Prod = thm "inj_on_Abs_Prod";
paulson@15404
   902
val injective_fst_snd = thm "injective_fst_snd";
paulson@15404
   903
val mem_Sigma_iff = thm "mem_Sigma_iff";
paulson@15404
   904
val mem_splitE = thm "mem_splitE";
paulson@15404
   905
val mem_splitI = thm "mem_splitI";
paulson@15404
   906
val mem_splitI2 = thm "mem_splitI2";
paulson@15404
   907
val prod_eqI = thm "prod_eqI";
paulson@15404
   908
val prod_fun = thm "prod_fun";
paulson@15404
   909
val prod_fun_compose = thm "prod_fun_compose";
paulson@15404
   910
val prod_fun_def = thm "prod_fun_def";
paulson@15404
   911
val prod_fun_ident = thm "prod_fun_ident";
paulson@15404
   912
val prod_fun_imageE = thm "prod_fun_imageE";
paulson@15404
   913
val prod_fun_imageI = thm "prod_fun_imageI";
paulson@15404
   914
val prod_induct = thm "prod_induct";
paulson@15404
   915
val snd_conv = thm "snd_conv";
paulson@15404
   916
val snd_def = thm "snd_def";
paulson@15404
   917
val snd_eqD = thm "snd_eqD";
paulson@15404
   918
val split = thm "split";
paulson@15404
   919
val splitD = thm "splitD";
paulson@15404
   920
val splitD' = thm "splitD'";
paulson@15404
   921
val splitE = thm "splitE";
paulson@15404
   922
val splitE' = thm "splitE'";
paulson@15404
   923
val splitE2 = thm "splitE2";
paulson@15404
   924
val splitI = thm "splitI";
paulson@15404
   925
val splitI2 = thm "splitI2";
paulson@15404
   926
val splitI2' = thm "splitI2'";
paulson@15404
   927
val split_Pair_apply = thm "split_Pair_apply";
paulson@15404
   928
val split_beta = thm "split_beta";
paulson@15404
   929
val split_conv = thm "split_conv";
paulson@15404
   930
val split_def = thm "split_def";
paulson@15404
   931
val split_eta = thm "split_eta";
paulson@15404
   932
val split_eta_SetCompr = thm "split_eta_SetCompr";
paulson@15404
   933
val split_eta_SetCompr2 = thm "split_eta_SetCompr2";
paulson@15404
   934
val split_paired_All = thm "split_paired_All";
paulson@15404
   935
val split_paired_Ball_Sigma = thm "split_paired_Ball_Sigma";
paulson@15404
   936
val split_paired_Bex_Sigma = thm "split_paired_Bex_Sigma";
paulson@15404
   937
val split_paired_Ex = thm "split_paired_Ex";
paulson@15404
   938
val split_paired_The = thm "split_paired_The";
paulson@15404
   939
val split_paired_all = thm "split_paired_all";
paulson@15404
   940
val split_part = thm "split_part";
paulson@15404
   941
val split_split = thm "split_split";
paulson@15404
   942
val split_split_asm = thm "split_split_asm";
paulson@15404
   943
val split_tupled_all = thms "split_tupled_all";
paulson@15404
   944
val split_weak_cong = thm "split_weak_cong";
paulson@15404
   945
val surj_pair = thm "surj_pair";
paulson@15404
   946
val surjective_pairing = thm "surjective_pairing";
paulson@15404
   947
val unit_abs_eta_conv = thm "unit_abs_eta_conv";
paulson@15404
   948
val unit_all_eq1 = thm "unit_all_eq1";
paulson@15404
   949
val unit_all_eq2 = thm "unit_all_eq2";
paulson@15404
   950
val unit_eq = thm "unit_eq";
paulson@15404
   951
val unit_induct = thm "unit_induct";
paulson@15404
   952
*}
paulson@15404
   953
nipkow@10213
   954
end