src/HOL/SetInterval.thy
author hoelzl
Thu Sep 02 10:14:32 2010 +0200 (2010-09-02)
changeset 39072 1030b1a166ef
parent 37664 2946b8f057df
child 39198 f967a16dfcdd
permissions -rw-r--r--
Add lessThan_Suc_eq_insert_0
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
huffman@36364
    57
  "_UNION_le"   :: "'a => 'a => 'b set => 'b set"       ("(3UN _<=_./ _)" [0, 0, 10] 10)
huffman@36364
    58
  "_UNION_less" :: "'a => 'a => 'b set => 'b set"       ("(3UN _<_./ _)" [0, 0, 10] 10)
huffman@36364
    59
  "_INTER_le"   :: "'a => 'a => 'b set => 'b set"       ("(3INT _<=_./ _)" [0, 0, 10] 10)
huffman@36364
    60
  "_INTER_less" :: "'a => 'a => 'b set => 'b set"       ("(3INT _<_./ _)" [0, 0, 10] 10)
kleing@14418
    61
nipkow@30372
    62
syntax (xsymbols)
huffman@36364
    63
  "_UNION_le"   :: "'a => 'a => 'b set => 'b set"       ("(3\<Union> _\<le>_./ _)" [0, 0, 10] 10)
huffman@36364
    64
  "_UNION_less" :: "'a => 'a => 'b set => 'b set"       ("(3\<Union> _<_./ _)" [0, 0, 10] 10)
huffman@36364
    65
  "_INTER_le"   :: "'a => 'a => 'b set => 'b set"       ("(3\<Inter> _\<le>_./ _)" [0, 0, 10] 10)
huffman@36364
    66
  "_INTER_less" :: "'a => 'a => 'b set => 'b set"       ("(3\<Inter> _<_./ _)" [0, 0, 10] 10)
kleing@14418
    67
nipkow@30372
    68
syntax (latex output)
huffman@36364
    69
  "_UNION_le"   :: "'a \<Rightarrow> 'a => 'b set => 'b set"       ("(3\<Union>(00_ \<le> _)/ _)" [0, 0, 10] 10)
huffman@36364
    70
  "_UNION_less" :: "'a \<Rightarrow> 'a => 'b set => 'b set"       ("(3\<Union>(00_ < _)/ _)" [0, 0, 10] 10)
huffman@36364
    71
  "_INTER_le"   :: "'a \<Rightarrow> 'a => 'b set => 'b set"       ("(3\<Inter>(00_ \<le> _)/ _)" [0, 0, 10] 10)
