src/HOL/Product_Type.thy
author nipkow
Mon Jan 05 00:46:06 2004 +0100 (2004-01-05)
changeset 14337 e13731554e50
parent 14208 144f45277d5a
child 14359 3d9948163018
permissions -rw-r--r--
undid split_comp_eq[simp] because it leads to nontermination together with split_def!
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
oheimb@11025
     9
theory Product_Type = Fun
wenzelm@11838
    10
files ("Tools/split_rule.ML"):
wenzelm@11838
    11
wenzelm@11838
    12
subsection {* Unit *}
wenzelm@11838
    13
wenzelm@11838
    14
typedef unit = "{True}"
wenzelm@11838
    15
proof
wenzelm@11838
    16
  show "True : ?unit" by blast
wenzelm@11838
    17
qed
wenzelm@11838
    18
wenzelm@11838
    19
constdefs
wenzelm@11838
    20
  Unity :: unit    ("'(')")
wenzelm@11838
    21
  "() == Abs_unit True"
wenzelm@11838
    22
wenzelm@11838
    23
lemma unit_eq: "u = ()"
wenzelm@11838
    24
  by (induct u) (simp add: unit_def Unity_def)
wenzelm@11838
    25
wenzelm@11838
    26
text {*
wenzelm@11838
    27
  Simplification procedure for @{thm [source] unit_eq}.  Cannot use
wenzelm@11838
    28
  this rule directly --- it loops!
wenzelm@11838
    29
*}
wenzelm@11838
    30
wenzelm@11838
    31
ML_setup {*
wenzelm@13462
    32
  val unit_eq_proc =
wenzelm@13462
    33
    let val unit_meta_eq = mk_meta_eq (thm "unit_eq") in
wenzelm@13462
    34
      Simplifier.simproc (Theory.sign_of (the_context ())) "unit_eq" ["x::unit"]
wenzelm@13462
    35
      (fn _ => fn _ => fn t => if HOLogic.is_unit t then None else Some unit_meta_eq)
wenzelm@13462
    36
    end;
wenzelm@11838
    37
wenzelm@11838
    38
  Addsimprocs [unit_eq_proc];
wenzelm@11838
    39
*}
wenzelm@11838
    40
wenzelm@11838
    41
lemma unit_all_eq1: "(!!x::unit. PROP P x) == PROP P ()"
wenzelm@11838
    42
  by simp
wenzelm@11838
    43
wenzelm@11838
    44
lemma unit_all_eq2: "(!!x::unit. PROP P) == PROP P"
wenzelm@11838
    45
  by (rule triv_forall_equality)
wenzelm@11838
    46
wenzelm@11838
    47
lemma unit_induct [induct type: unit]: "P () ==> P x"
wenzelm@11838
    48
  by simp
wenzelm@11838
    49
wenzelm@11838
    50
text {*
wenzelm@11838
    51
  This rewrite counters the effect of @{text unit_eq_proc} on @{term
wenzelm@11838
    52
  [source] "%u::unit. f u"}, replacing it by @{term [source]
wenzelm@11838
    53
  f} rather than by @{term [source] "%u. f ()"}.
wenzelm@11838
    54
*}
wenzelm@11838
    55
wenzelm@11838
    56
lemma unit_abs_eta_conv [simp]: "(%u::unit. f ()) = f"
wenzelm@11838
    57
  by (rule ext) simp
nipkow@10213
    58
nipkow@10213
    59
wenzelm@11838
    60
subsection {* Pairs *}
nipkow@10213
    61
wenzelm@11777
    62
subsubsection {* Type definition *}
nipkow@10213
    63
nipkow@10213
    64
constdefs
oheimb@11025
    65
  Pair_Rep :: "['a, 'b] => ['a, 'b] => bool"
wenzelm@11032
    66
  "Pair_Rep == (%a b. %x y. x=a & y=b)"
nipkow@10213
    67
nipkow@10213
    68
global
nipkow@10213
    69
nipkow@10213
    70
typedef (Prod)
wenzelm@11838
    71
  ('a, 'b) "*"    (infixr 20)
wenzelm@11032
    72
    = "{f. EX a b. f = Pair_Rep (a::'a) (b::'b)}"
oheimb@11025
    73
proof
oheimb@11025
    74
  fix a b show "Pair_Rep a b : ?Prod"
oheimb@11025
    75
    by blast
oheimb@11025
    76
qed
nipkow@10213
    77
wenzelm@12114
    78
syntax (xsymbols)
oheimb@11493
    79
  "*"      :: "[type, type] => type"         ("(_ \<times>/ _)" [21, 20] 20)
nipkow@10213
    80
syntax (HTML output)
oheimb@11493
    81
  "*"      :: "[type, type] => type"         ("(_ \<times>/ _)" [21, 20] 20)
nipkow@10213
    82
wenzelm@11777
    83
local
nipkow@10213
    84
wenzelm@11777
    85
wenzelm@11777
    86
subsubsection {* Abstract constants and syntax *}
wenzelm@11777
    87
wenzelm@11777
    88
global
nipkow@10213
    89
nipkow@10213
    90
consts
oheimb@11025
    91
  fst      :: "'a * 'b => 'a"
oheimb@11025
    92
  snd      :: "'a * 'b => 'b"
oheimb@11025
    93
  split    :: "[['a, 'b] => 'c, 'a * 'b] => 'c"
skalberg@14189
    94
  curry    :: "['a * 'b => 'c, 'a, 'b] => 'c"
oheimb@11025
    95
  prod_fun :: "['a => 'b, 'c => 'd, 'a * 'c] => 'b * 'd"
oheimb@11025
    96
  Pair     :: "['a, 'b] => 'a * 'b"
oheimb@11025
    97
  Sigma    :: "['a set, 'a => 'b set] => ('a * 'b) set"
nipkow@10213
    98
wenzelm@11777
    99
local
nipkow@10213
   100
wenzelm@11777
   101
text {*
wenzelm@11777
   102
  Patterns -- extends pre-defined type @{typ pttrn} used in
wenzelm@11777
   103
  abstractions.
wenzelm@11777
   104
*}
nipkow@10213
   105
