src/HOL/Algebra/Ring.thy
author wenzelm
Mon Feb 27 21:07:00 2012 +0100 (2012-02-27)
changeset 46721 f88b187ad8ca
parent 44677 3fb27b19e058
child 47409 c5be1120980d
permissions -rw-r--r--
tuned proofs;
wenzelm@41959
     1
(*  Title:      HOL/Algebra/Ring.thy
wenzelm@35849
     2
    Author:     Clemens Ballarin, started 9 December 1996
wenzelm@35849
     3
    Copyright:  Clemens Ballarin
ballarin@20318
     4
*)
ballarin@20318
     5
haftmann@28823
     6
theory Ring
haftmann@28823
     7
imports FiniteProduct
wenzelm@35847
     8
uses ("ringsimp.ML")
wenzelm@35847
     9
begin
ballarin@20318
    10
ballarin@27717
    11
section {* The Algebraic Hierarchy of Rings *}
ballarin@27717
    12
ballarin@27717
    13
subsection {* Abelian Groups *}
ballarin@20318
    14
ballarin@20318
    15
record 'a ring = "'a monoid" +
ballarin@20318
    16
  zero :: 'a ("\<zero>\<index>")
ballarin@20318
    17
  add :: "['a, 'a] => 'a" (infixl "\<oplus>\<index>" 65)
ballarin@20318
    18
ballarin@20318
    19
text {* Derived operations. *}
ballarin@20318
    20
wenzelm@35847
    21
definition
ballarin@20318
    22
  a_inv :: "[('a, 'm) ring_scheme, 'a ] => 'a" ("\<ominus>\<index> _" [81] 80)
wenzelm@35848
    23
  where "a_inv R = m_inv (| carrier = carrier R, mult = add R, one = zero R |)"
ballarin@20318
    24
wenzelm@35847
    25
definition
ballarin@20318
    26
  a_minus :: "[('a, 'm) ring_scheme, 'a, 'a] => 'a" (infixl "\<ominus>\<index>" 65)
wenzelm@35848
    27
  where "[| x \<in> carrier R; y \<in> carrier R |] ==> x \<ominus>\<^bsub>R\<^esub> y = x \<oplus>\<^bsub>R\<^esub> (\<ominus>\<^bsub>R\<^esub> y)"
ballarin@20318
    28
ballarin@20318
    29
locale abelian_monoid =
ballarin@20318
    30
  fixes G (structure)
ballarin@20318
    31
  assumes a_comm_monoid:
ballarin@20318
    32
     "comm_monoid (| carrier = carrier G, mult = add G, one = zero G |)"
ballarin@20318
    33
ballarin@41433
    34
definition
ballarin@41433
    35
  finsum :: "[('b, 'm) ring_scheme, 'a => 'b, 'a set] => 'b" where
ballarin@41433
    36
  "finsum G = finprod (| carrier = carrier G, mult = add G, one = zero G |)"
ballarin@20318
    37
ballarin@41433
    38
syntax
ballarin@41433
    39
  "_finsum" :: "index => idt => 'a set => 'b => 'b"
ballarin@41433
    40
      ("(3\<Oplus>__:_. _)" [1000, 0, 51, 10] 10)
ballarin@41433
    41
syntax (xsymbols)
ballarin@41433
    42
  "_finsum" :: "index => idt => 'a set => 'b => 'b"
ballarin@41433
    43
      ("(3\<Oplus>__\<in>_. _)" [1000, 0, 51, 10] 10)
ballarin@41433
    44
syntax (HTML output)
ballarin@41433
    45
  "_finsum" :: "index => idt => 'a set => 'b => 'b"
ballarin@41433
    46
      ("(3\<Oplus>__\<in>_. _)" [1000, 0, 51, 10] 10)
ballarin@41433
    47
translations
ballarin@41433
    48
  "\<Oplus>\<index>i:A. b" == "CONST finsum \<struct>\<index> (%i. b) A"
ballarin@41433
    49
  -- {* Beware of argument permutation! *}
ballarin@41433
    50
ballarin@20318
    51
ballarin@20318
    52
locale abelian_group = abelian_monoid +
ballarin@20318
    53
  assumes a_comm_group:
ballarin@20318
    54
     "comm_group (| carrier = carrier G, mult = add G, one = zero G |)"
ballarin@20318
    55
ballarin@20318
    56
ballarin@20318
    57
subsection {* Basic Properties *}
ballarin@20318
    58
ballarin@20318
    59
lemma abelian_monoidI:
ballarin@20318
    60
  fixes R (structure)
ballarin@20318
    61
  assumes a_closed:
ballarin@20318
    62
      "!!x y. [| x \<in> carrier R; y \<in> carrier R |] ==> x \<oplus> y \<in> carrier R"
ballarin@20318
    63
    and zero_closed: "\<zero> \<in> carrier R"
ballarin@20318
    64
    and a_assoc:
ballarin@20318
    65
      "!!x y z. [| x \<in> carrier R; y \<in> carrier R; z \<in> carrier R |] ==>
ballarin@20318
    66
      (x \<oplus> y) \<oplus> z = x \<oplus> (y \<oplus> z)"
ballarin@20318
    67
    and l_zero: "!!x. x \<in> carrier R ==> \<zero> \<oplus> x = x"
ballarin@20318
    68
    and a_comm:
ballarin@20318
    69
      "!!x y. [| x \<in> carrier R; y \<in> carrier R |] ==> x \<oplus> y = y \<oplus> x"
ballarin@20318
    70
  shows "abelian_monoid R"
ballarin@27714
    71
  by (auto intro!: abelian_monoid.intro comm_monoidI intro: assms)
ballarin@20318
    72
ballarin@20318
    73
lemma abelian_groupI:
ballarin@20318
    74
  fixes R (structure)
ballarin@20318
    75
  assumes a_closed:
ballarin@20318
    76
      "!!x y. [| x \<in> carrier R; y \<in> carrier R |] ==> x \<oplus> y \<in> carrier R"
ballarin@20318
    77
    and zero_closed: "zero R \<in> carrier R"
ballarin@20318
    78
    and a_assoc:
ballarin@20318
    79
      "!!x y z. [| x \<in> carrier R; y \<in> carrier R; z \<in> carrier R |] ==>
ballarin@20318
    80
      (x \<oplus> y) \<oplus> z = x \<oplus> (y \<oplus> z)"
ballarin@20318
    81
    and a_comm:
ballarin@20318
    82
      "!!x y. [| x \<in> carrier R; y \<in> carrier R |] ==> x \<oplus> y = y \<oplus> x"