huffman@36364
    72
  "_INTER_less" :: "'a \<Rightarrow> 'a => 'b set => 'b set"       ("(3\<Inter>(00_ < _)/ _)" [0, 0, 10] 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
blanchet@35828
   168
lemma greaterThanLessThan_iff [simp,no_atp]:
haftmann@25062
   169
  "(i : {l<..<u}) = (l < i & i < u)"
ballarin@13735
   170
by (simp add: greaterThanLessThan_def)
ballarin@13735
   171
blanchet@35828
   172
lemma atLeastLessThan_iff [simp,no_atp]:
haftmann@25062
   173
  "(i : {l..<u}) = (l <= i & i < u)"
ballarin@13735
   174
by (simp add: atLeastLessThan_def)
ballarin@13735
   175
blanchet@35828
   176
lemma greaterThanAtMost_iff [simp,no_atp]:
haftmann@25062
   177
  "(i : {l<..u}) = (l < i & i <= u)"
ballarin@13735
   178
by (simp add: greaterThanAtMost_def)
ballarin@13735
   179
blanchet@35828
   180
lemma atLeastAtMost_iff [simp,no_atp]:
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
hoelzl@36846
   234
lemma atLeastAtMost_singleton': "a = b \<Longrightarrow> {a .. b} = {a}" by simp
hoelzl@36846
   235
nipkow@32400
   236
lemma atLeastatMost_subset_iff[simp]:
nipkow@32400
   237
  "{a..b} <= {c..d} \<longleftrightarrow> (~ a <= b) | c <= a & b <= d"
nipkow@32400
   238
unfolding atLeastAtMost_def atLeast_def atMost_def
nipkow@32400
   239
by (blast intro: order_trans)
nipkow@32400
   240
nipkow@32400
   241
lemma atLeastatMost_psubset_iff:
nipkow@32400
   242
  "{a..b} < {c..d} \<longleftrightarrow>
nipkow@32400
   243
   ((~ a <= b) | c <= a & b <= d & (c < a | b < d))  &  c <= d"
nipkow@32400
   244
by(simp add: psubset_eq expand_set_eq less_le_not_le)(blast intro: order_trans)
nipkow@32400
   245
hoelzl@36846
   246
lemma atLeastAtMost_singleton_iff[simp]:
hoelzl@36846
   247
  "{a .. b} = {c} \<longleftrightarrow> a = b \<and> b = c"
hoelzl@36846
   248
proof
hoelzl@36846
   249
  assume "{a..b} = {c}"
hoelzl@36846
   250
  hence "\<not> (\<not> a \<le> b)" unfolding atLeastatMost_empty_iff[symmetric] by simp
hoelzl@36846
   251
  moreover with `{a..b} = {c}` have "c \<le> a \<and> b \<le> c" by auto
hoelzl@36846
   252
  ultimately show "a = b \<and> b = c" by auto
hoelzl@36846
   253
qed simp
hoelzl@36846
   254
nipkow@24691
   255
end
paulson@14485
   256
nipkow@32408
   257
lemma (in linorder) atLeastLessThan_subset_iff:
nipkow@32408
   258
  "{a..<b} <= {c..<d} \<Longrightarrow> b <= a | c<=a & b<=d"
nipkow@32408
   259
apply (auto simp:subset_eq Ball_def)
nipkow@32408
   260
apply(frule_tac x=a in spec)
nipkow@32408
   261
apply(erule_tac x=d in allE)
nipkow@32408
   262
apply (simp add: less_imp_le)
nipkow@32408
   263
done
nipkow@32408
   264
nipkow@32456
   265
subsubsection {* Intersection *}
nipkow@32456
   266
nipkow@32456
   267
context linorder
nipkow@32456
   268
begin
nipkow@32456
   269
nipkow@32456
   270
lemma Int_atLeastAtMost[simp]: "{a..b} Int {c..d} = {max a c .. min b d}"
nipkow@32456
   271
by auto
nipkow@32456
   272
nipkow@32456
   273
lemma Int_atLeastAtMostR1[simp]: "{..b} Int {c..d} = {c .. min b d}"
nipkow@32456
   274
by auto
nipkow@32456
   275
nipkow@32456
   276
lemma Int_atLeastAtMostR2[simp]: "{a..} Int {c..d} = {max a c .. d}"
nipkow@32456
   277
by auto
nipkow@32456
   278
nipkow@32456
   279
lemma Int_atLeastAtMostL1[simp]: "{a..b} Int {..d} = {a .. min b d}"
nipkow@32456
   280
by auto
nipkow@32456
   281
nipkow@32456
   282
lemma Int_atLeastAtMostL2[simp]: "{a..b} Int {c..} = {max a c .. b}"
nipkow@32456
   283
by auto
nipkow@32456
   284
nipkow@32456
   285
lemma Int_atLeastLessThan[simp]: "{a..<b} Int {c..<d} = {max a c ..< min b d}"
nipkow@32456
   286
by auto
nipkow@32456
   287
nipkow@32456
   288
lemma Int_greaterThanAtMost[simp]: "{a<..b} Int {c<..d} = {max a c <.. min b d}"
nipkow@32456
   289
by auto
nipkow@32456
   290
nipkow@32456
   291
lemma Int_greaterThanLessThan[simp]: "{a<..<b} Int {c<..<d} = {max a c <..< min b d}"
nipkow@32456
   292
by auto
nipkow@32456
   293
nipkow@32456
   294
end
nipkow@32456
   295
nipkow@32456
   296
paulson@14485
   297
subsection {* Intervals of natural numbers *}
paulson@14485
   298
paulson@15047
   299
subsubsection {* The Constant @{term lessThan} *}
paulson@15047
   300
paulson@14485
   301
lemma lessThan_0 [simp]: "lessThan (0::nat) = {}"
paulson@14485
   302
by (simp add: lessThan_def)
paulson@14485
   303
paulson@14485
   304
lemma lessThan_Suc: "lessThan (Suc k) = insert k (lessThan k)"
paulson@14485
   305
by (simp add: lessThan_def less_Suc_eq, blast)
paulson@14485
   306
hoelzl@39072
   307
text {* The following proof is convinient in induction proofs where
hoelzl@39072
   308
new elements get indices at the beginning. So it is used to transform
hoelzl@39072
   309
@{term "{..<Suc n}"} to @{term "0::nat"} and @{term "{..< n}"}. *}
hoelzl@39072
   310
hoelzl@39072
   311
lemma lessThan_Suc_eq_insert_0: "{..<Suc n} = insert 0 (Suc ` {..<n})"
hoelzl@39072
   312
proof safe
hoelzl@39072
   313
  fix x assume "x < Suc n" "x \<notin> Suc ` {..<n}"
hoelzl@39072
   314
  then have "x \<noteq> Suc (x - 1)" by auto
hoelzl@39072
   315
  with `x < Suc n` show "x = 0" by auto
hoelzl@39072
   316
qed
hoelzl@39072
   317
paulson@14485
   318
lemma lessThan_Suc_atMost: "lessThan (Suc k) = atMost k"
paulson@14485
   319
by (simp add: lessThan_def atMost_def less_Suc_eq_le)
paulson@14485
   320
paulson@14485
   321
lemma UN_lessThan_UNIV: "(UN m::nat. lessThan m) = UNIV"
paulson@14485
   322
by blast
paulson@14485
   323
paulson@15047
   324
subsubsection {* The Constant @{term greaterThan} *}
paulson@15047
   325
paulson@14485
   326
lemma greaterThan_0 [simp]: "greaterThan 0 = range Suc"
paulson@14485
   327
apply (simp add: greaterThan_def)
paulson@14485
   328
apply (blast dest: gr0_conv_Suc [THEN iffD1])
paulson@14485
   329
done
paulson@14485
   330
paulson@14485
   331
lemma greaterThan_Suc: "greaterThan (Suc k) = greaterThan k - {Suc k}"
paulson@14485
   332
apply (simp add: greaterThan_def)
paulson@14485
   333
apply (auto elim: linorder_neqE)
paulson@14485
   334
done
paulson@14485
   335
paulson@14485
   336
lemma INT_greaterThan_UNIV: "(INT m::nat. greaterThan m) = {}"
paulson@14485
   337
by blast
paulson@14485
   338
paulson@15047
   339
subsubsection {* The Constant @{term atLeast} *}
paulson@15047
   340
paulson@14485
   341
lemma atLeast_0 [simp]: "atLeast (0::nat) = UNIV"
paulson@14485
   342
by (unfold atLeast_def UNIV_def, simp)
paulson@14485
   343
paulson@14485
   344
lemma atLeast_Suc: "atLeast (Suc k) = atLeast k - {k}"
paulson@14485
   345
apply (simp add: atLeast_def)
paulson@14485
   346
apply (simp add: Suc_le_eq)
paulson@14485
   347
apply (simp add: order_le_less, blast)
paulson@14485
   348
done
paulson@14485
   349
paulson@14485
   350
lemma atLeast_Suc_greaterThan: "atLeast (Suc k) = greaterThan k"
paulson@14485
   351
  by (auto simp add: greaterThan_def atLeast_def less_Suc_eq_le)
paulson@14485
   352
paulson@14485
   353
lemma UN_atLeast_UNIV: "(UN m::nat. atLeast m) = UNIV"
paulson@14485
   354
by blast
paulson@14485
   355
paulson@15047
   356
subsubsection {* The Constant @{term atMost} *}
paulson@15047
   357
paulson@14485
   358
lemma atMost_0 [simp]: "atMost (0::nat) = {0}"
paulson@14485
   359
by (simp add: atMost_def)
paulson@14485
   360
paulson@14485
   361
lemma atMost_Suc: "atMost (Suc k) = insert (Suc k) (atMost k)"
paulson@14485
   362
apply (simp add: atMost_def)
paulson@14485
   363
apply (simp add: less_Suc_eq order_le_less, blast)
paulson@14485
   364
done
paulson@14485
   365
paulson@14485
   366
lemma UN_atMost_UNIV: "(UN m::nat. atMost m) = UNIV"
paulson@14485
   367
by blast
paulson@14485
   368
paulson@15047
   369
subsubsection {* The Constant @{term atLeastLessThan} *}
paulson@15047
   370
nipkow@28068
   371
text{*The orientation of the following 2 rules is tricky. The lhs is
nipkow@24449
   372
defined in terms of the rhs.  Hence the chosen orientation makes sense
nipkow@24449
   373
in this theory --- the reverse orientation complicates proofs (eg
nipkow@24449
   374
nontermination). But outside, when the definition of the lhs is rarely
nipkow@24449
   375
used, the opposite orientation seems preferable because it reduces a
nipkow@24449
   376
specific concept to a more general one. *}
nipkow@28068
   377
paulson@15047
   378
lemma atLeast0LessThan: "{0::nat..<n} = {..<n}"
nipkow@15042
   379
by(simp add:lessThan_def atLeastLessThan_def)
nipkow@24449
   380
nipkow@28068
   381
lemma atLeast0AtMost: "{0..n::nat} = {..n}"
nipkow@28068
   382
by(simp add:atMost_def atLeastAtMost_def)
nipkow@28068
   383
haftmann@31998
   384
declare atLeast0LessThan[symmetric, code_unfold]
haftmann@31998
   385
        atLeast0AtMost[symmetric, code_unfold]
nipkow@24449
   386
nipkow@24449
   387
lemma atLeastLessThan0: "{m..<0::nat} = {}"
paulson@15047
   388
by (simp add: atLeastLessThan_def)
nipkow@24449
   389
paulson@15047
   390
subsubsection {* Intervals of nats with @{term Suc} *}
paulson@15047
   391
paulson@15047
   392
text{*Not a simprule because the RHS is too messy.*}
paulson@15047
   393
lemma atLeastLessThanSuc:
paulson@15047
   394
    "{m..<Suc n} = (if m \<le> n then insert n {m..<n} else {})"
paulson@15418
   395
by (auto simp add: atLeastLessThan_def)
paulson@15047
   396
paulson@15418
   397
lemma atLeastLessThan_singleton [simp]: "{m..<Suc m} = {m}"
paulson@15047
   398
by (auto simp add: atLeastLessThan_def)
nipkow@16041
   399
(*
paulson@15047
   400
lemma atLeast_sum_LessThan [simp]: "{m + k..<k::nat} = {}"
paulson@15047
   401
by (induct k, simp_all add: atLeastLessThanSuc)
paulson@15047
   402
paulson@15047
   403
lemma atLeastSucLessThan [simp]: "{Suc n..<n} = {}"
paulson@15047
   404
by (auto simp add: atLeastLessThan_def)
nipkow@16041
   405
*)
nipkow@15045
   406
lemma atLeastLessThanSuc_atLeastAtMost: "{l..<Suc u} = {l..u}"
paulson@14485
   407
  by (simp add: lessThan_Suc_atMost atLeastAtMost_def atLeastLessThan_def)
paulson@14485
   408
paulson@15418
   409
lemma atLeastSucAtMost_greaterThanAtMost: "{Suc l..u} = {l<..u}"
paulson@15418
   410
  by (simp add: atLeast_Suc_greaterThan atLeastAtMost_def
paulson@14485
   411
    greaterThanAtMost_def)
paulson@14485
   412
paulson@15418
   413
lemma atLeastSucLessThan_greaterThanLessThan: "{Suc l..<u} = {l<..<u}"
paulson@15418
   414
  by (simp add: atLeast_Suc_greaterThan atLeastLessThan_def
paulson@14485
   415
    greaterThanLessThan_def)
paulson@14485
   416
nipkow@15554
   417
lemma atLeastAtMostSuc_conv: "m \<le> Suc n \<Longrightarrow> {m..Suc n} = insert (Suc n) {m..n}"
nipkow@15554
   418
by (auto simp add: atLeastAtMost_def)
nipkow@15554
   419
paulson@33044
   420
lemma atLeastLessThan_add_Un: "i \<le> j \<Longrightarrow> {i..<j+k} = {i..<j} \<union> {j..<j+k::nat}"
paulson@33044
   421
  apply (induct k) 
paulson@33044
   422
  apply (simp_all add: atLeastLessThanSuc)   
paulson@33044
   423
  done
paulson@33044
   424
nipkow@16733
   425
subsubsection {* Image *}
nipkow@16733
   426
nipkow@16733
   427
lemma image_add_atLeastAtMost:
nipkow@16733
   428
  "(%n::nat. n+k) ` {i..j} = {i+k..j+k}" (is "?A = ?B")
nipkow@16733
   429
proof
nipkow@16733
   430
  show "?A \<subseteq> ?B" by auto
nipkow@16733
   431
next
nipkow@16733
   432
  show "?B \<subseteq> ?A"
nipkow@16733
   433
  proof
nipkow@16733
   434
    fix n assume a: "n : ?B"
webertj@20217
   435
    hence "n - k : {i..j}" by auto
nipkow@16733
   436
    moreover have "n = (n - k) + k" using a by auto
nipkow@16733
   437
    ultimately show "n : ?A" by blast
nipkow@16733
   438
  qed
nipkow@16733
   439
qed
nipkow@16733
   440
nipkow@16733
   441
lemma image_add_atLeastLessThan:
nipkow@16733
   442
  "(%n::nat. n+k) ` {i..<j} = {i+k..<j+k}" (is "?A = ?B")
nipkow@16733
   443
proof
nipkow@16733
   444
  show "?A \<subseteq> ?B" by auto
nipkow@16733
   445
next
nipkow@16733
   446
  show "?B \<subseteq> ?A"
nipkow@16733
   447
  proof
nipkow@16733
   448
    fix n assume a: "n : ?B"
webertj@20217
   449
    hence "n - k : {i..<j}" by auto
nipkow@16733
   450
    moreover have "n = (n - k) + k" using a by auto
nipkow@16733
   451
    ultimately show "n : ?A" by blast
nipkow@16733
   452
  qed
nipkow@16733
   453
qed
nipkow@16733
   454
nipkow@16733
   455
corollary image_Suc_atLeastAtMost[simp]:
nipkow@16733
   456
  "Suc ` {i..j} = {Suc i..Suc j}"
huffman@30079
   457
using image_add_atLeastAtMost[where k="Suc 0"] by simp
nipkow@16733
   458
nipkow@16733
   459
corollary image_Suc_atLeastLessThan[simp]:
nipkow@16733
   460
  "Suc ` {i..<j} = {Suc i..<Suc j}"
huffman@30079
   461
using image_add_atLeastLessThan[where k="Suc 0"] by simp
nipkow@16733
   462
nipkow@16733
   463
lemma image_add_int_atLeastLessThan:
nipkow@16733
   464
    "(%x. x + (l::int)) ` {0..<u-l} = {l..<u}"
nipkow@16733
   465
  apply (auto simp add: image_def)
nipkow@16733
   466
  apply (rule_tac x = "x - l" in bexI)
nipkow@16733
   467
  apply auto
nipkow@16733
   468
  done
nipkow@16733
   469
hoelzl@37664
   470
lemma image_minus_const_atLeastLessThan_nat:
hoelzl@37664
   471
  fixes c :: nat
hoelzl@37664
   472
  shows "(\<lambda>i. i - c) ` {x ..< y} =
hoelzl@37664
   473
      (if c < y then {x - c ..< y - c} else if x < y then {0} else {})"
hoelzl@37664
   474
    (is "_ = ?right")
hoelzl@37664
   475
proof safe
hoelzl@37664
   476
  fix a assume a: "a \<in> ?right"
hoelzl@37664
   477
  show "a \<in> (\<lambda>i. i - c) ` {x ..< y}"
hoelzl@37664
   478
  proof cases
hoelzl@37664
   479
    assume "c < y" with a show ?thesis
hoelzl@37664
   480
      by (auto intro!: image_eqI[of _ _ "a + c"])
hoelzl@37664
   481
  next
hoelzl@37664
   482
    assume "\<not> c < y" with a show ?thesis
hoelzl@37664
   483
      by (auto intro!: image_eqI[of _ _ x] split: split_if_asm)
hoelzl@37664
   484
  qed
hoelzl@37664
   485
qed auto
hoelzl@37664
   486
hoelzl@35580
   487
context ordered_ab_group_add
hoelzl@35580
   488
begin
hoelzl@35580
   489
hoelzl@35580
   490
lemma
hoelzl@35580
   491
  fixes x :: 'a
hoelzl@35580
   492
  shows image_uminus_greaterThan[simp]: "uminus ` {x<..} = {..<-x}"
hoelzl@35580
   493
  and image_uminus_atLeast[simp]: "uminus ` {x..} = {..-x}"
hoelzl@35580
   494
proof safe
hoelzl@35580
   495
  fix y assume "y < -x"
hoelzl@35580
   496
  hence *:  "x < -y" using neg_less_iff_less[of "-y" x] by simp
hoelzl@35580
   497
  have "- (-y) \<in> uminus ` {x<..}"
hoelzl@35580
   498
    by (rule imageI) (simp add: *)
hoelzl@35580
   499
  thus "y \<in> uminus ` {x<..}" by simp
hoelzl@35580
   500
next
hoelzl@35580
   501
  fix y assume "y \<le> -x"
hoelzl@35580
   502
  have "- (-y) \<in> uminus ` {x..}"
hoelzl@35580
   503
    by (rule imageI) (insert `y \<le> -x`[THEN le_imp_neg_le], simp)
hoelzl@35580
   504
  thus "y \<in> uminus ` {x..}" by simp
hoelzl@35580
   505
qed simp_all
hoelzl@35580
   506
hoelzl@35580
   507
lemma
hoelzl@35580
   508
  fixes x :: 'a
hoelzl@35580
   509
  shows image_uminus_lessThan[simp]: "uminus ` {..<x} = {-x<..}"
hoelzl@35580
   510
  and image_uminus_atMost[simp]: "uminus ` {..x} = {-x..}"
hoelzl@35580
   511
proof -
hoelzl@35580
   512
  have "uminus ` {..<x} = uminus ` uminus ` {-x<..}"
hoelzl@35580
   513
    and "uminus ` {..x} = uminus ` uminus ` {-x..}" by simp_all
hoelzl@35580
   514
  thus "uminus ` {..<x} = {-x<..}" and "uminus ` {..x} = {-x..}"
hoelzl@35580
   515
    by (simp_all add: image_image
hoelzl@35580
   516
        del: image_uminus_greaterThan image_uminus_atLeast)
hoelzl@35580
   517
qed
hoelzl@35580
   518
hoelzl@35580
   519
lemma
hoelzl@35580
   520
  fixes x :: 'a
hoelzl@35580
   521
  shows image_uminus_atLeastAtMost[simp]: "uminus ` {x..y} = {-y..-x}"
hoelzl@35580
   522
  and image_uminus_greaterThanAtMost[simp]: "uminus ` {x<..y} = {-y..<-x}"
hoelzl@35580
   523
  and image_uminus_atLeastLessThan[simp]: "uminus ` {x..<y} = {-y<..-x}"
hoelzl@35580
   524
  and image_uminus_greaterThanLessThan[simp]: "uminus ` {x<..<y} = {-y<..<-x}"
hoelzl@35580
   525
  by (simp_all add: atLeastAtMost_def greaterThanAtMost_def atLeastLessThan_def
hoelzl@35580
   526
      greaterThanLessThan_def image_Int[OF inj_uminus] Int_commute)
hoelzl@35580
   527
end
nipkow@16733
   528
paulson@14485
   529
subsubsection {* Finiteness *}
paulson@14485
   530
nipkow@15045
   531
lemma finite_lessThan [iff]: fixes k :: nat shows "finite {..<k}"
paulson@14485
   532
  by (induct k) (simp_all add: lessThan_Suc)
paulson@14485
   533
paulson@14485
   534
lemma finite_atMost [iff]: fixes k :: nat shows "finite {..k}"
paulson@14485
   535
  by (induct k) (simp_all add: atMost_Suc)
paulson@14485
   536
paulson@14485
   537
lemma finite_greaterThanLessThan [iff]:
nipkow@15045
   538
  fixes l :: nat shows "finite {l<..<u}"
paulson@14485
   539
by (simp add: greaterThanLessThan_def)
paulson@14485
   540
paulson@14485
   541
lemma finite_atLeastLessThan [iff]:
nipkow@15045
   542
  fixes l :: nat shows "finite {l..<u}"
paulson@14485
   543
by (simp add: atLeastLessThan_def)
paulson@14485
   544
paulson@14485
   545
lemma finite_greaterThanAtMost [iff]:
nipkow@15045
   546
  fixes l :: nat shows "finite {l<..u}"
paulson@14485
   547
by (simp add: greaterThanAtMost_def)
paulson@14485
   548
paulson@14485
   549
lemma finite_atLeastAtMost [iff]:
paulson@14485
   550
  fixes l :: nat shows "finite {l..u}"
paulson@14485
   551
by (simp add: atLeastAtMost_def)
paulson@14485
   552
nipkow@28068
   553
text {* A bounded set of natural numbers is finite. *}
paulson@14485
   554
lemma bounded_nat_set_is_finite:
nipkow@24853
   555
  "(ALL i:N. i < (n::nat)) ==> finite N"
nipkow@28068
   556
apply (rule finite_subset)
nipkow@28068
   557
 apply (rule_tac [2] finite_lessThan, auto)
nipkow@28068
   558
done
nipkow@28068
   559
nipkow@31044
   560
text {* A set of natural numbers is finite iff it is bounded. *}
nipkow@31044
   561
lemma finite_nat_set_iff_bounded:
nipkow@31044
   562
  "finite(N::nat set) = (EX m. ALL n:N. n<m)" (is "?F = ?B")
nipkow@31044
   563
proof
nipkow@31044
   564
  assume f:?F  show ?B
nipkow@31044
   565
    using Max_ge[OF `?F`, simplified less_Suc_eq_le[symmetric]] by blast
nipkow@31044
   566
next
nipkow@31044
   567
  assume ?B show ?F using `?B` by(blast intro:bounded_nat_set_is_finite)
nipkow@31044
   568
qed
nipkow@31044
   569
nipkow@31044
   570
lemma finite_nat_set_iff_bounded_le:
nipkow@31044
   571
  "finite(N::nat set) = (EX m. ALL n:N. n<=m)"
nipkow@31044
   572
apply(simp add:finite_nat_set_iff_bounded)
nipkow@31044
   573
apply(blast dest:less_imp_le_nat le_imp_less_Suc)
nipkow@31044
   574
done
nipkow@31044
   575
nipkow@28068
   576
lemma finite_less_ub:
nipkow@28068
   577
     "!!f::nat=>nat. (!!n. n \<le> f n) ==> finite {n. f n \<le> u}"
nipkow@28068
   578
by (rule_tac B="{..u}" in finite_subset, auto intro: order_trans)
paulson@14485
   579
nipkow@24853
   580
text{* Any subset of an interval of natural numbers the size of the
nipkow@24853
   581
subset is exactly that interval. *}
nipkow@24853
   582
nipkow@24853
   583
lemma subset_card_intvl_is_intvl:
nipkow@24853
   584
  "A <= {k..<k+card A} \<Longrightarrow> A = {k..<k+card A}" (is "PROP ?P")
nipkow@24853
   585
proof cases
nipkow@24853
   586
  assume "finite A"
nipkow@24853
   587
  thus "PROP ?P"
nipkow@32006
   588
  proof(induct A rule:finite_linorder_max_induct)
nipkow@24853
   589
    case empty thus ?case by auto
nipkow@24853
   590
  next
nipkow@33434
   591
    case (insert b A)
nipkow@24853
   592
    moreover hence "b ~: A" by auto
nipkow@24853
   593
    moreover have "A <= {k..<k+card A}" and "b = k+card A"
nipkow@24853
   594
      using `b ~: A` insert by fastsimp+
nipkow@24853
   595
    ultimately show ?case by auto
nipkow@24853
   596
  qed
nipkow@24853
   597
next
nipkow@24853
   598
  assume "~finite A" thus "PROP ?P" by simp
nipkow@24853
   599
qed
nipkow@24853
   600
nipkow@24853
   601
paulson@32596
   602
subsubsection {* Proving Inclusions and Equalities between Unions *}
paulson@32596
   603
nipkow@36755
   604
lemma UN_le_eq_Un0:
nipkow@36755
   605
  "(\<Union>i\<le>n::nat. M i) = (\<Union>i\<in>{1..n}. M i) \<union> M 0" (is "?A = ?B")
nipkow@36755
   606
proof
nipkow@36755
   607
  show "?A <= ?B"
nipkow@36755
   608
  proof
nipkow@36755
   609
    fix x assume "x : ?A"
nipkow@36755
   610
    then obtain i where i: "i\<le>n" "x : M i" by auto
nipkow@36755
   611
    show "x : ?B"
nipkow@36755
   612
    proof(cases i)
nipkow@36755
   613
      case 0 with i show ?thesis by simp
nipkow@36755
   614
    next
nipkow@36755
   615
      case (Suc j) with i show ?thesis by auto
nipkow@36755
   616
    qed
nipkow@36755
   617
  qed
nipkow@36755
   618
next
nipkow@36755
   619
  show "?B <= ?A" by auto
nipkow@36755
   620
qed
nipkow@36755
   621
nipkow@36755
   622
lemma UN_le_add_shift:
nipkow@36755
   623
  "(\<Union>i\<le>n::nat. M(i+k)) = (\<Union>i\<in>{k..n+k}. M i)" (is "?A = ?B")
nipkow@36755
   624
proof
nipkow@36755
   625
  show "?A <= ?B" by fastsimp
nipkow@36755
   626
next
nipkow@36755
   627
  show "?B <= ?A"
nipkow@36755
   628
  proof
nipkow@36755
   629
    fix x assume "x : ?B"
nipkow@36755
   630
    then obtain i where i: "i : {k..n+k}" "x : M(i)" by auto
nipkow@36755
   631
    hence "i-k\<le>n & x : M((i-k)+k)" by auto
nipkow@36755
   632
    thus "x : ?A" by blast
nipkow@36755
   633
  qed
nipkow@36755
   634
qed
nipkow@36755
   635
paulson@32596
   636
lemma UN_UN_finite_eq: "(\<Union>n::nat. \<Union>i\<in>{0..<n}. A i) = (\<Union>n. A n)"
paulson@32596
   637
  by (auto simp add: atLeast0LessThan) 
paulson@32596
   638
paulson@32596
   639
lemma UN_finite_subset: "(!!n::nat. (\<Union>i\<in>{0..<n}. A i) \<subseteq> C) \<Longrightarrow> (\<Union>n. A n) \<subseteq> C"
paulson@32596
   640
  by (subst UN_UN_finite_eq [symmetric]) blast
paulson@32596
   641
paulson@33044
   642
lemma UN_finite2_subset: 
paulson@33044
   643
     "(!!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
   644
  apply (rule UN_finite_subset)
paulson@33044
   645
  apply (subst UN_UN_finite_eq [symmetric, of B]) 
paulson@33044
   646
  apply blast
paulson@33044
   647
  done
paulson@32596
   648
paulson@32596
   649
lemma UN_finite2_eq:
paulson@33044
   650
  "(!!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
   651
  apply (rule subset_antisym)
paulson@33044
   652
   apply (rule UN_finite2_subset, blast)
paulson@33044
   653
 apply (rule UN_finite2_subset [where k=k])
huffman@35216
   654
 apply (force simp add: atLeastLessThan_add_Un [of 0])
paulson@33044
   655
 done
paulson@32596
   656
paulson@32596
   657
paulson@14485
   658
subsubsection {* Cardinality *}
paulson@14485
   659
nipkow@15045
   660
lemma card_lessThan [simp]: "card {..<u} = u"
paulson@15251
   661
  by (induct u, simp_all add: lessThan_Suc)
paulson@14485
   662
paulson@14485
   663
lemma card_atMost [simp]: "card {..u} = Suc u"
paulson@14485
   664
  by (simp add: lessThan_Suc_atMost [THEN sym])
paulson@14485
   665
nipkow@15045
   666
lemma card_atLeastLessThan [simp]: "card {l..<u} = u - l"
nipkow@15045
   667
  apply (subgoal_tac "card {l..<u} = card {..<u-l}")
paulson@14485
   668
  apply (erule ssubst, rule card_lessThan)
nipkow@15045
   669
  apply (subgoal_tac "(%x. x + l) ` {..<u-l} = {l..<u}")
paulson@14485
   670
  apply (erule subst)
paulson@14485
   671
  apply (rule card_image)
paulson@14485
   672
  apply (simp add: inj_on_def)
paulson@14485
   673
  apply (auto simp add: image_def atLeastLessThan_def lessThan_def)
paulson@14485
   674
  apply (rule_tac x = "x - l" in exI)
paulson@14485
   675
  apply arith
paulson@14485
   676
  done
paulson@14485
   677
paulson@15418
   678
lemma card_atLeastAtMost [simp]: "card {l..u} = Suc u - l"
paulson@14485
   679
  by (subst atLeastLessThanSuc_atLeastAtMost [THEN sym], simp)
paulson@14485
   680
paulson@15418
   681
lemma card_greaterThanAtMost [simp]: "card {l<..u} = u - l"
paulson@14485
   682
  by (subst atLeastSucAtMost_greaterThanAtMost [THEN sym], simp)
paulson@14485
   683
nipkow@15045
   684
lemma card_greaterThanLessThan [simp]: "card {l<..<u} = u - Suc l"
paulson@14485
   685
  by (subst atLeastSucLessThan_greaterThanLessThan [THEN sym], simp)
paulson@14485
   686
nipkow@26105
   687
lemma ex_bij_betw_nat_finite:
nipkow@26105
   688
  "finite M \<Longrightarrow> \<exists>h. bij_betw h {0..<card M} M"
nipkow@26105
   689
apply(drule finite_imp_nat_seg_image_inj_on)
nipkow@26105
   690
apply(auto simp:atLeast0LessThan[symmetric] lessThan_def[symmetric] card_image bij_betw_def)
nipkow@26105
   691
done
nipkow@26105
   692
nipkow@26105
   693
lemma ex_bij_betw_finite_nat:
nipkow@26105
   694
  "finite M \<Longrightarrow> \<exists>h. bij_betw h M {0..<card M}"
nipkow@26105
   695
by (blast dest: ex_bij_betw_nat_finite bij_betw_inv)
nipkow@26105
   696
nipkow@31438
   697
lemma finite_same_card_bij:
nipkow@31438
   698
  "finite A \<Longrightarrow> finite B \<Longrightarrow> card A = card B \<Longrightarrow> EX h. bij_betw h A B"
nipkow@31438
   699
apply(drule ex_bij_betw_finite_nat)
nipkow@31438
   700
apply(drule ex_bij_betw_nat_finite)
nipkow@31438
   701
apply(auto intro!:bij_betw_trans)
nipkow@31438
   702
done
nipkow@31438
   703
nipkow@31438
   704
lemma ex_bij_betw_nat_finite_1:
nipkow@31438
   705
  "finite M \<Longrightarrow> \<exists>h. bij_betw h {1 .. card M} M"
nipkow@31438
   706
by (rule finite_same_card_bij) auto
nipkow@31438
   707
nipkow@26105
   708
paulson@14485
   709
subsection {* Intervals of integers *}
paulson@14485
   710
nipkow@15045
   711
lemma atLeastLessThanPlusOne_atLeastAtMost_int: "{l..<u+1} = {l..(u::int)}"
paulson@14485
   712
  by (auto simp add: atLeastAtMost_def atLeastLessThan_def)
paulson@14485
   713
paulson@15418
   714
lemma atLeastPlusOneAtMost_greaterThanAtMost_int: "{l+1..u} = {l<..(u::int)}"
paulson@14485
   715
  by (auto simp add: atLeastAtMost_def greaterThanAtMost_def)
paulson@14485
   716
paulson@15418
   717
lemma atLeastPlusOneLessThan_greaterThanLessThan_int:
paulson@15418
   718
    "{l+1..<u} = {l<..<u::int}"
paulson@14485
   719
  by (auto simp add: atLeastLessThan_def greaterThanLessThan_def)
paulson@14485
   720
paulson@14485
   721
subsubsection {* Finiteness *}
paulson@14485
   722
paulson@15418
   723
lemma image_atLeastZeroLessThan_int: "0 \<le> u ==>
nipkow@15045
   724
    {(0::int)..<u} = int ` {..<nat u}"
paulson@14485
   725
  apply (unfold image_def lessThan_def)
paulson@14485
   726
  apply auto
paulson@14485
   727
  apply (rule_tac x = "nat x" in exI)
huffman@35216
   728
  apply (auto simp add: zless_nat_eq_int_zless [THEN sym])
paulson@14485
   729
  done
paulson@14485
   730
nipkow@15045
   731
lemma finite_atLeastZeroLessThan_int: "finite {(0::int)..<u}"
paulson@14485
   732
  apply (case_tac "0 \<le> u")
paulson@14485
   733
  apply (subst image_atLeastZeroLessThan_int, assumption)
paulson@14485
   734
  apply (rule finite_imageI)
paulson@14485
   735
  apply auto
paulson@14485
   736
  done
paulson@14485
   737
nipkow@15045
   738
lemma finite_atLeastLessThan_int [iff]: "finite {l..<u::int}"
nipkow@15045
   739
  apply (subgoal_tac "(%x. x + l) ` {0..<u-l} = {l..<u}")
paulson@14485
   740
  apply (erule subst)
paulson@14485
   741
  apply (rule finite_imageI)
paulson@14485
   742
  apply (rule finite_atLeastZeroLessThan_int)
nipkow@16733
   743
  apply (rule image_add_int_atLeastLessThan)
paulson@14485
   744
  done
paulson@14485
   745
paulson@15418
   746
lemma finite_atLeastAtMost_int [iff]: "finite {l..(u::int)}"
paulson@14485
   747
  by (subst atLeastLessThanPlusOne_atLeastAtMost_int [THEN sym], simp)
paulson@14485
   748
paulson@15418
   749
lemma finite_greaterThanAtMost_int [iff]: "finite {l<..(u::int)}"
paulson@14485
   750
  by (subst atLeastPlusOneAtMost_greaterThanAtMost_int [THEN sym], simp)
paulson@14485
   751
paulson@15418
   752
lemma finite_greaterThanLessThan_int [iff]: "finite {l<..<u::int}"
paulson@14485
   753
  by (subst atLeastPlusOneLessThan_greaterThanLessThan_int [THEN sym], simp)
paulson@14485
   754
nipkow@24853
   755
paulson@14485
   756
subsubsection {* Cardinality *}
paulson@14485
   757
nipkow@15045
   758
lemma card_atLeastZeroLessThan_int: "card {(0::int)..<u} = nat u"
paulson@14485
   759
  apply (case_tac "0 \<le> u")
paulson@14485
   760
  apply (subst image_atLeastZeroLessThan_int, assumption)
paulson@14485
   761
  apply (subst card_image)
paulson@14485
   762
  apply (auto simp add: inj_on_def)
paulson@14485
   763
  done
paulson@14485
   764
nipkow@15045
   765
lemma card_atLeastLessThan_int [simp]: "card {l..<u} = nat (u - l)"
nipkow@15045
   766
  apply (subgoal_tac "card {l..<u} = card {0..<u-l}")
paulson@14485
   767
  apply (erule ssubst, rule card_atLeastZeroLessThan_int)
nipkow@15045
   768
  apply (subgoal_tac "(%x. x + l) ` {0..<u-l} = {l..<u}")
paulson@14485
   769
  apply (erule subst)
paulson@14485
   770
  apply (rule card_image)
paulson@14485
   771
  apply (simp add: inj_on_def)
nipkow@16733
   772
  apply (rule image_add_int_atLeastLessThan)
paulson@14485
   773
  done
paulson@14485
   774
paulson@14485
   775
lemma card_atLeastAtMost_int [simp]: "card {l..u} = nat (u - l + 1)"
nipkow@29667
   776
apply (subst atLeastLessThanPlusOne_atLeastAtMost_int [THEN sym])
nipkow@29667
   777
apply (auto simp add: algebra_simps)
nipkow@29667
   778
done
paulson@14485
   779
paulson@15418
   780
lemma card_greaterThanAtMost_int [simp]: "card {l<..u} = nat (u - l)"
nipkow@29667
   781
by (subst atLeastPlusOneAtMost_greaterThanAtMost_int [THEN sym], simp)
paulson@14485
   782
nipkow@15045
   783
lemma card_greaterThanLessThan_int [simp]: "card {l<..<u} = nat (u - (l + 1))"
nipkow@29667
   784
by (subst atLeastPlusOneLessThan_greaterThanLessThan_int [THEN sym], simp)
paulson@14485
   785
bulwahn@27656
   786
lemma finite_M_bounded_by_nat: "finite {k. P k \<and> k < (i::nat)}"
bulwahn@27656
   787
proof -
bulwahn@27656
   788
  have "{k. P k \<and> k < i} \<subseteq> {..<i}" by auto
bulwahn@27656
   789
  with finite_lessThan[of "i"] show ?thesis by (simp add: finite_subset)
bulwahn@27656
   790
qed
bulwahn@27656
   791
bulwahn@27656
   792
lemma card_less:
bulwahn@27656
   793
assumes zero_in_M: "0 \<in> M"
bulwahn@27656
   794
shows "card {k \<in> M. k < Suc i} \<noteq> 0"
bulwahn@27656
   795
proof -
bulwahn@27656
   796
  from zero_in_M have "{k \<in> M. k < Suc i} \<noteq> {}" by auto
bulwahn@27656
   797
  with finite_M_bounded_by_nat show ?thesis by (auto simp add: card_eq_0_iff)
bulwahn@27656
   798
qed
bulwahn@27656
   799
bulwahn@27656
   800
lemma card_less_Suc2: "0 \<notin> M \<Longrightarrow> card {k. Suc k \<in> M \<and> k < i} = card {k \<in> M. k < Suc i}"
haftmann@37388
   801
apply (rule card_bij_eq [of Suc _ _ "\<lambda>x. x - Suc 0"])
bulwahn@27656
   802
apply simp
bulwahn@27656
   803
apply fastsimp
bulwahn@27656
   804
apply auto
bulwahn@27656
   805
apply (rule inj_on_diff_nat)
bulwahn@27656
   806
apply auto
bulwahn@27656
   807
apply (case_tac x)
bulwahn@27656
   808
apply auto
bulwahn@27656
   809
apply (case_tac xa)
bulwahn@27656
   810
apply auto
bulwahn@27656
   811
apply (case_tac xa)
bulwahn@27656
   812
apply auto
bulwahn@27656
   813
done
bulwahn@27656
   814
bulwahn@27656
   815
lemma card_less_Suc:
bulwahn@27656
   816
  assumes zero_in_M: "0 \<in> M"
bulwahn@27656
   817
    shows "Suc (card {k. Suc k \<in> M \<and> k < i}) = card {k \<in> M. k < Suc i}"
bulwahn@27656
   818
proof -
bulwahn@27656
   819
  from assms have a: "0 \<in> {k \<in> M. k < Suc i}" by simp
bulwahn@27656
   820
  hence c: "{k \<in> M. k < Suc i} = insert 0 ({k \<in> M. k < Suc i} - {0})"
bulwahn@27656
   821
    by (auto simp only: insert_Diff)
bulwahn@27656
   822
  have b: "{k \<in> M. k < Suc i} - {0} = {k \<in> M - {0}. k < Suc i}"  by auto
bulwahn@27656
   823
  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
   824
    apply (subst card_insert)
bulwahn@27656
   825
    apply simp_all
bulwahn@27656
   826
    apply (subst b)
bulwahn@27656
   827
    apply (subst card_less_Suc2[symmetric])
bulwahn@27656
   828
    apply simp_all
bulwahn@27656
   829
    done
bulwahn@27656
   830
  with c show ?thesis by simp
bulwahn@27656
   831
qed
bulwahn@27656
   832
paulson@14485
   833
paulson@13850
   834
subsection {*Lemmas useful with the summation operator setsum*}
paulson@13850
   835
ballarin@16102
   836
text {* For examples, see Algebra/poly/UnivPoly2.thy *}
ballarin@13735
   837
wenzelm@14577
   838
subsubsection {* Disjoint Unions *}
ballarin@13735
   839
wenzelm@14577
   840
text {* Singletons and open intervals *}
ballarin@13735
   841
ballarin@13735
   842
lemma ivl_disj_un_singleton:
nipkow@15045
   843
  "{l::'a::linorder} Un {l<..} = {l..}"
nipkow@15045
   844
  "{..<u} Un {u::'a::linorder} = {..u}"
nipkow@15045
   845
  "(l::'a::linorder) < u ==> {l} Un {l<..<u} = {l..<u}"
nipkow@15045
   846
  "(l::'a::linorder) < u ==> {l<..<u} Un {u} = {l<..u}"
nipkow@15045
   847
  "(l::'a::linorder) <= u ==> {l} Un {l<..u} = {l..u}"
nipkow@15045
   848
  "(l::'a::linorder) <= u ==> {l..<u} Un {u} = {l..u}"
ballarin@14398
   849
by auto
ballarin@13735
   850
wenzelm@14577
   851
text {* One- and two-sided intervals *}
ballarin@13735
   852
ballarin@13735
   853
lemma ivl_disj_un_one:
nipkow@15045
   854
  "(l::'a::linorder) < u ==> {..l} Un {l<..<u} = {..<u}"
nipkow@15045
   855
  "(l::'a::linorder) <= u ==> {..<l} Un {l..<u} = {..<u}"
nipkow@15045
   856
  "(l::'a::linorder) <= u ==> {..l} Un {l<..u} = {..u}"
nipkow@15045
   857
  "(l::'a::linorder) <= u ==> {..<l} Un {l..u} = {..u}"
nipkow@15045
   858
  "(l::'a::linorder) <= u ==> {l<..u} Un {u<..} = {l<..}"
nipkow@15045
   859
  "(l::'a::linorder) < u ==> {l<..<u} Un {u..} = {l<..}"
nipkow@15045
   860
  "(l::'a::linorder) <= u ==> {l..u} Un {u<..} = {l..}"
nipkow@15045
   861
  "(l::'a::linorder) <= u ==> {l..<u} Un {u..} = {l..}"
ballarin@14398
   862
by auto
ballarin@13735
   863
wenzelm@14577
   864
text {* Two- and two-sided intervals *}
ballarin@13735
   865
ballarin@13735
   866
lemma ivl_disj_un_two:
nipkow@15045
   867
  "[| (l::'a::linorder) < m; m <= u |] ==> {l<..<m} Un {m..<u} = {l<..<u}"
nipkow@15045
   868
  "[| (l::'a::linorder) <= m; m < u |] ==> {l<..m} Un {m<..<u} = {l<..<u}"
nipkow@15045
   869
  "[| (l::'a::linorder) <= m; m <= u |] ==> {l..<m} Un {m..<u} = {l..<u}"
nipkow@15045
   870
  "[| (l::'a::linorder) <= m; m < u |] ==> {l..m} Un {m<..<u} = {l..<u}"
nipkow@15045
   871
  "[| (l::'a::linorder) < m; m <= u |] ==> {l<..<m} Un {m..u} = {l<..u}"
nipkow@15045
   872
  "[| (l::'a::linorder) <= m; m <= u |] ==> {l<..m} Un {m<..u} = {l<..u}"
nipkow@15045
   873
  "[| (l::'a::linorder) <= m; m <= u |] ==> {l..<m} Un {m..u} = {l..u}"
nipkow@15045
   874
  "[| (l::'a::linorder) <= m; m <= u |] ==> {l..m} Un {m<..u} = {l..u}"
ballarin@14398
   875
by auto
ballarin@13735
   876
ballarin@13735
   877
lemmas ivl_disj_un = ivl_disj_un_singleton ivl_disj_un_one ivl_disj_un_two
ballarin@13735
   878
wenzelm@14577
   879
subsubsection {* Disjoint Intersections *}
ballarin@13735
   880
wenzelm@14577
   881
text {* One- and two-sided intervals *}
ballarin@13735
   882
ballarin@13735
   883
lemma ivl_disj_int_one:
nipkow@15045
   884
  "{..l::'a::order} Int {l<..<u} = {}"
nipkow@15045
   885
  "{..<l} Int {l..<u} = {}"
nipkow@15045
   886
  "{..l} Int {l<..u} = {}"
nipkow@15045
   887
  "{..<l} Int {l..u} = {}"
nipkow@15045
   888
  "{l<..u} Int {u<..} = {}"
nipkow@15045
   889
  "{l<..<u} Int {u..} = {}"
nipkow@15045
   890
  "{l..u} Int {u<..} = {}"
nipkow@15045
   891
  "{l..<u} Int {u..} = {}"
ballarin@14398
   892
  by auto
ballarin@13735
   893
wenzelm@14577
   894
text {* Two- and two-sided intervals *}
ballarin@13735
   895
ballarin@13735
   896
lemma ivl_disj_int_two:
nipkow@15045
   897
  "{l::'a::order<..<m} Int {m..<u} = {}"
nipkow@15045
   898
  "{l<..m} Int {m<..<u} = {}"
nipkow@15045
   899
  "{l..<m} Int {m..<u} = {}"
nipkow@15045
   900
  "{l..m} Int {m<..<u} = {}"
nipkow@15045
   901
  "{l<..<m} Int {m..u} = {}"
nipkow@15045
   902
  "{l<..m} Int {m<..u} = {}"
nipkow@15045
   903
  "{l..<m} Int {m..u} = {}"
nipkow@15045
   904
  "{l..m} Int {m<..u} = {}"
ballarin@14398
   905
  by auto
ballarin@13735
   906
nipkow@32456
   907
lemmas ivl_disj_int = ivl_disj_int_one ivl_disj_int_two
ballarin@13735
   908
nipkow@15542
   909
subsubsection {* Some Differences *}
nipkow@15542
   910
nipkow@15542
   911
lemma ivl_diff[simp]:
nipkow@15542
   912
 "i \<le> n \<Longrightarrow> {i..<m} - {i..<n} = {n..<(m::'a::linorder)}"
nipkow@15542
   913
by(auto)
nipkow@15542
   914
nipkow@15542
   915
nipkow@15542
   916
subsubsection {* Some Subset Conditions *}
nipkow@15542
   917
blanchet@35828
   918
lemma ivl_subset [simp,no_atp]:
nipkow@15542
   919
 "({i..<j} \<subseteq> {m..<n}) = (j \<le> i | m \<le> i & j \<le> (n::'a::linorder))"
nipkow@15542
   920
apply(auto simp:linorder_not_le)
nipkow@15542
   921
apply(rule ccontr)
nipkow@15542
   922
apply(insert linorder_le_less_linear[of i n])
nipkow@15542
   923
apply(clarsimp simp:linorder_not_le)
nipkow@15542
   924
apply(fastsimp)
nipkow@15542
   925
done
nipkow@15542
   926
nipkow@15041
   927
nipkow@15042
   928
subsection {* Summation indexed over intervals *}
nipkow@15042
   929
nipkow@15042
   930
syntax
nipkow@15042
   931
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(SUM _ = _.._./ _)" [0,0,0,10] 10)
nipkow@15048
   932
  "_from_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(SUM _ = _..<_./ _)" [0,0,0,10] 10)
