src/HOL/SetInterval.thy
author nipkow
Wed Nov 04 10:17:43 2009 +0100 (2009-11-04)
changeset 33434 e9de8d69c1b9
parent 33318 ddd97d9dfbfb
child 35115 446c5063e4fd
permissions -rw-r--r--
fixed order of parameters in induction rules
nipkow@8924
     1
(*  Title:      HOL/SetInterval.thy
wenzelm@32960
     2
    Author:     Tobias Nipkow
wenzelm@32960
     3
    Author:     Clemens Ballarin
wenzelm@32960
     4
    Author:     Jeremy Avigad
nipkow@8924
     5
ballarin@13735
     6
lessThan, greaterThan, atLeast, atMost and two-sided intervals
nipkow@8924
     7
*)
nipkow@8924
     8
wenzelm@14577
     9
header {* Set intervals *}
wenzelm@14577
    10
nipkow@15131
    11
theory SetInterval
haftmann@33318
    12
imports Int Nat_Transfer
nipkow@15131
    13
begin
nipkow@8924
    14
nipkow@24691
    15
context ord
nipkow@24691
    16
begin
nipkow@24691
    17
definition
wenzelm@32960
    18
  lessThan    :: "'a => 'a set" ("(1{..<_})") where
haftmann@25062
    19
  "{..<u} == {x. x < u}"
nipkow@24691
    20
nipkow@24691
    21
definition
wenzelm@32960
    22
  atMost      :: "'a => 'a set" ("(1{.._})") where
haftmann@25062
    23
  "{..u} == {x. x \<le> u}"
nipkow@24691
    24
nipkow@24691
    25
definition
wenzelm@32960
    26
  greaterThan :: "'a => 'a set" ("(1{_<..})") where
haftmann@25062
    27
  "{l<..} == {x. l<x}"
nipkow@24691
    28
nipkow@24691
    29
definition
wenzelm@32960
    30
  atLeast     :: "'a => 'a set" ("(1{_..})") where
haftmann@25062
    31
  "{l..} == {x. l\<le>x}"
nipkow@24691
    32
nipkow@24691
    33
definition
haftmann@25062
    34
  greaterThanLessThan :: "'a => 'a => 'a set"  ("(1{_<..<_})") where
haftmann@25062
    35
  "{l<..<u} == {l<..} Int {..<u}"
nipkow@24691
    36
nipkow@24691
    37
definition
haftmann@25062
    38
  atLeastLessThan :: "'a => 'a => 'a set"      ("(1{_..<_})") where
haftmann@25062
    39
  "{l..<u} == {l..} Int {..<u}"
nipkow@24691
    40
nipkow@24691
    41
definition
haftmann@25062
    42
  greaterThanAtMost :: "'a => 'a => 'a set"    ("(1{_<.._})") where
haftmann@25062
    43
  "{l<..u} == {l<..} Int {..u}"
nipkow@24691
    44
nipkow@24691
    45
definition
haftmann@25062
    46
  atLeastAtMost :: "'a => 'a => 'a set"        ("(1{_.._})") where
haftmann@25062
    47
  "{l..u} == {l..} Int {..u}"
nipkow@24691
    48
nipkow@24691
    49
end
nipkow@8924
    50
ballarin@13735
    51
nipkow@15048
    52
text{* A note of warning when using @{term"{..<n}"} on type @{typ
nipkow@15048
    53
nat}: it is equivalent to @{term"{0::nat..<n}"} but some lemmas involving
nipkow@15052
    54
@{term"{m..<n}"} may not exist in @{term"{..<n}"}-form as well. *}
nipkow@15048
    55
kleing@14418
    56
syntax
nipkow@30384
    57
  "@UNION_le"   :: "'a => 'a => 'b set => 'b set"       ("(3UN _<=_./ _)" 10)
nipkow@30384
    58
  "@UNION_less" :: "'a => 'a => 'b set => 'b set"       ("(3UN _<_./ _)" 10)
nipkow@30384
    59
  "@INTER_le"   :: "'a => 'a => 'b set => 'b set"       ("(3INT _<=_./ _)" 10)
nipkow@30384
    60
  "@INTER_less" :: "'a => 'a => 'b set => 'b set"       ("(3INT _<_./ _)" 10)
kleing@14418
    61
nipkow@30372
    62
syntax (xsymbols)
nipkow@30384
    63
  "@UNION_le"   :: "'a => 'a => 'b set => 'b set"       ("(3\<Union> _\<le>_./ _)" 10)
nipkow@30384
    64
  "@UNION_less" :: "'a => 'a => 'b set => 'b set"       ("(3\<Union> _<_./ _)" 10)
nipkow@30384
    65
  "@INTER_le"   :: "'a => 'a => 'b set => 'b set"       ("(3\<Inter> _\<le>_./ _)" 10)
nipkow@30384
    66
  "@INTER_less" :: "'a => 'a => 'b set => 'b set"       ("(3\<Inter> _<_./ _)" 10)
kleing@14418
    67
nipkow@30372
    68
syntax (latex output)
nipkow@30384
    69
  "@UNION_le"   :: "'a \<Rightarrow> 'a => 'b set => 'b set"       ("(3\<Union>(00_ \<le> _)/ _)" 10)
nipkow@30384
    70
  "@UNION_less" :: "'a \<Rightarrow> 'a => 'b set => 'b set"       ("(3\<Union>(00_ < _)/ _)" 10)
nipkow@30384
    71
  "@INTER_le"   :: "'a \<Rightarrow> 'a => 'b set => 'b set"       ("(3\<Inter>(00_ \<le> _)/ _)" 10)
nipkow@30384
    72
  "@INTER_less" :: "'a \<Rightarrow> 'a => 'b set => 'b set"       ("(3\<Inter>(00_ < _)/ _)" 10)
kleing@14418
    73
kleing@14418
    74
translations
kleing@14418
    75
  "UN i<=n. A"  == "UN i:{..n}. A"
nipkow@15045
    76
  "UN i<n. A"   == "UN i:{..<n}. A"
kleing@14418
    77
  "INT i<=n. A" == "INT i:{..n}. A"
nipkow@15045
    78
  "INT i<n. A"  == "INT i:{..<n}. A"
kleing@14418
    79
kleing@14418
    80
paulson@14485
    81
subsection {* Various equivalences *}
ballarin@13735
    82
haftmann@25062
    83
lemma (in ord) lessThan_iff [iff]: "(i: lessThan k) = (i<k)"
paulson@13850
    84
by (simp add: lessThan_def)
ballarin@13735
    85
paulson@15418
    86
lemma Compl_lessThan [simp]:
ballarin@13735
    87
    "!!k:: 'a::linorder. -lessThan k = atLeast k"
paulson@13850
    88
apply (auto simp add: lessThan_def atLeast_def)
ballarin@13735
    89
done
ballarin@13735
    90
paulson@13850
    91
lemma single_Diff_lessThan [simp]: "!!k:: 'a::order. {k} - lessThan k = {k}"
paulson@13850
    92
by auto
ballarin@13735
    93
haftmann@25062
    94
lemma (in ord) greaterThan_iff [iff]: "(i: greaterThan k) = (k<i)"
paulson@13850
    95
by (simp add: greaterThan_def)
ballarin@13735
    96
paulson@15418
    97
lemma Compl_greaterThan [simp]:
ballarin@13735
    98
    "!!k:: 'a::linorder. -greaterThan k = atMost k"
haftmann@26072
    99
  by (auto simp add: greaterThan_def atMost_def)
ballarin@13735
   100
paulson@13850
   101
lemma Compl_atMost [simp]: "!!k:: 'a::linorder. -atMost k = greaterThan k"
paulson@13850
   102
apply (subst Compl_greaterThan [symmetric])
paulson@15418
   103
apply (rule double_complement)
ballarin@13735
   104
done
ballarin@13735
   105
haftmann@25062
   106
lemma (in ord) atLeast_iff [iff]: "(i: atLeast k) = (k<=i)"
paulson@13850
   107
by (simp add: atLeast_def)
ballarin@13735
   108
paulson@15418
   109
lemma Compl_atLeast [simp]:
ballarin@13735
   110
    "!!k:: 'a::linorder. -atLeast k = lessThan k"
haftmann@26072
   111
  by (auto simp add: lessThan_def atLeast_def)
ballarin@13735
   112
haftmann@25062
   113
lemma (in ord) atMost_iff [iff]: "(i: atMost k) = (i<=k)"
paulson@13850
   114
by (simp add: atMost_def)
ballarin@13735
   115
paulson@14485
   116
lemma atMost_Int_atLeast: "!!n:: 'a::order. atMost n Int atLeast n = {n}"
paulson@14485
   117
by (blast intro: order_antisym)
paulson@13850
   118
paulson@13850
   119
paulson@14485
   120
subsection {* Logical Equivalences for Set Inclusion and Equality *}
paulson@13850
   121
paulson@13850
   122
lemma atLeast_subset_iff [iff]:
paulson@15418
   123
     "(atLeast x \<subseteq> atLeast y) = (y \<le> (x::'a::order))"
paulson@15418
   124
by (blast intro: order_trans)
paulson@13850
   125
paulson@13850
   126
lemma atLeast_eq_iff [iff]:
paulson@15418
   127
     "(atLeast x = atLeast y) = (x = (y::'a::linorder))"
paulson@13850
   128
by (blast intro: order_antisym order_trans)
paulson@13850
   129
paulson@13850
   130
lemma greaterThan_subset_iff [iff]:
paulson@15418
   131
     "(greaterThan x \<subseteq> greaterThan y) = (y \<le> (x::'a::linorder))"
paulson@15418
   132
apply (auto simp add: greaterThan_def)
paulson@15418
   133
 apply (subst linorder_not_less [symmetric], blast)
paulson@13850
   134
done
paulson@13850
   135
paulson@13850
   136
lemma greaterThan_eq_iff [iff]:
paulson@15418
   137
     "(greaterThan x = greaterThan y) = (x = (y::'a::linorder))"
paulson@15418
   138
apply (rule iffI)
paulson@15418
   139
 apply (erule equalityE)
haftmann@29709
   140
 apply simp_all
paulson@13850
   141
done
paulson@13850
   142
paulson@15418
   143
lemma atMost_subset_iff [iff]: "(atMost x \<subseteq> atMost y) = (x \<le> (y::'a::order))"
paulson@13850
   144
by (blast intro: order_trans)
paulson@13850
   145
paulson@15418
   146
lemma atMost_eq_iff [iff]: "(atMost x = atMost y) = (x = (y::'a::linorder))"
paulson@13850
   147
by (blast intro: order_antisym order_trans)
paulson@13850
   148
paulson@13850
   149
lemma lessThan_subset_iff [iff]:
paulson@15418
   150
     "(lessThan x \<subseteq> lessThan y) = (x \<le> (y::'a::linorder))"
paulson@15418
   151
apply (auto simp add: lessThan_def)
paulson@15418
   152
 apply (subst linorder_not_less [symmetric], blast)