ballarin@20318
    83
    and l_zero: "!!x. x \<in> carrier R ==> \<zero> \<oplus> x = x"
ballarin@20318
    84
    and l_inv_ex: "!!x. x \<in> carrier R ==> EX y : carrier R. y \<oplus> x = \<zero>"
ballarin@20318
    85
  shows "abelian_group R"
ballarin@20318
    86
  by (auto intro!: abelian_group.intro abelian_monoidI
ballarin@20318
    87
      abelian_group_axioms.intro comm_monoidI comm_groupI
ballarin@27714
    88
    intro: assms)
ballarin@20318
    89
ballarin@20318
    90
lemma (in abelian_monoid) a_monoid:
ballarin@20318
    91
  "monoid (| carrier = carrier G, mult = add G, one = zero G |)"
ballarin@20318
    92
by (rule comm_monoid.axioms, rule a_comm_monoid) 
ballarin@20318
    93
ballarin@20318
    94
lemma (in abelian_group) a_group:
ballarin@20318
    95
  "group (| carrier = carrier G, mult = add G, one = zero G |)"
ballarin@20318
    96
  by (simp add: group_def a_monoid)
ballarin@20318
    97
    (simp add: comm_group.axioms group.axioms a_comm_group)
ballarin@20318
    98
ballarin@20318
    99
lemmas monoid_record_simps = partial_object.simps monoid.simps
ballarin@20318
   100
ballarin@41433
   101
text {* Transfer facts from multiplicative structures via interpretation. *}
ballarin@20318
   102
ballarin@41433
   103
sublocale abelian_monoid <
ballarin@41433
   104
  add!: monoid "(| carrier = carrier G, mult = add G, one = zero G |)"
ballarin@41433
   105
  where "carrier (| carrier = carrier G, mult = add G, one = zero G |) = carrier G"
ballarin@41433
   106
    and "mult (| carrier = carrier G, mult = add G, one = zero G |) = add G"
ballarin@41433
   107
    and "one (| carrier = carrier G, mult = add G, one = zero G |) = zero G"
ballarin@41433
   108
  by (rule a_monoid) auto
ballarin@20318
   109
ballarin@27933
   110
context abelian_monoid begin
ballarin@27933
   111
ballarin@41433
   112
lemmas a_closed = add.m_closed 
ballarin@41433
   113
lemmas zero_closed = add.one_closed
ballarin@41433
   114
lemmas a_assoc = add.m_assoc
ballarin@41433
   115
lemmas l_zero = add.l_one
ballarin@41433
   116
lemmas r_zero = add.r_one
ballarin@41433
   117
lemmas minus_unique = add.inv_unique
ballarin@20318
   118
ballarin@41433
   119
end
ballarin@20318
   120
ballarin@41433
   121
sublocale abelian_monoid <
ballarin@41433
   122
  add!: comm_monoid "(| carrier = carrier G, mult = add G, one = zero G |)"
ballarin@41433
   123
  where "carrier (| carrier = carrier G, mult = add G, one = zero G |) = carrier G"
ballarin@41433
   124
    and "mult (| carrier = carrier G, mult = add G, one = zero G |) = add G"
ballarin@41433
   125
    and "one (| carrier = carrier G, mult = add G, one = zero G |) = zero G"
ballarin@41433
   126
    and "finprod (| carrier = carrier G, mult = add G, one = zero G |) = finsum G"
ballarin@41433
   127
  by (rule a_comm_monoid) (auto simp: finsum_def)
ballarin@20318
   128
ballarin@41433
   129
context abelian_monoid begin
ballarin@20318
   130
ballarin@41433
   131
lemmas a_comm = add.m_comm
ballarin@41433
   132
lemmas a_lcomm = add.m_lcomm
ballarin@41433
   133
lemmas a_ac = a_assoc a_comm a_lcomm
ballarin@20318
   134
ballarin@41433
   135
lemmas finsum_empty = add.finprod_empty
ballarin@41433
   136
lemmas finsum_insert = add.finprod_insert
ballarin@41433
   137
lemmas finsum_zero = add.finprod_one
ballarin@41433
   138
lemmas finsum_closed = add.finprod_closed
ballarin@41433
   139
lemmas finsum_Un_Int = add.finprod_Un_Int
ballarin@41433
   140
lemmas finsum_Un_disjoint = add.finprod_Un_disjoint
ballarin@41433
   141
lemmas finsum_addf = add.finprod_multf
ballarin@41433
   142
lemmas finsum_cong' = add.finprod_cong'
ballarin@41433
   143
lemmas finsum_0 = add.finprod_0
ballarin@41433
   144
lemmas finsum_Suc = add.finprod_Suc
ballarin@41433
   145
lemmas finsum_Suc2 = add.finprod_Suc2
ballarin@41433
   146
lemmas finsum_add = add.finprod_mult
ballarin@20318
   147
ballarin@41433
   148
lemmas finsum_cong = add.finprod_cong
ballarin@20318
   149
text {*Usually, if this rule causes a failed congruence proof error,
ballarin@20318
   150
   the reason is that the premise @{text "g \<in> B -> carrier G"} cannot be shown.
ballarin@20318
   151
   Adding @{thm [source] Pi_def} to the simpset is often useful. *}
ballarin@20318
   152
ballarin@41433
   153
lemmas finsum_reindex = add.finprod_reindex
ballarin@27699
   154
ballarin@41433
   155
(* The following would be wrong.  Needed is the equivalent of (^) for addition,
ballarin@27699
   156
  or indeed the canonical embedding from Nat into the monoid.
ballarin@27699
   157
ballarin@27933
   158
lemma finsum_const:
ballarin@27699
   159
  assumes fin [simp]: "finite A"
ballarin@27699
   160
      and a [simp]: "a : carrier G"
ballarin@27699
   161
    shows "finsum G (%x. a) A = a (^) card A"
ballarin@27699
   162
  using fin apply induct
ballarin@27699
   163
  apply force
ballarin@27699
   164
  apply (subst finsum_insert)
ballarin@27699
   165
  apply auto
ballarin@27699
   166
  apply (force simp add: Pi_def)
ballarin@27699
   167
  apply (subst m_comm)
ballarin@27699
   168
  apply auto
ballarin@27699
   169
done
ballarin@27699
   170
*)
ballarin@27699
   171
ballarin@41433
   172
lemmas finsum_singleton = add.finprod_singleton
ballarin@27933
   173
ballarin@27933
   174