nipkow@16052
   933
  "_upt_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(SUM _<_./ _)" [0,0,10] 10)
nipkow@16052
   934
  "_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(SUM _<=_./ _)" [0,0,10] 10)
nipkow@15042
   935
syntax (xsymbols)
nipkow@15042
   936
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _.._./ _)" [0,0,0,10] 10)
nipkow@15048
   937
  "_from_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _..<_./ _)" [0,0,0,10] 10)
nipkow@16052
   938
  "_upt_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_<_./ _)" [0,0,10] 10)
nipkow@16052
   939
  "_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_\<le>_./ _)" [0,0,10] 10)
nipkow@15042
   940
syntax (HTML output)
nipkow@15042
   941
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _.._./ _)" [0,0,0,10] 10)
nipkow@15048
   942
  "_from_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _..<_./ _)" [0,0,0,10] 10)
nipkow@16052
   943
  "_upt_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_<_./ _)" [0,0,10] 10)
nipkow@16052
   944
  "_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_\<le>_./ _)" [0,0,10] 10)
nipkow@15056
   945
syntax (latex_sum output)
nipkow@15052
   946
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
nipkow@15052
   947
 ("(3\<^raw:$\sum_{>_ = _\<^raw:}^{>_\<^raw:}$> _)" [0,0,0,10] 10)
