src/HOL/Algebra/FiniteProduct.thy
author berghofe
Wed Jul 11 11:14:51 2007 +0200 (2007-07-11)
changeset 23746 a455e69c31cc
parent 23350 50c5b0912a0c
child 27699 489e3f33af0e
permissions -rw-r--r--
Adapted to new inductive definition package.
wenzelm@14706
     1
(*  Title:      HOL/Algebra/FiniteProduct.thy
ballarin@13936
     2
    ID:         $Id$
ballarin@13936
     3
    Author:     Clemens Ballarin, started 19 November 2002
ballarin@13936
     4
ballarin@13936
     5
This file is largely based on HOL/Finite_Set.thy.
ballarin@13936
     6
*)
ballarin@13936
     7
ballarin@20318
     8
theory FiniteProduct imports Group begin
ballarin@20318
     9
ballarin@13936
    10
ballarin@20318
    11
section {* Product Operator for Commutative Monoids *}
ballarin@20318
    12
ballarin@20318
    13
ballarin@20318
    14
subsection {* Inductive Definition of a Relation for Products over Sets *}
ballarin@13936
    15
paulson@14750
    16
text {* Instantiation of locale @{text LC} of theory @{text Finite_Set} is not
paulson@14750
    17
  possible, because here we have explicit typing rules like 
paulson@14750
    18
  @{text "x \<in> carrier G"}.  We introduce an explicit argument for the domain
wenzelm@14651
    19
  @{text D}. *}
ballarin@13936
    20
berghofe@23746
    21
inductive_set
ballarin@13936
    22
  foldSetD :: "['a set, 'b => 'a => 'a, 'a] => ('b set * 'a) set"
berghofe@23746
    23
  for D :: "'a set" and f :: "'b => 'a => 'a" and e :: 'a
berghofe@23746
    24
  where
paulson@14750
    25
    emptyI [intro]: "e \<in> D ==> ({}, e) \<in> foldSetD D f e"
berghofe@23746
    26
  | insertI [intro]: "[| x ~: A; f x y \<in> D; (A, y) \<in> foldSetD D f e |] ==>
paulson@14750
    27
                      (insert x A, f x y) \<in> foldSetD D f e"
ballarin@13936
    28
paulson@14750
    29
inductive_cases empty_foldSetDE [elim!]: "({}, x) \<in> foldSetD D f e"
ballarin@13936
    30
ballarin@13936
    31
constdefs
ballarin@13936
    32
  foldD :: "['a set, 'b => 'a => 'a, 'a, 'b set] => 'a"
paulson@14750
    33
  "foldD D f e A == THE x. (A, x) \<in> foldSetD D f e"
ballarin@13936
    34
ballarin@13936
    35
lemma foldSetD_closed:
paulson@14750
    36
  "[| (A, z) \<in> foldSetD D f e ; e \<in> D; !!x y. [| x \<in> A; y \<in> D |] ==> f x y \<in> D 
paulson@14750
    37
      |] ==> z \<in> D";
berghofe@23746
    38
  by (erule foldSetD.cases) auto
ballarin@13936
    39
ballarin@13936
    40
lemma Diff1_foldSetD:
paulson@14750
    41
  "[| (A - {x}, y) \<in> foldSetD D f e; x \<in> A; f x y \<in> D |] ==>
paulson@14750
    42
   (A, f x y) \<in> foldSetD D f e"
ballarin@13936
    43
  apply (erule insert_Diff [THEN subst], rule foldSetD.intros)
ballarin@13936
    44
    apply auto
ballarin@13936
    45
  done
ballarin@13936
    46
paulson@14750
    47
lemma foldSetD_imp_finite [simp]: "(A, x) \<in> foldSetD D f e ==> finite A"
ballarin@13936
    48
  by (induct set: foldSetD) auto
ballarin@13936
    49
ballarin@13936
    50
lemma finite_imp_foldSetD:
paulson@14750
    51
  "[| finite A; e \<in> D; !!x y. [| x \<in> A; y \<in> D |] ==> f x y \<in> D |] ==>
paulson@14750
    52
   EX x. (A, x) \<in> foldSetD D f e"
berghofe@22265
    53
proof (induct set: finite)
ballarin@13936
    54
  case empty then show ?case by auto
ballarin@13936
    55
next
nipkow@15328
    56
  case (insert x F)
paulson@14750
    57
  then obtain y where y: "(F, y) \<in> foldSetD D f e" by auto