end
ballarin@27933
   175
ballarin@41433
   176
sublocale abelian_group <
ballarin@41433
   177
  add!: group "(| carrier = carrier G, mult = add G, one = zero G |)"
ballarin@41433
   178
  where "carrier (| carrier = carrier G, mult = add G, one = zero G |) = carrier G"
ballarin@41433
   179
    and "mult (| carrier = carrier G, mult = add G, one = zero G |) = add G"
ballarin@41433
   180
    and "one (| carrier = carrier G, mult = add G, one = zero G |) = zero G"
ballarin@41433
   181
    and "m_inv (| carrier = carrier G, mult = add G, one = zero G |) = a_inv G"
ballarin@41433
   182
  by (rule a_group) (auto simp: m_inv_def a_inv_def)
ballarin@41433
   183
ballarin@41433
   184
context abelian_group begin
ballarin@41433
   185
ballarin@41433
   186
lemmas a_inv_closed = add.inv_closed
ballarin@41433
   187
ballarin@41433
   188
lemma minus_closed [intro, simp]:
ballarin@41433
   189
  "[| x \<in> carrier G; y \<in> carrier G |] ==> x \<ominus> y \<in> carrier G"
ballarin@41433
   190
  by (simp add: a_minus_def)
ballarin@41433
   191
ballarin@41433
   192
lemmas a_l_cancel = add.l_cancel
ballarin@41433
   193
lemmas a_r_cancel = add.r_cancel
ballarin@41433
   194
lemmas l_neg = add.l_inv [simp del]
ballarin@41433
   195
lemmas r_neg = add.r_inv [simp del]
ballarin@41433
   196
lemmas minus_zero = add.inv_one
ballarin@41433
   197
lemmas minus_minus = add.inv_inv
ballarin@41433
   198
lemmas a_inv_inj = add.inv_inj
ballarin@41433
   199
lemmas minus_equality = add.inv_equality
ballarin@41433
   200
ballarin@41433
   201
end
ballarin@41433
   202
ballarin@41433
   203
sublocale abelian_group <
ballarin@41433
   204
  add!: comm_group "(| carrier = carrier G, mult = add G, one = zero G |)"
ballarin@41433
   205
  where "carrier (| carrier = carrier G, mult = add G, one = zero G |) = carrier G"
ballarin@41433
   206
    and "mult (| carrier = carrier G, mult = add G, one = zero G |) = add G"
ballarin@41433
   207
    and "one (| carrier = carrier G, mult = add G, one = zero G |) = zero G"
ballarin@41433
   208
    and "m_inv (| carrier = carrier G, mult = add G, one = zero G |) = a_inv G"
ballarin@41433
   209
    and "finprod (| carrier = carrier G, mult = add G, one = zero G |) = finsum G"
ballarin@41433
   210
  by (rule a_comm_group) (auto simp: m_inv_def a_inv_def finsum_def)
ballarin@41433
   211
ballarin@41433
   212
lemmas (in abelian_group) minus_add = add.inv_mult
ballarin@41433
   213
 
ballarin@41433
   214
text {* Derive an @{text "abelian_group"} from a @{text "comm_group"} *}
ballarin@41433
   215
ballarin@41433
   216
lemma comm_group_abelian_groupI:
ballarin@41433
   217
  fixes G (structure)
ballarin@41433
   218
  assumes cg: "comm_group \<lparr>carrier = carrier G, mult = add G, one = zero G\<rparr>"
ballarin@41433
   219
  shows "abelian_group G"
ballarin@41433
   220
proof -
ballarin@41433
   221
  interpret comm_group "\<lparr>carrier = carrier G, mult = add G, one = zero G\<rparr>"
ballarin@41433
   222
    by (rule cg)
ballarin@41433
   223
  show "abelian_group G" ..
ballarin@41433
   224
qed
ballarin@41433
   225
ballarin@20318
   226
ballarin@27717
   227
subsection {* Rings: Basic Definitions *}
ballarin@20318
   228
ballarin@29237
   229
locale ring = abelian_group R + monoid R for R (structure) +
ballarin@20318
   230
  assumes l_distr: "[| x \<in> carrier R; y \<in> carrier R; z \<in> carrier R |]
ballarin@20318
   231
      ==> (x \<oplus> y) \<otimes> z = x \<otimes> z \<oplus> y \<otimes> z"
ballarin@20318
   232
    and r_distr: "[| x \<in> carrier R; y \<in> carrier R; z \<in> carrier R |]
ballarin@20318
   233
      ==> z \<otimes> (x \<oplus> y) = z \<otimes> x \<oplus> z \<otimes> y"
ballarin@20318
   234
ballarin@20318
   235
locale cring = ring + comm_monoid R
ballarin@20318
   236
ballarin@20318
   237
locale "domain" = cring +
ballarin@20318
   238
  assumes one_not_zero [simp]: "\<one> ~= \<zero>"
ballarin@20318
   239
    and integral: "[| a \<otimes> b = \<zero>; a \<in> carrier R; b \<in> carrier R |] ==>
ballarin@20318
   240
                  a = \<zero> | b = \<zero>"
ballarin@20318
   241
ballarin@20318
   242
locale field = "domain" +
ballarin@20318
   243
  assumes field_Units: "Units R = carrier R - {\<zero>}"
ballarin@20318
   244
ballarin@20318
   245
ballarin@20318
   246
subsection {* Rings *}
ballarin@20318
   247
ballarin@20318
   248
lemma ringI:
ballarin@20318
   249
  fixes R (structure)
ballarin@20318
   250
  assumes abelian_group: "abelian_group R"
ballarin@20318
   251
    and monoid: "monoid R"
ballarin@20318
   252
    and l_distr: "!!x y z. [| x \<in> carrier R; y \<in> carrier R; z \<in> carrier R |]
ballarin@20318
   253
      ==> (x \<oplus> y) \<otimes> z = x \<otimes> z \<oplus> y \<otimes> z"
ballarin@20318
   254
    and r_distr: "!!x y z. [| x \<in> carrier R; y \<in> carrier R; z \<in> carrier R |]
ballarin@20318
   255
      ==> z \<otimes> (x \<oplus> y) = z \<otimes> x \<oplus> z \<otimes> y"
ballarin@20318
   256
  shows "ring R"
ballarin@20318
   257
  by (auto intro: ring.intro
ballarin@27714
   258
    abelian_group.axioms ring_axioms.intro assms)
ballarin@20318
   259
ballarin@41433
   260
context ring begin
ballarin@41433
   261