nipkow@10213
   106
nonterminals
nipkow@10213
   107
  tuple_args patterns
nipkow@10213
   108
nipkow@10213
   109
syntax
nipkow@10213
   110
  "_tuple"      :: "'a => tuple_args => 'a * 'b"        ("(1'(_,/ _'))")
nipkow@10213
   111
  "_tuple_arg"  :: "'a => tuple_args"                   ("_")
nipkow@10213
   112
  "_tuple_args" :: "'a => tuple_args => tuple_args"     ("_,/ _")
oheimb@11025
   113
  "_pattern"    :: "[pttrn, patterns] => pttrn"         ("'(_,/ _')")
oheimb@11025
   114
  ""            :: "pttrn => patterns"                  ("_")
oheimb@11025
   115
  "_patterns"   :: "[pttrn, patterns] => patterns"      ("_,/ _")
oheimb@11025
   116
  "@Sigma" ::"[pttrn, 'a set, 'b set] => ('a * 'b) set" ("(3SIGMA _:_./ _)" 10)
oheimb@11025
   117
  "@Times" ::"['a set,  'a => 'b set] => ('a * 'b) set" (infixr "<*>" 80)
nipkow@10213
   118
nipkow@10213
   119
translations
nipkow@10213
   120
  "(x, y)"       == "Pair x y"
nipkow@10213
   121
  "_tuple x (_tuple_args y z)" == "_tuple x (_tuple_arg (_tuple y z))"
nipkow@10213
   122
  "%(x,y,zs).b"  == "split(%x (y,zs).b)"
nipkow@10213
   123
  "%(x,y).b"     == "split(%x y. b)"
nipkow@10213
   124
  "_abs (Pair x y) t" => "%(x,y).t"