nipkow@15052
   948
  "_from_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
nipkow@15052
   949
 ("(3\<^raw:$\sum_{>_ = _\<^raw:}^{<>_\<^raw:}$> _)" [0,0,0,10] 10)
nipkow@16052
   950
  "_upt_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
nipkow@16052
   951
 ("(3\<^raw:$\sum_{>_ < _\<^raw:}$> _)" [0,0,10] 10)
nipkow@15052
   952
  "_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
nipkow@16052
   953
 ("(3\<^raw:$\sum_{>_ \<le> _\<^raw:}$> _)" [0,0,10] 10)
nipkow@15041
   954
nipkow@15048
   955
translations
nipkow@28853
   956
  "\<Sum>x=a..b. t" == "CONST setsum (%x. t) {a..b}"
nipkow@28853
   957
  "\<Sum>x=a..<b. t" == "CONST setsum (%x. t) {a..<b}"
nipkow@28853
   958
  "\<Sum>i\<le>n. t" == "CONST setsum (\<lambda>i. t) {..n}"
nipkow@28853
   959
  "\<Sum>i<n. t" == "CONST setsum (\<lambda>i. t) {..<n}"
nipkow@15041
   960
nipkow@15052
   961
text{* The above introduces some pretty alternative syntaxes for
nipkow@15056
   962
summation over intervals:
nipkow@15052
   963
\begin{center}
nipkow@15052
   964
\begin{tabular}{lll}
nipkow@15056
   965
Old & New & \LaTeX\\
nipkow@15056
   966
@{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
   967
@{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
   968
@{term[source]"\<Sum>x\<in>{..b}. e"} & @{term"\<Sum>x\<le>b. e"} & @{term[mode=latex_sum]"\<Sum>x\<le>b. e"}\\
nipkow@15056
   969
@{term[source]"\<Sum>x\<in>{..<b}. e"} & @{term"\<Sum>x<b. e"} & @{term[mode=latex_sum]"\<Sum>x<b. e"}
nipkow@15052
   970
\end{tabular}
nipkow@15052
   971
\end{center}
nipkow@15056
   972
The left column shows the term before introduction of the new syntax,
nipkow@15056
   973
the middle column shows the new (default) syntax, and the right column
nipkow@15056
   974
shows a special syntax. The latter is only meaningful for latex output
nipkow@15056
   975
and has to be activated explicitly by setting the print mode to
wenzelm@21502
   976
@{text latex_sum} (e.g.\ via @{text "mode = latex_sum"} in
nipkow@15056
   977
antiquotations). It is not the default \LaTeX\ output because it only
nipkow@15056
   978
works well with italic-style formulae, not tt-style.
nipkow@15052
   979
nipkow@15052
   980
Note that for uniformity on @{typ nat} it is better to use
nipkow@15052
   981
@{term"\<Sum>x::nat=0..<n. e"} rather than @{text"\<Sum>x<n. e"}: @{text setsum} may
nipkow@15052
   982
not provide all lemmas available for @{term"{m..<n}"} also in the
nipkow@15052
   983
special form for @{term"{..<n}"}. *}
nipkow@15052
   984
nipkow@15542
   985
text{* This congruence rule should be used for sums over intervals as
nipkow@15542
   986
the standard theorem @{text[source]setsum_cong} does not work well
nipkow@15542
   987
with the simplifier who adds the unsimplified premise @{term"x:B"} to
nipkow@15542
   988
the context. *}
nipkow@15542
   989
nipkow@15542
   990
lemma setsum_ivl_cong:
nipkow@15542
   991
 "\<lbrakk>a = c; b = d; !!x. \<lbrakk> c \<le> x; x < d \<rbrakk> \<Longrightarrow> f x = g x \<rbrakk> \<Longrightarrow>
nipkow@15542
   992
 setsum f {a..<b} = setsum g {c..<d}"
nipkow@15542
   993
by(rule setsum_cong, simp_all)
nipkow@15041
   994
nipkow@16041
   995
(* FIXME why are the following simp rules but the corresponding eqns
nipkow@16041
   996
on intervals are not? *)
nipkow@16041
   997
nipkow@16052
   998
lemma setsum_atMost_Suc[simp]: "(\<Sum>i \<le> Suc n. f i) = (\<Sum>i \<le> n. f i) + f(Suc n)"
nipkow@16052
   999
by (simp add:atMost_Suc add_ac)
nipkow@16052
  1000
nipkow@16041
  1001
lemma setsum_lessThan_Suc[simp]: "(\<Sum>i < Suc n. f i) = (\<Sum>i < n. f i) + f n"
nipkow@16041
  1002
by (simp add:lessThan_Suc add_ac)
nipkow@15041
  1003
nipkow@15911
  1004
lemma setsum_cl_ivl_Suc[simp]:
nipkow@15561
  1005
  "setsum f {m..Suc n} = (if Suc n < m then 0 else setsum f {m..n} + f(Suc n))"
nipkow@15561
  1006
by (auto simp:add_ac atLeastAtMostSuc_conv)
nipkow@15561
  1007
nipkow@15911
  1008
lemma setsum_op_ivl_Suc[simp]:
nipkow@15561
  1009
  "setsum f {m..<Suc n} = (if n < m then 0 else setsum f {m..<n} + f(n))"
nipkow@15561
  1010
by (auto simp:add_ac atLeastLessThanSuc)
nipkow@16041
  1011
(*
nipkow@15561
  1012
lemma setsum_cl_ivl_add_one_nat: "(n::nat) <= m + 1 ==>
nipkow@15561
  1013
    (\<Sum>i=n..m+1. f i) = (\<Sum>i=n..m. f i) + f(m + 1)"
nipkow@15561
  1014
by (auto simp:add_ac atLeastAtMostSuc_conv)
nipkow@16041
  1015
*)
nipkow@28068
  1016
nipkow@28068
  1017
lemma setsum_head:
nipkow@28068
  1018
  fixes n :: nat
nipkow@28068
  1019
  assumes mn: "m <= n" 
nipkow@28068
  1020
  shows "(\<Sum>x\<in>{m..n}. P x) = P m + (\<Sum>x\<in>{m<..n}. P x)" (is "?lhs = ?rhs")
nipkow@28068
  1021
proof -
nipkow@28068
  1022
  from mn
nipkow@28068
  1023
  have "{m..n} = {m} \<union> {m<..n}"
nipkow@28068
  1024
    by (auto intro: ivl_disj_un_singleton)
nipkow@28068
  1025
  hence "?lhs = (\<Sum>x\<in>{m} \<union> {m<..n}. P x)"
nipkow@28068
  1026
    by (simp add: atLeast0LessThan)
nipkow@28068
  1027
  also have "\<dots> = ?rhs" by simp
nipkow@28068
  1028
  finally show ?thesis .
nipkow@28068
  1029
qed
nipkow@28068
  1030
nipkow@28068
  1031
lemma setsum_head_Suc:
nipkow@28068
  1032
  "m \<le> n \<Longrightarrow> setsum f {m..n} = f m + setsum f {Suc m..n}"
nipkow@28068
  1033
by (simp add: setsum_head atLeastSucAtMost_greaterThanAtMost)
nipkow@28068
  1034
nipkow@28068
  1035
lemma setsum_head_upt_Suc:
nipkow@28068
  1036
  "m < n \<Longrightarrow> setsum f {m..<n} = f m + setsum f {Suc m..<n}"
huffman@30079
  1037
apply(insert setsum_head_Suc[of m "n - Suc 0" f])
nipkow@29667
  1038
apply (simp add: atLeastLessThanSuc_atLeastAtMost[symmetric] algebra_simps)
nipkow@28068
  1039
done
nipkow@28068
  1040
nipkow@31501
  1041
lemma setsum_ub_add_nat: assumes "(m::nat) \<le> n + 1"
nipkow@31501
  1042
  shows "setsum f {m..n + p} = setsum f {m..n} + setsum f {n + 1..n + p}"
nipkow@31501
  1043
proof-
nipkow@31501
  1044
  have "{m .. n+p} = {m..n} \<union> {n+1..n+p}" using `m \<le> n+1` by auto
nipkow@31501
  1045
  thus ?thesis by (auto simp: ivl_disj_int setsum_Un_disjoint
nipkow@31501
  1046
    atLeastSucAtMost_greaterThanAtMost)
nipkow@31501
  1047
qed
nipkow@28068
  1048
nipkow@15539
  1049
lemma setsum_add_nat_ivl: "\<lbrakk> m \<le> n; n \<le> p \<rbrakk> \<Longrightarrow>
nipkow@15539
  1050
  setsum f {m..<n} + setsum f {n..<p} = setsum f {m..<p::nat}"
nipkow@15539
  1051
by (simp add:setsum_Un_disjoint[symmetric] ivl_disj_int ivl_disj_un)
nipkow@15539
  1052
nipkow@15539
  1053
lemma setsum_diff_nat_ivl:
nipkow@15539
  1054
fixes f :: "nat \<Rightarrow> 'a::ab_group_add"
nipkow@15539
  1055
shows "\<lbrakk> m \<le> n; n \<le> p \<rbrakk> \<Longrightarrow>
nipkow@15539
  1056
  setsum f {m..<p} - setsum f {m..<n} = setsum f {n..<p}"
nipkow@15539
  1057
using setsum_add_nat_ivl [of m n p f,symmetric]
nipkow@15539
  1058
apply (simp add: add_ac)
nipkow@15539
  1059
done
nipkow@15539
  1060
nipkow@31505
  1061
lemma setsum_natinterval_difff:
nipkow@31505
  1062
  fixes f:: "nat \<Rightarrow> ('a::ab_group_add)"
nipkow@31505
  1063
  shows  "setsum (\<lambda>k. f k - f(k + 1)) {(m::nat) .. n} =
nipkow@31505
  1064
          (if m <= n then f m - f(n + 1) else 0)"
nipkow@31505
  1065
by (induct n, auto simp add: algebra_simps not_le le_Suc_eq)
nipkow@31505
  1066
nipkow@31509
  1067
lemmas setsum_restrict_set' = setsum_restrict_set[unfolded Int_def]
nipkow@31509
  1068
nipkow@31509
  1069
lemma setsum_setsum_restrict:
nipkow@31509
  1070
  "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
  1071
  by (simp add: setsum_restrict_set'[unfolded mem_def] mem_def)
nipkow@31509
  1072
     (rule setsum_commute)
nipkow@31509
  1073
nipkow@31509
  1074
lemma setsum_image_gen: assumes fS: "finite S"
nipkow@31509
  1075
  shows "setsum g S = setsum (\<lambda>y. setsum g {x. x \<in> S \<and> f x = y}) (f ` S)"
nipkow@31509
  1076
proof-
nipkow@31509
  1077
  { fix x assume "x \<in> S" then have "{y. y\<in> f`S \<and> f x = y} = {f x}" by auto }
nipkow@31509
  1078
  hence "setsum g S = setsum (\<lambda>x. setsum (\<lambda>y. g x) {y. y\<in> f`S \<and> f x = y}) S"
nipkow@31509
  1079
    by simp
nipkow@31509
  1080
  also have "\<dots> = setsum (\<lambda>y. setsum g {x. x \<in> S \<and> f x = y}) (f ` S)"
nipkow@31509
  1081
    by (rule setsum_setsum_restrict[OF fS finite_imageI[OF fS]])
nipkow@31509
  1082
  finally show ?thesis .
nipkow@31509
  1083
qed
nipkow@31509
  1084
hoelzl@35171
  1085
lemma setsum_le_included:
haftmann@36307
  1086
  fixes f :: "'a \<Rightarrow> 'b::ordered_comm_monoid_add"
hoelzl@35171
  1087
  assumes "finite s" "finite t"
hoelzl@35171
  1088
  and "\<forall>y\<in>t. 0 \<le> g y" "(\<forall>x\<in>s. \<exists>y\<in>t. i y = x \<and> f x \<le> g y)"
hoelzl@35171
  1089
  shows "setsum f s \<le> setsum g t"
hoelzl@35171
  1090
proof -
hoelzl@35171
  1091
  have "setsum f s \<le> setsum (\<lambda>y. setsum g {x. x\<in>t \<and> i x = y}) s"
hoelzl@35171
  1092
  proof (rule setsum_mono)
hoelzl@35171
  1093
    fix y assume "y \<in> s"
hoelzl@35171
  1094
    with assms obtain z where z: "z \<in> t" "y = i z" "f y \<le> g z" by auto
hoelzl@35171
  1095
    with assms show "f y \<le> setsum g {x \<in> t. i x = y}" (is "?A y \<le> ?B y")
hoelzl@35171
  1096
      using order_trans[of "?A (i z)" "setsum g {z}" "?B (i z)", intro]
hoelzl@35171
  1097
      by (auto intro!: setsum_mono2)
hoelzl@35171
  1098
  qed
hoelzl@35171
  1099
  also have "... \<le> setsum (\<lambda>y. setsum g {x. x\<in>t \<and> i x = y}) (i ` t)"
hoelzl@35171
  1100
    using assms(2-4) by (auto intro!: setsum_mono2 setsum_nonneg)
hoelzl@35171
  1101
  also have "... \<le> setsum g t"
hoelzl@35171
  1102
    using assms by (auto simp: setsum_image_gen[symmetric])
hoelzl@35171
  1103
  finally show ?thesis .
hoelzl@35171
  1104
qed
hoelzl@35171
  1105
nipkow@31509
  1106
lemma setsum_multicount_gen:
nipkow@31509
  1107
  assumes "finite s" "finite t" "\<forall>j\<in>t. (card {i\<in>s. R i j} = k j)"
nipkow@31509
  1108
  shows "setsum (\<lambda>i. (card {j\<in>t. R i j})) s = setsum k t" (is "?l = ?r")
nipkow@31509
  1109
proof-
nipkow@31509
  1110
  have "?l = setsum (\<lambda>i. setsum (\<lambda>x.1) {j\<in>t. R i j}) s" by auto
nipkow@31509
  1111
  also have "\<dots> = ?r" unfolding setsum_setsum_restrict[OF assms(1-2)]
nipkow@31509
  1112
    using assms(3) by auto
nipkow@31509
  1113
  finally show ?thesis .
nipkow@31509
  1114
qed
nipkow@31509
  1115
nipkow@31509
  1116
lemma setsum_multicount:
nipkow@31509
  1117
  assumes "finite S" "finite T" "\<forall>j\<in>T. (card {i\<in>S. R i j} = k)"
nipkow@31509
  1118
  shows "setsum (\<lambda>i. card {j\<in>T. R i j}) S = k * card T" (is "?l = ?r")
nipkow@31509
  1119
proof-
nipkow@31509
  1120
  have "?l = setsum (\<lambda>i. k) T" by(rule setsum_multicount_gen)(auto simp:assms)
huffman@35216
  1121
  also have "\<dots> = ?r" by(simp add: mult_commute)
nipkow@31509
  1122
  finally show ?thesis by auto
nipkow@31509
  1123
qed
nipkow@31509
  1124
nipkow@28068
  1125
nipkow@16733
  1126
subsection{* Shifting bounds *}
nipkow@16733
  1127
nipkow@15539
  1128
lemma setsum_shift_bounds_nat_ivl:
nipkow@15539
  1129
  "setsum f {m+k..<n+k} = setsum (%i. f(i + k)){m..<n::nat}"
nipkow@15539
  1130
by (induct "n", auto simp:atLeastLessThanSuc)
nipkow@15539
  1131
nipkow@16733
  1132
lemma setsum_shift_bounds_cl_nat_ivl:
nipkow@16733
  1133
  "setsum f {m+k..n+k} = setsum (%i. f(i + k)){m..n::nat}"
nipkow@16733
  1134
apply (insert setsum_reindex[OF inj_on_add_nat, where h=f and B = "{m..n}"])
nipkow@16733
  1135
apply (simp add:image_add_atLeastAtMost o_def)
nipkow@16733
  1136
done
nipkow@16733
  1137
nipkow@16733
  1138
corollary setsum_shift_bounds_cl_Suc_ivl:
nipkow@16733
  1139
  "setsum f {Suc m..Suc n} = setsum (%i. f(Suc i)){m..n}"
huffman@30079
  1140
by (simp add:setsum_shift_bounds_cl_nat_ivl[where k="Suc 0", simplified])
nipkow@16733
  1141
nipkow@16733
  1142
corollary setsum_shift_bounds_Suc_ivl:
nipkow@16733
  1143
  "setsum f {Suc m..<Suc n} = setsum (%i. f(Suc i)){m..<n}"
huffman@30079
  1144
by (simp add:setsum_shift_bounds_nat_ivl[where k="Suc 0", simplified])
nipkow@16733
  1145
nipkow@28068
  1146
lemma setsum_shift_lb_Suc0_0:
nipkow@28068
  1147
  "f(0::nat) = (0::nat) \<Longrightarrow> setsum f {Suc 0..k} = setsum f {0..k}"
nipkow@28068
  1148
by(simp add:setsum_head_Suc)
kleing@19106
  1149
nipkow@28068
  1150
lemma setsum_shift_lb_Suc0_0_upt:
nipkow@28068
  1151
  "f(0::nat) = 0 \<Longrightarrow> setsum f {Suc 0..<k} = setsum f {0..<k}"
nipkow@28068
  1152
apply(cases k)apply simp
nipkow@28068
  1153
apply(simp add:setsum_head_upt_Suc)
nipkow@28068
  1154
done
kleing@19022
  1155
ballarin@17149
  1156
subsection {* The formula for geometric sums *}
ballarin@17149
  1157
ballarin@17149
  1158
lemma geometric_sum:
haftmann@36307
  1159
  assumes "x \<noteq> 1"
haftmann@36307
  1160
  shows "(\<Sum>i=0..<n. x ^ i) = (x ^ n - 1) / (x - 1::'a::field)"
haftmann@36307
  1161
proof -
haftmann@36307
  1162
  from assms obtain y where "y = x - 1" and "y \<noteq> 0" by simp_all
haftmann@36307
  1163
  moreover have "(\<Sum>i=0..<n. (y + 1) ^ i) = ((y + 1) ^ n - 1) / y"
haftmann@36307
  1164
  proof (induct n)
haftmann@36307
  1165
    case 0 then show ?case by simp
haftmann@36307
  1166
  next
haftmann@36307
  1167
    case (Suc n)
haftmann@36307
  1168
    moreover with `y \<noteq> 0` have "(1 + y) ^ n = (y * inverse y) * (1 + y) ^ n" by simp 
haftmann@36350
  1169
    ultimately show ?case by (simp add: field_simps divide_inverse)
haftmann@36307
  1170
  qed
haftmann@36307
  1171
  ultimately show ?thesis by simp
haftmann@36307
  1172
qed
haftmann@36307
  1173
ballarin@17149
  1174
kleing@19469
  1175
subsection {* The formula for arithmetic sums *}
kleing@19469
  1176
kleing@19469
  1177
lemma gauss_sum:
huffman@23277
  1178
  "((1::'a::comm_semiring_1) + 1)*(\<Sum>i\<in>{1..n}. of_nat i) =
kleing@19469
  1179
   of_nat n*((of_nat n)+1)"
kleing@19469
  1180
proof (induct n)
kleing@19469
  1181
  case 0
kleing@19469
  1182
  show ?case by simp
kleing@19469
  1183
next
kleing@19469
  1184
  case (Suc n)
nipkow@29667
  1185
  then show ?case by (simp add: algebra_simps)
kleing@19469
  1186
qed
kleing@19469
  1187
kleing@19469
  1188
theorem arith_series_general:
huffman@23277
  1189
  "((1::'a::comm_semiring_1) + 1) * (\<Sum>i\<in>{..<n}. a + of_nat i * d) =
kleing@19469
  1190
  of_nat n * (a + (a + of_nat(n - 1)*d))"
kleing@19469
  1191
proof cases
kleing@19469
  1192
  assume ngt1: "n > 1"
kleing@19469
  1193
  let ?I = "\<lambda>i. of_nat i" and ?n = "of_nat n"
kleing@19469
  1194
  have
kleing@19469
  1195
    "(\<Sum>i\<in>{..<n}. a+?I i*d) =
kleing@19469
  1196
     ((\<Sum>i\<in>{..<n}. a) + (\<Sum>i\<in>{..<n}. ?I i*d))"
kleing@19469
  1197
    by (rule setsum_addf)
kleing@19469
  1198
  also from ngt1 have "\<dots> = ?n*a + (\<Sum>i\<in>{..<n}. ?I i*d)" by simp
kleing@19469
  1199
  also from ngt1 have "\<dots> = (?n*a + d*(\<Sum>i\<in>{1..<n}. ?I i))"
huffman@30079
  1200
    unfolding One_nat_def
nipkow@28068
  1201
    by (simp add: setsum_right_distrib atLeast0LessThan[symmetric] setsum_shift_lb_Suc0_0_upt mult_ac)
kleing@19469
  1202
  also have "(1+1)*\<dots> = (1+1)*?n*a + d*(1+1)*(\<Sum>i\<in>{1..<n}. ?I i)"
kleing@19469
  1203
    by (simp add: left_distrib right_distrib)
kleing@19469
  1204
  also from ngt1 have "{1..<n} = {1..n - 1}"
nipkow@28068
  1205
    by (cases n) (auto simp: atLeastLessThanSuc_atLeastAtMost)
nipkow@28068
  1206
  also from ngt1
kleing@19469
  1207
  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
  1208
    by (simp only: mult_ac gauss_sum [of "n - 1"], unfold One_nat_def)
huffman@23431
  1209
       (simp add:  mult_ac trans [OF add_commute of_nat_Suc [symmetric]])
nipkow@29667
  1210
  finally show ?thesis by (simp add: algebra_simps)
kleing@19469
  1211
next
kleing@19469
  1212
  assume "\<not>(n > 1)"
kleing@19469
  1213
  hence "n = 1 \<or> n = 0" by auto
nipkow@29667
  1214
  thus ?thesis by (auto simp: algebra_simps)
kleing@19469
  1215
qed
kleing@19469
  1216
kleing@19469
  1217
lemma arith_series_nat:
kleing@19469
  1218
  "Suc (Suc 0) * (\<Sum>i\<in>{..<n}. a+i*d) = n * (a + (a+(n - 1)*d))"
kleing@19469
  1219
proof -
kleing@19469
  1220
  have
kleing@19469
  1221
    "((1::nat) + 1) * (\<Sum>i\<in>{..<n::nat}. a + of_nat(i)*d) =
kleing@19469
  1222
    of_nat(n) * (a + (a + of_nat(n - 1)*d))"
kleing@19469
  1223
    by (rule arith_series_general)
huffman@30079
  1224
  thus ?thesis
huffman@35216
  1225
    unfolding One_nat_def by auto
kleing@19469
  1226
qed
kleing@19469
  1227
kleing@19469
  1228
lemma arith_series_int:
kleing@19469
  1229
  "(2::int) * (\<Sum>i\<in>{..<n}. a + of_nat i * d) =
kleing@19469
  1230
  of_nat n * (a + (a + of_nat(n - 1)*d))"
kleing@19469
  1231
proof -
kleing@19469
  1232
  have
kleing@19469
  1233
    "((1::int) + 1) * (\<Sum>i\<in>{..<n}. a + of_nat i * d) =
kleing@19469
  1234
    of_nat(n) * (a + (a + of_nat(n - 1)*d))"
kleing@19469
  1235
    by (rule arith_series_general)
kleing@19469
  1236
  thus ?thesis by simp
kleing@19469
  1237
qed
paulson@15418
  1238
kleing@19022
  1239
lemma sum_diff_distrib:
kleing@19022
  1240
  fixes P::"nat\<Rightarrow>nat"
kleing@19022
  1241
  shows
kleing@19022
  1242
  "\<forall>x. Q x \<le> P x  \<Longrightarrow>
kleing@19022
  1243
  (\<Sum>x<n. P x) - (\<Sum>x<n. Q x) = (\<Sum>x<n. P x - Q x)"
kleing@19022
  1244
proof (induct n)
kleing@19022
  1245
  case 0 show ?case by simp
kleing@19022
  1246
next
kleing@19022
  1247
  case (Suc n)
kleing@19022
  1248
kleing@19022
  1249
  let ?lhs = "(\<Sum>x<n. P x) - (\<Sum>x<n. Q x)"
kleing@19022
  1250
  let ?rhs = "\<Sum>x<n. P x - Q x"
kleing@19022
  1251
kleing@19022
  1252
  from Suc have "?lhs = ?rhs" by simp
kleing@19022
  1253
  moreover
kleing@19022
  1254
  from Suc have "?lhs + P n - Q n = ?rhs + (P n - Q n)" by simp
kleing@19022
  1255
  moreover
kleing@19022
  1256
  from Suc have
kleing@19022
  1257
    "(\<Sum>x<n. P x) + P n - ((\<Sum>x<n. Q x) + Q n) = ?rhs + (P n - Q n)"
kleing@19022
  1258
    by (subst diff_diff_left[symmetric],
kleing@19022
  1259
        subst diff_add_assoc2)
kleing@19022
  1260
       (auto simp: diff_add_assoc2 intro: setsum_mono)
kleing@19022
  1261
  ultimately
kleing@19022
  1262
  show ?case by simp
kleing@19022
  1263
qed
kleing@19022
  1264
paulson@29960
  1265
subsection {* Products indexed over intervals *}
paulson@29960
  1266
paulson@29960
  1267
syntax
paulson@29960
  1268
  "_from_to_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(PROD _ = _.._./ _)" [0,0,0,10] 10)
paulson@29960
  1269
  "_from_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(PROD _ = _..<_./ _)" [0,0,0,10] 10)
paulson@29960
  1270
  "_upt_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(PROD _<_./ _)" [0,0,10] 10)