wenzelm@46721
   262
lemma is_abelian_group: "abelian_group R" ..
ballarin@20318
   263
wenzelm@46721
   264
lemma is_monoid: "monoid R"
ballarin@20318
   265
  by (auto intro!: monoidI m_assoc)
ballarin@20318
   266
wenzelm@46721
   267
lemma is_ring: "ring R"
wenzelm@26202
   268
  by (rule ring_axioms)
ballarin@20318
   269
ballarin@41433
   270
end
ballarin@41433
   271
ballarin@20318
   272
lemmas ring_record_simps = monoid_record_simps ring.simps
ballarin@20318
   273
ballarin@20318
   274
lemma cringI:
ballarin@20318
   275
  fixes R (structure)
ballarin@20318
   276
  assumes abelian_group: "abelian_group R"
ballarin@20318
   277
    and comm_monoid: "comm_monoid R"
ballarin@20318
   278
    and l_distr: "!!x y z. [| x \<in> carrier R; y \<in> carrier R; z \<in> carrier R |]
ballarin@20318
   279
      ==> (x \<oplus> y) \<otimes> z = x \<otimes> z \<oplus> y \<otimes> z"
ballarin@20318
   280
  shows "cring R"
wenzelm@23350
   281
proof (intro cring.intro ring.intro)
wenzelm@23350
   282
  show "ring_axioms R"
ballarin@20318
   283
    -- {* Right-distributivity follows from left-distributivity and
ballarin@20318
   284
          commutativity. *}
wenzelm@23350
   285
  proof (rule ring_axioms.intro)
wenzelm@23350
   286
    fix x y z
wenzelm@23350
   287
    assume R: "x \<in> carrier R" "y \<in> carrier R" "z \<in> carrier R"
wenzelm@23350
   288
    note [simp] = comm_monoid.axioms [OF comm_monoid]
wenzelm@23350
   289
      abelian_group.axioms [OF abelian_group]
wenzelm@23350
   290
      abelian_monoid.a_closed
ballarin@20318
   291
        
wenzelm@23350
   292
    from R have "z \<otimes> (x \<oplus> y) = (x \<oplus> y) \<otimes> z"
wenzelm@23350
   293
      by (simp add: comm_monoid.m_comm [OF comm_monoid.intro])
wenzelm@23350
   294
    also from R have "... = x \<otimes> z \<oplus> y \<otimes> z" by (simp add: l_distr)
wenzelm@23350
   295
    also from R have "... = z \<otimes> x \<oplus> z \<otimes> y"
wenzelm@23350
   296
      by (simp add: comm_monoid.m_comm [OF comm_monoid.intro])
wenzelm@23350
   297
    finally show "z \<otimes> (x \<oplus> y) = z \<otimes> x \<oplus> z \<otimes> y" .
wenzelm@23350
   298
  qed (rule l_distr)
wenzelm@23350
   299
qed (auto intro: cring.intro
ballarin@27714
   300
  abelian_group.axioms comm_monoid.axioms ring_axioms.intro assms)
ballarin@20318
   301
ballarin@27699
   302
(*
ballarin@20318
   303
lemma (in cring) is_comm_monoid:
ballarin@20318
   304
  "comm_monoid R"
ballarin@20318
   305
  by (auto intro!: comm_monoidI m_assoc m_comm)
ballarin@27699
   306
*)
ballarin@20318
   307
ballarin@20318
   308
lemma (in cring) is_cring:
wenzelm@26202
   309
  "cring R" by (rule cring_axioms)
wenzelm@23350
   310
ballarin@20318
   311
ballarin@20318
   312
subsubsection {* Normaliser for Rings *}
ballarin@20318
   313
ballarin@20318
   314
lemma (in abelian_group) r_neg2:
ballarin@20318
   315
  "[| x \<in> carrier G; y \<in> carrier G |] ==> x \<oplus> (\<ominus> x \<oplus> y) = y"
ballarin@20318
   316
proof -
ballarin@20318
   317
  assume G: "x \<in> carrier G" "y \<in> carrier G"
ballarin@20318
   318
  then have "(x \<oplus> \<ominus> x) \<oplus> y = y"
ballarin@20318
   319
    by (simp only: r_neg l_zero)
ballarin@41433
   320
  with G show ?thesis
ballarin@20318
   321
    by (simp add: a_ac)
ballarin@20318
   322
qed
ballarin@20318
   323
ballarin@20318
   324
lemma (in abelian_group) r_neg1:
ballarin@20318
   325
  "[| x \<in> carrier G; y \<in> carrier G |] ==> \<ominus> x \<oplus> (x \<oplus> y) = y"
ballarin@20318
   326
proof -
ballarin@20318
   327
  assume G: "x \<in> carrier G" "y \<in> carrier G"
ballarin@20318
   328
  then have "(\<ominus> x \<oplus> x) \<oplus> y = y" 
ballarin@20318
   329
    by (simp only: l_neg l_zero)
ballarin@20318
   330
  with G show ?thesis by (simp add: a_ac)
ballarin@20318
   331
qed
ballarin@20318
   332
ballarin@41433
   333
context ring begin
ballarin@41433
   334
ballarin@20318
   335
text {* 
ballarin@41433
   336
  The following proofs are from Jacobson, Basic Algebra I, pp.~88--89.
ballarin@20318
   337
*}
ballarin@20318
   338
ballarin@41433
   339
lemma l_null [simp]:
ballarin@20318
   340
  "x \<in> carrier R ==> \<zero> \<otimes> x = \<zero>"
ballarin@20318
   341
proof -
ballarin@20318
   342
  assume R: "x \<in> carrier R"
ballarin@20318
   343
  then have "\<zero> \<otimes> x \<oplus> \<zero> \<otimes> x = (\<zero> \<oplus> \<zero>) \<otimes> x"
ballarin@20318
   344
    by (simp add: l_distr del: l_zero r_zero)
ballarin@20318
   345
  also from R have "... = \<zero> \<otimes> x \<oplus> \<zero>" by simp
ballarin@20318
   346
  finally have "\<zero> \<otimes> x \<oplus> \<zero> \<otimes> x = \<zero> \<otimes> x \<oplus> \<zero>" .
ballarin@20318
   347
  with R show ?thesis by (simp del: r_zero)
ballarin@20318
   348
qed
ballarin@20318
   349
ballarin@41433
   350
lemma r_null [simp]:
ballarin@20318
   351
  "x \<in> carrier R ==> x \<otimes> \<zero> = \<zero>"
ballarin@20318
   352