paulson@14750
    58
  with insert have "y \<in> D" by (auto dest: foldSetD_closed)
paulson@14750
    59
  with y and insert have "(insert x F, f x y) \<in> foldSetD D f e"
ballarin@13936
    60
    by (intro foldSetD.intros) auto
ballarin@13936
    61
  then show ?case ..
ballarin@13936
    62
qed
ballarin@13936
    63
ballarin@20318
    64
ballarin@20318
    65
subsection {* Left-Commutative Operations *}
ballarin@13936
    66
ballarin@13936
    67
locale LCD =
ballarin@13936
    68
  fixes B :: "'b set"
ballarin@13936
    69
  and D :: "'a set"
ballarin@13936
    70
  and f :: "'b => 'a => 'a"    (infixl "\<cdot>" 70)
ballarin@13936
    71
  assumes left_commute:
paulson@14750
    72
    "[| x \<in> B; y \<in> B; z \<in> D |] ==> x \<cdot> (y \<cdot> z) = y \<cdot> (x \<cdot> z)"
paulson@14750
    73
  and f_closed [simp, intro!]: "!!x y. [| x \<in> B; y \<in> D |] ==> f x y \<in> D"
ballarin@13936
    74
ballarin@13936
    75
lemma (in LCD) foldSetD_closed [dest]:
paulson@14750
    76
  "(A, z) \<in> foldSetD D f e ==> z \<in> D";
berghofe@23746
    77
  by (erule foldSetD.cases) auto
ballarin@13936
    78
ballarin@13936
    79
lemma (in LCD) Diff1_foldSetD:
paulson@14750
    80
  "[| (A - {x}, y) \<in> foldSetD D f e; x \<in> A; A \<subseteq> B |] ==>
paulson@14750
    81
  (A, f x y) \<in> foldSetD D f e"
paulson@14750
    82
  apply (subgoal_tac "x \<in> B")
ballarin@13936
    83
   prefer 2 apply fast
ballarin@13936
    84
  apply (erule insert_Diff [THEN subst], rule foldSetD.intros)
ballarin@13936
    85
    apply auto
ballarin@13936
    86
  done
ballarin@13936
    87
ballarin@13936
    88
lemma (in LCD) foldSetD_imp_finite [simp]:
paulson@14750
    89
  "(A, x) \<in> foldSetD D f e ==> finite A"
ballarin@13936
    90
  by (induct set: foldSetD) auto
ballarin@13936
    91
ballarin@13936
    92
lemma (in LCD) finite_imp_foldSetD:
paulson@14750
    93
  "[| finite A; A \<subseteq> B; e \<in> D |] ==> EX x. (A, x) \<in> foldSetD D f e"
berghofe@22265
    94
proof (induct set: finite)
ballarin@13936
    95
  case empty then show ?case by auto
ballarin@13936
    96
next
nipkow@15328
    97
  case (insert x F)
paulson@14750
    98
  then obtain y where y: "(F, y) \<in> foldSetD D f e" by auto
paulson@14750
    99
  with insert have "y \<in> D" by auto
paulson@14750
   100
  with y and insert have "(insert x F, f x y) \<in> foldSetD D f e"
ballarin@13936
   101
    by (intro foldSetD.intros) auto
ballarin@13936
   102
  then show ?case ..
ballarin@13936
   103
qed
ballarin@13936
   104
ballarin@13936
   105
lemma (in LCD) foldSetD_determ_aux:
paulson@14750
   106
  "e \<in> D ==> \<forall>A x. A \<subseteq> B & card A < n --> (A, x) \<in> foldSetD D f e -->
paulson@14750
   107
    (\<forall>y. (A, y) \<in> foldSetD D f e --> y = x)"
ballarin@13936
   108
  apply (induct n)
ballarin@13936
   109
   apply (auto simp add: less_Suc_eq) (* slow *)
ballarin@13936
   110
  apply (erule foldSetD.cases)
ballarin@13936
   111
   apply blast
ballarin@13936
   112
  apply (erule foldSetD.cases)
ballarin@13936
   113
   apply blast
ballarin@13936
   114
  apply clarify
ballarin@13936
   115
  txt {* force simplification of @{text "card A < card (insert ...)"}. *}
ballarin@13936
   116
  apply (erule rev_mp)
ballarin@13936
   117
  apply (simp add: less_Suc_eq_le)
ballarin@13936
   118
  apply (rule impI)
berghofe@23746
   119
  apply (rename_tac xa Aa ya xb Ab yb, case_tac "xa = xb")