paulson@13850
   153
done
paulson@13850
   154
paulson@13850
   155
lemma lessThan_eq_iff [iff]:
paulson@15418
   156
     "(lessThan x = lessThan y) = (x = (y::'a::linorder))"
paulson@15418
   157
apply (rule iffI)
paulson@15418
   158
 apply (erule equalityE)
haftmann@29709
   159
 apply simp_all
ballarin@13735
   160
done
ballarin@13735
   161
ballarin@13735
   162
paulson@13850
   163
subsection {*Two-sided intervals*}
ballarin@13735
   164
nipkow@24691
   165
context ord
nipkow@24691
   166
begin
nipkow@24691
   167
paulson@24286
   168
lemma greaterThanLessThan_iff [simp,noatp]:
haftmann@25062
   169
  "(i : {l<..<u}) = (l < i & i < u)"
ballarin@13735
   170
by (simp add: greaterThanLessThan_def)
ballarin@13735
   171
paulson@24286
   172
lemma atLeastLessThan_iff [simp,noatp]:
haftmann@25062
   173
  "(i : {l..<u}) = (l <= i & i < u)"
ballarin@13735
   174
by (simp add: atLeastLessThan_def)
ballarin@13735
   175
paulson@24286
   176
lemma greaterThanAtMost_iff [simp,noatp]:
haftmann@25062
   177
  "(i : {l<..u}) = (l < i & i <= u)"
ballarin@13735
   178
by (simp add: greaterThanAtMost_def)
ballarin@13735
   179
paulson@24286
   180
lemma atLeastAtMost_iff [simp,noatp]:
haftmann@25062
   181
  "(i : {l..u}) = (l <= i & i <= u)"
ballarin@13735
   182
by (simp add: atLeastAtMost_def)
ballarin@13735
   183
nipkow@32436
   184
text {* The above four lemmas could be declared as iffs. Unfortunately this
nipkow@32436
   185
breaks many proofs. Since it only helps blast, it is better to leave well
nipkow@32436
   186
alone *}
nipkow@32436
   187
nipkow@24691
   188
end
ballarin@13735
   189
nipkow@32400
   190
subsubsection{* Emptyness, singletons, subset *}
nipkow@15554
   191
nipkow@24691
   192
context order
nipkow@24691
   193
begin
nipkow@15554
   194
nipkow@32400
   195
lemma atLeastatMost_empty[simp]:
nipkow@32400
   196
  "b < a \<Longrightarrow> {a..b} = {}"
nipkow@32400
   197
by(auto simp: atLeastAtMost_def atLeast_def atMost_def)
nipkow@32400
   198
nipkow@32400
   199
lemma atLeastatMost_empty_iff[simp]:
nipkow@32400
   200
  "{a..b} = {} \<longleftrightarrow> (~ a <= b)"
nipkow@32400
   201
by auto (blast intro: order_trans)
nipkow@32400
   202
nipkow@32400
   203
lemma atLeastatMost_empty_iff2[simp]:
nipkow@32400
   204
  "{} = {a..b} \<longleftrightarrow> (~ a <= b)"
nipkow@32400
   205
by auto (blast intro: order_trans)
nipkow@32400
   206
nipkow@32400
   207
lemma atLeastLessThan_empty[simp]:
nipkow@32400
   208
  "b <= a \<Longrightarrow> {a..<b} = {}"
nipkow@32400
   209
by(auto simp: atLeastLessThan_def)
nipkow@24691
   210
nipkow@32400
   211
lemma atLeastLessThan_empty_iff[simp]:
nipkow@32400
   212
  "{a..<b} = {} \<longleftrightarrow> (~ a < b)"
nipkow@32400
   213
by auto (blast intro: le_less_trans)
nipkow@32400
   214
nipkow@32400
   215
lemma atLeastLessThan_empty_iff2[simp]:
nipkow@32400
   216
  "{} = {a..<b} \<longleftrightarrow> (~ a < b)"
nipkow@32400
   217
by auto (blast intro: le_less_trans)
nipkow@15554
   218
nipkow@32400
   219
lemma greaterThanAtMost_empty[simp]: "l \<le> k ==> {k<..l} = {}"
nipkow@17719
   220
by(auto simp:greaterThanAtMost_def greaterThan_def atMost_def)
nipkow@17719
   221
nipkow@32400
   222
lemma greaterThanAtMost_empty_iff[simp]: "{k<..l} = {} \<longleftrightarrow> ~ k < l"
nipkow@32400
   223
by auto (blast intro: less_le_trans)
nipkow@32400
   224
nipkow@32400
   225
lemma greaterThanAtMost_empty_iff2[simp]: "{} = {k<..l} \<longleftrightarrow> ~ k < l"
nipkow@32400
   226
by auto (blast intro: less_le_trans)
nipkow@32400
   227
haftmann@29709
   228
lemma greaterThanLessThan_empty[simp]:"l \<le> k ==> {k<..<l} = {}"
nipkow@17719
   229
by(auto simp:greaterThanLessThan_def greaterThan_def lessThan_def)
nipkow@17719
   230
haftmann@25062
   231
lemma atLeastAtMost_singleton [simp]: "{a..a} = {a}"
nipkow@24691
   232
by (auto simp add: atLeastAtMost_def atMost_def atLeast_def)
nipkow@24691
   233
nipkow@32400
   234
lemma atLeastatMost_subset_iff[simp]:
nipkow@32400
   235
  "{a..b} <= {c..d} \<longleftrightarrow> (~ a <= b) | c <= a & b <= d"
nipkow@32400
   236
unfolding atLeastAtMost_def atLeast_def atMost_def
nipkow@32400
   237
by (blast intro: order_trans)
nipkow@32400
   238
nipkow@32400
   239
lemma atLeastatMost_psubset_iff:
nipkow@32400
   240
  "{a..b} < {c..d} \<longleftrightarrow>
nipkow@32400
   241
   ((~ a <= b) | c <= a & b <= d & (c < a | b < d))  &  c <= d"
nipkow@32400
   242
by(simp add: psubset_eq expand_set_eq less_le_not_le)(blast intro: order_trans)
nipkow@32400
   243
nipkow@24691
   244
end
paulson@14485
   245
nipkow@32408
   246
lemma (in linorder) atLeastLessThan_subset_iff:
nipkow@32408
   247
  "{a..<b} <= {c..<d} \<Longrightarrow> b <= a | c<=a & b<=d"
nipkow@32408
   248
apply (auto simp:subset_eq Ball_def)
nipkow@32408
   249
apply(frule_tac x=a in spec)
nipkow@32408
   250
apply(erule_tac x=d in allE)
nipkow@32408
   251
apply (simp add: less_imp_le)
nipkow@32408
   252
done
nipkow@32408
   253
nipkow@32456
   254
subsubsection {* Intersection *}
nipkow@32456
   255
nipkow@32456
   256
context linorder
nipkow@32456
   257
begin
nipkow@32456
   258
nipkow@32456
   259
lemma Int_atLeastAtMost[simp]: "{a..b} Int {c..d} = {max a c .. min b d}"
nipkow@32456
   260
by auto
nipkow@32456
   261
nipkow@32456
   262
lemma Int_atLeastAtMostR1[simp]: "{..b} Int {c..d} = {c .. min b d}"
nipkow@32456
   263
by auto
nipkow@32456
   264
nipkow@32456
   265
lemma Int_atLeastAtMostR2[simp]: "{a..} Int {c..d} = {max a c .. d}"
nipkow@32456
   266
by auto
nipkow@32456
   267
nipkow@32456
   268
lemma Int_atLeastAtMostL1[simp]: "{a..b} Int {..d} = {a .. min b d}"
nipkow@32456
   269
by auto
nipkow@32456
   270
nipkow@32456
   271
lemma Int_atLeastAtMostL2[simp]: "{a..b} Int {c..} = {max a c .. b}"
nipkow@32456
   272
by auto
nipkow@32456
   273
nipkow@32456
   274
lemma Int_atLeastLessThan[simp]: "{a..<b} Int {c..<d} = {max a c ..< min b d}"
nipkow@32456
   275
by auto
nipkow@32456
   276
nipkow@32456
   277
lemma Int_greaterThanAtMost[simp]: "{a<..b} Int {c<..d} = {max a c <.. min b d}"
nipkow@32456
   278
by auto
nipkow@32456
   279
nipkow@32456
   280
lemma Int_greaterThanLessThan[simp]: "{a<..<b} Int {c<..<d} = {max a c <..< min b d}"
nipkow@32456
   281
by auto
nipkow@32456
   282
nipkow@32456
   283
end
nipkow@32456
   284
nipkow@32456
   285
paulson@14485
   286
subsection {* Intervals of natural numbers *}
paulson@14485
   287
paulson@15047
   288
subsubsection {* The Constant @{term lessThan} *}
paulson@15047
   289
paulson@14485
   290
lemma lessThan_0 [simp]: "lessThan (0::nat) = {}"
paulson@14485
   291
by (simp add: lessThan_def)
paulson@14485
   292
paulson@14485
   293
lemma lessThan_Suc: "lessThan (Suc k) = insert k (lessThan k)"
paulson@14485
   294
by (simp add: lessThan_def less_Suc_eq, blast)
paulson@14485
   295
paulson@14485
   296
lemma lessThan_Suc_atMost: "lessThan (Suc k) = atMost k"
paulson@14485
   297
by (simp add: lessThan_def atMost_def less_Suc_eq_le)
paulson@14485
   298
paulson@14485
   299
lemma UN_lessThan_UNIV: "(UN m::nat. lessThan m) = UNIV"
paulson@14485
   300
by blast
paulson@14485
   301
paulson@15047
   302
subsubsection {* The Constant @{term greaterThan} *}
paulson@15047
   303
paulson@14485
   304
lemma greaterThan_0 [simp]: "greaterThan 0 = range Suc"
paulson@14485
   305
apply (simp add: greaterThan_def)
paulson@14485
   306
apply (blast dest: gr0_conv_Suc [THEN iffD1])
paulson@14485
   307
done
paulson@14485
   308
paulson@14485
   309
lemma greaterThan_Suc: "greaterThan (Suc k) = greaterThan k - {Suc k}"
paulson@14485
   310
apply (simp add: greaterThan_def)
paulson@14485
   311
apply (auto elim: linorder_neqE)
paulson@14485
   312
done
paulson@14485
   313
paulson@14485
   314
lemma INT_greaterThan_UNIV: "(INT m::nat. greaterThan m) = {}"
paulson@14485
   315
by blast
paulson@14485
   316
paulson@15047
   317
subsubsection {* The Constant @{term atLeast} *}
paulson@15047
   318
paulson@14485
   319
lemma atLeast_0 [simp]: "atLeast (0::nat) = UNIV"
paulson@14485
   320
by (unfold atLeast_def UNIV_def, simp)
paulson@14485
   321
paulson@14485
   322
lemma atLeast_Suc: "atLeast (Suc k) = atLeast k - {k}"
paulson@14485
   323