proof -
ballarin@20318
   353
  assume R: "x \<in> carrier R"
ballarin@20318
   354
  then have "x \<otimes> \<zero> \<oplus> x \<otimes> \<zero> = x \<otimes> (\<zero> \<oplus> \<zero>)"
ballarin@20318
   355
    by (simp add: r_distr del: l_zero r_zero)
ballarin@20318
   356
  also from R have "... = x \<otimes> \<zero> \<oplus> \<zero>" by simp
ballarin@20318
   357
  finally have "x \<otimes> \<zero> \<oplus> x \<otimes> \<zero> = x \<otimes> \<zero> \<oplus> \<zero>" .
ballarin@20318
   358
  with R show ?thesis by (simp del: r_zero)
ballarin@20318
   359
qed
ballarin@20318
   360
ballarin@41433
   361
lemma l_minus:
ballarin@20318
   362
  "[| x \<in> carrier R; y \<in> carrier R |] ==> \<ominus> x \<otimes> y = \<ominus> (x \<otimes> y)"
ballarin@20318
   363
proof -
ballarin@20318
   364
  assume R: "x \<in> carrier R" "y \<in> carrier R"
ballarin@20318
   365
  then have "(\<ominus> x) \<otimes> y \<oplus> x \<otimes> y = (\<ominus> x \<oplus> x) \<otimes> y" by (simp add: l_distr)
wenzelm@44677
   366
  also from R have "... = \<zero>" by (simp add: l_neg)
ballarin@20318
   367
  finally have "(\<ominus> x) \<otimes> y \<oplus> x \<otimes> y = \<zero>" .
ballarin@20318
   368
  with R have "(\<ominus> x) \<otimes> y \<oplus> x \<otimes> y \<oplus> \<ominus> (x \<otimes> y) = \<zero> \<oplus> \<ominus> (x \<otimes> y)" by simp
ballarin@21896
   369
  with R show ?thesis by (simp add: a_assoc r_neg)
ballarin@20318
   370
qed
ballarin@20318
   371
ballarin@41433
   372
lemma r_minus:
ballarin@20318
   373
  "[| x \<in> carrier R; y \<in> carrier R |] ==> x \<otimes> \<ominus> y = \<ominus> (x \<otimes> y)"
ballarin@20318
   374
proof -
ballarin@20318
   375
  assume R: "x \<in> carrier R" "y \<in> carrier R"
ballarin@20318
   376
  then have "x \<otimes> (\<ominus> y) \<oplus> x \<otimes> y = x \<otimes> (\<ominus> y \<oplus> y)" by (simp add: r_distr)
wenzelm@44677
   377
  also from R have "... = \<zero>" by (simp add: l_neg)
ballarin@20318
   378
  finally have "x \<otimes> (\<ominus> y) \<oplus> x \<otimes> y = \<zero>" .
ballarin@20318
   379
  with R have "x \<otimes> (\<ominus> y) \<oplus> x \<otimes> y \<oplus> \<ominus> (x \<otimes> y) = \<zero> \<oplus> \<ominus> (x \<otimes> y)" by simp
ballarin@20318
   380
  with R show ?thesis by (simp add: a_assoc r_neg )
ballarin@20318
   381
qed
ballarin@20318
   382
ballarin@41433
   383
end
ballarin@41433
   384
ballarin@23957
   385
lemma (in abelian_group) minus_eq:
ballarin@23957
   386
  "[| x \<in> carrier G; y \<in> carrier G |] ==> x \<ominus> y = x \<oplus> \<ominus> y"
ballarin@20318
   387
  by (simp only: a_minus_def)
ballarin@20318
   388
ballarin@20318
   389
text {* Setup algebra method:
ballarin@20318
   390
  compute distributive normal form in locale contexts *}
ballarin@20318
   391
ballarin@20318
   392
use "ringsimp.ML"
ballarin@20318
   393
ballarin@20318
   394
setup Algebra.setup
ballarin@20318
   395
ballarin@20318
   396
lemmas (in ring) ring_simprules
ballarin@20318
   397
  [algebra ring "zero R" "add R" "a_inv R" "a_minus R" "one R" "mult R"] =
ballarin@20318
   398
  a_closed zero_closed a_inv_closed minus_closed m_closed one_closed
ballarin@20318
   399
  a_assoc l_zero l_neg a_comm m_assoc l_one l_distr minus_eq
ballarin@20318
   400
  r_zero r_neg r_neg2 r_neg1 minus_add minus_minus minus_zero
ballarin@20318
   401
  a_lcomm r_distr l_null r_null l_minus r_minus
ballarin@20318
   402
ballarin@20318
   403
lemmas (in cring)
ballarin@20318
   404
  [algebra del: ring "zero R" "add R" "a_inv R" "a_minus R" "one R" "mult R"] =
ballarin@20318
   405
  _
ballarin@20318
   406
ballarin@20318
   407
lemmas (in cring) cring_simprules
ballarin@20318
   408
  [algebra add: cring "zero R" "add R" "a_inv R" "a_minus R" "one R" "mult R"] =
ballarin@20318
   409
  a_closed zero_closed a_inv_closed minus_closed m_closed one_closed
ballarin@20318
   410
  a_assoc l_zero l_neg a_comm m_assoc l_one l_distr m_comm minus_eq
ballarin@20318
   411
  r_zero r_neg r_neg2 r_neg1 minus_add minus_minus minus_zero
ballarin@20318
   412
  a_lcomm m_lcomm r_distr l_null r_null l_minus r_minus
ballarin@20318
   413
ballarin@20318
   414
lemma (in cring) nat_pow_zero:
ballarin@20318
   415
  "(n::nat) ~= 0 ==> \<zero> (^) n = \<zero>"
ballarin@20318
   416
  by (induct n) simp_all
ballarin@20318
   417
ballarin@41433
   418
context ring begin
ballarin@41433
   419
ballarin@41433
   420
lemma one_zeroD:
ballarin@20318
   421
  assumes onezero: "\<one> = \<zero>"
ballarin@20318
   422
  shows "carrier R = {\<zero>}"
ballarin@20318
   423
proof (rule, rule)
ballarin@20318
   424
  fix x
ballarin@20318
   425
  assume xcarr: "x \<in> carrier R"
ballarin@20318
   426
  from xcarr
ballarin@20318
   427
      have "x = x \<otimes> \<one>" by simp
ballarin@20318
   428
  from this and onezero
ballarin@20318
   429
      have "x = x \<otimes> \<zero>" by simp