ballarin@13936
   120
   apply (subgoal_tac "Aa = Ab")
ballarin@13936
   121
    prefer 2 apply (blast elim!: equalityE)
ballarin@13936
   122
   apply blast
ballarin@13936
   123
  txt {* case @{prop "xa \<notin> xb"}. *}
paulson@14750
   124
  apply (subgoal_tac "Aa - {xb} = Ab - {xa} & xb \<in> Aa & xa \<in> Ab")
ballarin@13936
   125
   prefer 2 apply (blast elim!: equalityE)
ballarin@13936
   126
  apply clarify
ballarin@13936
   127
  apply (subgoal_tac "Aa = insert xb Ab - {xa}")
ballarin@13936
   128
   prefer 2 apply blast
paulson@14750
   129
  apply (subgoal_tac "card Aa \<le> card Ab")
ballarin@13936
   130
   prefer 2
ballarin@13936
   131
   apply (rule Suc_le_mono [THEN subst])
ballarin@13936
   132
   apply (simp add: card_Suc_Diff1)
ballarin@13936
   133
  apply (rule_tac A1 = "Aa - {xb}" in finite_imp_foldSetD [THEN exE])
ballarin@13936
   134
     apply (blast intro: foldSetD_imp_finite finite_Diff)
ballarin@13936
   135
    apply best
ballarin@13936
   136
   apply assumption
ballarin@13936
   137
  apply (frule (1) Diff1_foldSetD)
ballarin@13936
   138
   apply best
ballarin@13936
   139
  apply (subgoal_tac "ya = f xb x")
ballarin@13936
   140
   prefer 2
paulson@14750
   141
   apply (subgoal_tac "Aa \<subseteq> B")
ballarin@13936
   142
    prefer 2 apply best (* slow *)
ballarin@13936
   143
   apply (blast del: equalityCE)
paulson@14750
   144
  apply (subgoal_tac "(Ab - {xa}, x) \<in> foldSetD D f e")
ballarin@13936
   145
   prefer 2 apply simp
ballarin@13936
   146
  apply (subgoal_tac "yb = f xa x")
ballarin@13936
   147
   prefer 2 
ballarin@13936
   148
   apply (blast del: equalityCE dest: Diff1_foldSetD)
ballarin@13936
   149
  apply (simp (no_asm_simp))
ballarin@13936
   150
  apply (rule left_commute)
ballarin@13936
   151
    apply assumption
ballarin@13936
   152
   apply best (* slow *)
ballarin@13936
   153
  apply best
ballarin@13936
   154
  done
ballarin@13936
   155
ballarin@13936
   156
lemma (in LCD) foldSetD_determ:
paulson@14750
   157
  "[| (A, x) \<in> foldSetD D f e; (A, y) \<in> foldSetD D f e; e \<in> D; A \<subseteq> B |]
ballarin@13936
   158
  ==> y = x"
ballarin@13936
   159
  by (blast intro: foldSetD_determ_aux [rule_format])
ballarin@13936
   160
ballarin@13936
   161
lemma (in LCD) foldD_equality:
paulson@14750
   162
  "[| (A, y) \<in> foldSetD D f e; e \<in> D; A \<subseteq> B |] ==> foldD D f e A = y"
ballarin@13936
   163
  by (unfold foldD_def) (blast intro: foldSetD_determ)
ballarin@13936
   164
ballarin@13936
   165
lemma foldD_empty [simp]:
paulson@14750
   166
  "e \<in> D ==> foldD D f e {} = e"
ballarin@13936
   167
  by (unfold foldD_def) blast
ballarin@13936
   168
ballarin@13936
   169
lemma (in LCD) foldD_insert_aux:
paulson@14750
   170
  "[| x ~: A; x \<in> B; e \<in> D; A \<subseteq> B |] ==>
paulson@14750
   171
    ((insert x A, v) \<in> foldSetD D f e) =
paulson@14750
   172
    (EX y. (A, y) \<in> foldSetD D f e & v = f x y)"
ballarin@13936
   173
  apply auto
ballarin@13936
   174
  apply (rule_tac A1 = A in finite_imp_foldSetD [THEN exE])
ballarin@13936
   175
     apply (fastsimp dest: foldSetD_imp_finite)
ballarin@13936
   176
    apply assumption
ballarin@13936
   177
   apply assumption
ballarin@13936
   178
  apply (blast intro: foldSetD_determ)
ballarin@13936
   179
  done
ballarin@13936
   180