apply (simp add: atLeast_def)
paulson@14485
   324
apply (simp add: Suc_le_eq)
paulson@14485
   325
apply (simp add: order_le_less, blast)
paulson@14485
   326
done
paulson@14485
   327
paulson@14485
   328
lemma atLeast_Suc_greaterThan: "atLeast (Suc k) = greaterThan k"
paulson@14485
   329
  by (auto simp add: greaterThan_def atLeast_def less_Suc_eq_le)
paulson@14485
   330
paulson@14485
   331
lemma UN_atLeast_UNIV: "(UN m::nat. atLeast m) = UNIV"
paulson@14485
   332
by blast
paulson@14485
   333
paulson@15047
   334
subsubsection {* The Constant @{term atMost} *}
paulson@15047
   335
paulson@14485
   336
lemma atMost_0 [simp]: "atMost (0::nat) = {0}"
paulson@14485
   337
by (simp add: atMost_def)
paulson@14485
   338
paulson@14485
   339
lemma atMost_Suc: "atMost (Suc k) = insert (Suc k) (atMost k)"
paulson@14485
   340
apply (simp add: atMost_def)
paulson@14485
   341
apply (simp add: less_Suc_eq order_le_less, blast)
paulson@14485
   342
done
paulson@14485
   343
paulson@14485
   344
lemma UN_atMost_UNIV: "(UN m::nat. atMost m) = UNIV"
paulson@14485
   345
by blast
paulson@14485
   346
paulson@15047
   347
subsubsection {* The Constant @{term atLeastLessThan} *}
paulson@15047
   348
nipkow@28068
   349
text{*The orientation of the following 2 rules is tricky. The lhs is
nipkow@24449
   350
defined in terms of the rhs.  Hence the chosen orientation makes sense
nipkow@24449
   351
in this theory --- the reverse orientation complicates proofs (eg
nipkow@24449
   352
nontermination). But outside, when the definition of the lhs is rarely
nipkow@24449
   353
used, the opposite orientation seems preferable because it reduces a
nipkow@24449
   354
specific concept to a more general one. *}
nipkow@28068
   355
paulson@15047
   356
lemma atLeast0LessThan: "{0::nat..<n} = {..<n}"
nipkow@15042
   357
by(simp add:lessThan_def atLeastLessThan_def)
nipkow@24449
   358
nipkow@28068
   359
lemma atLeast0AtMost: "{0..n::nat} = {..n}"
nipkow@28068
   360
by(simp add:atMost_def atLeastAtMost_def)
nipkow@28068
   361
haftmann@31998
   362
declare atLeast0LessThan[symmetric, code_unfold]
haftmann@31998
   363
        atLeast0AtMost[symmetric, code_unfold]
nipkow@24449
   364
nipkow@24449
   365
lemma atLeastLessThan0: "{m..<0::nat} = {}"
paulson@15047
   366
by (simp add: atLeastLessThan_def)
nipkow@24449
   367
paulson@15047
   368
subsubsection {* Intervals of nats with @{term Suc} *}
paulson@15047
   369
paulson@15047
   370
text{*Not a simprule because the RHS is too messy.*}
paulson@15047
   371
lemma atLeastLessThanSuc:
paulson@15047
   372
    "{m..<Suc n} = (if m \<le> n then insert n {m..<n} else {})"
paulson@15418
   373
by (auto simp add: atLeastLessThan_def)
paulson@15047
   374
paulson@15418
   375
lemma atLeastLessThan_singleton [simp]: "{m..<Suc m} = {m}"
paulson@15047
   376
by (auto simp add: atLeastLessThan_def)
nipkow@16041
   377
(*
paulson@15047
   378
lemma atLeast_sum_LessThan [simp]: "{m + k..<k::nat} = {}"
paulson@15047
   379
by (induct k, simp_all add: atLeastLessThanSuc)
paulson@15047
   380
paulson@15047
   381
lemma atLeastSucLessThan [simp]: "{Suc n..<n} = {}"
paulson@15047
   382
by (auto simp add: atLeastLessThan_def)
nipkow@16041
   383
*)
nipkow@15045
   384
lemma atLeastLessThanSuc_atLeastAtMost: "{l..<Suc u} = {l..u}"
paulson@14485
   385
  by (simp add: lessThan_Suc_atMost atLeastAtMost_def atLeastLessThan_def)
paulson@14485
   386
paulson@15418
   387
lemma atLeastSucAtMost_greaterThanAtMost: "{Suc l..u} = {l<..u}"
paulson@15418
   388
  by (simp add: atLeast_Suc_greaterThan atLeastAtMost_def
paulson@14485
   389
    greaterThanAtMost_def)
paulson@14485
   390
paulson@15418
   391
lemma atLeastSucLessThan_greaterThanLessThan: "{Suc l..<u} = {l<..<u}"
paulson@15418
   392
  by (simp add: atLeast_Suc_greaterThan atLeastLessThan_def
paulson@14485
   393
    greaterThanLessThan_def)
paulson@14485
   394
nipkow@15554
   395
lemma atLeastAtMostSuc_conv: "m \<le> Suc n \<Longrightarrow> {m..Suc n} = insert (Suc n) {m..n}"
nipkow@15554
   396
by (auto simp add: atLeastAtMost_def)
nipkow@15554
   397
paulson@33044
   398
lemma atLeastLessThan_add_Un: "i \<le> j \<Longrightarrow> {i..<j+k} = {i..<j} \<union> {j..<j+k::nat}"
paulson@33044
   399
  apply (induct k) 
paulson@33044
   400
  apply (simp_all add: atLeastLessThanSuc)   
paulson@33044
   401
  done
paulson@33044
   402
nipkow@16733
   403
subsubsection {* Image *}
nipkow@16733
   404
nipkow@16733
   405
lemma image_add_atLeastAtMost:
nipkow@16733
   406
  "(%n::nat. n+k) ` {i..j} = {i+k..j+k}" (is "?A = ?B")
nipkow@16733
   407
proof
nipkow@16733
   408
  show "?A \<subseteq> ?B" by auto
nipkow@16733
   409
next
nipkow@16733
   410
  show "?B \<subseteq> ?A"
nipkow@16733
   411
  proof
nipkow@16733
   412
    fix n assume a: "n : ?B"
webertj@20217
   413
    hence "n - k : {i..j}" by auto
nipkow@16733
   414
    moreover have "n = (n - k) + k" using a by auto
nipkow@16733
   415
    ultimately show "n : ?A" by blast
nipkow@16733
   416
  qed
nipkow@16733
   417
qed
nipkow@16733
   418
nipkow@16733
   419
lemma image_add_atLeastLessThan:
nipkow@16733
   420
  "(%n::nat. n+k) ` {i..<j} = {i+k..<j+k}" (is "?A = ?B")
nipkow@16733
   421
proof
nipkow@16733
   422
  show "?A \<subseteq> ?B" by auto
nipkow@16733
   423
next
nipkow@16733
   424
  show "?B \<subseteq> ?A"
nipkow@16733
   425
  proof
nipkow@16733
   426
    fix n assume a: "n : ?B"
webertj@20217
   427
    hence "n - k : {i..<j}" by auto
nipkow@16733
   428
    moreover have "n = (n - k) + k" using a by auto
nipkow@16733
   429
    ultimately show "n : ?A" by blast
nipkow@16733
   430
  qed
nipkow@16733
   431
qed
nipkow@16733
   432
nipkow@16733
   433
corollary image_Suc_atLeastAtMost[simp]:
nipkow@16733
   434
  "Suc ` {i..j} = {Suc i..Suc j}"
huffman@30079
   435
using image_add_atLeastAtMost[where k="Suc 0"] by simp
nipkow@16733
   436
nipkow@16733
   437
corollary image_Suc_atLeastLessThan[simp]:
nipkow@16733
   438
  "Suc ` {i..<j} = {Suc i..<Suc j}"
huffman@30079
   439
using image_add_atLeastLessThan[where k="Suc 0"] by simp
nipkow@16733
   440
nipkow@16733
   441
lemma image_add_int_atLeastLessThan:
nipkow@16733
   442
    "(%x. x + (l::int)) ` {0..<u-l} = {l..<u}"
nipkow@16733
   443
  apply (auto simp add: image_def)
nipkow@16733
   444
  apply (rule_tac x = "x - l" in bexI)
nipkow@16733
   445
  apply auto
nipkow@16733
   446
  done
nipkow@16733
   447
nipkow@16733
   448
paulson@14485
   449
subsubsection {* Finiteness *}
paulson@14485
   450
nipkow@15045
   451
lemma finite_lessThan [iff]: fixes k :: nat shows "finite {..<k}"
paulson@14485
   452
  by (induct k) (simp_all add: lessThan_Suc)
paulson@14485
   453
paulson@14485
   454
lemma finite_atMost [iff]: fixes k :: nat shows "finite {..k}"
paulson@14485
   455
  by (induct k) (simp_all add: atMost_Suc)
paulson@14485
   456
paulson@14485
   457
lemma finite_greaterThanLessThan [iff]:
nipkow@15045
   458
  fixes l :: nat shows "finite {l<..<u}"
paulson@14485
   459
by (simp add: greaterThanLessThan_def)
paulson@14485
   460
paulson@14485
   461
lemma finite_atLeastLessThan [iff]:
nipkow@15045
   462
  fixes l :: nat shows "finite {l..<u}"
paulson@14485
   463
by (simp add: atLeastLessThan_def)
paulson@14485
   464
paulson@14485
   465
lemma finite_greaterThanAtMost [iff]:
nipkow@15045
   466
  fixes l :: nat shows "finite {l<..u}"
paulson@14485
   467
by (simp add: greaterThanAtMost_def)
paulson@14485
   468
paulson@14485
   469
lemma finite_atLeastAtMost [iff]:
paulson@14485
   470
  fixes l :: nat shows "finite {l..u}"
paulson@14485
   471
by (simp add: atLeastAtMost_def)
paulson@14485
   472
nipkow@28068
   473
text {* A bounded set of natural numbers is finite. *}
paulson@14485
   474
lemma bounded_nat_set_is_finite:
nipkow@24853
   475
  "(ALL i:N. i < (n::nat)) ==> finite N"
nipkow@28068
   476
apply (rule finite_subset)
nipkow@28068
   477
 apply (rule_tac [2] finite_lessThan, auto)
nipkow@28068
   478
done
nipkow@28068
   479
nipkow@31044
   480
text {* A set of natural numbers is finite iff it is bounded. *}
nipkow@31044
   481
lemma finite_nat_set_iff_bounded:
nipkow@31044
   482
  "finite(N::nat set) = (EX m. ALL n:N. n<m)" (is "?F = ?B")
nipkow@31044
   483
proof
nipkow@31044
   484
  assume f:?F  show ?B
nipkow@31044
   485
    using Max_ge[OF `?F`, simplified less_Suc_eq_le[symmetric]] by blast
nipkow@31044
   486