ballarin@20318
   430
  from this and xcarr
ballarin@20318
   431
      have "x = \<zero>" by simp
ballarin@20318
   432
  thus "x \<in> {\<zero>}" by fast
ballarin@20318
   433
qed fast
ballarin@20318
   434
ballarin@41433
   435
lemma one_zeroI:
ballarin@20318
   436
  assumes carrzero: "carrier R = {\<zero>}"
ballarin@20318
   437
  shows "\<one> = \<zero>"
ballarin@20318
   438
proof -
ballarin@20318
   439
  from one_closed and carrzero
ballarin@20318
   440
      show "\<one> = \<zero>" by simp
ballarin@20318
   441
qed
ballarin@20318
   442
wenzelm@46721
   443
lemma carrier_one_zero: "(carrier R = {\<zero>}) = (\<one> = \<zero>)"
wenzelm@46721
   444
  apply rule
wenzelm@46721
   445
   apply (erule one_zeroI)
wenzelm@46721
   446
  apply (erule one_zeroD)
wenzelm@46721
   447
  done
ballarin@20318
   448
wenzelm@46721
   449
lemma carrier_one_not_zero: "(carrier R \<noteq> {\<zero>}) = (\<one> \<noteq> \<zero>)"
ballarin@27717
   450
  by (simp add: carrier_one_zero)
ballarin@20318
   451
ballarin@41433
   452
end
ballarin@41433
   453
ballarin@20318
   454
text {* Two examples for use of method algebra *}
ballarin@20318
   455
ballarin@20318
   456
lemma
ballarin@27611
   457
  fixes R (structure) and S (structure)
ballarin@27611
   458
  assumes "ring R" "cring S"
ballarin@27611
   459
  assumes RS: "a \<in> carrier R" "b \<in> carrier R" "c \<in> carrier S" "d \<in> carrier S"
ballarin@27611
   460
  shows "a \<oplus> \<ominus> (a \<oplus> \<ominus> b) = b & c \<otimes>\<^bsub>S\<^esub> d = d \<otimes>\<^bsub>S\<^esub> c"
ballarin@27611
   461
proof -
ballarin@29237
   462
  interpret ring R by fact
ballarin@29237
   463
  interpret cring S by fact
ballarin@27611
   464
  from RS show ?thesis by algebra
ballarin@27611
   465
qed
ballarin@20318
   466
ballarin@20318
   467
lemma
ballarin@27611
   468
  fixes R (structure)
ballarin@27611
   469
  assumes "ring R"
ballarin@27611
   470
  assumes R: "a \<in> carrier R" "b \<in> carrier R"
ballarin@27611
   471
  shows "a \<ominus> (a \<ominus> b) = b"
ballarin@27611
   472
proof -
ballarin@29237
   473
  interpret ring R by fact
ballarin@27611
   474
  from R show ?thesis by algebra
ballarin@27611
   475
qed
ballarin@20318
   476
wenzelm@35849
   477
ballarin@20318
   478
subsubsection {* Sums over Finite Sets *}
ballarin@20318
   479
ballarin@27717
   480
lemma (in ring) finsum_ldistr:
ballarin@20318
   481
  "[| finite A; a \<in> carrier R; f \<in> A -> carrier R |] ==>
ballarin@20318
   482
   finsum R f A \<otimes> a = finsum R (%i. f i \<otimes> a) A"
berghofe@22265
   483
proof (induct set: finite)
ballarin@20318
   484
  case empty then show ?case by simp
ballarin@20318
   485
next
ballarin@20318
   486
  case (insert x F) then show ?case by (simp add: Pi_def l_distr)
ballarin@20318
   487
qed
ballarin@20318
   488
ballarin@27717
   489
lemma (in ring) finsum_rdistr:
ballarin@20318
   490
  "[| finite A; a \<in> carrier R; f \<in> A -> carrier R |] ==>
ballarin@20318
   491
   a \<otimes> finsum R f A = finsum R (%i. a \<otimes> f i) A"
berghofe@22265
   492
proof (induct set: finite)
ballarin@20318
   493
  case empty then show ?case by simp
ballarin@20318
   494
next
ballarin@20318
   495
  case (insert x F) then show ?case by (simp add: Pi_def r_distr)
ballarin@20318
   496
qed
ballarin@20318
   497
ballarin@20318
   498
ballarin@20318
   499
subsection {* Integral Domains *}
ballarin@20318
   500
ballarin@41433
   501
context "domain" begin
ballarin@41433
   502
ballarin@41433
   503
lemma zero_not_one [simp]:
ballarin@20318
   504
  "\<zero> ~= \<one>"
ballarin@20318
   505
  by (rule not_sym) simp
ballarin@20318
   506
ballarin@41433
   507
lemma integral_iff: (* not by default a simp rule! *)
ballarin@20318
   508
  "[| a \<in> carrier R; b \<in> carrier R |] ==> (a \<otimes> b = \<zero>) = (a = \<zero> | b = \<zero>)"
ballarin@20318
   509
proof
ballarin@20318
   510
  assume "a \<in> carrier R" "b \<in> carrier R" "a \<otimes> b = \<zero>"
ballarin@20318
   511
  then show "a = \<zero> | b = \<zero>" by (simp add: integral)
ballarin@20318
   512
next
ballarin@20318
   513
  assume "a \<in> carrier R" "b \<in> carrier R" "a = \<zero> | b = \<zero>"
ballarin@20318
   514
  then show "a \<otimes> b = \<zero>" by auto
ballarin@20318
   515
qed
ballarin@20318
   516
ballarin@41433
   517
lemma m_lcancel:
ballarin@20318
   518
  assumes prem: "a ~= \<zero>"
ballarin@20318
   519
    and R: "a \<in> carrier R" "b \<in> carrier R" "c \<in> carrier R"
ballarin@20318
   520
  shows "(a \<otimes> b = a \<otimes> c) = (b = c)"
ballarin@20318
   521
proof
ballarin@20318
   522
  assume eq: "a \<otimes> b = a \<otimes> c"
ballarin@20318
   523
  with R have "a \<otimes> (b \<ominus> c) = \<zero>" by algebra
ballarin@20318
   524
  with R have "a = \<zero> | (b \<ominus> c) = \<zero>" by (simp add: integral_iff)
ballarin@20318
   525
  with prem and R have "b \<ominus> c = \<zero>" by auto 
ballarin@20318
   526
  with R have "b = b \<ominus> (b \<ominus> c)" by algebra 