ballarin@13936
   181
lemma (in LCD) foldD_insert:
paulson@14750
   182
    "[| finite A; x ~: A; x \<in> B; e \<in> D; A \<subseteq> B |] ==>
ballarin@13936
   183
     foldD D f e (insert x A) = f x (foldD D f e A)"
ballarin@13936
   184
  apply (unfold foldD_def)
ballarin@13936
   185
  apply (simp add: foldD_insert_aux)
ballarin@13936
   186
  apply (rule the_equality)
ballarin@13936
   187
   apply (auto intro: finite_imp_foldSetD
ballarin@13936
   188
     cong add: conj_cong simp add: foldD_def [symmetric] foldD_equality)
ballarin@13936
   189
  done
ballarin@13936
   190
ballarin@13936
   191
lemma (in LCD) foldD_closed [simp]:
paulson@14750
   192
  "[| finite A; e \<in> D; A \<subseteq> B |] ==> foldD D f e A \<in> D"
berghofe@22265
   193
proof (induct set: finite)
ballarin@13936
   194
  case empty then show ?case by (simp add: foldD_empty)
ballarin@13936
   195
next
ballarin@13936
   196
  case insert then show ?case by (simp add: foldD_insert)
ballarin@13936
   197
qed
ballarin@13936
   198
ballarin@13936
   199
lemma (in LCD) foldD_commute:
paulson@14750
   200
  "[| finite A; x \<in> B; e \<in> D; A \<subseteq> B |] ==>
ballarin@13936
   201
   f x (foldD D f e A) = foldD D f (f x e) A"
berghofe@22265
   202
  apply (induct set: finite)
ballarin@13936
   203
   apply simp
ballarin@13936
   204
  apply (auto simp add: left_commute foldD_insert)
ballarin@13936
   205
  done
ballarin@13936
   206
ballarin@13936
   207
lemma Int_mono2:
paulson@14750
   208
  "[| A \<subseteq> C; B \<subseteq> C |] ==> A Int B \<subseteq> C"
ballarin@13936
   209
  by blast
ballarin@13936
   210
ballarin@13936
   211
lemma (in LCD) foldD_nest_Un_Int:
paulson@14750
   212
  "[| finite A; finite C; e \<in> D; A \<subseteq> B; C \<subseteq> B |] ==>
ballarin@13936
   213
   foldD D f (foldD D f e C) A = foldD D f (foldD D f e (A Int C)) (A Un C)"
berghofe@22265
   214
  apply (induct set: finite)
ballarin@13936
   215
   apply simp
ballarin@13936
   216
  apply (simp add: foldD_insert foldD_commute Int_insert_left insert_absorb
ballarin@13936
   217
    Int_mono2 Un_subset_iff)
ballarin@13936
   218
  done
ballarin@13936
   219
ballarin@13936
   220
lemma (in LCD) foldD_nest_Un_disjoint:
paulson@14750
   221
  "[| finite A; finite B; A Int B = {}; e \<in> D; A \<subseteq> B; C \<subseteq> B |]
ballarin@13936
   222
    ==> foldD D f e (A Un B) = foldD D f (foldD D f e B) A"
ballarin@13936
   223
  by (simp add: foldD_nest_Un_Int)
ballarin@13936
   224
ballarin@13936
   225
-- {* Delete rules to do with @{text foldSetD} relation. *}
ballarin@13936
   226
ballarin@13936
   227
declare foldSetD_imp_finite [simp del]
ballarin@13936
   228
  empty_foldSetDE [rule del]
ballarin@13936
   229
  foldSetD.intros [rule del]
ballarin@13936
   230
declare (in LCD)
ballarin@13936
   231
  foldSetD_closed [rule del]
ballarin@13936
   232
ballarin@20318
   233
ballarin@20318
   234
subsection {* Commutative Monoids *}
ballarin@13936
   235
ballarin@13936
   236
text {*
ballarin@13936
   237
  We enter a more restrictive context, with @{text "f :: 'a => 'a => 'a"}
ballarin@13936
   238
  instead of @{text "'b => 'a => 'a"}.
ballarin@13936
   239
*}
ballarin@13936
   240
ballarin@13936
   241
locale ACeD =
ballarin@13936
   242
  fixes D :: "'a set"
ballarin@13936
   243
    and f :: "'a => 'a => 'a"    (infixl "\<cdot>" 70)
ballarin@13936
   244
    and e :: 'a