next
nipkow@31044
   487
  assume ?B show ?F using `?B` by(blast intro:bounded_nat_set_is_finite)
nipkow@31044
   488
qed
nipkow@31044
   489
nipkow@31044
   490
lemma finite_nat_set_iff_bounded_le:
nipkow@31044
   491
  "finite(N::nat set) = (EX m. ALL n:N. n<=m)"
nipkow@31044
   492
apply(simp add:finite_nat_set_iff_bounded)
nipkow@31044
   493
apply(blast dest:less_imp_le_nat le_imp_less_Suc)
nipkow@31044
   494
done
nipkow@31044
   495
nipkow@28068
   496
lemma finite_less_ub:
nipkow@28068
   497
     "!!f::nat=>nat. (!!n. n \<le> f n) ==> finite {n. f n \<le> u}"
nipkow@28068
   498
by (rule_tac B="{..u}" in finite_subset, auto intro: order_trans)
paulson@14485
   499
nipkow@24853
   500
text{* Any subset of an interval of natural numbers the size of the
nipkow@24853
   501
subset is exactly that interval. *}
nipkow@24853
   502
nipkow@24853
   503
lemma subset_card_intvl_is_intvl:
nipkow@24853
   504
  "A <= {k..<k+card A} \<Longrightarrow> A = {k..<k+card A}" (is "PROP ?P")
nipkow@24853
   505
proof cases
nipkow@24853
   506
  assume "finite A"
nipkow@24853
   507
  thus "PROP ?P"
nipkow@32006
   508
  proof(induct A rule:finite_linorder_max_induct)
nipkow@24853
   509
    case empty thus ?case by auto
nipkow@24853
   510
  next
nipkow@33434
   511
    case (insert b A)
nipkow@24853
   512
    moreover hence "b ~: A" by auto
nipkow@24853
   513
    moreover have "A <= {k..<k+card A}" and "b = k+card A"
nipkow@24853
   514
      using `b ~: A` insert by fastsimp+
nipkow@24853
   515
    ultimately show ?case by auto
nipkow@24853
   516
  qed
nipkow@24853
   517
next
nipkow@24853
   518
  assume "~finite A" thus "PROP ?P" by simp
nipkow@24853
   519
qed
nipkow@24853
   520
nipkow@24853
   521
paulson@32596
   522
subsubsection {* Proving Inclusions and Equalities between Unions *}
paulson@32596
   523
paulson@32596
   524
lemma UN_UN_finite_eq: "(\<Union>n::nat. \<Union>i\<in>{0..<n}. A i) = (\<Union>n. A n)"
paulson@32596
   525
  by (auto simp add: atLeast0LessThan) 
paulson@32596
   526
paulson@32596
   527
lemma UN_finite_subset: "(!!n::nat. (\<Union>i\<in>{0..<n}. A i) \<subseteq> C) \<Longrightarrow> (\<Union>n. A n) \<subseteq> C"
paulson@32596
   528
  by (subst UN_UN_finite_eq [symmetric]) blast
paulson@32596
   529
paulson@33044
   530
lemma UN_finite2_subset: 
paulson@33044
   531
     "(!!n::nat. (\<Union>i\<in>{0..<n}. A i) \<subseteq> (\<Union>i\<in>{0..<n+k}. B i)) \<Longrightarrow> (\<Union>n. A n) \<subseteq> (\<Union>n. B n)"
paulson@33044
   532
  apply (rule UN_finite_subset)
paulson@33044
   533
  apply (subst UN_UN_finite_eq [symmetric, of B]) 
paulson@33044
   534
  apply blast
paulson@33044
   535
  done
paulson@32596
   536
paulson@32596
   537
lemma UN_finite2_eq:
paulson@33044
   538
  "(!!n::nat. (\<Union>i\<in>{0..<n}. A i) = (\<Union>i\<in>{0..<n+k}. B i)) \<Longrightarrow> (\<Union>n. A n) = (\<Union>n. B n)"
paulson@33044
   539
  apply (rule subset_antisym)
paulson@33044
   540
   apply (rule UN_finite2_subset, blast)
paulson@33044
   541
 apply (rule UN_finite2_subset [where k=k])
paulson@33044
   542
 apply (force simp add: atLeastLessThan_add_Un [of 0] UN_Un) 
paulson@33044
   543
 done
paulson@32596
   544
paulson@32596
   545
paulson@14485
   546
subsubsection {* Cardinality *}
paulson@14485
   547
nipkow@15045
   548
lemma card_lessThan [simp]: "card {..<u} = u"
paulson@15251
   549
  by (induct u, simp_all add: lessThan_Suc)
paulson@14485
   550
paulson@14485
   551
lemma card_atMost [simp]: "card {..u} = Suc u"
paulson@14485
   552
  by (simp add: lessThan_Suc_atMost [THEN sym])
paulson@14485
   553
nipkow@15045
   554
lemma card_atLeastLessThan [simp]: "card {l..<u} = u - l"
nipkow@15045
   555
  apply (subgoal_tac "card {l..<u} = card {..<u-l}")
paulson@14485
   556
  apply (erule ssubst, rule card_lessThan)
nipkow@15045
   557
  apply (subgoal_tac "(%x. x + l) ` {..<u-l} = {l..<u}")
paulson@14485
   558
  apply (erule subst)
paulson@14485
   559
  apply (rule card_image)
paulson@14485
   560
  apply (simp add: inj_on_def)
paulson@14485
   561
  apply (auto simp add: image_def atLeastLessThan_def lessThan_def)
paulson@14485
   562
  apply (rule_tac x = "x - l" in exI)
paulson@14485
   563
  apply arith
paulson@14485
   564
  done
paulson@14485
   565
paulson@15418
   566
lemma card_atLeastAtMost [simp]: "card {l..u} = Suc u - l"
paulson@14485
   567
  by (subst atLeastLessThanSuc_atLeastAtMost [THEN sym], simp)
paulson@14485
   568
paulson@15418
   569
lemma card_greaterThanAtMost [simp]: "card {l<..u} = u - l"
paulson@14485
   570
  by (subst atLeastSucAtMost_greaterThanAtMost [THEN sym], simp)
paulson@14485
   571
nipkow@15045
   572
lemma card_greaterThanLessThan [simp]: "card {l<..<u} = u - Suc l"
paulson@14485
   573
  by (subst atLeastSucLessThan_greaterThanLessThan [THEN sym], simp)
paulson@14485
   574
nipkow@26105
   575
lemma ex_bij_betw_nat_finite:
nipkow@26105
   576
  "finite M \<Longrightarrow> \<exists>h. bij_betw h {0..<card M} M"
nipkow@26105
   577
apply(drule finite_imp_nat_seg_image_inj_on)
nipkow@26105
   578
apply(auto simp:atLeast0LessThan[symmetric] lessThan_def[symmetric] card_image bij_betw_def)
nipkow@26105
   579
done
nipkow@26105
   580
nipkow@26105
   581
lemma ex_bij_betw_finite_nat:
nipkow@26105
   582
  "finite M \<Longrightarrow> \<exists>h. bij_betw h M {0..<card M}"
nipkow@26105
   583
by (blast dest: ex_bij_betw_nat_finite bij_betw_inv)
nipkow@26105
   584
nipkow@31438
   585
lemma finite_same_card_bij:
nipkow@31438
   586
  "finite A \<Longrightarrow> finite B \<Longrightarrow> card A = card B \<Longrightarrow> EX h. bij_betw h A B"
nipkow@31438
   587
apply(drule ex_bij_betw_finite_nat)
nipkow@31438
   588
apply(drule ex_bij_betw_nat_finite)
nipkow@31438
   589
apply(auto intro!:bij_betw_trans)
nipkow@31438
   590
done
nipkow@31438
   591
nipkow@31438
   592
lemma ex_bij_betw_nat_finite_1:
nipkow@31438
   593
  "finite M \<Longrightarrow> \<exists>h. bij_betw h {1 .. card M} M"
nipkow@31438
   594
by (rule finite_same_card_bij) auto
nipkow@31438
   595
nipkow@26105
   596
paulson@14485
   597
subsection {* Intervals of integers *}
paulson@14485
   598
nipkow@15045
   599
lemma atLeastLessThanPlusOne_atLeastAtMost_int: "{l..<u+1} = {l..(u::int)}"
paulson@14485
   600
  by (auto simp add: atLeastAtMost_def atLeastLessThan_def)
paulson@14485
   601
paulson@15418
   602
lemma atLeastPlusOneAtMost_greaterThanAtMost_int: "{l+1..u} = {l<..(u::int)}"
paulson@14485
   603
  by (auto simp add: atLeastAtMost_def greaterThanAtMost_def)
paulson@14485
   604
paulson@15418
   605
lemma atLeastPlusOneLessThan_greaterThanLessThan_int:
paulson@15418
   606
    "{l+1..<u} = {l<..<u::int}"
paulson@14485
   607
  by (auto simp add: atLeastLessThan_def greaterThanLessThan_def)
paulson@14485
   608
paulson@14485
   609
subsubsection {* Finiteness *}
paulson@14485
   610
paulson@15418
   611
lemma image_atLeastZeroLessThan_int: "0 \<le> u ==>
nipkow@15045
   612
    {(0::int)..<u} = int ` {..<nat u}"
paulson@14485
   613
  apply (unfold image_def lessThan_def)
paulson@14485
   614
  apply auto
paulson@14485
   615
  apply (rule_tac x = "nat x" in exI)
paulson@14485
   616
  apply (auto simp add: zless_nat_conj zless_nat_eq_int_zless [THEN sym])
paulson@14485
   617
  done
paulson@14485
   618
nipkow@15045
   619
lemma finite_atLeastZeroLessThan_int: "finite {(0::int)..<u}"
paulson@14485
   620
  apply (case_tac "0 \<le> u")
paulson@14485
   621
  apply (subst image_atLeastZeroLessThan_int, assumption)
paulson@14485
   622
  apply (rule finite_imageI)
paulson@14485
   623
  apply auto
paulson@14485
   624
  done
paulson@14485
   625
nipkow@15045
   626
lemma finite_atLeastLessThan_int [iff]: "finite {l..<u::int}"
nipkow@15045
   627
  apply (subgoal_tac "(%x. x + l) ` {0..<u-l} = {l..<u}")
paulson@14485
   628
  apply (erule subst)
paulson@14485
   629
  apply (rule finite_imageI)
paulson@14485
   630
  apply (rule finite_atLeastZeroLessThan_int)
nipkow@16733
   631
  apply (rule image_add_int_atLeastLessThan)
paulson@14485
   632
  done
paulson@14485
   633
paulson@15418
   634
lemma finite_atLeastAtMost_int [iff]: "finite {l..(u::int)}"
paulson@14485
   635
  by (subst atLeastLessThanPlusOne_atLeastAtMost_int [THEN sym], simp)
paulson@14485
   636
paulson@15418
   637