ballarin@20318
   527
  also from R have "b \<ominus> (b \<ominus> c) = c" by algebra
ballarin@20318
   528
  finally show "b = c" .
ballarin@20318
   529
next
ballarin@20318
   530
  assume "b = c" then show "a \<otimes> b = a \<otimes> c" by simp
ballarin@20318
   531
qed
ballarin@20318
   532
ballarin@41433
   533
lemma m_rcancel:
ballarin@20318
   534
  assumes prem: "a ~= \<zero>"
ballarin@20318
   535
    and R: "a \<in> carrier R" "b \<in> carrier R" "c \<in> carrier R"
ballarin@20318
   536
  shows conc: "(b \<otimes> a = c \<otimes> a) = (b = c)"
ballarin@20318
   537
proof -
ballarin@20318
   538
  from prem and R have "(a \<otimes> b = a \<otimes> c) = (b = c)" by (rule m_lcancel)
ballarin@20318
   539
  with R show ?thesis by algebra
ballarin@20318
   540
qed
ballarin@20318
   541
ballarin@41433
   542
end
ballarin@41433
   543
ballarin@20318
   544
ballarin@20318
   545
subsection {* Fields *}
ballarin@20318
   546
ballarin@20318
   547
text {* Field would not need to be derived from domain, the properties
ballarin@20318
   548
  for domain follow from the assumptions of field *}
ballarin@20318
   549
lemma (in cring) cring_fieldI:
ballarin@20318
   550
  assumes field_Units: "Units R = carrier R - {\<zero>}"
ballarin@20318
   551
  shows "field R"
haftmann@28823
   552
proof
ballarin@20318
   553
  from field_Units
ballarin@20318
   554
  have a: "\<zero> \<notin> Units R" by fast
ballarin@20318
   555
  have "\<one> \<in> Units R" by fast
ballarin@20318
   556
  from this and a
ballarin@20318
   557
  show "\<one> \<noteq> \<zero>" by force
ballarin@20318
   558
next
ballarin@20318
   559
  fix a b
ballarin@20318
   560
  assume acarr: "a \<in> carrier R"
ballarin@20318
   561
    and bcarr: "b \<in> carrier R"
ballarin@20318
   562
    and ab: "a \<otimes> b = \<zero>"
ballarin@20318
   563
  show "a = \<zero> \<or> b = \<zero>"
ballarin@20318
   564
  proof (cases "a = \<zero>", simp)
ballarin@20318
   565
    assume "a \<noteq> \<zero>"
ballarin@20318
   566
    from this and field_Units and acarr
ballarin@20318
   567
    have aUnit: "a \<in> Units R" by fast
ballarin@20318
   568
    from bcarr
ballarin@20318
   569
    have "b = \<one> \<otimes> b" by algebra
ballarin@20318
   570
    also from aUnit acarr
wenzelm@46721
   571
    have "... = (inv a \<otimes> a) \<otimes> b" by simp
ballarin@20318
   572
    also from acarr bcarr aUnit[THEN Units_inv_closed]
ballarin@20318
   573
    have "... = (inv a) \<otimes> (a \<otimes> b)" by algebra
ballarin@20318
   574
    also from ab and acarr bcarr aUnit
ballarin@20318
   575
    have "... = (inv a) \<otimes> \<zero>" by simp
ballarin@20318
   576
    also from aUnit[THEN Units_inv_closed]
ballarin@20318
   577
    have "... = \<zero>" by algebra
ballarin@20318
   578
    finally
ballarin@20318
   579
    have "b = \<zero>" .
ballarin@20318
   580
    thus "a = \<zero> \<or> b = \<zero>" by simp
ballarin@20318
   581
  qed
wenzelm@23350
   582
qed (rule field_Units)
ballarin@20318
   583
ballarin@20318
   584
text {* Another variant to show that something is a field *}
ballarin@20318
   585
lemma (in cring) cring_fieldI2:
ballarin@20318
   586
  assumes notzero: "\<zero> \<noteq> \<one>"
ballarin@20318
   587
  and invex: "\<And>a. \<lbrakk>a \<in> carrier R; a \<noteq> \<zero>\<rbrakk> \<Longrightarrow> \<exists>b\<in>carrier R. a \<otimes> b = \<one>"
ballarin@20318
   588
  shows "field R"
ballarin@20318
   589
  apply (rule cring_fieldI, simp add: Units_def)
ballarin@20318
   590
  apply (rule, clarsimp)
ballarin@20318
   591
  apply (simp add: notzero)
ballarin@20318
   592
proof (clarsimp)
ballarin@20318
   593
  fix x
ballarin@20318
   594
  assume xcarr: "x \<in> carrier R"
ballarin@20318
   595
    and "x \<noteq> \<zero>"
ballarin@20318
   596
  from this
ballarin@20318
   597
  have "\<exists>y\<in>carrier R. x \<otimes> y = \<one>" by (rule invex)
ballarin@20318
   598
  from this
ballarin@20318
   599
  obtain y
ballarin@20318
   600
    where ycarr: "y \<in> carrier R"
ballarin@20318
   601
    and xy: "x \<otimes> y = \<one>"
ballarin@20318
   602
    by fast
ballarin@20318
   603
  from xy xcarr ycarr have "y \<otimes> x = \<one>" by (simp add: m_comm)
ballarin@20318
   604
  from ycarr and this and xy
ballarin@20318
   605
  show "\<exists>y\<in>carrier R. y \<otimes> x = \<one> \<and> x \<otimes> y = \<one>" by fast
ballarin@20318
   606
qed
ballarin@20318
   607
ballarin@20318
   608
ballarin@20318
   609
subsection {* Morphisms *}
ballarin@20318
   610
wenzelm@35847
   611
definition
ballarin@20318
   612
  ring_hom :: "[('a, 'm) ring_scheme, ('b, 'n) ring_scheme] => ('a => 'b) set"
wenzelm@35848
   613
  where "ring_hom R S =
wenzelm@35847
   614
    {h. h \<in> carrier R -> carrier S &
ballarin@20318
   615
      (ALL x y. x \<in> carrier R & y \<in> carrier R -->
wenzelm@35847
   616
        h (x \<otimes>\<^bsub>R\<^esub> y) = h x \<otimes>\<^bsub>S\<^esub> h y & h (x \<oplus>\<^bsub>R\<^esub> y) = h x \<oplus>\<^bsub>S\<^esub> h y) &
wenzelm@35847
   617
      h \<one>\<^bsub>R\<^esub> = \<one>\<^bsub>S\<^esub>}"