paulson@29960
  1271
  "_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(PROD _<=_./ _)" [0,0,10] 10)
paulson@29960
  1272
syntax (xsymbols)
paulson@29960
  1273
  "_from_to_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_ = _.._./ _)" [0,0,0,10] 10)
paulson@29960
  1274
  "_from_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_ = _..<_./ _)" [0,0,0,10] 10)
paulson@29960
  1275
  "_upt_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_<_./ _)" [0,0,10] 10)
paulson@29960
  1276
  "_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_\<le>_./ _)" [0,0,10] 10)
paulson@29960
  1277
syntax (HTML output)
paulson@29960
  1278
  "_from_to_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_ = _.._./ _)" [0,0,0,10] 10)
paulson@29960
  1279
  "_from_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_ = _..<_./ _)" [0,0,0,10] 10)
paulson@29960
  1280
  "_upt_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_<_./ _)" [0,0,10] 10)
paulson@29960
  1281
  "_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Prod>_\<le>_./ _)" [0,0,10] 10)
paulson@29960
  1282
syntax (latex_prod output)
paulson@29960
  1283
  "_from_to_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
paulson@29960
  1284
 ("(3\<^raw:$\prod_{>_ = _\<^raw:}^{>_\<^raw:}$> _)" [0,0,0,10] 10)