lemma finite_greaterThanAtMost_int [iff]: "finite {l<..(u::int)}"
paulson@14485
   638
  by (subst atLeastPlusOneAtMost_greaterThanAtMost_int [THEN sym], simp)
paulson@14485
   639
paulson@15418
   640
lemma finite_greaterThanLessThan_int [iff]: "finite {l<..<u::int}"
paulson@14485
   641
  by (subst atLeastPlusOneLessThan_greaterThanLessThan_int [THEN sym], simp)
paulson@14485
   642
nipkow@24853
   643
paulson@14485
   644
subsubsection {* Cardinality *}
paulson@14485
   645
nipkow@15045
   646
lemma card_atLeastZeroLessThan_int: "card {(0::int)..<u} = nat u"
paulson@14485
   647
  apply (case_tac "0 \<le> u")
paulson@14485
   648
  apply (subst image_atLeastZeroLessThan_int, assumption)
paulson@14485
   649
  apply (subst card_image)
paulson@14485
   650
  apply (auto simp add: inj_on_def)
paulson@14485
   651
  done
paulson@14485
   652
nipkow@15045
   653
lemma card_atLeastLessThan_int [simp]: "card {l..<u} = nat (u - l)"
nipkow@15045
   654
  apply (subgoal_tac "card {l..<u} = card {0..<u-l}")
paulson@14485
   655
  apply (erule ssubst, rule card_atLeastZeroLessThan_int)
nipkow@15045
   656
  apply (subgoal_tac "(%x. x + l) ` {0..<u-l} = {l..<u}")
paulson@14485
   657
  apply (erule subst)
paulson@14485
   658
  apply (rule card_image)
paulson@14485
   659
  apply (simp add: inj_on_def)
nipkow@16733
   660
  apply (rule image_add_int_atLeastLessThan)
paulson@14485
   661
  done
paulson@14485
   662
paulson@14485
   663
lemma card_atLeastAtMost_int [simp]: "card {l..u} = nat (u - l + 1)"
nipkow@29667
   664
apply (subst atLeastLessThanPlusOne_atLeastAtMost_int [THEN sym])
nipkow@29667
   665
apply (auto simp add: algebra_simps)
nipkow@29667
   666
done
paulson@14485
   667
paulson@15418
   668
lemma card_greaterThanAtMost_int [simp]: "card {l<..u} = nat (u - l)"
nipkow@29667
   669
by (subst atLeastPlusOneAtMost_greaterThanAtMost_int [THEN sym], simp)
paulson@14485
   670
nipkow@15045
   671
lemma card_greaterThanLessThan_int [simp]: "card {l<..<u} = nat (u - (l + 1))"
nipkow@29667
   672
by (subst atLeastPlusOneLessThan_greaterThanLessThan_int [THEN sym], simp)
paulson@14485
   673
bulwahn@27656
   674
lemma finite_M_bounded_by_nat: "finite {k. P k \<and> k < (i::nat)}"
bulwahn@27656
   675
proof -
bulwahn@27656
   676
  have "{k. P k \<and> k < i} \<subseteq> {..<i}" by auto
bulwahn@27656
   677
  with finite_lessThan[of "i"] show ?thesis by (simp add: finite_subset)
bulwahn@27656
   678
qed
bulwahn@27656
   679
bulwahn@27656
   680
lemma card_less:
bulwahn@27656
   681
assumes zero_in_M: "0 \<in> M"
bulwahn@27656
   682
shows "card {k \<in> M. k < Suc i} \<noteq> 0"
bulwahn@27656
   683
proof -
bulwahn@27656
   684
  from zero_in_M have "{k \<in> M. k < Suc i} \<noteq> {}" by auto
bulwahn@27656
   685
  with finite_M_bounded_by_nat show ?thesis by (auto simp add: card_eq_0_iff)
bulwahn@27656
   686
qed
bulwahn@27656
   687
bulwahn@27656
   688
lemma card_less_Suc2: "0 \<notin> M \<Longrightarrow> card {k. Suc k \<in> M \<and> k < i} = card {k \<in> M. k < Suc i}"
huffman@30079
   689
apply (rule card_bij_eq [of "Suc" _ _ "\<lambda>x. x - Suc 0"])
bulwahn@27656
   690
apply simp
bulwahn@27656
   691
apply fastsimp
bulwahn@27656
   692
apply auto
bulwahn@27656
   693
apply (rule inj_on_diff_nat)
bulwahn@27656
   694
apply auto
bulwahn@27656
   695
apply (case_tac x)
bulwahn@27656
   696
apply auto
bulwahn@27656
   697
apply (case_tac xa)
bulwahn@27656
   698
apply auto
bulwahn@27656
   699
apply (case_tac xa)
bulwahn@27656
   700
apply auto
bulwahn@27656
   701
done
bulwahn@27656
   702
bulwahn@27656
   703
lemma card_less_Suc:
bulwahn@27656
   704
  assumes zero_in_M: "0 \<in> M"
bulwahn@27656
   705
    shows "Suc (card {k. Suc k \<in> M \<and> k < i}) = card {k \<in> M. k < Suc i}"
bulwahn@27656
   706
proof -
bulwahn@27656
   707
  from assms have a: "0 \<in> {k \<in> M. k < Suc i}" by simp
bulwahn@27656
   708
  hence c: "{k \<in> M. k < Suc i} = insert 0 ({k \<in> M. k < Suc i} - {0})"
bulwahn@27656
   709
    by (auto simp only: insert_Diff)
bulwahn@27656
   710
  have b: "{k \<in> M. k < Suc i} - {0} = {k \<in> M - {0}. k < Suc i}"  by auto
bulwahn@27656
   711
  from finite_M_bounded_by_nat[of "\<lambda>x. x \<in> M" "Suc i"] have "Suc (card {k. Suc k \<in> M \<and> k < i}) = card (insert 0 ({k \<in> M. k < Suc i} - {0}))"
bulwahn@27656
   712
    apply (subst card_insert)
bulwahn@27656
   713
    apply simp_all
bulwahn@27656
   714
    apply (subst b)
bulwahn@27656
   715
    apply (subst card_less_Suc2[symmetric])
bulwahn@27656
   716
    apply simp_all
bulwahn@27656
   717
    done
bulwahn@27656
   718
  with c show ?thesis by simp
bulwahn@27656
   719
qed
bulwahn@27656
   720
paulson@14485
   721
paulson@13850
   722
subsection {*Lemmas useful with the summation operator setsum*}
paulson@13850
   723
ballarin@16102
   724
text {* For examples, see Algebra/poly/UnivPoly2.thy *}
ballarin@13735
   725
wenzelm@14577
   726
subsubsection {* Disjoint Unions *}
ballarin@13735
   727
wenzelm@14577
   728
text {* Singletons and open intervals *}
ballarin@13735
   729
ballarin@13735
   730
lemma ivl_disj_un_singleton:
nipkow@15045
   731
  "{l::'a::linorder} Un {l<..} = {l..}"
nipkow@15045
   732
  "{..<u} Un {u::'a::linorder} = {..u}"
nipkow@15045
   733
  "(l::'a::linorder) < u ==> {l} Un {l<..<u} = {l..<u}"
nipkow@15045
   734
  "(l::'a::linorder) < u ==> {l<..<u} Un {u} = {l<..u}"
nipkow@15045
   735
  "(l::'a::linorder) <= u ==> {l} Un {l<..u} = {l..u}"
nipkow@15045
   736
  "(l::'a::linorder) <= u ==> {l..<u} Un {u} = {l..u}"
ballarin@14398
   737
by auto
ballarin@13735
   738
wenzelm@14577
   739
text {* One- and two-sided intervals *}
ballarin@13735
   740
ballarin@13735
   741
lemma ivl_disj_un_one:
nipkow@15045
   742
  "(l::'a::linorder) < u ==> {..l} Un {l<..<u} = {..<u}"
nipkow@15045
   743
  "(l::'a::linorder) <= u ==> {..<l} Un {l..<u} = {..<u}"
nipkow@15045
   744
  "(l::'a::linorder) <= u ==> {..l} Un {l<..u} = {..u}"
nipkow@15045
   745
  "(l::'a::linorder) <= u ==> {..<l} Un {l..u} = {..u}"
nipkow@15045
   746
  "(l::'a::linorder) <= u ==> {l<..u} Un {u<..} = {l<..}"
nipkow@15045
   747
  "(l::'a::linorder) < u ==> {l<..<u} Un {u..} = {l<..}"
nipkow@15045
   748
  "(l::'a::linorder) <= u ==> {l..u} Un {u<..} = {l..}"
nipkow@15045
   749
  "(l::'a::linorder) <= u ==> {l..<u} Un {u..} = {l..}"
ballarin@14398
   750
by auto
ballarin@13735
   751
wenzelm@14577
   752
text {* Two- and two-sided intervals *}
ballarin@13735
   753
ballarin@13735
   754
lemma ivl_disj_un_two:
nipkow@15045
   755
  "[| (l::'a::linorder) < m; m <= u |] ==> {l<..<m} Un {m..<u} = {l<..<u}"
nipkow@15045
   756
  "[| (l::'a::linorder) <= m; m < u |] ==> {l<..m} Un {m<..<u} = {l<..<u}"
nipkow@15045
   757
  "[| (l::'a::linorder) <= m; m <= u |] ==> {l..<m} Un {m..<u} = {l..<u}"
nipkow@15045
   758
  "[| (l::'a::linorder) <= m; m < u |] ==> {l..m} Un {m<..<u} = {l..<u}"
nipkow@15045
   759
  "[| (l::'a::linorder) < m; m <= u |] ==> {l<..<m} Un {m..u} = {l<..u}"
nipkow@15045
   760
  "[| (l::'a::linorder) <= m; m <= u |] ==> {l<..m} Un {m<..u} = {l<..u}"
nipkow@15045
   761
  "[| (l::'a::linorder) <= m; m <= u |] ==> {l..<m} Un {m..u} = {l..u}"
nipkow@15045
   762
  "[| (l::'a::linorder) <= m; m <= u |] ==> {l..m} Un {m<..u} = {l..u}"
ballarin@14398
   763
by auto
ballarin@13735
   764
ballarin@13735
   765
lemmas ivl_disj_un = ivl_disj_un_singleton ivl_disj_un_one ivl_disj_un_two
ballarin@13735
   766
wenzelm@14577
   767
subsubsection {* Disjoint Intersections *}
ballarin@13735
   768
wenzelm@14577
   769
text {* One- and two-sided intervals *}
ballarin@13735
   770
ballarin@13735
   771
lemma ivl_disj_int_one:
nipkow@15045
   772
  "{..l::'a::order} Int {l<..<u} = {}"
nipkow@15045
   773
  "{..<l} Int {l..<u} = {}"
nipkow@15045
   774
  "{..l} Int {l<..u} = {}"
nipkow@15045
   775
  "{..<l} Int {l..u} = {}"
nipkow@15045
   776
  "{l<..u} Int {u<..} = {}"
nipkow@15045
   777
  "{l<..<u} Int {u..} = {}"