ballarin@20318
   618
ballarin@20318
   619
lemma ring_hom_memI:
ballarin@20318
   620
  fixes R (structure) and S (structure)
ballarin@20318
   621
  assumes hom_closed: "!!x. x \<in> carrier R ==> h x \<in> carrier S"
ballarin@20318
   622
    and hom_mult: "!!x y. [| x \<in> carrier R; y \<in> carrier R |] ==>
ballarin@20318
   623
      h (x \<otimes> y) = h x \<otimes>\<^bsub>S\<^esub> h y"
ballarin@20318
   624
    and hom_add: "!!x y. [| x \<in> carrier R; y \<in> carrier R |] ==>
ballarin@20318
   625
      h (x \<oplus> y) = h x \<oplus>\<^bsub>S\<^esub> h y"
ballarin@20318
   626
    and hom_one: "h \<one> = \<one>\<^bsub>S\<^esub>"
ballarin@20318
   627
  shows "h \<in> ring_hom R S"
ballarin@27714
   628
  by (auto simp add: ring_hom_def assms Pi_def)
ballarin@20318
   629
ballarin@20318
   630
lemma ring_hom_closed:
ballarin@20318
   631
  "[| h \<in> ring_hom R S; x \<in> carrier R |] ==> h x \<in> carrier S"
ballarin@20318
   632
  by (auto simp add: ring_hom_def funcset_mem)
ballarin@20318
   633
ballarin@20318
   634
lemma ring_hom_mult:
ballarin@20318
   635
  fixes R (structure) and S (structure)
ballarin@20318
   636
  shows
ballarin@20318
   637
    "[| h \<in> ring_hom R S; x \<in> carrier R; y \<in> carrier R |] ==>
ballarin@20318
   638
    h (x \<otimes> y) = h x \<otimes>\<^bsub>S\<^esub> h y"
ballarin@20318
   639
    by (simp add: ring_hom_def)
ballarin@20318
   640
ballarin@20318
   641
lemma ring_hom_add:
ballarin@20318
   642
  fixes R (structure) and S (structure)
ballarin@20318
   643
  shows
ballarin@20318
   644
    "[| h \<in> ring_hom R S; x \<in> carrier R; y \<in> carrier R |] ==>
ballarin@20318
   645
    h (x \<oplus> y) = h x \<oplus>\<^bsub>S\<^esub> h y"
ballarin@20318
   646
    by (simp add: ring_hom_def)
ballarin@20318
   647
ballarin@20318
   648
lemma ring_hom_one:
ballarin@20318
   649
  fixes R (structure) and S (structure)
ballarin@20318
   650
  shows "h \<in> ring_hom R S ==> h \<one> = \<one>\<^bsub>S\<^esub>"
ballarin@20318
   651
  by (simp add: ring_hom_def)
ballarin@20318
   652
ballarin@29237
   653
locale ring_hom_cring = R: cring R + S: cring S
ballarin@29237
   654
    for R (structure) and S (structure) +
ballarin@20318
   655
  fixes h
ballarin@20318
   656
  assumes homh [simp, intro]: "h \<in> ring_hom R S"
ballarin@20318
   657
  notes hom_closed [simp, intro] = ring_hom_closed [OF homh]
ballarin@20318
   658
    and hom_mult [simp] = ring_hom_mult [OF homh]
ballarin@20318
   659
    and hom_add [simp] = ring_hom_add [OF homh]
ballarin@20318
   660
    and hom_one [simp] = ring_hom_one [OF homh]
ballarin@20318
   661
ballarin@20318
   662
lemma (in ring_hom_cring) hom_zero [simp]:
ballarin@20318
   663
  "h \<zero> = \<zero>\<^bsub>S\<^esub>"
ballarin@20318
   664
proof -
ballarin@20318
   665
  have "h \<zero> \<oplus>\<^bsub>S\<^esub> h \<zero> = h \<zero> \<oplus>\<^bsub>S\<^esub> \<zero>\<^bsub>S\<^esub>"
ballarin@20318
   666
    by (simp add: hom_add [symmetric] del: hom_add)
ballarin@20318
   667
  then show ?thesis by (simp del: S.r_zero)
ballarin@20318
   668
qed
ballarin@20318
   669
ballarin@20318
   670
lemma (in ring_hom_cring) hom_a_inv [simp]:
ballarin@20318
   671
  "x \<in> carrier R ==> h (\<ominus> x) = \<ominus>\<^bsub>S\<^esub> h x"
ballarin@20318
   672
proof -
ballarin@20318
   673
  assume R: "x \<in> carrier R"
ballarin@20318
   674
  then have "h x \<oplus>\<^bsub>S\<^esub> h (\<ominus> x) = h x \<oplus>\<^bsub>S\<^esub> (\<ominus>\<^bsub>S\<^esub> h x)"
ballarin@20318
   675
    by (simp add: hom_add [symmetric] R.r_neg S.r_neg del: hom_add)
ballarin@20318
   676
  with R show ?thesis by simp
ballarin@20318
   677
qed
ballarin@20318
   678
ballarin@20318
   679
lemma (in ring_hom_cring) hom_finsum [simp]:
ballarin@20318
   680
  "[| finite A; f \<in> A -> carrier R |] ==>
ballarin@20318
   681
  h (finsum R f A) = finsum S (h o f) A"
berghofe@22265
   682
proof (induct set: finite)
ballarin@20318
   683
  case empty then show ?case by simp
ballarin@20318
   684
next
ballarin@20318
   685
  case insert then show ?case by (simp add: Pi_def)
ballarin@20318
   686
qed
ballarin@20318
   687
ballarin@20318
   688
lemma (in ring_hom_cring) hom_finprod:
ballarin@20318
   689
  "[| finite A; f \<in> A -> carrier R |] ==>
ballarin@20318
   690
  h (finprod R f A) = finprod S (h o f) A"
berghofe@22265
   691
proof (induct set: finite)
ballarin@20318
   692
  case empty then show ?case by simp
ballarin@20318
   693
next
ballarin@20318
   694
  case insert then show ?case by (simp add: Pi_def)
ballarin@20318
   695
qed
ballarin@20318
   696
ballarin@20318
   697
declare ring_hom_cring.hom_finprod [simp]
ballarin@20318
   698
ballarin@20318
   699
lemma id_ring_hom [simp]:
ballarin@20318
   700
  "id \<in> ring_hom R R"
ballarin@20318
   701
  by (auto intro!: ring_hom_memI)
ballarin@20318
   702
ballarin@20318
   703
end