paulson@29960
  1285
  "_from_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
paulson@29960
  1286
 ("(3\<^raw:$\prod_{>_ = _\<^raw:}^{<>_\<^raw:}$> _)" [0,0,0,10] 10)
paulson@29960
  1287
  "_upt_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
paulson@29960
  1288
 ("(3\<^raw:$\prod_{>_ < _\<^raw:}$> _)" [0,0,10] 10)
paulson@29960
  1289
  "_upto_setprod" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
paulson@29960
  1290
 ("(3\<^raw:$\prod_{>_ \<le> _\<^raw:}$> _)" [0,0,10] 10)
paulson@29960
  1291
paulson@29960
  1292
translations
paulson@29960
  1293
  "\<Prod>x=a..b. t" == "CONST setprod (%x. t) {a..b}"
paulson@29960
  1294
  "\<Prod>x=a..<b. t" == "CONST setprod (%x. t) {a..<b}"
paulson@29960
  1295
  "\<Prod>i\<le>n. t" == "CONST setprod (\<lambda>i. t) {..n}"
paulson@29960
  1296
  "\<Prod>i<n. t" == "CONST setprod (\<lambda>i. t) {..<n}"
paulson@29960
  1297
haftmann@33318
  1298
subsection {* Transfer setup *}
haftmann@33318
  1299