nipkow@15045
   778
  "{l..u} Int {u<..} = {}"
nipkow@15045
   779
  "{l..<u} Int {u..} = {}"
ballarin@14398
   780
  by auto
ballarin@13735
   781
wenzelm@14577
   782
text {* Two- and two-sided intervals *}
ballarin@13735
   783
ballarin@13735
   784
lemma ivl_disj_int_two:
nipkow@15045
   785
  "{l::'a::order<..<m} Int {m..<u} = {}"
nipkow@15045
   786
  "{l<..m} Int {m<..<u} = {}"
nipkow@15045
   787
  "{l..<m} Int {m..<u} = {}"
nipkow@15045
   788
  "{l..m} Int {m<..<u} = {}"
nipkow@15045
   789
  "{l<..<m} Int {m..u} = {}"
nipkow@15045
   790
  "{l<..m} Int {m<..u} = {}"
nipkow@15045
   791
  "{l..<m} Int {m..u} = {}"
nipkow@15045
   792
  "{l..m} Int {m<..u} = {}"
ballarin@14398
   793
  by auto
ballarin@13735
   794
nipkow@32456
   795
lemmas ivl_disj_int = ivl_disj_int_one ivl_disj_int_two
ballarin@13735
   796
nipkow@15542
   797
subsubsection {* Some Differences *}
nipkow@15542
   798
nipkow@15542
   799
lemma ivl_diff[simp]:
nipkow@15542
   800
 "i \<le> n \<Longrightarrow> {i..<m} - {i..<n} = {n..<(m::'a::linorder)}"
nipkow@15542
   801
by(auto)
nipkow@15542
   802
nipkow@15542
   803
nipkow@15542
   804
subsubsection {* Some Subset Conditions *}
nipkow@15542
   805
paulson@24286
   806
lemma ivl_subset [simp,noatp]:
nipkow@15542
   807
 "({i..<j} \<subseteq> {m..<n}) = (j \<le> i | m \<le> i & j \<le> (n::'a::linorder))"
nipkow@15542
   808
apply(auto simp:linorder_not_le)
nipkow@15542
   809
apply(rule ccontr)
nipkow@15542
   810
apply(insert linorder_le_less_linear[of i n])
nipkow@15542
   811
apply(clarsimp simp:linorder_not_le)
nipkow@15542
   812
apply(fastsimp)
nipkow@15542
   813
done
nipkow@15542
   814
nipkow@15041
   815
nipkow@15042
   816
subsection {* Summation indexed over intervals *}
nipkow@15042
   817
nipkow@15042
   818
syntax
nipkow@15042
   819
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(SUM _ = _.._./ _)" [0,0,0,10] 10)
nipkow@15048
   820
  "_from_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(SUM _ = _..<_./ _)" [0,0,0,10] 10)
nipkow@16052
   821
  "_upt_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(SUM _<_./ _)" [0,0,10] 10)
nipkow@16052
   822
  "_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(SUM _<=_./ _)" [0,0,10] 10)
nipkow@15042
   823
syntax (xsymbols)
nipkow@15042
   824
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _.._./ _)" [0,0,0,10] 10)
nipkow@15048
   825
  "_from_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _..<_./ _)" [0,0,0,10] 10)
nipkow@16052
   826
  "_upt_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_<_./ _)" [0,0,10] 10)
nipkow@16052
   827
  "_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_\<le>_./ _)" [0,0,10] 10)
nipkow@15042
   828
syntax (HTML output)
nipkow@15042
   829
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _.._./ _)" [0,0,0,10] 10)
nipkow@15048
   830
  "_from_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _..<_./ _)" [0,0,0,10] 10)
nipkow@16052
   831
  "_upt_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_<_./ _)" [0,0,10] 10)
nipkow@16052
   832
  "_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_\<le>_./ _)" [0,0,10] 10)
nipkow@15056
   833
syntax (latex_sum output)
nipkow@15052
   834
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
nipkow@15052
   835
 ("(3\<^raw:$\sum_{>_ = _\<^raw:}^{>_\<^raw:}$> _)" [0,0,0,10] 10)
nipkow@15052
   836
  "_from_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
nipkow@15052
   837
 ("(3\<^raw:$\sum_{>_ = _\<^raw:}^{<>_\<^raw:}$> _)" [0,0,0,10] 10)
nipkow@16052
   838
  "_upt_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
nipkow@16052
   839
 ("(3\<^raw:$\sum_{>_ < _\<^raw:}$> _)" [0,0,10] 10)
nipkow@15052
   840
  "_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
nipkow@16052
   841
 ("(3\<^raw:$\sum_{>_ \<le> _\<^raw:}$> _)" [0,0,10] 10)
nipkow@15041
   842
nipkow@15048
   843
translations
nipkow@28853
   844
  "\<Sum>x=a..b. t" == "CONST setsum (%x. t) {a..b}"
nipkow@28853
   845
  "\<Sum>x=a..<b. t" == "CONST setsum (%x. t) {a..<b}"
nipkow@28853
   846
  "\<Sum>i\<le>n. t" == "CONST setsum (\<lambda>i. t) {..n}"
nipkow@28853
   847
  "\<Sum>i<n. t" == "CONST setsum (\<lambda>i. t) {..<n}"
nipkow@15041
   848
nipkow@15052
   849
text{* The above introduces some pretty alternative syntaxes for
nipkow@15056
   850
summation over intervals:
nipkow@15052
   851
\begin{center}
nipkow@15052
   852
\begin{tabular}{lll}
nipkow@15056
   853
Old & New & \LaTeX\\
nipkow@15056
   854
@{term[source]"\<Sum>x\<in>{a..b}. e"} & @{term"\<Sum>x=a..b. e"} & @{term[mode=latex_sum]"\<Sum>x=a..b. e"}\\
nipkow@15056
   855
@{term[source]"\<Sum>x\<in>{a..<b}. e"} & @{term"\<Sum>x=a..<b. e"} & @{term[mode=latex_sum]"\<Sum>x=a..<b. e"}\\
nipkow@16052
   856
@{term[source]"\<Sum>x\<in>{..b}. e"} & @{term"\<Sum>x\<le>b. e"} & @{term[mode=latex_sum]"\<Sum>x\<le>b. e"}\\
nipkow@15056
   857
@{term[source]"\<Sum>x\<in>{..<b}. e"} & @{term"\<Sum>x<b. e"} & @{term[mode=latex_sum]"\<Sum>x<b. e"}
nipkow@15052
   858
\end{tabular}
nipkow@15052
   859
\end{center}
nipkow@15056
   860
The left column shows the term before introduction of the new syntax,
nipkow@15056
   861
the middle column shows the new (default) syntax, and the right column
nipkow@15056
   862
shows a special syntax. The latter is only meaningful for latex output
nipkow@15056
   863
and has to be activated explicitly by setting the print mode to
wenzelm@21502
   864
@{text latex_sum} (e.g.\ via @{text "mode = latex_sum"} in
nipkow@15056
   865
antiquotations). It is not the default \LaTeX\ output because it only
nipkow@15056
   866
works well with italic-style formulae, not tt-style.
nipkow@15052
   867
nipkow@15052
   868
Note that for uniformity on @{typ nat} it is better to use
nipkow@15052
   869
@{term"\<Sum>x::nat=0..<n. e"} rather than @{text"\<Sum>x<n. e"}: @{text setsum} may
nipkow@15052
   870
not provide all lemmas available for @{term"{m..<n}"} also in the
nipkow@15052
   871
special form for @{term"{..<n}"}. *}
nipkow@15052
   872
nipkow@15542
   873
text{* This congruence rule should be used for sums over intervals as
nipkow@15542
   874
the standard theorem @{text[source]setsum_cong} does not work well
nipkow@15542
   875
with the simplifier who adds the unsimplified premise @{term"x:B"} to
nipkow@15542
   876
the context. *}
nipkow@15542
   877
nipkow@15542
   878
lemma setsum_ivl_cong:
nipkow@15542
   879
 "\<lbrakk>a = c; b = d; !!x. \<lbrakk> c \<le> x; x < d \<rbrakk> \<Longrightarrow> f x = g x \<rbrakk> \<Longrightarrow>
nipkow@15542
   880
 setsum f {a..<b} = setsum g {c..<d}"
nipkow@15542
   881
by(rule setsum_cong, simp_all)
nipkow@15041
   882
nipkow@16041
   883
(* FIXME why are the following simp rules but the corresponding eqns
nipkow@16041
   884
on intervals are not? *)
nipkow@16041
   885
nipkow@16052
   886
lemma setsum_atMost_Suc[simp]: "(\<Sum>i \<le> Suc n. f i) = (\<Sum>i \<le> n. f i) + f(Suc n)"
nipkow@16052
   887
by (simp add:atMost_Suc add_ac)
nipkow@16052
   888
nipkow@16041
   889
lemma setsum_lessThan_Suc[simp]: "(\<Sum>i < Suc n. f i) = (\<Sum>i < n. f i) + f n"
nipkow@16041
   890
by (simp add:lessThan_Suc add_ac)
nipkow@15041
   891
nipkow@15911
   892
lemma setsum_cl_ivl_Suc[simp]:
nipkow@15561
   893
  "setsum f {m..Suc n} = (if Suc n < m then 0 else setsum f {m..n} + f(Suc n))"
nipkow@15561
   894
by (auto simp:add_ac atLeastAtMostSuc_conv)
nipkow@15561
   895
nipkow@15911
   896
lemma setsum_op_ivl_Suc[simp]:
nipkow@15561
   897
  "setsum f {m..<Suc n} = (if n < m then 0 else setsum f {m..<n} + f(n))"
nipkow@15561
   898
by (auto simp:add_ac atLeastLessThanSuc)
nipkow@16041
   899
(*
nipkow@15561
   900
lemma setsum_cl_ivl_add_one_nat: "(n::nat) <= m + 1 ==>
nipkow@15561
   901
    (\<Sum>i=n..m+1. f i) = (\<Sum>i=n..m. f i) + f(m + 1)"
nipkow@15561
   902
by (auto simp:add_ac atLeastAtMostSuc_conv)
nipkow@16041
   903
*)
nipkow@28068
   904
nipkow@28068
   905
lemma setsum_head:
nipkow@28068
   906
  fixes n :: nat
nipkow@28068
   907
  assumes mn: "m <= n" 
nipkow@28068
   908
  shows "(\<Sum>x\<in>{m..n}. P x) = P m + (\<Sum>x\<in>{m<..n}. P x)" (is "?lhs = ?rhs")
nipkow@28068
   909
proof -
nipkow@28068
   910
  from mn
nipkow@28068
   911
  have "{m..n} = {m} \<union> {m<..n}"
nipkow@28068
   912
    by (auto intro: ivl_disj_un_singleton)
nipkow@28068
   913
  hence "?lhs = (\<Sum>x\<in>{m} \<union> {m<..n}. P x)"
nipkow@28068
   914
    by (simp add: atLeast0LessThan)