paulson@14750
   245
  assumes ident [simp]: "x \<in> D ==> x \<cdot> e = x"
paulson@14750
   246
    and commute: "[| x \<in> D; y \<in> D |] ==> x \<cdot> y = y \<cdot> x"
paulson@14750
   247
    and assoc: "[| x \<in> D; y \<in> D; z \<in> D |] ==> (x \<cdot> y) \<cdot> z = x \<cdot> (y \<cdot> z)"
paulson@14750
   248
    and e_closed [simp]: "e \<in> D"
paulson@14750
   249
    and f_closed [simp]: "[| x \<in> D; y \<in> D |] ==> x \<cdot> y \<in> D"
ballarin@13936
   250
ballarin@13936
   251
lemma (in ACeD) left_commute:
paulson@14750
   252
  "[| x \<in> D; y \<in> D; z \<in> D |] ==> x \<cdot> (y \<cdot> z) = y \<cdot> (x \<cdot> z)"
ballarin@13936
   253
proof -
paulson@14750
   254
  assume D: "x \<in> D" "y \<in> D" "z \<in> D"
ballarin@13936
   255
  then have "x \<cdot> (y \<cdot> z) = (y \<cdot> z) \<cdot> x" by (simp add: commute)
ballarin@13936
   256
  also from D have "... = y \<cdot> (z \<cdot> x)" by (simp add: assoc)
ballarin@13936
   257
  also from D have "z \<cdot> x = x \<cdot> z" by (simp add: commute)
ballarin@13936
   258
  finally show ?thesis .
ballarin@13936
   259
qed
ballarin@13936
   260
ballarin@13936
   261
lemmas (in ACeD) AC = assoc commute left_commute
ballarin@13936
   262
paulson@14750
   263
lemma (in ACeD) left_ident [simp]: "x \<in> D ==> e \<cdot> x = x"
ballarin@13936
   264
proof -
wenzelm@23350
   265
  assume "x \<in> D"
wenzelm@23350
   266
  then have "x \<cdot> e = x" by (rule ident)
wenzelm@23350
   267
  with `x \<in> D` show ?thesis by (simp add: commute)
ballarin@13936
   268
qed
ballarin@13936
   269
ballarin@13936
   270
lemma (in ACeD) foldD_Un_Int:
paulson@14750
   271
  "[| finite A; finite B; A \<subseteq> D; B \<subseteq> D |] ==>
ballarin@13936
   272
    foldD D f e A \<cdot> foldD D f e B =
ballarin@13936
   273
    foldD D f e (A Un B) \<cdot> foldD D f e (A Int B)"
berghofe@22265
   274
  apply (induct set: finite)
ballarin@13936
   275
   apply (simp add: left_commute LCD.foldD_closed [OF LCD.intro [of D]])
ballarin@13936
   276
  apply (simp add: AC insert_absorb Int_insert_left
ballarin@13936
   277
    LCD.foldD_insert [OF LCD.intro [of D]]
ballarin@13936
   278
    LCD.foldD_closed [OF LCD.intro [of D]]
ballarin@13936
   279
    Int_mono2 Un_subset_iff)
ballarin@13936
   280
  done
ballarin@13936
   281
ballarin@13936
   282
lemma (in ACeD) foldD_Un_disjoint:
paulson@14750
   283
  "[| finite A; finite B; A Int B = {}; A \<subseteq> D; B \<subseteq> D |] ==>
ballarin@13936
   284
    foldD D f e (A Un B) = foldD D f e A \<cdot> foldD D f e B"
ballarin@13936
   285
  by (simp add: foldD_Un_Int
ballarin@13936
   286
    left_commute LCD.foldD_closed [OF LCD.intro [of D]] Un_subset_iff)
ballarin@13936
   287
ballarin@20318
   288
ballarin@13936
   289
subsection {* Products over Finite Sets *}
ballarin@13936
   290
wenzelm@14651
   291
constdefs (structure G)
ballarin@15095
   292
  finprod :: "[('b, 'm) monoid_scheme, 'a => 'b, 'a set] => 'b"
ballarin@13936
   293
  "finprod G f A == if finite A
wenzelm@14651
   294
      then foldD (carrier G) (mult G o f) \<one> A
ballarin@13936
   295
      else arbitrary"
ballarin@13936
   296
wenzelm@14651
   297
syntax
wenzelm@14651
   298
  "_finprod" :: "index => idt => 'a set => 'b => 'b"
wenzelm@14666
   299
      ("(3\<Otimes>__:_. _)" [1000, 0, 51, 10] 10)
