src/HOL/SetInterval.thy
author nipkow
Thu, 15 Jul 2004 13:11:34 +0200
changeset 15045 d59f7e2e18d3
parent 15042 fa7d27ef7e59
child 15047 fa62de5862b9
permissions -rw-r--r--
Moved to new m<..<n syntax for set intervals.
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
     1
(*  Title:      HOL/SetInterval.thy
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
     2
    ID:         $Id$
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
     3
    Author:     Tobias Nipkow and Clemens Ballarin
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
     4
                Additions by Jeremy Avigad in March 2004
8957
26b6e8f43305 added parent
paulson
parents: 8924
diff changeset
     5
    Copyright   2000  TU Muenchen
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
     6
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
     7
lessThan, greaterThan, atLeast, atMost and two-sided intervals
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
     8
*)
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
     9
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
    10
header {* Set intervals *}
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
    11
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
    12
theory SetInterval = IntArith:
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
    13
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
    14
constdefs
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    15
  lessThan    :: "('a::ord) => 'a set"	("(1{..<_})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    16
  "{..<u} == {x. x<u}"
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
    17
11609
3f3d1add4d94 eliminated theories "equalities" and "mono" (made part of "Typedef",
wenzelm
parents: 10214
diff changeset
    18
  atMost      :: "('a::ord) => 'a set"	("(1{.._})")
3f3d1add4d94 eliminated theories "equalities" and "mono" (made part of "Typedef",
wenzelm
parents: 10214
diff changeset
    19
  "{..u} == {x. x<=u}"
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
    20
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    21
  greaterThan :: "('a::ord) => 'a set"	("(1{_<..})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    22
  "{l<..} == {x. l<x}"
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
    23
11609
3f3d1add4d94 eliminated theories "equalities" and "mono" (made part of "Typedef",
wenzelm
parents: 10214
diff changeset
    24
  atLeast     :: "('a::ord) => 'a set"	("(1{_..})")
3f3d1add4d94 eliminated theories "equalities" and "mono" (made part of "Typedef",
wenzelm
parents: 10214
diff changeset
    25
  "{l..} == {x. l<=x}"
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
    26
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    27
  greaterThanLessThan :: "['a::ord, 'a] => 'a set"  ("(1{_<..<_})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    28
  "{l<..<u} == {l<..} Int {..<u}"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    29
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    30
  atLeastLessThan :: "['a::ord, 'a] => 'a set"      ("(1{_..<_})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    31
  "{l..<u} == {l..} Int {..<u}"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    32
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    33
  greaterThanAtMost :: "['a::ord, 'a] => 'a set"    ("(1{_<.._})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    34
  "{l<..u} == {l<..} Int {..u}"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    35
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    36
  atLeastAtMost :: "['a::ord, 'a] => 'a set"        ("(1{_.._})")
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    37
  "{l..u} == {l..} Int {..u}"
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    38
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    39
(* Old syntax, will disappear! *)
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    40
syntax
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    41
  "_lessThan"    :: "('a::ord) => 'a set"	("(1{.._'(})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    42
  "_greaterThan" :: "('a::ord) => 'a set"	("(1{')_..})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    43
  "_greaterThanLessThan" :: "['a::ord, 'a] => 'a set"  ("(1{')_.._'(})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    44
  "_atLeastLessThan" :: "['a::ord, 'a] => 'a set"      ("(1{_.._'(})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    45
  "_greaterThanAtMost" :: "['a::ord, 'a] => 'a set"    ("(1{')_.._})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    46
translations
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    47
  "{..m(}" => "{..<m}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    48
  "{)m..}" => "{m<..}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    49
  "{)m..n(}" => "{m<..<n}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    50
  "{m..n(}" => "{m..<n}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    51
  "{)m..n}" => "{m<..n}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    52
14418
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    53
syntax
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    54
  "@UNION_le"   :: "nat => nat => 'b set => 'b set"       ("(3UN _<=_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    55
  "@UNION_less" :: "nat => nat => 'b set => 'b set"       ("(3UN _<_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    56
  "@INTER_le"   :: "nat => nat => 'b set => 'b set"       ("(3INT _<=_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    57
  "@INTER_less" :: "nat => nat => 'b set => 'b set"       ("(3INT _<_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    58
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    59
syntax (input)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    60
  "@UNION_le"   :: "nat => nat => 'b set => 'b set"       ("(3\<Union> _\<le>_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    61
  "@UNION_less" :: "nat => nat => 'b set => 'b set"       ("(3\<Union> _<_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    62
  "@INTER_le"   :: "nat => nat => 'b set => 'b set"       ("(3\<Inter> _\<le>_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    63
  "@INTER_less" :: "nat => nat => 'b set => 'b set"       ("(3\<Inter> _<_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    64
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    65
syntax (xsymbols)
14846
b1fcade3880b \<^bsub>/\<^esub> syntax: unbreakable block;
wenzelm
parents: 14692
diff changeset
    66
  "@UNION_le"   :: "nat \<Rightarrow> nat => 'b set => 'b set"       ("(3\<Union>(00\<^bsub>_ \<le> _\<^esub>)/ _)" 10)
b1fcade3880b \<^bsub>/\<^esub> syntax: unbreakable block;
wenzelm
parents: 14692
diff changeset
    67
  "@UNION_less" :: "nat \<Rightarrow> nat => 'b set => 'b set"       ("(3\<Union>(00\<^bsub>_ < _\<^esub>)/ _)" 10)
b1fcade3880b \<^bsub>/\<^esub> syntax: unbreakable block;
wenzelm
parents: 14692
diff changeset
    68
  "@INTER_le"   :: "nat \<Rightarrow> nat => 'b set => 'b set"       ("(3\<Inter>(00\<^bsub>_ \<le> _\<^esub>)/ _)" 10)
b1fcade3880b \<^bsub>/\<^esub> syntax: unbreakable block;
wenzelm
parents: 14692
diff changeset
    69
  "@INTER_less" :: "nat \<Rightarrow> nat => 'b set => 'b set"       ("(3\<Inter>(00\<^bsub>_ < _\<^esub>)/ _)" 10)
14418
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    70
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    71
translations
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    72
  "UN i<=n. A"  == "UN i:{..n}. A"
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    73
  "UN i<n. A"   == "UN i:{..<n}. A"
14418
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    74
  "INT i<=n. A" == "INT i:{..n}. A"
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    75
  "INT i<n. A"  == "INT i:{..<n}. A"
14418
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    76
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    77
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
    78
subsection {* Various equivalences *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    79
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    80
lemma lessThan_iff [iff]: "(i: lessThan k) = (i<k)"
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    81
by (simp add: lessThan_def)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    82
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    83
lemma Compl_lessThan [simp]: 
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    84
    "!!k:: 'a::linorder. -lessThan k = atLeast k"
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    85
apply (auto simp add: lessThan_def atLeast_def)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    86
done
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    87
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    88
lemma single_Diff_lessThan [simp]: "!!k:: 'a::order. {k} - lessThan k = {k}"
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    89
by auto
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    90
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    91
lemma greaterThan_iff [iff]: "(i: greaterThan k) = (k<i)"
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    92
by (simp add: greaterThan_def)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    93
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    94
lemma Compl_greaterThan [simp]: 
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    95
    "!!k:: 'a::linorder. -greaterThan k = atMost k"
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    96
apply (simp add: greaterThan_def atMost_def le_def, auto)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    97
done
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    98
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    99
lemma Compl_atMost [simp]: "!!k:: 'a::linorder. -atMost k = greaterThan k"
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   100
apply (subst Compl_greaterThan [symmetric])
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   101
apply (rule double_complement) 
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   102
done
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   103
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   104
lemma atLeast_iff [iff]: "(i: atLeast k) = (k<=i)"
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   105
by (simp add: atLeast_def)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   106
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   107
lemma Compl_atLeast [simp]: 
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   108
    "!!k:: 'a::linorder. -atLeast k = lessThan k"
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   109
apply (simp add: lessThan_def atLeast_def le_def, auto)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   110
done
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   111
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   112
lemma atMost_iff [iff]: "(i: atMost k) = (i<=k)"
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   113
by (simp add: atMost_def)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   114
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   115
lemma atMost_Int_atLeast: "!!n:: 'a::order. atMost n Int atLeast n = {n}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   116
by (blast intro: order_antisym)
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   117
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   118
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   119
subsection {* Logical Equivalences for Set Inclusion and Equality *}
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   120
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   121
lemma atLeast_subset_iff [iff]:
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   122
     "(atLeast x \<subseteq> atLeast y) = (y \<le> (x::'a::order))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   123
by (blast intro: order_trans) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   124
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   125
lemma atLeast_eq_iff [iff]:
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   126
     "(atLeast x = atLeast y) = (x = (y::'a::linorder))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   127
by (blast intro: order_antisym order_trans)
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   128
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   129
lemma greaterThan_subset_iff [iff]:
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   130
     "(greaterThan x \<subseteq> greaterThan y) = (y \<le> (x::'a::linorder))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   131
apply (auto simp add: greaterThan_def) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   132
 apply (subst linorder_not_less [symmetric], blast) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   133
done
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   134
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   135
lemma greaterThan_eq_iff [iff]:
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   136
     "(greaterThan x = greaterThan y) = (x = (y::'a::linorder))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   137
apply (rule iffI) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   138
 apply (erule equalityE) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   139
 apply (simp add: greaterThan_subset_iff order_antisym, simp) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   140
done
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   141
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   142
lemma atMost_subset_iff [iff]: "(atMost x \<subseteq> atMost y) = (x \<le> (y::'a::order))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   143
by (blast intro: order_trans)
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   144
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   145
lemma atMost_eq_iff [iff]: "(atMost x = atMost y) = (x = (y::'a::linorder))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   146
by (blast intro: order_antisym order_trans)
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   147
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   148
lemma lessThan_subset_iff [iff]:
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   149
     "(lessThan x \<subseteq> lessThan y) = (x \<le> (y::'a::linorder))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   150
apply (auto simp add: lessThan_def) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   151
 apply (subst linorder_not_less [symmetric], blast) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   152
done
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   153
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   154
lemma lessThan_eq_iff [iff]:
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   155
     "(lessThan x = lessThan y) = (x = (y::'a::linorder))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   156
apply (rule iffI) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   157
 apply (erule equalityE) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   158
 apply (simp add: lessThan_subset_iff order_antisym, simp) 
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   159
done
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   160
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   161
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   162
subsection {*Two-sided intervals*}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   163
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   164
text {* @{text greaterThanLessThan} *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   165
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   166
lemma greaterThanLessThan_iff [simp]:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   167
  "(i : {l<..<u}) = (l < i & i < u)"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   168
by (simp add: greaterThanLessThan_def)
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   169
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   170
text {* @{text atLeastLessThan} *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   171
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   172
lemma atLeastLessThan_iff [simp]:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   173
  "(i : {l..<u}) = (l <= i & i < u)"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   174
by (simp add: atLeastLessThan_def)
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   175
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   176
text {* @{text greaterThanAtMost} *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   177
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   178
lemma greaterThanAtMost_iff [simp]:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   179
  "(i : {l<..u}) = (l < i & i <= u)"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   180
by (simp add: greaterThanAtMost_def)
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   181
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   182
text {* @{text atLeastAtMost} *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   183
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   184
lemma atLeastAtMost_iff [simp]:
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   185
  "(i : {l..u}) = (l <= i & i <= u)"
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   186
by (simp add: atLeastAtMost_def)
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   187
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   188
text {* The above four lemmas could be declared as iffs.
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   189
  If we do so, a call to blast in Hyperreal/Star.ML, lemma @{text STAR_Int}
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   190
  seems to take forever (more than one hour). *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   191
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   192
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   193
subsection {* Intervals of natural numbers *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   194
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   195
lemma lessThan_0 [simp]: "lessThan (0::nat) = {}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   196
by (simp add: lessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   197
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   198
lemma lessThan_Suc: "lessThan (Suc k) = insert k (lessThan k)"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   199
by (simp add: lessThan_def less_Suc_eq, blast)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   200
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   201
lemma lessThan_Suc_atMost: "lessThan (Suc k) = atMost k"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   202
by (simp add: lessThan_def atMost_def less_Suc_eq_le)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   203
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   204
lemma UN_lessThan_UNIV: "(UN m::nat. lessThan m) = UNIV"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   205
by blast
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   206
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   207
lemma greaterThan_0 [simp]: "greaterThan 0 = range Suc"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   208
apply (simp add: greaterThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   209
apply (blast dest: gr0_conv_Suc [THEN iffD1])
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   210
done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   211
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   212
lemma greaterThan_Suc: "greaterThan (Suc k) = greaterThan k - {Suc k}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   213
apply (simp add: greaterThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   214
apply (auto elim: linorder_neqE)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   215
done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   216
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   217
lemma INT_greaterThan_UNIV: "(INT m::nat. greaterThan m) = {}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   218
by blast
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   219
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   220
lemma atLeast_0 [simp]: "atLeast (0::nat) = UNIV"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   221
by (unfold atLeast_def UNIV_def, simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   222
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   223
lemma atLeast_Suc: "atLeast (Suc k) = atLeast k - {k}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   224
apply (simp add: atLeast_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   225
apply (simp add: Suc_le_eq)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   226
apply (simp add: order_le_less, blast)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   227
done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   228
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   229
lemma atLeast_Suc_greaterThan: "atLeast (Suc k) = greaterThan k"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   230
  by (auto simp add: greaterThan_def atLeast_def less_Suc_eq_le)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   231
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   232
lemma UN_atLeast_UNIV: "(UN m::nat. atLeast m) = UNIV"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   233
by blast
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   234
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   235
lemma atMost_0 [simp]: "atMost (0::nat) = {0}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   236
by (simp add: atMost_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   237
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   238
lemma atMost_Suc: "atMost (Suc k) = insert (Suc k) (atMost k)"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   239
apply (simp add: atMost_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   240
apply (simp add: less_Suc_eq order_le_less, blast)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   241
done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   242
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   243
lemma UN_atMost_UNIV: "(UN m::nat. atMost m) = UNIV"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   244
by blast
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   245
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   246
lemma atLeast0LessThan [simp]: "{0::nat..<n} = {..<n}"
15042
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   247
by(simp add:lessThan_def atLeastLessThan_def)
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   248
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   249
text {* Intervals of nats with @{text Suc} *}
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   250
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   251
lemma atLeastLessThanSuc_atLeastAtMost: "{l..<Suc u} = {l..u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   252
  by (simp add: lessThan_Suc_atMost atLeastAtMost_def atLeastLessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   253
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   254
lemma atLeastSucAtMost_greaterThanAtMost: "{Suc l..u} = {l<..u}"  
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   255
  by (simp add: atLeast_Suc_greaterThan atLeastAtMost_def 
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   256
    greaterThanAtMost_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   257
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   258
lemma atLeastSucLessThan_greaterThanLessThan: "{Suc l..<u} = {l<..<u}"  
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   259
  by (simp add: atLeast_Suc_greaterThan atLeastLessThan_def 
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   260
    greaterThanLessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   261
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   262
subsubsection {* Finiteness *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   263
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   264
lemma finite_lessThan [iff]: fixes k :: nat shows "finite {..<k}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   265
  by (induct k) (simp_all add: lessThan_Suc)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   266
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   267
lemma finite_atMost [iff]: fixes k :: nat shows "finite {..k}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   268
  by (induct k) (simp_all add: atMost_Suc)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   269
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   270
lemma finite_greaterThanLessThan [iff]:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   271
  fixes l :: nat shows "finite {l<..<u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   272
by (simp add: greaterThanLessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   273
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   274
lemma finite_atLeastLessThan [iff]:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   275
  fixes l :: nat shows "finite {l..<u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   276
by (simp add: atLeastLessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   277
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   278
lemma finite_greaterThanAtMost [iff]:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   279
  fixes l :: nat shows "finite {l<..u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   280
by (simp add: greaterThanAtMost_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   281
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   282
lemma finite_atLeastAtMost [iff]:
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   283
  fixes l :: nat shows "finite {l..u}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   284
by (simp add: atLeastAtMost_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   285
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   286
lemma bounded_nat_set_is_finite:
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   287
    "(ALL i:N. i < (n::nat)) ==> finite N"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   288
  -- {* A bounded set of natural numbers is finite. *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   289
  apply (rule finite_subset)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   290
   apply (rule_tac [2] finite_lessThan, auto)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   291
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   292
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   293
subsubsection {* Cardinality *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   294
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   295
lemma card_lessThan [simp]: "card {..<u} = u"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   296
  by (induct_tac u, simp_all add: lessThan_Suc)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   297
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   298
lemma card_atMost [simp]: "card {..u} = Suc u"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   299
  by (simp add: lessThan_Suc_atMost [THEN sym])
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   300
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   301
lemma card_atLeastLessThan [simp]: "card {l..<u} = u - l"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   302
  apply (subgoal_tac "card {l..<u} = card {..<u-l}")
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   303
  apply (erule ssubst, rule card_lessThan)
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   304
  apply (subgoal_tac "(%x. x + l) ` {..<u-l} = {l..<u}")
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   305
  apply (erule subst)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   306
  apply (rule card_image)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   307
  apply (rule finite_lessThan)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   308
  apply (simp add: inj_on_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   309
  apply (auto simp add: image_def atLeastLessThan_def lessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   310
  apply arith
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   311
  apply (rule_tac x = "x - l" in exI)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   312
  apply arith
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   313
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   314
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   315
lemma card_atLeastAtMost [simp]: "card {l..u} = Suc u - l"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   316
  by (subst atLeastLessThanSuc_atLeastAtMost [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   317
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   318
lemma card_greaterThanAtMost [simp]: "card {l<..u} = u - l" 
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   319
  by (subst atLeastSucAtMost_greaterThanAtMost [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   320
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   321
lemma card_greaterThanLessThan [simp]: "card {l<..<u} = u - Suc l"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   322
  by (subst atLeastSucLessThan_greaterThanLessThan [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   323
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   324
subsection {* Intervals of integers *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   325
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   326
lemma atLeastLessThanPlusOne_atLeastAtMost_int: "{l..<u+1} = {l..(u::int)}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   327
  by (auto simp add: atLeastAtMost_def atLeastLessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   328
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   329
lemma atLeastPlusOneAtMost_greaterThanAtMost_int: "{l+1..u} = {l<..(u::int)}"  
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   330
  by (auto simp add: atLeastAtMost_def greaterThanAtMost_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   331
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   332
lemma atLeastPlusOneLessThan_greaterThanLessThan_int: 
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   333
    "{l+1..<u} = {l<..<u::int}"  
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   334
  by (auto simp add: atLeastLessThan_def greaterThanLessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   335
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   336
subsubsection {* Finiteness *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   337
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   338
lemma image_atLeastZeroLessThan_int: "0 \<le> u ==> 
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   339
    {(0::int)..<u} = int ` {..<nat u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   340
  apply (unfold image_def lessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   341
  apply auto
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   342
  apply (rule_tac x = "nat x" in exI)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   343
  apply (auto simp add: zless_nat_conj zless_nat_eq_int_zless [THEN sym])
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   344
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   345
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   346
lemma finite_atLeastZeroLessThan_int: "finite {(0::int)..<u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   347
  apply (case_tac "0 \<le> u")
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   348
  apply (subst image_atLeastZeroLessThan_int, assumption)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   349
  apply (rule finite_imageI)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   350
  apply auto
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   351
  apply (subgoal_tac "{0..<u} = {}")
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   352
  apply auto
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   353
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   354
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   355
lemma image_atLeastLessThan_int_shift: 
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   356
    "(%x. x + (l::int)) ` {0..<u-l} = {l..<u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   357
  apply (auto simp add: image_def atLeastLessThan_iff)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   358
  apply (rule_tac x = "x - l" in bexI)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   359
  apply auto
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   360
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   361
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   362
lemma finite_atLeastLessThan_int [iff]: "finite {l..<u::int}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   363
  apply (subgoal_tac "(%x. x + l) ` {0..<u-l} = {l..<u}")
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   364
  apply (erule subst)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   365
  apply (rule finite_imageI)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   366
  apply (rule finite_atLeastZeroLessThan_int)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   367
  apply (rule image_atLeastLessThan_int_shift)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   368
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   369
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   370
lemma finite_atLeastAtMost_int [iff]: "finite {l..(u::int)}" 
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   371
  by (subst atLeastLessThanPlusOne_atLeastAtMost_int [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   372
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   373
lemma finite_greaterThanAtMost_int [iff]: "finite {l<..(u::int)}" 
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   374
  by (subst atLeastPlusOneAtMost_greaterThanAtMost_int [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   375
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   376
lemma finite_greaterThanLessThan_int [iff]: "finite {l<..<u::int}" 
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   377
  by (subst atLeastPlusOneLessThan_greaterThanLessThan_int [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   378
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   379
subsubsection {* Cardinality *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   380
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   381
lemma card_atLeastZeroLessThan_int: "card {(0::int)..<u} = nat u"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   382
  apply (case_tac "0 \<le> u")
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   383
  apply (subst image_atLeastZeroLessThan_int, assumption)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   384
  apply (subst card_image)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   385
  apply (auto simp add: inj_on_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   386
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   387
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   388
lemma card_atLeastLessThan_int [simp]: "card {l..<u} = nat (u - l)"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   389
  apply (subgoal_tac "card {l..<u} = card {0..<u-l}")
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   390
  apply (erule ssubst, rule card_atLeastZeroLessThan_int)
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   391
  apply (subgoal_tac "(%x. x + l) ` {0..<u-l} = {l..<u}")
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   392
  apply (erule subst)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   393
  apply (rule card_image)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   394
  apply (rule finite_atLeastZeroLessThan_int)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   395
  apply (simp add: inj_on_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   396
  apply (rule image_atLeastLessThan_int_shift)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   397
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   398
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   399
lemma card_atLeastAtMost_int [simp]: "card {l..u} = nat (u - l + 1)"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   400
  apply (subst atLeastLessThanPlusOne_atLeastAtMost_int [THEN sym])
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   401
  apply (auto simp add: compare_rls)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   402
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   403
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   404
lemma card_greaterThanAtMost_int [simp]: "card {l<..u} = nat (u - l)" 
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   405
  by (subst atLeastPlusOneAtMost_greaterThanAtMost_int [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   406
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   407
lemma card_greaterThanLessThan_int [simp]: "card {l<..<u} = nat (u - (l + 1))"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   408
  by (subst atLeastPlusOneLessThan_greaterThanLessThan_int [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   409
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   410
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   411
subsection {*Lemmas useful with the summation operator setsum*}
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   412
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   413
text {* For examples, see Algebra/poly/UnivPoly.thy *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   414
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   415
subsubsection {* Disjoint Unions *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   416
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   417
text {* Singletons and open intervals *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   418
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   419
lemma ivl_disj_un_singleton:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   420
  "{l::'a::linorder} Un {l<..} = {l..}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   421
  "{..<u} Un {u::'a::linorder} = {..u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   422
  "(l::'a::linorder) < u ==> {l} Un {l<..<u} = {l..<u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   423
  "(l::'a::linorder) < u ==> {l<..<u} Un {u} = {l<..u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   424
  "(l::'a::linorder) <= u ==> {l} Un {l<..u} = {l..u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   425
  "(l::'a::linorder) <= u ==> {l..<u} Un {u} = {l..u}"
14398
c5c47703f763 Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents: 13850
diff changeset
   426
by auto
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   427
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   428
text {* One- and two-sided intervals *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   429
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   430
lemma ivl_disj_un_one:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   431
  "(l::'a::linorder) < u ==> {..l} Un {l<..<u} = {..<u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   432
  "(l::'a::linorder) <= u ==> {..<l} Un {l..<u} = {..<u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   433
  "(l::'a::linorder) <= u ==> {..l} Un {l<..u} = {..u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   434
  "(l::'a::linorder) <= u ==> {..<l} Un {l..u} = {..u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   435
  "(l::'a::linorder) <= u ==> {l<..u} Un {u<..} = {l<..}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   436
  "(l::'a::linorder) < u ==> {l<..<u} Un {u..} = {l<..}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   437
  "(l::'a::linorder) <= u ==> {l..u} Un {u<..} = {l..}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   438
  "(l::'a::linorder) <= u ==> {l..<u} Un {u..} = {l..}"
14398
c5c47703f763 Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents: 13850
diff changeset
   439
by auto
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   440
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   441
text {* Two- and two-sided intervals *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   442
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   443
lemma ivl_disj_un_two:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   444
  "[| (l::'a::linorder) < m; m <= u |] ==> {l<..<m} Un {m..<u} = {l<..<u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   445
  "[| (l::'a::linorder) <= m; m < u |] ==> {l<..m} Un {m<..<u} = {l<..<u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   446
  "[| (l::'a::linorder) <= m; m <= u |] ==> {l..<m} Un {m..<u} = {l..<u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   447
  "[| (l::'a::linorder) <= m; m < u |] ==> {l..m} Un {m<..<u} = {l..<u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   448
  "[| (l::'a::linorder) < m; m <= u |] ==> {l<..<m} Un {m..u} = {l<..u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   449
  "[| (l::'a::linorder) <= m; m <= u |] ==> {l<..m} Un {m<..u} = {l<..u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   450
  "[| (l::'a::linorder) <= m; m <= u |] ==> {l..<m} Un {m..u} = {l..u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   451
  "[| (l::'a::linorder) <= m; m <= u |] ==> {l..m} Un {m<..u} = {l..u}"
14398
c5c47703f763 Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents: 13850
diff changeset
   452
by auto
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   453
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   454
lemmas ivl_disj_un = ivl_disj_un_singleton ivl_disj_un_one ivl_disj_un_two
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   455
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   456
subsubsection {* Disjoint Intersections *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   457
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   458
text {* Singletons and open intervals *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   459
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   460
lemma ivl_disj_int_singleton:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   461
  "{l::'a::order} Int {l<..} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   462
  "{..<u} Int {u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   463
  "{l} Int {l<..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   464
  "{l<..<u} Int {u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   465
  "{l} Int {l<..u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   466
  "{l..<u} Int {u} = {}"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   467
  by simp+
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   468
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   469
text {* One- and two-sided intervals *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   470
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   471
lemma ivl_disj_int_one:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   472
  "{..l::'a::order} Int {l<..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   473
  "{..<l} Int {l..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   474
  "{..l} Int {l<..u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   475
  "{..<l} Int {l..u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   476
  "{l<..u} Int {u<..} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   477
  "{l<..<u} Int {u..} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   478
  "{l..u} Int {u<..} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   479
  "{l..<u} Int {u..} = {}"
14398
c5c47703f763 Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents: 13850
diff changeset
   480
  by auto
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   481
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   482
text {* Two- and two-sided intervals *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   483
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   484
lemma ivl_disj_int_two:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   485
  "{l::'a::order<..<m} Int {m..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   486
  "{l<..m} Int {m<..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   487
  "{l..<m} Int {m..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   488
  "{l..m} Int {m<..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   489
  "{l<..<m} Int {m..u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   490
  "{l<..m} Int {m<..u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   491
  "{l..<m} Int {m..u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   492
  "{l..m} Int {m<..u} = {}"
14398
c5c47703f763 Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents: 13850
diff changeset
   493
  by auto
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   494
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   495
lemmas ivl_disj_int = ivl_disj_int_singleton ivl_disj_int_one ivl_disj_int_two
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   496
15041
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   497
15042
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   498
subsection {* Summation indexed over intervals *}
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   499
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   500
text{* We introduce the obvious syntax @{text"\<Sum>x=a..b. e"} for
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   501
@{term"\<Sum>x\<in>{a..b}. e"}. *}
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   502
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   503
syntax
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   504
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(SUM _ = _.._./ _)" [0,0,0,10] 10)
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   505
syntax (xsymbols)
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   506
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _.._./ _)" [0,0,0,10] 10)
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   507
syntax (HTML output)
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   508
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _.._./ _)" [0,0,0,10] 10)
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   509
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   510
translations "\<Sum>x=a..b. t" == "setsum (%x. t) {a..b}"
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   511
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   512
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   513
subsection {* Summation up to *}
15041
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   514
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   515
text{* Legacy, only used in HoareParallel and Isar-Examples. Really
15042
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   516
needed? Probably better to replace it with above syntax. *}
15041
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   517
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   518
syntax
15042
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   519
  "_Summation" :: "idt => 'a => 'b => 'b"    ("\<Sum>_<_. _" [0, 51, 10] 10)
15041
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   520
translations
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   521
  "\<Sum>i < n. b" == "setsum (\<lambda>i. b) {..<n}"
15041
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   522
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   523
lemma Summation_Suc[simp]: "(\<Sum>i < Suc n. b i) = b n + (\<Sum>i < n. b i)"
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   524
by (simp add:lessThan_Suc)
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   525
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
   526
end