nipkow@28068
   915
  also have "\<dots> = ?rhs" by simp
nipkow@28068
   916
  finally show ?thesis .
nipkow@28068
   917
qed
nipkow@28068
   918
nipkow@28068
   919
lemma setsum_head_Suc:
nipkow@28068
   920
  "m \<le> n \<Longrightarrow> setsum f {m..n} = f m + setsum f {Suc m..n}"
nipkow@28068
   921
by (simp add: setsum_head atLeastSucAtMost_greaterThanAtMost)
nipkow@28068
   922
nipkow@28068
   923
lemma setsum_head_upt_Suc:
nipkow@28068
   924
  "m < n \<Longrightarrow> setsum f {m..<n} = f m + setsum f {Suc m..<n}"
huffman@30079
   925
apply(insert setsum_head_Suc[of m "n - Suc 0" f])
nipkow@29667
   926
apply (simp add: atLeastLessThanSuc_atLeastAtMost[symmetric] algebra_simps)
nipkow@28068
   927
done
nipkow@28068
   928
nipkow@31501
   929
lemma setsum_ub_add_nat: assumes "(m::nat) \<le> n + 1"
nipkow@31501
   930
  shows "setsum f {m..n + p} = setsum f {m..n} + setsum f {n + 1..n + p}"
nipkow@31501
   931
proof-
nipkow@31501
   932
  have "{m .. n+p} = {m..n} \<union> {n+1..n+p}" using `m \<le> n+1` by auto
nipkow@31501
   933
  thus ?thesis by (auto simp: ivl_disj_int setsum_Un_disjoint
nipkow@31501
   934
    atLeastSucAtMost_greaterThanAtMost)
nipkow@31501
   935
qed
nipkow@28068
   936
nipkow@15539
   937
lemma setsum_add_nat_ivl: "\<lbrakk> m \<le> n; n \<le> p \<rbrakk> \<Longrightarrow>
nipkow@15539
   938
  setsum f {m..<n} + setsum f {n..<p} = setsum f {m..<p::nat}"
nipkow@15539
   939
by (simp add:setsum_Un_disjoint[symmetric] ivl_disj_int ivl_disj_un)
nipkow@15539
   940
nipkow@15539
   941
lemma setsum_diff_nat_ivl:
nipkow@15539
   942
fixes f :: "nat \<Rightarrow> 'a::ab_group_add"
nipkow@15539
   943
shows "\<lbrakk> m \<le> n; n \<le> p \<rbrakk> \<Longrightarrow>
nipkow@15539
   944
  setsum f {m..<p} - setsum f {m..<n} = setsum f {n..<p}"
nipkow@15539
   945
using setsum_add_nat_ivl [of m n p f,symmetric]
nipkow@15539
   946
apply (simp add: add_ac)
nipkow@15539
   947
done
nipkow@15539
   948
nipkow@31505
   949
lemma setsum_natinterval_difff:
nipkow@31505
   950
  fixes f:: "nat \<Rightarrow> ('a::ab_group_add)"
nipkow@31505
   951
  shows  "setsum (\<lambda>k. f k - f(k + 1)) {(m::nat) .. n} =
nipkow@31505
   952
          (if m <= n then f m - f(n + 1) else 0)"
nipkow@31505
   953
by (induct n, auto simp add: algebra_simps not_le le_Suc_eq)
nipkow@31505
   954
nipkow@31509
   955
lemmas setsum_restrict_set' = setsum_restrict_set[unfolded Int_def]
nipkow@31509
   956
nipkow@31509
   957
lemma setsum_setsum_restrict:
nipkow@31509
   958
  "finite S \<Longrightarrow> finite T \<Longrightarrow> setsum (\<lambda>x. setsum (\<lambda>y. f x y) {y. y\<in> T \<and> R x y}) S = setsum (\<lambda>y. setsum (\<lambda>x. f x y) {x. x \<in> S \<and> R x y}) T"
nipkow@31509
   959
  by (simp add: setsum_restrict_set'[unfolded mem_def] mem_def)
nipkow@31509
   960
     (rule setsum_commute)
nipkow@31509
   961
nipkow@31509
   962
lemma setsum_image_gen: assumes fS: "finite S"
nipkow@31509
   963
  shows "setsum g S = setsum (\<lambda>y. setsum g {x. x \<in> S \<and> f x = y}) (f ` S)"
nipkow@31509
   964
proof-
nipkow@31509
   965
  { fix x assume "x \<in> S" then have "{y. y\<in> f`S \<and> f x = y} = {f x}" by auto }
nipkow@31509
   966
  hence "setsum g S = setsum (\<lambda>x. setsum (\<lambda>y. g x) {y. y\<in> f`S \<and> f x = y}) S"
nipkow@31509
   967
    by simp
nipkow@31509
   968
  also have "\<dots> = setsum (\<lambda>y. setsum g {x. x \<in> S \<and> f x = y}) (f ` S)"
nipkow@31509
   969
    by (rule setsum_setsum_restrict[OF fS finite_imageI[OF fS]])
nipkow@31509
   970
  finally show ?thesis .
nipkow@31509
   971
qed
nipkow@31509
   972
nipkow@31509
   973
lemma setsum_multicount_gen:
nipkow@31509
   974
  assumes "finite s" "finite t" "\<forall>j\<in>t. (card {i\<in>s. R i j} = k j)"
nipkow@31509
   975
  shows "setsum (\<lambda>i. (card {j\<in>t. R i j})) s = setsum k t" (is "?l = ?r")
nipkow@31509
   976
proof-
nipkow@31509
   977
  have "?l = setsum (\<lambda>i. setsum (\<lambda>x.1) {j\<in>t. R i j}) s" by auto
nipkow@31509
   978
  also have "\<dots> = ?r" unfolding setsum_setsum_restrict[OF assms(1-2)]
nipkow@31509
   979
    using assms(3) by auto
nipkow@31509
   980
  finally show ?thesis .
nipkow@31509
   981
qed
nipkow@31509
   982
nipkow@31509
   983
lemma setsum_multicount:
nipkow@31509
   984
  assumes "finite S" "finite T" "\<forall>j\<in>T. (card {i\<in>S. R i j} = k)"
nipkow@31509
   985
  shows "setsum (\<lambda>i. card {j\<in>T. R i j}) S = k * card T" (is "?l = ?r")
nipkow@31509
   986
proof-
nipkow@31509
   987
  have "?l = setsum (\<lambda>i. k) T" by(rule setsum_multicount_gen)(auto simp:assms)
nipkow@31509
   988
  also have "\<dots> = ?r" by(simp add: setsum_constant mult_commute)
nipkow@31509
   989
  finally show ?thesis by auto
nipkow@31509
   990
qed
nipkow@31509
   991
nipkow@28068
   992
nipkow@16733
   993
subsection{* Shifting bounds *}
nipkow@16733
   994
nipkow@15539
   995
lemma setsum_shift_bounds_nat_ivl:
nipkow@15539
   996
  "setsum f {m+k..<n+k} = setsum (%i. f(i + k)){m..<n::nat}"
nipkow@15539
   997
by (induct "n", auto simp:atLeastLessThanSuc)
nipkow@15539
   998
nipkow@16733
   999
lemma setsum_shift_bounds_cl_nat_ivl:
nipkow@16733
  1000
  "setsum f {m+k..n+k} = setsum (%i. f(i + k)){m..n::nat}"
nipkow@16733
  1001
apply (insert setsum_reindex[OF inj_on_add_nat, where h=f and B = "{m..n}"])
nipkow@16733
  1002
apply (simp add:image_add_atLeastAtMost o_def)
nipkow@16733
  1003
done
nipkow@16733
  1004
nipkow@16733
  1005
corollary setsum_shift_bounds_cl_Suc_ivl:
nipkow@16733
  1006
  "setsum f {Suc m..Suc n} = setsum (%i. f(Suc i)){m..n}"
huffman@30079
  1007
by (simp add:setsum_shift_bounds_cl_nat_ivl[where k="Suc 0", simplified])
nipkow@16733
  1008
nipkow@16733
  1009
corollary setsum_shift_bounds_Suc_ivl:
nipkow@16733
  1010
  "setsum f {Suc m..<Suc n} = setsum (%i. f(Suc i)){m..<n}"
huffman@30079
  1011
by (simp add:setsum_shift_bounds_nat_ivl[where k="Suc 0", simplified])
nipkow@16733
  1012
nipkow@28068
  1013
lemma setsum_shift_lb_Suc0_0:
nipkow@28068
  1014
  "f(0::nat) = (0::nat) \<Longrightarrow> setsum f {Suc 0..k} = setsum f {0..k}"
nipkow@28068
  1015
by(simp add:setsum_head_Suc)
kleing@19106
  1016
nipkow@28068
  1017
lemma setsum_shift_lb_Suc0_0_upt:
nipkow@28068
  1018
  "f(0::nat) = 0 \<Longrightarrow> setsum f {Suc 0..<k} = setsum f {0..<k}"
nipkow@28068
  1019
apply(cases k)apply simp
nipkow@28068
  1020
apply(simp add:setsum_head_upt_Suc)
nipkow@28068
  1021
done
kleing@19022
  1022
ballarin@17149
  1023
subsection {* The formula for geometric sums *}
ballarin@17149
  1024
ballarin@17149
  1025
lemma geometric_sum:
ballarin@17149
  1026
  "x ~= 1 ==> (\<Sum>i=0..<n. x ^ i) =
haftmann@31017
  1027
  (x ^ n - 1) / (x - 1::'a::{field})"
nipkow@23496
  1028
by (induct "n") (simp_all add:field_simps power_Suc)
ballarin@17149
  1029
kleing@19469
  1030
subsection {* The formula for arithmetic sums *}
kleing@19469
  1031
kleing@19469
  1032
lemma gauss_sum:
huffman@23277
  1033
  "((1::'a::comm_semiring_1) + 1)*(\<Sum>i\<in>{1..n}. of_nat i) =
kleing@19469
  1034
   of_nat n*((of_nat n)+1)"
kleing@19469
  1035
proof (induct n)
kleing@19469
  1036
  case 0
kleing@19469
  1037
  show ?case by simp
kleing@19469
  1038
next
kleing@19469
  1039
  case (Suc n)
nipkow@29667
  1040
  then show ?case by (simp add: algebra_simps)
kleing@19469
  1041
qed
kleing@19469
  1042
kleing@19469
  1043
theorem arith_series_general:
huffman@23277
  1044
  "((1::'a::comm_semiring_1) + 1) * (\<Sum>i\<in>{..<n}. a + of_nat i * d) =
kleing@19469
  1045
  of_nat n * (a + (a + of_nat(n - 1)*d))"
kleing@19469
  1046
proof cases
kleing@19469
  1047
  assume ngt1: "n > 1"
kleing@19469
  1048
  let ?I = "\<lambda>i. of_nat i" and ?n = "of_nat n"
kleing@19469
  1049
  have
kleing@19469
  1050
    "(\<Sum>i\<in>{..<n}. a+?I i*d) =
kleing@19469
  1051
     ((\<Sum>i\<in>{..<n}. a) + (\<Sum>i\<in>{..<n}. ?I i*d))"
kleing@19469
  1052
    by (rule setsum_addf)
kleing@19469
  1053
  also from ngt1 have "\<dots> = ?n*a + (\<Sum>i\<in>{..<n}. ?I i*d)" by simp
kleing@19469
  1054
  also from ngt1 have "\<dots> = (?n*a + d*(\<Sum>i\<in>{1..<n}. ?I i))"
huffman@30079
  1055
    unfolding One_nat_def
nipkow@28068
  1056
    by (simp add: setsum_right_distrib atLeast0LessThan[symmetric] setsum_shift_lb_Suc0_0_upt mult_ac)
kleing@19469
  1057
  also have "(1+1)*\<dots> = (1+1)*?n*a + d*(1+1)*(\<Sum>i\<in>{1..<n}. ?I i)"
kleing@19469
  1058
    by (simp add: left_distrib right_distrib)
kleing@19469
  1059
  also from ngt1 have "{1..<n} = {1..n - 1}"
nipkow@28068
  1060
    by (cases n) (auto simp: atLeastLessThanSuc_atLeastAtMost)
nipkow@28068
  1061
  also from ngt1
kleing@19469
  1062
  have "(1+1)*?n*a + d*(1+1)*(\<Sum>i\<in>{1..n - 1}. ?I i) = ((1+1)*?n*a + d*?I (n - 1)*?I n)"
huffman@30079
  1063
    by (simp only: mult_ac gauss_sum [of "n - 1"], unfold One_nat_def)
huffman@23431
  1064
       (simp add:  mult_ac trans [OF add_commute of_nat_Suc [symmetric]])
nipkow@29667
  1065
  finally show ?thesis by (simp add: algebra_simps)
kleing@19469
  1066
next
kleing@19469
  1067
  assume "\<not>(n > 1)"
kleing@19469
  1068
  hence "n = 1 \<or> n = 0" by auto
nipkow@29667
  1069
  thus ?thesis by (auto simp: algebra_simps)
kleing@19469
  1070
qed
kleing@19469
  1071
kleing@19469
  1072
lemma arith_series_nat:
kleing@19469
  1073
  "Suc (Suc 0) * (\<Sum>i\<in>{..<n}. a+i*d) = n * (a + (a+(n - 1)*d))"
kleing@19469
  1074
proof -
kleing@19469
  1075
  have
kleing@19469
  1076
    "((1::nat) + 1) * (\<Sum>i\<in>{..<n::nat}. a + of_nat(i)*d) =
kleing@19469
  1077
    of_nat(n) * (a + (a + of_nat(n - 1)*d))"
kleing@19469
  1078
    by (rule arith_series_general)
huffman@30079
  1079
  thus ?thesis
huffman@30079
  1080
    unfolding One_nat_def by (auto simp add: of_nat_id)
kleing@19469
  1081
qed
kleing@19469
  1082
kleing@19469
  1083
lemma arith_series_int:
kleing@19469
  1084
  "(2::int) * (\<Sum>i\<in>{..<n}. a + of_nat i * d) =
kleing@19469
  1085
  of_nat n * (a + (a + of_nat(n - 1)*d))"
kleing@19469
  1086
proof -
kleing@19469
  1087
  have
kleing@19469
  1088
    "((1::int) + 1) * (\<Sum>i\<in>{..<n}. a + of_nat i * d) =
kleing@19469
  1089
    of_nat(n) * (a + (a + of_nat(n - 1)*d))"
kleing@19469
  1090
    by (rule arith_series_general)
kleing@19469
  1091
  thus ?thesis by simp
kleing@19469
  1092
qed
paulson@15418
  1093
kleing@19022
  1094
lemma sum_diff_distrib:
kleing@19022
  1095
  fixes P::"nat\<Rightarrow>nat"
kleing@19022
  1096
  shows
kleing@19022
  1097
  "\<forall>x. Q x \<le> P x  \<Longrightarrow>
kleing@19022
  1098
  (\<Sum>x<n. P x) - (\<Sum>x<n. Q x) = (\<Sum>x<n. P x - Q x)"
kleing@19022
  1099
proof (induct n)
kleing@19022
  1100
  case 0 show ?case by simp
kleing@19022
  1101
next
kleing@19022
  1102
  case (Suc n)
kleing@19022
  1103
kleing@19022
  1104
  let ?lhs = "(\<Sum>x<n. P x) - (\<Sum>x<n. Q x)"
kleing@19022
  1105
  let ?rhs = "\<Sum>x<n. P x - Q x"
kleing@19022
  1106
kleing@19022
  1107
  from Suc have "?lhs = ?rhs" by simp
kleing@19022
  1108
  moreover
kleing@19022
  1109
  from Suc have "?lhs + P n - Q n = ?rhs + (P n - Q n)" by simp
kleing@19022
  1110
  moreover
kleing@19022
  1111
  from Suc have
kleing@19022
  1112
    "(\<Sum>x<n. P x) + P n - ((\<Sum>x<n. Q x) + Q n) = ?rhs + (P n - Q n)"
kleing@19022
  1113
    by (subst diff_diff_left[symmetric],
kleing@19022
  1114
        subst diff_add_assoc2)
kleing@19022
  1115
       (auto simp: diff_add_assoc2 intro: setsum_mono)
kleing@19022
  1116
  ultimately
kleing@19022
  1117
  show ?case by simp
kleing@19022
  1118
qed
kleing@19022
  1119
paulson@29960
  1120
subsection {* Products indexed over intervals *}
paulson@29960
  1121
paulson@29960
  1122
syntax
paulson@29960
  1123
  "_from_to_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(PROD _ = _.._./ _)" [0,0,0,10] 10)
paulson@29960
  1124
  "_from_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(PROD _ = _..<_./ _)" [0,0,0,10] 10)