nipkow@10213
   125
  (* The last rule accommodates tuples in `case C ... (x,y) ... => ...'
nipkow@10213
   126
     The (x,y) is parsed as `Pair x y' because it is logic, not pttrn *)
nipkow@10213
   127
nipkow@10213
   128
  "SIGMA x:A. B" => "Sigma A (%x. B)"
nipkow@10213
   129
  "A <*> B"      => "Sigma A (_K B)"
nipkow@10213
   130
wenzelm@12114
   131
syntax (xsymbols)
oheimb@11493
   132
  "@Sigma" :: "[pttrn, 'a set, 'b set] => ('a * 'b) set"  ("(3\<Sigma> _\<in>_./ _)"   10)
oheimb@11493
   133
  "@Times" :: "['a set,  'a => 'b set] => ('a * 'b) set"  ("_ \<times> _" [81, 80] 80)
oheimb@11025
   134
wenzelm@11032
   135
print_translation {* [("Sigma", dependent_tr' ("@Sigma", "@Times"))] *}
nipkow@10213
   136
nipkow@10213
   137
wenzelm@11777
   138
subsubsection {* Definitions *}
nipkow@10213
   139
nipkow@10213
   140
defs
oheimb@11025
   141
  Pair_def:     "Pair a b == Abs_Prod(Pair_Rep a b)"
paulson@11451
   142
  fst_def:      "fst p == THE a. EX b. p = (a, b)"
paulson@11451
   143
  snd_def:      "snd p == THE b. EX a. p = (a, b)"
oheimb@11025
   144
  split_def:    "split == (%c p. c (fst p) (snd p))"
skalberg@14189
   145
  curry_def:    "curry == (%c x y. c (x,y))"
oheimb@11025
   146
  prod_fun_def: "prod_fun f g == split(%x y.(f(x), g(y)))"
oheimb@11025
   147
  Sigma_def:    "Sigma A B == UN x:A. UN y:B(x). {(x, y)}"
nipkow@10213
   148
nipkow@10213
   149
wenzelm@11966
   150
subsubsection {* Lemmas and proof tool setup *}
wenzelm@11838
   151
wenzelm@11838
   152
lemma ProdI: "Pair_Rep a b : Prod"
wenzelm@11838
   153
  by (unfold Prod_def) blast
wenzelm@11838
   154
wenzelm@11838
   155
lemma Pair_Rep_inject: "Pair_Rep a b = Pair_Rep a' b' ==> a = a' & b = b'"
wenzelm@11838
   156
  apply (unfold Pair_Rep_def)
paulson@14208
   157
  apply (drule fun_cong [THEN fun_cong], blast)
wenzelm@11838
   158
  done
nipkow@10213
   159
wenzelm@11838
   160
lemma inj_on_Abs_Prod: "inj_on Abs_Prod Prod"
wenzelm@11838
   161
  apply (rule inj_on_inverseI)
wenzelm@11838
   162
  apply (erule Abs_Prod_inverse)
wenzelm@11838
   163
  done
wenzelm@11838
   164
wenzelm@11838
   165
lemma Pair_inject:
wenzelm@11838
   166
  "(a, b) = (a', b') ==> (a = a' ==> b = b' ==> R) ==> R"
wenzelm@11838
   167
proof -
wenzelm@11838
   168
  case rule_context [unfolded Pair_def]
wenzelm@11838
   169
  show ?thesis
wenzelm@11838
   170
    apply (rule inj_on_Abs_Prod [THEN inj_onD, THEN Pair_Rep_inject, THEN conjE])
wenzelm@11838
   171
    apply (rule rule_context ProdI)+
wenzelm@11838
   172
    .
oheimb@11025
   173
qed
nipkow@10213
   174
wenzelm@11838
   175
lemma Pair_eq [iff]: "((a, b) = (a', b')) = (a = a' & b = b')"
wenzelm@11838
   176
  by (blast elim!: Pair_inject)
wenzelm@11838
   177
wenzelm@11838
   178
lemma fst_conv [simp]: "fst (a, b) = a"
wenzelm@11838
   179
  by (unfold fst_def) blast
wenzelm@11838
   180
wenzelm@11838
   181
lemma snd_conv [simp]: "snd (a, b) = b"
wenzelm@11838
   182
  by (unfold snd_def) blast
oheimb@11025
   183
wenzelm@11838
   184
lemma fst_eqD: "fst (x, y) = a ==> x = a"
wenzelm@11838
   185
  by simp
wenzelm@11838
   186
wenzelm@11838
   187
lemma snd_eqD: "snd (x, y) = a ==> y = a"
wenzelm@11838
   188
  by simp
wenzelm@11838
   189
wenzelm@11838
   190
lemma PairE_lemma: "EX x y. p = (x, y)"
wenzelm@11838
   191
  apply (unfold Pair_def)
wenzelm@11838
   192
  apply (rule Rep_Prod [unfolded Prod_def, THEN CollectE])
wenzelm@11838
   193
  apply (erule exE, erule exE, rule exI, rule exI)
wenzelm@11838
   194
  apply (rule Rep_Prod_inverse [symmetric, THEN trans])
wenzelm@11838
   195
  apply (erule arg_cong)
wenzelm@11838
   196
  done
wenzelm@11032
   197
wenzelm@11838
   198
lemma PairE [cases type: *]: "(!!x y. p = (x, y) ==> Q) ==> Q"
wenzelm@11838
   199
  by (insert PairE_lemma [of p]) blast
wenzelm@11838
   200
wenzelm@11838
   201
ML_setup {*
wenzelm@11838
   202
  local val PairE = thm "PairE" in
wenzelm@11838
   203
    fun pair_tac s =
wenzelm@11838
   204
      EVERY' [res_inst_tac [("p", s)] PairE, hyp_subst_tac, K prune_params_tac];
wenzelm@11838
   205
  end;
wenzelm@11838
   206
*}
wenzelm@11032
   207
wenzelm@11838
   208
lemma surjective_pairing: "p = (fst p, snd p)"
wenzelm@11838
   209
  -- {* Do not add as rewrite rule: invalidates some proofs in IMP *}
wenzelm@11838
   210
  by (cases p) simp
wenzelm@11838
   211
wenzelm@11838
   212
declare surjective_pairing [symmetric, simp]
oheimb@11025
   213
wenzelm@11838
   214
lemma surj_pair [simp]: "EX x y. z = (x, y)"
wenzelm@11838
   215
  apply (rule exI)
wenzelm@11838
   216
  apply (rule exI)
wenzelm@11838
   217
  apply (rule surjective_pairing)
wenzelm@11838
   218
  done
wenzelm@11838
   219
wenzelm@11838
   220
lemma split_paired_all: "(!!x. PROP P x) == (!!a b. PROP P (a, b))"
wenzelm@11820
   221
proof
wenzelm@11820
   222
  fix a b
wenzelm@11820
   223
  assume "!!x. PROP P x"
wenzelm@11820
   224
  thus "PROP P (a, b)" .
wenzelm@11820
   225
next
wenzelm@11820
   226
  fix x
wenzelm@11820
   227
  assume "!!a b. PROP P (a, b)"
wenzelm@11820
   228
  hence "PROP P (fst x, snd x)" .
wenzelm@11820
   229
  thus "PROP P x" by simp
wenzelm@11820
   230
qed
wenzelm@11820
   231
wenzelm@11838
   232
lemmas split_tupled_all = split_paired_all unit_all_eq2
wenzelm@11838
   233
wenzelm@11838
   234
text {*
wenzelm@11838
   235
  The rule @{thm [source] split_paired_all} does not work with the
wenzelm@11838
   236
  Simplifier because it also affects premises in congrence rules,
wenzelm@11838
   237
  where this can lead to premises of the form @{text "!!a b. ... =
wenzelm@11838
   238
  ?P(a, b)"} which cannot be solved by reflexivity.
wenzelm@11838
   239
*}
wenzelm@11838
   240
wenzelm@11838
   241
ML_setup "
wenzelm@11838
   242
  (* replace parameters of product type by individual component parameters *)
wenzelm@11838
   243
  val safe_full_simp_tac = generic_simp_tac true (true, false, false);
wenzelm@11838
   244
  local (* filtering with exists_paired_all is an essential optimization *)
wenzelm@11838
   245
    fun exists_paired_all (Const (\"all\", _) $ Abs (_, T, t)) =
wenzelm@11838
   246
          can HOLogic.dest_prodT T orelse exists_paired_all t
wenzelm@11838
   247
      | exists_paired_all (t $ u) = exists_paired_all t orelse exists_paired_all u
wenzelm@11838
   248
      | exists_paired_all (Abs (_, _, t)) = exists_paired_all t
wenzelm@11838
   249
      | exists_paired_all _ = false;
wenzelm@11838
   250
    val ss = HOL_basic_ss
wenzelm@11838
   251
      addsimps [thm \"split_paired_all\", thm \"unit_all_eq2\", thm \"unit_abs_eta_conv\"]
wenzelm@11838
   252
      addsimprocs [unit_eq_proc];
wenzelm@11838
   253
  in
wenzelm@11838
   254
    val split_all_tac = SUBGOAL (fn (t, i) =>
wenzelm@11838
   255
      if exists_paired_all t then safe_full_simp_tac ss i else no_tac);
wenzelm@11838
   256
    val unsafe_split_all_tac = SUBGOAL (fn (t, i) =>
wenzelm@11838
   257
      if exists_paired_all t then full_simp_tac ss i else no_tac);
wenzelm@11838
   258
    fun split_all th =
wenzelm@11838
   259
   if exists_paired_all (#prop (Thm.rep_thm th)) then full_simplify ss th else th;
wenzelm@11838
   260
  end;
wenzelm@11838
   261
wenzelm@11838
   262
claset_ref() := claset() addSbefore (\"split_all_tac\", split_all_tac);
wenzelm@11838
   263
"
wenzelm@11838
   264
wenzelm@11838
   265
lemma split_paired_All [simp]: "(ALL x. P x) = (ALL a b. P (a, b))"
wenzelm@11838
   266
  -- {* @{text "[iff]"} is not a good idea because it makes @{text blast} loop *}
wenzelm@11838
   267
  by fast
wenzelm@11838
   268
skalberg@14189
   269
lemma curry_split [simp]: "curry (split f) = f"
skalberg@14189
   270
  by (simp add: curry_def split_def)
skalberg@14189
   271
skalberg@14189
   272
lemma split_curry [simp]: "split (curry f) = f"
skalberg@14189
   273
  by (simp add: curry_def split_def)
skalberg@14189
   274
skalberg@14189
   275
lemma curryI [intro!]: "f (a,b) ==> curry f a b"
skalberg@14189
   276
  by (simp add: curry_def)
skalberg@14189
   277
skalberg@14190
   278
lemma curryD [dest!]: "curry f a b ==> f (a,b)"
skalberg@14189
   279
  by (simp add: curry_def)
skalberg@14189
   280
skalberg@14190
   281
lemma curryE: "[| curry f a b ; f (a,b) ==> Q |] ==> Q"
skalberg@14189
   282
  by (simp add: curry_def)
skalberg@14189
   283
skalberg@14189
   284
lemma curry_conv [simp]: "curry f a b = f (a,b)"
skalberg@14189
   285
  by (simp add: curry_def)
skalberg@14189
   286
wenzelm@11838
   287
lemma prod_induct [induct type: *]: "!!x. (!!a b. P (a, b)) ==> P x"
wenzelm@11838
   288
  by fast
wenzelm@11838
   289
wenzelm@11838
   290
lemma split_paired_Ex [simp]: "(EX x. P x) = (EX a b. P (a, b))"
wenzelm@11838
   291
  by fast
wenzelm@11838
   292
wenzelm@11838
   293
lemma split_conv [simp]: "split c (a, b) = c a b"
wenzelm@11838
   294
  by (simp add: split_def)
wenzelm@11838
   295
wenzelm@11838
   296
lemmas split = split_conv  -- {* for backwards compatibility *}
wenzelm@11838
   297
wenzelm@11838
   298
lemmas splitI = split_conv [THEN iffD2, standard]
wenzelm@11838
   299
lemmas splitD = split_conv [THEN iffD1, standard]
wenzelm@11838
   300
wenzelm@11838
   301
lemma split_Pair_apply: "split (%x y. f (x, y)) = f"
wenzelm@11838
   302
  -- {* Subsumes the old @{text split_Pair} when @{term f} is the identity function. *}
wenzelm@11838
   303
  apply (rule ext)
paulson@14208
   304
  apply (tactic {* pair_tac "x" 1 *}, simp)
wenzelm@11838
   305
  done
wenzelm@11838
   306
wenzelm@11838
   307
lemma split_paired_The: "(THE x. P x) = (THE (a, b). P (a, b))"
wenzelm@11838
   308
  -- {* Can't be added to simpset: loops! *}
wenzelm@11838
   309
  by (simp add: split_Pair_apply)
wenzelm@11838
   310
wenzelm@11838
   311
lemma The_split: "The (split P) = (THE xy. P (fst xy) (snd xy))"
wenzelm@11838
   312
  by (simp add: split_def)
wenzelm@11838
   313
wenzelm@11838
   314
lemma Pair_fst_snd_eq: "!!s t. (s = t) = (fst s = fst t & snd s = snd t)"
paulson@14208
   315
by (simp only: split_tupled_all, simp)
wenzelm@11838
   316
wenzelm@11838
   317
lemma prod_eqI [intro?]: "fst p = fst q ==> snd p = snd q ==> p = q"
wenzelm@11838
   318
  by (simp add: Pair_fst_snd_eq)
wenzelm@11838
   319
wenzelm@11838
   320
lemma split_weak_cong: "p = q ==> split c p = split c q"
wenzelm@11838
   321
  -- {* Prevents simplification of @{term c}: much faster *}
wenzelm@11838
   322
  by (erule arg_cong)
wenzelm@11838
   323
wenzelm@11838
   324
lemma split_eta: "(%(x, y). f (x, y)) = f"
wenzelm@11838
   325
  apply (rule ext)
wenzelm@11838
   326
  apply (simp only: split_tupled_all)
wenzelm@11838
   327
  apply (rule split_conv)
wenzelm@11838
   328
  done
wenzelm@11838
   329
wenzelm@11838
   330
lemma cond_split_eta: "(!!x y. f x y = g (x, y)) ==> (%(x, y). f x y) = g"
wenzelm@11838
   331
  by (simp add: split_eta)
wenzelm@11838
   332
wenzelm@11838
   333
text {*
wenzelm@11838
   334
  Simplification procedure for @{thm [source] cond_split_eta}.  Using
wenzelm@11838
   335
  @{thm [source] split_eta} as a rewrite rule is not general enough,
wenzelm@11838
   336
  and using @{thm [source] cond_split_eta} directly would render some
wenzelm@11838
   337
  existing proofs very inefficient; similarly for @{text
wenzelm@11838
   338
  split_beta}. *}
wenzelm@11838
   339
wenzelm@11838
   340
ML_setup {*
wenzelm@11838
   341
wenzelm@11838
   342
local
wenzelm@11838
   343
  val cond_split_eta = thm "cond_split_eta";
wenzelm@11838
   344
  fun  Pair_pat k 0 (Bound m) = (m = k)
wenzelm@11838
   345
  |    Pair_pat k i (Const ("Pair",  _) $ Bound m $ t) = i > 0 andalso
wenzelm@11838
   346
                        m = k+i andalso Pair_pat k (i-1) t
wenzelm@11838
   347
  |    Pair_pat _ _ _ = false;
wenzelm@11838
   348
  fun no_args k i (Abs (_, _, t)) = no_args (k+1) i t
wenzelm@11838
   349
  |   no_args k i (t $ u) = no_args k i t andalso no_args k i u
wenzelm@11838
   350
  |   no_args k i (Bound m) = m < k orelse m > k+i
wenzelm@11838
   351
  |   no_args _ _ _ = true;
wenzelm@11838
   352
  fun split_pat tp i (Abs  (_,_,t)) = if tp 0 i t then Some (i,t) else None
wenzelm@11838
   353
  |   split_pat tp i (Const ("split", _) $ Abs (_, _, t)) = split_pat tp (i+1) t
wenzelm@11838
   354
  |   split_pat tp i _ = None;
wenzelm@13480
   355
  fun metaeq sg lhs rhs = mk_meta_eq (Tactic.prove sg [] []
wenzelm@13480
   356
        (HOLogic.mk_Trueprop (HOLogic.mk_eq (lhs,rhs)))
wenzelm@13480
   357
        (K (simp_tac (HOL_basic_ss addsimps [cond_split_eta]) 1)));
wenzelm@11838
   358
wenzelm@11838
   359
  fun beta_term_pat k i (Abs (_, _, t)) = beta_term_pat (k+1) i t
wenzelm@11838
   360
  |   beta_term_pat k i (t $ u) = Pair_pat k i (t $ u) orelse
wenzelm@11838
   361
                        (beta_term_pat k i t andalso beta_term_pat k i u)
wenzelm@11838
   362
  |   beta_term_pat k i t = no_args k i t;
wenzelm@11838
   363
  fun  eta_term_pat k i (f $ arg) = no_args k i f andalso Pair_pat k i arg
wenzelm@11838
   364
  |    eta_term_pat _ _ _ = false;
wenzelm@11838
   365
  fun subst arg k i (Abs (x, T, t)) = Abs (x, T, subst arg (k+1) i t)
wenzelm@11838
   366
  |   subst arg k i (t $ u) = if Pair_pat k i (t $ u) then incr_boundvars k arg
wenzelm@11838
   367
                              else (subst arg k i t $ subst arg k i u)
wenzelm@11838
   368
  |   subst arg k i t = t;
wenzelm@11838
   369
  fun beta_proc sg _ (s as Const ("split", _) $ Abs (_, _, t) $ arg) =
wenzelm@11838
   370
        (case split_pat beta_term_pat 1 t of
wenzelm@11838
   371
        Some (i,f) => Some (metaeq sg s (subst arg 0 i f))
wenzelm@11838
   372
        | None => None)
wenzelm@11838
   373
  |   beta_proc _ _ _ = None;
wenzelm@11838
   374
  fun eta_proc sg _ (s as Const ("split", _) $ Abs (_, _, t)) =
wenzelm@11838
   375
        (case split_pat eta_term_pat 1 t of
wenzelm@11838
   376
          Some (_,ft) => Some (metaeq sg s (let val (f $ arg) = ft in f end))
wenzelm@11838
   377
        | None => None)
wenzelm@11838
   378
  |   eta_proc _ _ _ = None;
wenzelm@11838
   379
in
wenzelm@13462
   380
  val split_beta_proc = Simplifier.simproc (Theory.sign_of (the_context ()))
wenzelm@13462
   381
    "split_beta" ["split f z"] beta_proc;
wenzelm@13462
   382
  val split_eta_proc = Simplifier.simproc (Theory.sign_of (the_context ()))
wenzelm@13462
   383
    "split_eta" ["split f"] eta_proc;
wenzelm@11838
   384
end;
wenzelm@11838
   385
wenzelm@11838
   386
Addsimprocs [split_beta_proc, split_eta_proc];
wenzelm@11838
   387
*}
wenzelm@11838
   388
wenzelm@11838
   389
lemma split_beta: "(%(x, y). P x y) z = P (fst z) (snd z)"
wenzelm@11838
   390
  by (subst surjective_pairing, rule split_conv)
wenzelm@11838
   391
wenzelm@11838
   392
lemma split_split: "R (split c p) = (ALL x y. p = (x, y) --> R (c x y))"
wenzelm@11838
   393
  -- {* For use with @{text split} and the Simplifier. *}
wenzelm@11838
   394
  apply (subst surjective_pairing)
paulson@14208
   395
  apply (subst split_conv, blast)
wenzelm@11838
   396
  done
wenzelm@11838
   397
wenzelm@11838
   398
text {*
wenzelm@11838
   399
  @{thm [source] split_split} could be declared as @{text "[split]"}
wenzelm@11838
   400
  done after the Splitter has been speeded up significantly;
wenzelm@11838
   401
  precompute the constants involved and don't do anything unless the
wenzelm@11838
   402
  current goal contains one of those constants.
wenzelm@11838
   403
*}
wenzelm@11838
   404
wenzelm@11838
   405
lemma split_split_asm: "R (split c p) = (~(EX x y. p = (x, y) & (~R (c x y))))"
paulson@14208
   406
by (subst split_split, simp)
wenzelm@11838
   407
wenzelm@11838
   408
wenzelm@11838
   409
text {*
wenzelm@11838
   410
  \medskip @{term split} used as a logical connective or set former.
wenzelm@11838
   411
wenzelm@11838
   412
  \medskip These rules are for use with @{text blast}; could instead
wenzelm@11838
   413
  call @{text simp} using @{thm [source] split} as rewrite. *}
wenzelm@11838
   414
wenzelm@11838
   415
lemma splitI2: "!!p. [| !!a b. p = (a, b) ==> c a b |] ==> split c p"
wenzelm@11838
   416
  apply (simp only: split_tupled_all)
wenzelm@11838
   417
  apply (simp (no_asm_simp))
wenzelm@11838
   418
  done
wenzelm@11838
   419
wenzelm@11838
   420
lemma splitI2': "!!p. [| !!a b. (a, b) = p ==> c a b x |] ==> split c p x"
wenzelm@11838
   421
  apply (simp only: split_tupled_all)
wenzelm@11838
   422
  apply (simp (no_asm_simp))
wenzelm@11838
   423
  done
wenzelm@11838
   424
wenzelm@11838
   425
lemma splitE: "split c p ==> (!!x y. p = (x, y) ==> c x y ==> Q) ==> Q"
wenzelm@11838
   426
  by (induct p) (auto simp add: split_def)
wenzelm@11838
   427
wenzelm@11838
   428
lemma splitE': "split c p z ==> (!!x y. p = (x, y) ==> c x y z ==> Q) ==> Q"
wenzelm@11838
   429
  by (induct p) (auto simp add: split_def)
wenzelm@11838
   430
wenzelm@11838
   431
lemma splitE2:
wenzelm@11838
   432
  "[| Q (split P z);  !!x y. [|z = (x, y); Q (P x y)|] ==> R |] ==> R"
wenzelm@11838
   433
proof -
wenzelm@11838
   434
  assume q: "Q (split P z)"
wenzelm@11838
   435
  assume r: "!!x y. [|z = (x, y); Q (P x y)|] ==> R"
wenzelm@11838
   436
  show R
wenzelm@11838
   437
    apply (rule r surjective_pairing)+
wenzelm@11838
   438
    apply (rule split_beta [THEN subst], rule q)
wenzelm@11838
   439
    done
wenzelm@11838
   440
qed
wenzelm@11838
   441
wenzelm@11838
   442
lemma splitD': "split R (a,b) c ==> R a b c"
wenzelm@11838
   443
  by simp
wenzelm@11838
   444
wenzelm@11838
   445
lemma mem_splitI: "z: c a b ==> z: split c (a, b)"
wenzelm@11838
   446
  by simp
wenzelm@11838
   447
wenzelm@11838
   448
lemma mem_splitI2: "!!p. [| !!a b. p = (a, b) ==> z: c a b |] ==> z: split c p"
paulson@14208
   449
by (simp only: split_tupled_all, simp)
wenzelm@11838
   450
wenzelm@11838
   451
lemma mem_splitE: "[| z: split c p; !!x y. [| p = (x,y); z: c x y |] ==> Q |] ==> Q"
wenzelm@11838
   452
proof -
wenzelm@11838
   453
  case rule_context [unfolded split_def]
wenzelm@11838
   454
  show ?thesis by (rule rule_context surjective_pairing)+
wenzelm@11838
   455
qed
wenzelm@11838
   456
wenzelm@11838
   457
declare mem_splitI2 [intro!] mem_splitI [intro!] splitI2' [intro!] splitI2 [intro!] splitI [intro!]
wenzelm@11838
   458
declare mem_splitE [elim!] splitE' [elim!] splitE [elim!]
wenzelm@11838
   459
wenzelm@11838
   460
ML_setup "
wenzelm@11838
   461
local (* filtering with exists_p_split is an essential optimization *)
wenzelm@11838
   462
  fun exists_p_split (Const (\"split\",_) $ _ $ (Const (\"Pair\",_)$_$_)) = true
wenzelm@11838
   463
    | exists_p_split (t $ u) = exists_p_split t orelse exists_p_split u
wenzelm@11838
   464
    | exists_p_split (Abs (_, _, t)) = exists_p_split t
wenzelm@11838
   465
    | exists_p_split _ = false;
wenzelm@11838
   466
  val ss = HOL_basic_ss addsimps [thm \"split_conv\"];
wenzelm@11838
   467
in
wenzelm@11838
   468
val split_conv_tac = SUBGOAL (fn (t, i) =>
wenzelm@11838
   469
    if exists_p_split t then safe_full_simp_tac ss i else no_tac);
wenzelm@11838
   470
end;
wenzelm@11838
   471
(* This prevents applications of splitE for already splitted arguments leading
wenzelm@11838
   472
   to quite time-consuming computations (in particular for nested tuples) *)
wenzelm@11838
   473
claset_ref() := claset() addSbefore (\"split_conv_tac\", split_conv_tac);
wenzelm@11838
   474
"
wenzelm@11838
   475
wenzelm@11838
   476
lemma split_eta_SetCompr [simp]: "(%u. EX x y. u = (x, y) & P (x, y)) = P"
paulson@14208
   477
by (rule ext, fast)
wenzelm@11838
   478
wenzelm@11838
   479
lemma split_eta_SetCompr2 [simp]: "(%u. EX x y. u = (x, y) & P x y) = split P"
paulson@14208
   480
by (rule ext, fast)
wenzelm@11838
   481
wenzelm@11838
   482
lemma split_part [simp]: "(%(a,b). P & Q a b) = (%ab. P & split Q ab)"
wenzelm@11838
   483
  -- {* Allows simplifications of nested splits in case of independent predicates. *}
paulson@14208
   484
  apply (rule ext, blast)
wenzelm@11838
   485
  done
wenzelm@11838
   486
nipkow@14337
   487
(* Do NOT make this a simp rule as it
nipkow@14337
   488
   a) only helps in special situations
nipkow@14337
   489
   b) can lead to nontermination in the presence of split_def
nipkow@14337
   490
*)
nipkow@14337
   491
lemma split_comp_eq: 
oheimb@14101
   492
"(%u. f (g (fst u)) (snd u)) = (split (%x. f (g x)))"
oheimb@14101
   493
by (rule ext, auto)
oheimb@14101
   494
wenzelm@11838
   495
lemma The_split_eq [simp]: "(THE (x',y'). x = x' & y = y') = (x, y)"
wenzelm@11838
   496
  by blast
wenzelm@11838
   497
wenzelm@11838
   498
(*
wenzelm@11838
   499
the following  would be slightly more general,
wenzelm@11838
   500
but cannot be used as rewrite rule:
wenzelm@11838
   501
### Cannot add premise as rewrite rule because it contains (type) unknowns:
wenzelm@11838
   502
### ?y = .x
wenzelm@11838
   503
Goal "[| P y; !!x. P x ==> x = y |] ==> (@(x',y). x = x' & P y) = (x,y)"
paulson@14208
   504
by (rtac some_equality 1)
paulson@14208
   505
by ( Simp_tac 1)
paulson@14208
   506
by (split_all_tac 1)
paulson@14208
   507
by (Asm_full_simp_tac 1)
wenzelm@11838
   508
qed "The_split_eq";
wenzelm@11838
   509
*)
wenzelm@11838
   510
wenzelm@11838
   511
lemma injective_fst_snd: "!!x y. [|fst x = fst y; snd x = snd y|] ==> x = y"
wenzelm@11838
   512
  by auto
wenzelm@11838
   513
wenzelm@11838
   514
wenzelm@11838
   515
text {*
wenzelm@11838
   516
  \bigskip @{term prod_fun} --- action of the product functor upon
wenzelm@11838
   517
  functions.
wenzelm@11838
   518
*}
wenzelm@11838
   519
wenzelm@11838
   520
lemma prod_fun [simp]: "prod_fun f g (a, b) = (f a, g b)"
wenzelm@11838
   521
  by (simp add: prod_fun_def)
wenzelm@11838
   522
wenzelm@11838
   523
lemma prod_fun_compose: "prod_fun (f1 o f2) (g1 o g2) = (prod_fun f1 g1 o prod_fun f2 g2)"
wenzelm@11838
   524
  apply (rule ext)
paulson@14208
   525
  apply (tactic {* pair_tac "x" 1 *}, simp)
wenzelm@11838
   526
  done
wenzelm@11838
   527
wenzelm@11838
   528
lemma prod_fun_ident [simp]: "prod_fun (%x. x) (%y. y) = (%z. z)"
wenzelm@11838
   529
  apply (rule ext)
paulson@14208
   530
  apply (tactic {* pair_tac "z" 1 *}, simp)
wenzelm@11838
   531
  done
wenzelm@11838
   532
wenzelm@11838
   533
lemma prod_fun_imageI [intro]: "(a, b) : r ==> (f a, g b) : prod_fun f g ` r"
wenzelm@11838
   534
  apply (rule image_eqI)
paulson@14208
   535
  apply (rule prod_fun [symmetric], assumption)
wenzelm@11838
   536
  done
wenzelm@11838
   537
wenzelm@11838
   538
lemma prod_fun_imageE [elim!]:
wenzelm@11838
   539
  "[| c: (prod_fun f g)`r;  !!x y. [| c=(f(x),g(y));  (x,y):r |] ==> P
wenzelm@11838
   540
    |] ==> P"
wenzelm@11838
   541
proof -
wenzelm@11838
   542
  case rule_context
wenzelm@11838
   543
  assume major: "c: (prod_fun f g)`r"
wenzelm@11838
   544
  show ?thesis
wenzelm@11838
   545
    apply (rule major [THEN imageE])
wenzelm@11838
   546
    apply (rule_tac p = x in PairE)
wenzelm@11838
   547
    apply (rule rule_context)
wenzelm@11838
   548
     prefer 2
wenzelm@11838
   549
     apply blast
wenzelm@11838
   550
    apply (blast intro: prod_fun)
wenzelm@11838
   551
    done
wenzelm@11838
   552
qed
wenzelm@11838
   553
wenzelm@11838
   554
oheimb@14101
   555
constdefs
oheimb@14101
   556
  upd_fst :: "('a => 'c) => 'a * 'b => 'c * 'b"
oheimb@14101
   557
 "upd_fst f == prod_fun f id"
oheimb@14101
   558
oheimb@14101
   559
  upd_snd :: "('b => 'c) => 'a * 'b => 'a * 'c"
oheimb@14101
   560
 "upd_snd f == prod_fun id f"
oheimb@14101
   561
oheimb@14101
   562
lemma upd_fst_conv [simp]: "upd_fst f (x,y) = (f x,y)" 
oheimb@14101
   563
by (simp add: upd_fst_def)
oheimb@14101
   564
oheimb@14101
   565
lemma upd_snd_conv [simp]: "upd_snd f (x,y) = (x,f y)" 
oheimb@14101
   566
by (simp add: upd_snd_def)
oheimb@14101
   567
wenzelm@11838
   568
text {*
wenzelm@11838
   569
  \bigskip Disjoint union of a family of sets -- Sigma.
wenzelm@11838
   570
*}
wenzelm@11838
   571
wenzelm@11838
   572
lemma SigmaI [intro!]: "[| a:A;  b:B(a) |] ==> (a,b) : Sigma A B"
wenzelm@11838
   573
  by (unfold Sigma_def) blast
wenzelm@11838
   574
wenzelm@11838
   575
wenzelm@11838
   576
lemma SigmaE:
wenzelm@11838
   577
    "[| c: Sigma A B;
wenzelm@11838
   578
        !!x y.[| x:A;  y:B(x);  c=(x,y) |] ==> P
wenzelm@11838
   579
     |] ==> P"
wenzelm@11838
   580
  -- {* The general elimination rule. *}
wenzelm@11838
   581
  by (unfold Sigma_def) blast
wenzelm@11838
   582
wenzelm@11838
   583
text {*
wenzelm@11838
   584
  Elimination of @{term "(a, b) : A \<times> B"} -- introduces no
wenzelm@11838
   585
  eigenvariables.
wenzelm@11838
   586
*}
wenzelm@11838
   587
wenzelm@11838
   588
lemma SigmaD1: "(a, b) : Sigma A B ==> a : A"
paulson@14208
   589
by (erule SigmaE, blast)
wenzelm@11838
   590
wenzelm@11838
   591
lemma SigmaD2: "(a, b) : Sigma A B ==> b : B a"
paulson@14208
   592
by (erule SigmaE, blast)
wenzelm@11838
   593
wenzelm@11838
   594
lemma SigmaE2:
wenzelm@11838
   595
    "[| (a, b) : Sigma A B;
wenzelm@11838
   596
        [| a:A;  b:B(a) |] ==> P
wenzelm@11838
   597
     |] ==> P"
wenzelm@11838
   598
  by (blast dest: SigmaD1 SigmaD2)
wenzelm@11838
   599
wenzelm@11838
   600
declare SigmaE [elim!] SigmaE2 [elim!]
wenzelm@11838
   601
wenzelm@11838
   602
lemma Sigma_mono: "[| A <= C; !!x. x:A ==> B x <= D x |] ==> Sigma A B <= Sigma C D"
wenzelm@11838
   603
  by blast
wenzelm@11838
   604
wenzelm@11838
   605
lemma Sigma_empty1 [simp]: "Sigma {} B = {}"
wenzelm@11838
   606
  by blast
wenzelm@11838
   607
wenzelm@11838
   608
lemma Sigma_empty2 [simp]: "A <*> {} = {}"
wenzelm@11838
   609
  by blast
wenzelm@11838
   610
wenzelm@11838
   611
lemma UNIV_Times_UNIV [simp]: "UNIV <*> UNIV = UNIV"
wenzelm@11838
   612
  by auto
wenzelm@11838
   613
wenzelm@11838
   614
lemma Compl_Times_UNIV1 [simp]: "- (UNIV <*> A) = UNIV <*> (-A)"
wenzelm@11838
   615
  by auto
wenzelm@11838
   616
wenzelm@11838
   617
lemma Compl_Times_UNIV2 [simp]: "- (A <*> UNIV) = (-A) <*> UNIV"
wenzelm@11838
   618
  by auto
wenzelm@11838
   619
wenzelm@11838
   620
lemma mem_Sigma_iff [iff]: "((a,b): Sigma A B) = (a:A & b:B(a))"
wenzelm@11838
   621
  by blast
wenzelm@11838
   622
wenzelm@11838
   623
lemma Times_subset_cancel2: "x:C ==> (A <*> C <= B <*> C) = (A <= B)"
wenzelm@11838
   624
  by blast
wenzelm@11838
   625
wenzelm@11838
   626
lemma Times_eq_cancel2: "x:C ==> (A <*> C = B <*> C) = (A = B)"
wenzelm@11838
   627
  by (blast elim: equalityE)
wenzelm@11838
   628
wenzelm@11838
   629
lemma SetCompr_Sigma_eq:
wenzelm@11838
   630
    "Collect (split (%x y. P x & Q x y)) = (SIGMA x:Collect P. Collect (Q x))"
wenzelm@11838
   631
  by blast
wenzelm@11838
   632
wenzelm@11838
   633
text {*
wenzelm@11838
   634
  \bigskip Complex rules for Sigma.
wenzelm@11838
   635
*}
wenzelm@11838
   636
wenzelm@11838
   637
lemma Collect_split [simp]: "{(a,b). P a & Q b} = Collect P <*> Collect Q"
wenzelm@11838
   638
  by blast
wenzelm@11838
   639
wenzelm@11838
   640
lemma UN_Times_distrib:
wenzelm@11838
   641
  "(UN (a,b):(A <*> B). E a <*> F b) = (UNION A E) <*> (UNION B F)"
wenzelm@11838
   642
  -- {* Suggested by Pierre Chartier *}
wenzelm@11838
   643
  by blast
wenzelm@11838
   644
wenzelm@11838
   645
lemma split_paired_Ball_Sigma [simp]:
wenzelm@11838
   646
    "(ALL z: Sigma A B. P z) = (ALL x:A. ALL y: B x. P(x,y))"
wenzelm@11838
   647
  by blast
wenzelm@11838
   648
wenzelm@11838
   649
lemma split_paired_Bex_Sigma [simp]:
wenzelm@11838
   650
    "(EX z: Sigma A B. P z) = (EX x:A. EX y: B x. P(x,y))"
wenzelm@11838
   651
  by blast
wenzelm@11838
   652
wenzelm@11838
   653
lemma Sigma_Un_distrib1: "(SIGMA i:I Un J. C(i)) = (SIGMA i:I. C(i)) Un (SIGMA j:J. C(j))"
wenzelm@11838
   654
  by blast
wenzelm@11838
   655
wenzelm@11838
   656
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
   657
  by blast
wenzelm@11838
   658
wenzelm@11838
   659
lemma Sigma_Int_distrib1: "(SIGMA i:I Int J. C(i)) = (SIGMA i:I. C(i)) Int (SIGMA j:J. C(j))"
wenzelm@11838
   660
  by blast
wenzelm@11838
   661
wenzelm@11838
   662
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
   663
  by blast
wenzelm@11838
   664
wenzelm@11838
   665
lemma Sigma_Diff_distrib1: "(SIGMA i:I - J. C(i)) = (SIGMA i:I. C(i)) - (SIGMA j:J. C(j))"
wenzelm@11838
   666
  by blast
wenzelm@11838
   667
wenzelm@11838
   668
lemma Sigma_Diff_distrib2: "(SIGMA i:I. A(i) - B(i)) = (SIGMA i:I. A(i)) - (SIGMA i:I. B(i))"
wenzelm@11838
   669
  by blast
wenzelm@11838
   670
wenzelm@11838
   671
lemma Sigma_Union: "Sigma (Union X) B = (UN A:X. Sigma A B)"
wenzelm@11838
   672
  by blast
wenzelm@11838
   673
wenzelm@11838
   674
text {*
wenzelm@11838
   675
  Non-dependent versions are needed to avoid the need for higher-order
wenzelm@11838
   676
  matching, especially when the rules are re-oriented.
wenzelm@11838
   677
*}
wenzelm@11838
   678
wenzelm@11838
   679
lemma Times_Un_distrib1: "(A Un B) <*> C = (A <*> C) Un (B <*> C)"
wenzelm@11838
   680
  by blast
wenzelm@11838
   681
wenzelm@11838
   682
lemma Times_Int_distrib1: "(A Int B) <*> C = (A <*> C) Int (B <*> C)"
wenzelm@11838
   683
  by blast
wenzelm@11838
   684
wenzelm@11838
   685
lemma Times_Diff_distrib1: "(A - B) <*> C = (A <*> C) - (B <*> C)"
wenzelm@11838
   686
  by blast
wenzelm@11838
   687
wenzelm@11838
   688
oheimb@11493
   689
lemma pair_imageI [intro]: "(a, b) : A ==> f a b : (%(a, b). f a b) ` A"
wenzelm@11777
   690
  apply (rule_tac x = "(a, b)" in image_eqI)
wenzelm@11777
   691
   apply auto
wenzelm@11777
   692
  done
wenzelm@11777
   693
oheimb@11493
   694
wenzelm@11838
   695
text {*
wenzelm@11838
   696
  Setup of internal @{text split_rule}.
wenzelm@11838
   697
*}
wenzelm@11838
   698
wenzelm@11032
   699
constdefs
wenzelm@11425
   700
  internal_split :: "('a => 'b => 'c) => 'a * 'b => 'c"
wenzelm@11032
   701
  "internal_split == split"
wenzelm@11032
   702
wenzelm@11032
   703
lemma internal_split_conv: "internal_split c (a, b) = c a b"
wenzelm@11032
   704
  by (simp only: internal_split_def split_conv)
wenzelm@11032
   705
wenzelm@11032
   706
hide const internal_split
wenzelm@11032
   707
oheimb@11025
   708
use "Tools/split_rule.ML"
wenzelm@11032
   709
setup SplitRule.setup
nipkow@10213
   710
nipkow@10213
   711
end