haftmann@33318
  1300
lemma transfer_nat_int_set_functions:
haftmann@33318
  1301
    "{..n} = nat ` {0..int n}"
haftmann@33318
  1302
    "{m..n} = nat ` {int m..int n}"  (* need all variants of these! *)
haftmann@33318
  1303
  apply (auto simp add: image_def)
haftmann@33318
  1304
  apply (rule_tac x = "int x" in bexI)
haftmann@33318
  1305
  apply auto
haftmann@33318
  1306
  apply (rule_tac x = "int x" in bexI)
haftmann@33318
  1307
  apply auto
haftmann@33318
  1308
  done
haftmann@33318
  1309
haftmann@33318
  1310
lemma transfer_nat_int_set_function_closures:
haftmann@33318
  1311
    "x >= 0 \<Longrightarrow> nat_set {x..y}"
haftmann@33318
  1312
  by (simp add: nat_set_def)
haftmann@33318
  1313
haftmann@35644
  1314
declare transfer_morphism_nat_int[transfer add
haftmann@33318
  1315
  return: transfer_nat_int_set_functions
haftmann@33318
  1316
    transfer_nat_int_set_function_closures
haftmann@33318
  1317
]
haftmann@33318
  1318
haftmann@33318
  1319
lemma transfer_int_nat_set_functions:
haftmann@33318
  1320
    "is_nat m \<Longrightarrow> is_nat n \<Longrightarrow> {m..n} = int ` {nat m..nat n}"
haftmann@33318
  1321
  by (simp only: is_nat_def transfer_nat_int_set_functions
haftmann@33318
  1322
    transfer_nat_int_set_function_closures
haftmann@33318
  1323
    transfer_nat_int_set_return_embed nat_0_le
haftmann@33318
  1324
    cong: transfer_nat_int_set_cong)
haftmann@33318
  1325
haftmann@33318
  1326
lemma transfer_int_nat_set_function_closures:
haftmann@33318
  1327
    "is_nat x \<Longrightarrow> nat_set {x..y}"
haftmann@33318
  1328
  by (simp only: transfer_nat_int_set_function_closures is_nat_def)
haftmann@33318
  1329
haftmann@35644
  1330
declare transfer_morphism_int_nat[transfer add
haftmann@33318
  1331
  return: transfer_int_nat_set_functions
haftmann@33318
  1332
    transfer_int_nat_set_function_closures
haftmann@33318
  1333
]
haftmann@33318
  1334
nipkow@8924
  1335
end