paulson@29960
  1125
  "_upt_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(PROD _<_./ _)" [0,0,10] 10)
paulson@29960
  1126
  "_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(PROD _<=_./ _)" [0,0,10] 10)
paulson@29960
  1127
syntax (xsymbols)
paulson@29960
  1128
  "_from_to_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_ = _.._./ _)" [0,0,0,10] 10)
paulson@29960
  1129
  "_from_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_ = _..<_./ _)" [0,0,0,10] 10)
paulson@29960
  1130
  "_upt_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_<_./ _)" [0,0,10] 10)
paulson@29960
  1131
  "_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_\<le>_./ _)" [0,0,10] 10)
paulson@29960
  1132
syntax (HTML output)
paulson@29960
  1133
  "_from_to_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_ = _.._./ _)" [0,0,0,10] 10)
paulson@29960
  1134
  "_from_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_ = _..<_./ _)" [0,0,0,10] 10)
paulson@29960
  1135
  "_upt_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_<_./ _)" [0,0,10] 10)
paulson@29960
  1136
  "_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_\<le>_./ _)" [0,0,10] 10)
paulson@29960
  1137
syntax (latex_prod output)
paulson@29960
  1138
  "_from_to_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
paulson@29960
  1139
 ("(3\<^raw:$\prod_{>_ = _\<^raw:}^{>_\<^raw:}$> _)" [0,0,0,10] 10)
paulson@29960
  1140
  "_from_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
paulson@29960
  1141
 ("(3\<^raw:$\prod_{>_ = _\<^raw:}^{<>_\<^raw:}$> _)" [0,0,0,10] 10)
paulson@29960
  1142
  "_upt_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
paulson@29960
  1143
 ("(3\<^raw:$\prod_{>_ < _\<^raw:}$> _)" [0,0,10] 10)
paulson@29960
  1144
  "_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
paulson@29960
  1145
 ("(3\<^raw:$\prod_{>_ \<le> _\<^raw:}$> _)" [0,0,10] 10)
paulson@29960
  1146
paulson@29960
  1147
translations
paulson@29960
  1148
  "\<Prod>x=a..b. t" == "CONST setprod (%x. t) {a..b}"
paulson@29960
  1149
  "\<Prod>x=a..<b. t" == "CONST setprod (%x. t) {a..<b}"
paulson@29960
  1150
  "\<Prod>i\<le>n. t" == "CONST setprod (\<lambda>i. t) {..n}"
paulson@29960
  1151
  "\<Prod>i<n. t" == "CONST setprod (\<lambda>i. t) {..<n}"
paulson@29960
  1152
haftmann@33318
  1153
subsection {* Transfer setup *}
haftmann@33318
  1154
haftmann@33318
  1155
lemma transfer_nat_int_set_functions:
haftmann@33318
  1156
    "{..n} = nat ` {0..int n}"
haftmann@33318
  1157
    "{m..n} = nat ` {int m..int n}"  (* need all variants of these! *)
haftmann@33318
  1158
  apply (auto simp add: image_def)
haftmann@33318
  1159
  apply (rule_tac x = "int x" in bexI)
haftmann@33318
  1160
  apply auto
haftmann@33318
  1161
  apply (rule_tac x = "int x" in bexI)
haftmann@33318
  1162
  apply auto
haftmann@33318
  1163
  done
haftmann@33318
  1164
haftmann@33318
  1165
lemma transfer_nat_int_set_function_closures:
haftmann@33318
  1166
    "x >= 0 \<Longrightarrow> nat_set {x..y}"
haftmann@33318
  1167
  by (simp add: nat_set_def)
haftmann@33318
  1168
haftmann@33318
  1169
declare TransferMorphism_nat_int[transfer add
haftmann@33318
  1170
  return: transfer_nat_int_set_functions
haftmann@33318
  1171
    transfer_nat_int_set_function_closures
haftmann@33318
  1172
]
haftmann@33318
  1173
haftmann@33318
  1174
lemma transfer_int_nat_set_functions:
haftmann@33318
  1175
    "is_nat m \<Longrightarrow> is_nat n \<Longrightarrow> {m..n} = int ` {nat m..nat n}"
haftmann@33318
  1176
  by (simp only: is_nat_def transfer_nat_int_set_functions
haftmann@33318
  1177
    transfer_nat_int_set_function_closures
haftmann@33318
  1178
    transfer_nat_int_set_return_embed nat_0_le
haftmann@33318
  1179
    cong: transfer_nat_int_set_cong)
haftmann@33318
  1180
haftmann@33318
  1181
lemma transfer_int_nat_set_function_closures:
haftmann@33318
  1182
    "is_nat x \<Longrightarrow> nat_set {x..y}"
haftmann@33318
  1183
  by (simp only: transfer_nat_int_set_function_closures is_nat_def)
haftmann@33318
  1184
haftmann@33318
  1185
declare TransferMorphism_int_nat[transfer add
haftmann@33318
  1186
  return: transfer_int_nat_set_functions
haftmann@33318
  1187
    transfer_int_nat_set_function_closures
haftmann@33318
  1188
]
haftmann@33318
  1189
nipkow@8924
  1190
end