wenzelm@14651
   300
syntax (xsymbols)
wenzelm@14651
   301
  "_finprod" :: "index => idt => 'a set => 'b => 'b"
wenzelm@14666
   302
      ("(3\<Otimes>__\<in>_. _)" [1000, 0, 51, 10] 10)
wenzelm@14651
   303
syntax (HTML output)
wenzelm@14651
   304
  "_finprod" :: "index => idt => 'a set => 'b => 'b"
wenzelm@14666
   305
      ("(3\<Otimes>__\<in>_. _)" [1000, 0, 51, 10] 10)
wenzelm@14651
   306
translations
ballarin@15095
   307
  "\<Otimes>\<index>i:A. b" == "finprod \<struct>\<index> (%i. b) A"
ballarin@15095
   308
  -- {* Beware of argument permutation! *}
ballarin@13936
   309
ballarin@13936
   310
lemma (in comm_monoid) finprod_empty [simp]: 
ballarin@13936
   311
  "finprod G f {} = \<one>"
ballarin@13936
   312
  by (simp add: finprod_def)
ballarin@13936
   313
ballarin@13936
   314
declare funcsetI [intro]
ballarin@13936
   315
  funcset_mem [dest]
ballarin@13936
   316
ballarin@13936
   317
lemma (in comm_monoid) finprod_insert [simp]:
ballarin@13936
   318
  "[| finite F; a \<notin> F; f \<in> F -> carrier G; f a \<in> carrier G |] ==>
ballarin@13936
   319
   finprod G f (insert a F) = f a \<otimes> finprod G f F"
ballarin@13936
   320
  apply (rule trans)
ballarin@13936
   321
   apply (simp add: finprod_def)
ballarin@13936
   322
  apply (rule trans)
ballarin@13936
   323
   apply (rule LCD.foldD_insert [OF LCD.intro [of "insert a F"]])
ballarin@13936
   324
         apply simp
ballarin@13936
   325
         apply (rule m_lcomm)
ballarin@13936
   326
           apply fast
ballarin@13936
   327
          apply fast
ballarin@13936
   328
         apply assumption
ballarin@13936
   329
        apply (fastsimp intro: m_closed)
ballarin@13936
   330
       apply simp+
ballarin@13936
   331
   apply fast
ballarin@13936
   332
  apply (auto simp add: finprod_def)
ballarin@13936
   333
  done
ballarin@13936
   334
ballarin@13936
   335
lemma (in comm_monoid) finprod_one [simp]:
wenzelm@14651
   336
  "finite A ==> (\<Otimes>i:A. \<one>) = \<one>"
berghofe@22265
   337
proof (induct set: finite)
ballarin@13936
   338
  case empty show ?case by simp
ballarin@13936
   339
next
nipkow@15328
   340
  case (insert a A)
ballarin@13936
   341
  have "(%i. \<one>) \<in> A -> carrier G" by auto
ballarin@13936
   342
  with insert show ?case by simp
ballarin@13936
   343
qed
ballarin@13936
   344
ballarin@13936
   345
lemma (in comm_monoid) finprod_closed [simp]:
ballarin@13936
   346
  fixes A
ballarin@13936
   347
  assumes fin: "finite A" and f: "f \<in> A -> carrier G" 
ballarin@13936
   348
  shows "finprod G f A \<in> carrier G"
ballarin@13936
   349
using fin f
ballarin@13936
   350
proof induct
ballarin@13936
   351
  case empty show ?case by simp
ballarin@13936
   352
next
nipkow@15328
   353
  case (insert a A)
ballarin@13936
   354
  then have a: "f a \<in> carrier G" by fast
ballarin@13936
   355
  from insert have A: "f \<in> A -> carrier G" by fast
ballarin@13936
   356
  from insert A a show ?case by simp
ballarin@13936
   357
qed
ballarin@13936
   358
ballarin@13936
   359
lemma funcset_Int_left [simp, intro]:
ballarin@13936
   360
  "[| f \<in> A -> C; f \<in> B -> C |] ==> f \<in> A Int B -> C"
ballarin@13936
   361
  by fast
ballarin@13936
   362
ballarin@13936
   363
lemma funcset_Un_left [iff]:
ballarin@13936
   364
  "(f \<in> A Un B -> C) = (f \<in> A -> C & f \<in> B -> C)"
ballarin@13936
   365
  by fast
ballarin@13936
   366
ballarin@13936
   367
lemma (in comm_monoid) finprod_Un_Int:
ballarin@13936
   368
  "[| finite A; finite B; g \<in> A -> carrier G; g \<in> B -> carrier G |] ==>
ballarin@13936
   369
     finprod G g (A Un B) \<otimes> finprod G g (A Int B) =
ballarin@13936
   370
     finprod G g A \<otimes> finprod G g B"
ballarin@13936
   371
-- {* The reversed orientation looks more natural, but LOOPS as a simprule! *}
berghofe@22265
   372
proof (induct set: finite)
ballarin@13936
   373
  case empty then show ?case by (simp add: finprod_closed)
ballarin@13936
   374
next
nipkow@15328
   375
  case (insert a A)
ballarin@13936
   376
  then have a: "g a \<in> carrier G" by fast
ballarin@13936
   377
  from insert have A: "g \<in> A -> carrier G" by fast
ballarin@13936
   378
  from insert A a show ?case
ballarin@13936
   379
    by (simp add: m_ac Int_insert_left insert_absorb finprod_closed
ballarin@13936
   380
          Int_mono2 Un_subset_iff) 
ballarin@13936
   381
qed
ballarin@13936
   382
ballarin@13936
   383
lemma (in comm_monoid) finprod_Un_disjoint:
ballarin@13936
   384
  "[| finite A; finite B; A Int B = {};
ballarin@13936
   385
      g \<in> A -> carrier G; g \<in> B -> carrier G |]
ballarin@13936
   386
   ==> finprod G g (A Un B) = finprod G g A \<otimes> finprod G g B"
ballarin@13936
   387
  apply (subst finprod_Un_Int [symmetric])
ballarin@13936
   388
      apply (auto simp add: finprod_closed)
ballarin@13936
   389
  done
ballarin@13936
   390
ballarin@13936
   391
lemma (in comm_monoid) finprod_multf:
ballarin@13936
   392
  "[| finite A; f \<in> A -> carrier G; g \<in> A -> carrier G |] ==>
ballarin@13936
   393
   finprod G (%x. f x \<otimes> g x) A = (finprod G f A \<otimes> finprod G g A)"
berghofe@22265
   394
proof (induct set: finite)
ballarin@13936
   395
  case empty show ?case by simp
ballarin@13936
   396
next
nipkow@15328
   397
  case (insert a A) then
paulson@14750
   398
  have fA: "f \<in> A -> carrier G" by fast
paulson@14750
   399
  from insert have fa: "f a \<in> carrier G" by fast
paulson@14750
   400
  from insert have gA: "g \<in> A -> carrier G" by fast
paulson@14750
   401
  from insert have ga: "g a \<in> carrier G" by fast
paulson@14750
   402
  from insert have fgA: "(%x. f x \<otimes> g x) \<in> A -> carrier G"
ballarin@13936
   403
    by (simp add: Pi_def)
ballarin@15095
   404
  show ?case
ballarin@15095
   405
    by (simp add: insert fA fa gA ga fgA m_ac)
ballarin@13936
   406
qed
ballarin@13936
   407
ballarin@13936
   408
lemma (in comm_monoid) finprod_cong':
paulson@14750
   409
  "[| A = B; g \<in> B -> carrier G;
paulson@14750
   410
      !!i. i \<in> B ==> f i = g i |] ==> finprod G f A = finprod G g B"
ballarin@13936
   411
proof -
paulson@14750
   412
  assume prems: "A = B" "g \<in> B -> carrier G"
paulson@14750
   413
    "!!i. i \<in> B ==> f i = g i"
ballarin@13936
   414
  show ?thesis
ballarin@13936
   415
  proof (cases "finite B")
ballarin@13936
   416
    case True
paulson@14750
   417
    then have "!!A. [| A = B; g \<in> B -> carrier G;
paulson@14750
   418
      !!i. i \<in> B ==> f i = g i |] ==> finprod G f A = finprod G g B"
ballarin@13936
   419
    proof induct
ballarin@13936
   420
      case empty thus ?case by simp
ballarin@13936
   421
    next
nipkow@15328
   422
      case (insert x B)
ballarin@13936
   423
      then have "finprod G f A = finprod G f (insert x B)" by simp
ballarin@13936
   424
      also from insert have "... = f x \<otimes> finprod G f B"
ballarin@13936
   425
      proof (intro finprod_insert)
wenzelm@23350
   426
	show "finite B" by fact
ballarin@13936
   427
      next
wenzelm@23350
   428
	show "x ~: B" by fact
ballarin@13936
   429
      next
ballarin@13936
   430
	assume "x ~: B" "!!i. i \<in> insert x B \<Longrightarrow> f i = g i"
ballarin@13936
   431
	  "g \<in> insert x B \<rightarrow> carrier G"
paulson@14750
   432
	thus "f \<in> B -> carrier G" by fastsimp
ballarin@13936
   433
      next
ballarin@13936
   434
	assume "x ~: B" "!!i. i \<in> insert x B \<Longrightarrow> f i = g i"
ballarin@13936
   435
	  "g \<in> insert x B \<rightarrow> carrier G"
ballarin@13936
   436
	thus "f x \<in> carrier G" by fastsimp
ballarin@13936
   437
      qed
ballarin@13936
   438
      also from insert have "... = g x \<otimes> finprod G g B" by fastsimp
ballarin@13936
   439
      also from insert have "... = finprod G g (insert x B)"
ballarin@13936
   440
      by (intro finprod_insert [THEN sym]) auto
ballarin@13936
   441
      finally show ?case .
ballarin@13936
   442
    qed
ballarin@13936
   443
    with prems show ?thesis by simp
ballarin@13936
   444
  next
ballarin@13936
   445
    case False with prems show ?thesis by (simp add: finprod_def)
ballarin@13936
   446
  qed
ballarin@13936
   447
qed
ballarin@13936
   448
ballarin@13936
   449
lemma (in comm_monoid) finprod_cong:
paulson@14750
   450
  "[| A = B; f \<in> B -> carrier G = True;
paulson@14750
   451
      !!i. i \<in> B ==> f i = g i |] ==> finprod G f A = finprod G g B"
ballarin@14213
   452
  (* This order of prems is slightly faster (3%) than the last two swapped. *)
ballarin@14213
   453
  by (rule finprod_cong') force+
ballarin@13936
   454
ballarin@13936
   455
text {*Usually, if this rule causes a failed congruence proof error,
paulson@14750
   456
  the reason is that the premise @{text "g \<in> B -> carrier G"} cannot be shown.
ballarin@13936
   457
  Adding @{thm [source] Pi_def} to the simpset is often useful.
ballarin@13936
   458
  For this reason, @{thm [source] comm_monoid.finprod_cong}
ballarin@13936
   459
  is not added to the simpset by default.
ballarin@13936
   460
*}
ballarin@13936
   461
ballarin@13936
   462
declare funcsetI [rule del]
ballarin@13936
   463
  funcset_mem [rule del]
ballarin@13936
   464
ballarin@13936
   465
lemma (in comm_monoid) finprod_0 [simp]:
paulson@14750
   466
  "f \<in> {0::nat} -> carrier G ==> finprod G f {..0} = f 0"
ballarin@13936
   467
by (simp add: Pi_def)
ballarin@13936
   468
ballarin@13936
   469
lemma (in comm_monoid) finprod_Suc [simp]:
paulson@14750
   470
  "f \<in> {..Suc n} -> carrier G ==>
ballarin@13936
   471
   finprod G f {..Suc n} = (f (Suc n) \<otimes> finprod G f {..n})"
ballarin@13936
   472
by (simp add: Pi_def atMost_Suc)
ballarin@13936
   473
ballarin@13936
   474
lemma (in comm_monoid) finprod_Suc2:
paulson@14750
   475
  "f \<in> {..Suc n} -> carrier G ==>
ballarin@13936
   476
   finprod G f {..Suc n} = (finprod G (%i. f (Suc i)) {..n} \<otimes> f 0)"
ballarin@13936
   477
proof (induct n)
ballarin@13936
   478
  case 0 thus ?case by (simp add: Pi_def)
ballarin@13936
   479
next
ballarin@13936
   480
  case Suc thus ?case by (simp add: m_assoc Pi_def)
ballarin@13936
   481
qed
ballarin@13936
   482
ballarin@13936
   483
lemma (in comm_monoid) finprod_mult [simp]:
paulson@14750
   484
  "[| f \<in> {..n} -> carrier G; g \<in> {..n} -> carrier G |] ==>
ballarin@13936
   485
     finprod G (%i. f i \<otimes> g i) {..n::nat} =
ballarin@13936
   486
     finprod G f {..n} \<otimes> finprod G g {..n}"
ballarin@13936
   487
  by (induct n) (simp_all add: m_ac Pi_def)
ballarin@13936
   488
ballarin@13936
   489
end
ballarin@13936
   490