src/HOL/SetInterval.thy
author paulson
Fri, 29 Oct 2004 15:16:02 +0200
changeset 15270 8b3f707a78a7
parent 15251 bb6f072c8d10
child 15402 97204f3b4705
permissions -rw-r--r--
fixed reference to renamed theorem
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
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15056
diff changeset
    12
theory SetInterval
15140
322485b816ac import -> imports
nipkow
parents: 15131
diff changeset
    13
imports IntArith
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15056
diff changeset
    14
begin
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
    15
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
    16
constdefs
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    17
  lessThan    :: "('a::ord) => 'a set"	("(1{..<_})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    18
  "{..<u} == {x. x<u}"
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
    19
11609
3f3d1add4d94 eliminated theories "equalities" and "mono" (made part of "Typedef",
wenzelm
parents: 10214
diff changeset
    20
  atMost      :: "('a::ord) => 'a set"	("(1{.._})")
3f3d1add4d94 eliminated theories "equalities" and "mono" (made part of "Typedef",
wenzelm
parents: 10214
diff changeset
    21
  "{..u} == {x. x<=u}"
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
    22
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    23
  greaterThan :: "('a::ord) => 'a set"	("(1{_<..})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    24
  "{l<..} == {x. l<x}"
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
    25
11609
3f3d1add4d94 eliminated theories "equalities" and "mono" (made part of "Typedef",
wenzelm
parents: 10214
diff changeset
    26
  atLeast     :: "('a::ord) => 'a set"	("(1{_..})")
3f3d1add4d94 eliminated theories "equalities" and "mono" (made part of "Typedef",
wenzelm
parents: 10214
diff changeset
    27
  "{l..} == {x. l<=x}"
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
    28
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    29
  greaterThanLessThan :: "['a::ord, 'a] => 'a set"  ("(1{_<..<_})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    30
  "{l<..<u} == {l<..} Int {..<u}"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    31
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    32
  atLeastLessThan :: "['a::ord, 'a] => 'a set"      ("(1{_..<_})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    33
  "{l..<u} == {l..} Int {..<u}"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    34
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    35
  greaterThanAtMost :: "['a::ord, 'a] => 'a set"    ("(1{_<.._})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    36
  "{l<..u} == {l<..} Int {..u}"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    37
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    38
  atLeastAtMost :: "['a::ord, 'a] => 'a set"        ("(1{_.._})")
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    39
  "{l..u} == {l..} Int {..u}"
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    40
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    41
(* Old syntax, will disappear! *)
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    42
syntax
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    43
  "_lessThan"    :: "('a::ord) => 'a set"	("(1{.._'(})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    44
  "_greaterThan" :: "('a::ord) => 'a set"	("(1{')_..})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    45
  "_greaterThanLessThan" :: "['a::ord, 'a] => 'a set"  ("(1{')_.._'(})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    46
  "_atLeastLessThan" :: "['a::ord, 'a] => 'a set"      ("(1{_.._'(})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    47
  "_greaterThanAtMost" :: "['a::ord, 'a] => 'a set"    ("(1{')_.._})")
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    48
translations
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    49
  "{..m(}" => "{..<m}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    50
  "{)m..}" => "{m<..}"
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
  "{m..n(}" => "{m..<n}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    53
  "{)m..n}" => "{m<..n}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    54
15048
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
    55
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
    56
text{* A note of warning when using @{term"{..<n}"} on type @{typ
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
    57
nat}: it is equivalent to @{term"{0::nat..<n}"} but some lemmas involving
15052
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
    58
@{term"{m..<n}"} may not exist in @{term"{..<n}"}-form as well. *}
15048
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
    59
14418
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    60
syntax
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    61
  "@UNION_le"   :: "nat => nat => 'b set => 'b set"       ("(3UN _<=_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    62
  "@UNION_less" :: "nat => nat => 'b set => 'b set"       ("(3UN _<_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    63
  "@INTER_le"   :: "nat => nat => 'b set => 'b set"       ("(3INT _<=_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    64
  "@INTER_less" :: "nat => nat => 'b set => 'b set"       ("(3INT _<_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    65
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    66
syntax (input)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    67
  "@UNION_le"   :: "nat => nat => 'b set => 'b set"       ("(3\<Union> _\<le>_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    68
  "@UNION_less" :: "nat => nat => 'b set => 'b set"       ("(3\<Union> _<_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    69
  "@INTER_le"   :: "nat => nat => 'b set => 'b set"       ("(3\<Inter> _\<le>_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    70
  "@INTER_less" :: "nat => nat => 'b set => 'b set"       ("(3\<Inter> _<_./ _)" 10)
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    71
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    72
syntax (xsymbols)
14846
b1fcade3880b \<^bsub>/\<^esub> syntax: unbreakable block;
wenzelm
parents: 14692
diff changeset
    73
  "@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
    74
  "@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
    75
  "@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
    76
  "@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
    77
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    78
translations
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    79
  "UN i<=n. A"  == "UN i:{..n}. A"
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    80
  "UN i<n. A"   == "UN i:{..<n}. A"
14418
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    81
  "INT i<=n. A" == "INT i:{..n}. A"
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
    82
  "INT i<n. A"  == "INT i:{..<n}. A"
14418
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    83
b62323c85134 union/intersection over intervals
kleing
parents: 14398
diff changeset
    84
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
    85
subsection {* Various equivalences *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    86
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    87
lemma lessThan_iff [iff]: "(i: lessThan k) = (i<k)"
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    88
by (simp add: lessThan_def)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    89
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    90
lemma Compl_lessThan [simp]: 
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    91
    "!!k:: 'a::linorder. -lessThan k = atLeast k"
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    92
apply (auto simp add: lessThan_def atLeast_def)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    93
done
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    94
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    95
lemma single_Diff_lessThan [simp]: "!!k:: 'a::order. {k} - lessThan k = {k}"
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    96
by auto
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
    97
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    98
lemma greaterThan_iff [iff]: "(i: greaterThan k) = (k<i)"
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
    99
by (simp add: greaterThan_def)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   100
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   101
lemma Compl_greaterThan [simp]: 
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   102
    "!!k:: 'a::linorder. -greaterThan k = atMost k"
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   103
apply (simp add: greaterThan_def atMost_def le_def, auto)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   104
done
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   105
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   106
lemma Compl_atMost [simp]: "!!k:: 'a::linorder. -atMost k = greaterThan k"
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   107
apply (subst Compl_greaterThan [symmetric])
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   108
apply (rule double_complement) 
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   109
done
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   110
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   111
lemma atLeast_iff [iff]: "(i: atLeast k) = (k<=i)"
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   112
by (simp add: atLeast_def)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   113
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   114
lemma Compl_atLeast [simp]: 
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   115
    "!!k:: 'a::linorder. -atLeast k = lessThan k"
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   116
apply (simp add: lessThan_def atLeast_def le_def, auto)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   117
done
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   118
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   119
lemma atMost_iff [iff]: "(i: atMost k) = (i<=k)"
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   120
by (simp add: atMost_def)
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   121
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   122
lemma atMost_Int_atLeast: "!!n:: 'a::order. atMost n Int atLeast n = {n}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   123
by (blast intro: order_antisym)
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   124
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   125
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   126
subsection {* Logical Equivalences for Set Inclusion and Equality *}
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   127
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   128
lemma atLeast_subset_iff [iff]:
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   129
     "(atLeast x \<subseteq> atLeast y) = (y \<le> (x::'a::order))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   130
by (blast intro: order_trans) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   131
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   132
lemma atLeast_eq_iff [iff]:
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   133
     "(atLeast x = atLeast y) = (x = (y::'a::linorder))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   134
by (blast intro: order_antisym order_trans)
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   135
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   136
lemma greaterThan_subset_iff [iff]:
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   137
     "(greaterThan x \<subseteq> greaterThan y) = (y \<le> (x::'a::linorder))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   138
apply (auto simp add: greaterThan_def) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   139
 apply (subst linorder_not_less [symmetric], blast) 
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 greaterThan_eq_iff [iff]:
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   143
     "(greaterThan x = greaterThan y) = (x = (y::'a::linorder))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   144
apply (rule iffI) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   145
 apply (erule equalityE) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   146
 apply (simp add: greaterThan_subset_iff order_antisym, simp) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   147
done
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   148
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   149
lemma atMost_subset_iff [iff]: "(atMost x \<subseteq> atMost y) = (x \<le> (y::'a::order))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   150
by (blast intro: order_trans)
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   151
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   152
lemma atMost_eq_iff [iff]: "(atMost x = atMost y) = (x = (y::'a::linorder))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   153
by (blast intro: order_antisym order_trans)
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   154
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   155
lemma lessThan_subset_iff [iff]:
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   156
     "(lessThan x \<subseteq> lessThan y) = (x \<le> (y::'a::linorder))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   157
apply (auto simp add: lessThan_def) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   158
 apply (subst linorder_not_less [symmetric], blast) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   159
done
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   160
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   161
lemma lessThan_eq_iff [iff]:
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   162
     "(lessThan x = lessThan y) = (x = (y::'a::linorder))" 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   163
apply (rule iffI) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   164
 apply (erule equalityE) 
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   165
 apply (simp add: lessThan_subset_iff order_antisym, simp) 
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   166
done
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   167
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   168
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   169
subsection {*Two-sided intervals*}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   170
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   171
text {* @{text greaterThanLessThan} *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   172
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   173
lemma greaterThanLessThan_iff [simp]:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   174
  "(i : {l<..<u}) = (l < i & i < u)"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   175
by (simp add: greaterThanLessThan_def)
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   176
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   177
text {* @{text atLeastLessThan} *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   178
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   179
lemma atLeastLessThan_iff [simp]:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   180
  "(i : {l..<u}) = (l <= i & i < u)"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   181
by (simp add: atLeastLessThan_def)
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   182
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   183
text {* @{text greaterThanAtMost} *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   184
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   185
lemma greaterThanAtMost_iff [simp]:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   186
  "(i : {l<..u}) = (l < i & i <= u)"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   187
by (simp add: greaterThanAtMost_def)
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   188
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   189
text {* @{text atLeastAtMost} *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   190
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   191
lemma atLeastAtMost_iff [simp]:
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   192
  "(i : {l..u}) = (l <= i & i <= u)"
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   193
by (simp add: atLeastAtMost_def)
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   194
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   195
text {* The above four lemmas could be declared as iffs.
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   196
  If we do so, a call to blast in Hyperreal/Star.ML, lemma @{text STAR_Int}
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   197
  seems to take forever (more than one hour). *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   198
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   199
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   200
subsection {* Intervals of natural numbers *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   201
15047
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   202
subsubsection {* The Constant @{term lessThan} *}
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   203
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   204
lemma lessThan_0 [simp]: "lessThan (0::nat) = {}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   205
by (simp add: lessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   206
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   207
lemma lessThan_Suc: "lessThan (Suc k) = insert k (lessThan k)"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   208
by (simp add: lessThan_def less_Suc_eq, blast)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   209
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   210
lemma lessThan_Suc_atMost: "lessThan (Suc k) = atMost k"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   211
by (simp add: lessThan_def atMost_def less_Suc_eq_le)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   212
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   213
lemma UN_lessThan_UNIV: "(UN m::nat. lessThan m) = UNIV"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   214
by blast
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   215
15047
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   216
subsubsection {* The Constant @{term greaterThan} *}
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   217
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   218
lemma greaterThan_0 [simp]: "greaterThan 0 = range Suc"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   219
apply (simp add: greaterThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   220
apply (blast dest: gr0_conv_Suc [THEN iffD1])
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   221
done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   222
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   223
lemma greaterThan_Suc: "greaterThan (Suc k) = greaterThan k - {Suc k}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   224
apply (simp add: greaterThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   225
apply (auto elim: linorder_neqE)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   226
done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   227
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   228
lemma INT_greaterThan_UNIV: "(INT m::nat. greaterThan m) = {}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   229
by blast
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   230
15047
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   231
subsubsection {* The Constant @{term atLeast} *}
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   232
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   233
lemma atLeast_0 [simp]: "atLeast (0::nat) = UNIV"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   234
by (unfold atLeast_def UNIV_def, simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   235
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   236
lemma atLeast_Suc: "atLeast (Suc k) = atLeast k - {k}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   237
apply (simp add: atLeast_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   238
apply (simp add: Suc_le_eq)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   239
apply (simp add: order_le_less, blast)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   240
done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   241
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   242
lemma atLeast_Suc_greaterThan: "atLeast (Suc k) = greaterThan k"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   243
  by (auto simp add: greaterThan_def atLeast_def less_Suc_eq_le)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   244
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   245
lemma UN_atLeast_UNIV: "(UN m::nat. atLeast m) = UNIV"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   246
by blast
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   247
15047
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   248
subsubsection {* The Constant @{term atMost} *}
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   249
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   250
lemma atMost_0 [simp]: "atMost (0::nat) = {0}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   251
by (simp add: atMost_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   252
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   253
lemma atMost_Suc: "atMost (Suc k) = insert (Suc k) (atMost k)"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   254
apply (simp add: atMost_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   255
apply (simp add: less_Suc_eq order_le_less, blast)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   256
done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   257
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   258
lemma UN_atMost_UNIV: "(UN m::nat. atMost m) = UNIV"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   259
by blast
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   260
15047
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   261
subsubsection {* The Constant @{term atLeastLessThan} *}
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   262
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   263
text{*But not a simprule because some concepts are better left in terms
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   264
  of @{term atLeastLessThan}*}
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   265
lemma atLeast0LessThan: "{0::nat..<n} = {..<n}"
15042
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   266
by(simp add:lessThan_def atLeastLessThan_def)
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   267
15047
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   268
lemma atLeastLessThan0 [simp]: "{m..<0::nat} = {}"
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   269
by (simp add: atLeastLessThan_def)
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   270
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   271
lemma atLeastLessThan_self [simp]: "{n::'a::order..<n} = {}"
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   272
by (auto simp add: atLeastLessThan_def)
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   273
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   274
lemma atLeastLessThan_empty: "n \<le> m ==> {m..<n::'a::order} = {}"
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   275
by (auto simp add: atLeastLessThan_def)
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   276
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   277
subsubsection {* Intervals of nats with @{term Suc} *}
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   278
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   279
text{*Not a simprule because the RHS is too messy.*}
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   280
lemma atLeastLessThanSuc:
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   281
    "{m..<Suc n} = (if m \<le> n then insert n {m..<n} else {})"
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   282
by (auto simp add: atLeastLessThan_def) 
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   283
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   284
lemma atLeastLessThan_singleton [simp]: "{m..<Suc m} = {m}" 
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   285
by (auto simp add: atLeastLessThan_def)
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   286
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   287
lemma atLeast_sum_LessThan [simp]: "{m + k..<k::nat} = {}"
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   288
by (induct k, simp_all add: atLeastLessThanSuc)
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   289
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   290
lemma atLeastSucLessThan [simp]: "{Suc n..<n} = {}"
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   291
by (auto simp add: atLeastLessThan_def)
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   292
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   293
lemma atLeastLessThanSuc_atLeastAtMost: "{l..<Suc u} = {l..u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   294
  by (simp add: lessThan_Suc_atMost atLeastAtMost_def atLeastLessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   295
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   296
lemma atLeastSucAtMost_greaterThanAtMost: "{Suc l..u} = {l<..u}"  
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   297
  by (simp add: atLeast_Suc_greaterThan atLeastAtMost_def 
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   298
    greaterThanAtMost_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   299
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   300
lemma atLeastSucLessThan_greaterThanLessThan: "{Suc l..<u} = {l<..<u}"  
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   301
  by (simp add: atLeast_Suc_greaterThan atLeastLessThan_def 
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   302
    greaterThanLessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   303
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   304
subsubsection {* Finiteness *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   305
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   306
lemma finite_lessThan [iff]: fixes k :: nat shows "finite {..<k}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   307
  by (induct k) (simp_all add: lessThan_Suc)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   308
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   309
lemma finite_atMost [iff]: fixes k :: nat shows "finite {..k}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   310
  by (induct k) (simp_all add: atMost_Suc)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   311
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   312
lemma finite_greaterThanLessThan [iff]:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   313
  fixes l :: nat shows "finite {l<..<u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   314
by (simp add: greaterThanLessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   315
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   316
lemma finite_atLeastLessThan [iff]:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   317
  fixes l :: nat shows "finite {l..<u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   318
by (simp add: atLeastLessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   319
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   320
lemma finite_greaterThanAtMost [iff]:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   321
  fixes l :: nat shows "finite {l<..u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   322
by (simp add: greaterThanAtMost_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   323
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   324
lemma finite_atLeastAtMost [iff]:
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   325
  fixes l :: nat shows "finite {l..u}"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   326
by (simp add: atLeastAtMost_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   327
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   328
lemma bounded_nat_set_is_finite:
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   329
    "(ALL i:N. i < (n::nat)) ==> finite N"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   330
  -- {* A bounded set of natural numbers is finite. *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   331
  apply (rule finite_subset)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   332
   apply (rule_tac [2] finite_lessThan, auto)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   333
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   334
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   335
subsubsection {* Cardinality *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   336
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   337
lemma card_lessThan [simp]: "card {..<u} = u"
15251
bb6f072c8d10 converted some induct_tac to induct
paulson
parents: 15140
diff changeset
   338
  by (induct u, simp_all add: lessThan_Suc)
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   339
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   340
lemma card_atMost [simp]: "card {..u} = Suc u"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   341
  by (simp add: lessThan_Suc_atMost [THEN sym])
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   342
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   343
lemma card_atLeastLessThan [simp]: "card {l..<u} = u - l"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   344
  apply (subgoal_tac "card {l..<u} = card {..<u-l}")
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   345
  apply (erule ssubst, rule card_lessThan)
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   346
  apply (subgoal_tac "(%x. x + l) ` {..<u-l} = {l..<u}")
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   347
  apply (erule subst)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   348
  apply (rule card_image)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   349
  apply (rule finite_lessThan)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   350
  apply (simp add: inj_on_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   351
  apply (auto simp add: image_def atLeastLessThan_def lessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   352
  apply arith
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   353
  apply (rule_tac x = "x - l" in exI)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   354
  apply arith
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   355
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   356
15047
fa62de5862b9 redefining sumr to be a translation to setsum
paulson
parents: 15045
diff changeset
   357
lemma card_atLeastAtMost [simp]: "card {l..u} = Suc u - l"  
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   358
  by (subst atLeastLessThanSuc_atLeastAtMost [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   359
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   360
lemma card_greaterThanAtMost [simp]: "card {l<..u} = u - l" 
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   361
  by (subst atLeastSucAtMost_greaterThanAtMost [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   362
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   363
lemma card_greaterThanLessThan [simp]: "card {l<..<u} = u - Suc l"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   364
  by (subst atLeastSucLessThan_greaterThanLessThan [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   365
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   366
subsection {* Intervals of integers *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   367
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   368
lemma atLeastLessThanPlusOne_atLeastAtMost_int: "{l..<u+1} = {l..(u::int)}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   369
  by (auto simp add: atLeastAtMost_def atLeastLessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   370
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   371
lemma atLeastPlusOneAtMost_greaterThanAtMost_int: "{l+1..u} = {l<..(u::int)}"  
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   372
  by (auto simp add: atLeastAtMost_def greaterThanAtMost_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   373
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   374
lemma atLeastPlusOneLessThan_greaterThanLessThan_int: 
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   375
    "{l+1..<u} = {l<..<u::int}"  
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   376
  by (auto simp add: atLeastLessThan_def greaterThanLessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   377
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   378
subsubsection {* Finiteness *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   379
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   380
lemma image_atLeastZeroLessThan_int: "0 \<le> u ==> 
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   381
    {(0::int)..<u} = int ` {..<nat u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   382
  apply (unfold image_def lessThan_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   383
  apply auto
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   384
  apply (rule_tac x = "nat x" in exI)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   385
  apply (auto simp add: zless_nat_conj zless_nat_eq_int_zless [THEN sym])
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 finite_atLeastZeroLessThan_int: "finite {(0::int)..<u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   389
  apply (case_tac "0 \<le> u")
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   390
  apply (subst image_atLeastZeroLessThan_int, assumption)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   391
  apply (rule finite_imageI)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   392
  apply auto
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   393
  apply (subgoal_tac "{0..<u} = {}")
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   394
  apply auto
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   395
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   396
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   397
lemma image_atLeastLessThan_int_shift: 
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   398
    "(%x. x + (l::int)) ` {0..<u-l} = {l..<u}"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   399
  apply (auto simp add: image_def atLeastLessThan_iff)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   400
  apply (rule_tac x = "x - l" in bexI)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   401
  apply auto
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 finite_atLeastLessThan_int [iff]: "finite {l..<u::int}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   405
  apply (subgoal_tac "(%x. x + l) ` {0..<u-l} = {l..<u}")
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   406
  apply (erule subst)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   407
  apply (rule finite_imageI)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   408
  apply (rule finite_atLeastZeroLessThan_int)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   409
  apply (rule image_atLeastLessThan_int_shift)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   410
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   411
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   412
lemma finite_atLeastAtMost_int [iff]: "finite {l..(u::int)}" 
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   413
  by (subst atLeastLessThanPlusOne_atLeastAtMost_int [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   414
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   415
lemma finite_greaterThanAtMost_int [iff]: "finite {l<..(u::int)}" 
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   416
  by (subst atLeastPlusOneAtMost_greaterThanAtMost_int [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   417
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   418
lemma finite_greaterThanLessThan_int [iff]: "finite {l<..<u::int}" 
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   419
  by (subst atLeastPlusOneLessThan_greaterThanLessThan_int [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   420
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   421
subsubsection {* Cardinality *}
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   422
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   423
lemma card_atLeastZeroLessThan_int: "card {(0::int)..<u} = nat u"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   424
  apply (case_tac "0 \<le> u")
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   425
  apply (subst image_atLeastZeroLessThan_int, assumption)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   426
  apply (subst card_image)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   427
  apply (auto simp add: inj_on_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   428
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   429
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   430
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
   431
  apply (subgoal_tac "card {l..<u} = card {0..<u-l}")
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   432
  apply (erule ssubst, rule card_atLeastZeroLessThan_int)
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   433
  apply (subgoal_tac "(%x. x + l) ` {0..<u-l} = {l..<u}")
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   434
  apply (erule subst)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   435
  apply (rule card_image)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   436
  apply (rule finite_atLeastZeroLessThan_int)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   437
  apply (simp add: inj_on_def)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   438
  apply (rule image_atLeastLessThan_int_shift)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   439
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   440
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   441
lemma card_atLeastAtMost_int [simp]: "card {l..u} = nat (u - l + 1)"
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   442
  apply (subst atLeastLessThanPlusOne_atLeastAtMost_int [THEN sym])
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   443
  apply (auto simp add: compare_rls)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   444
  done
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   445
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   446
lemma card_greaterThanAtMost_int [simp]: "card {l<..u} = nat (u - l)" 
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   447
  by (subst atLeastPlusOneAtMost_greaterThanAtMost_int [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   448
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   449
lemma card_greaterThanLessThan_int [simp]: "card {l<..<u} = nat (u - (l + 1))"
14485
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   450
  by (subst atLeastPlusOneLessThan_greaterThanLessThan_int [THEN sym], simp)
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   451
ea2707645af8 new material from Avigad
paulson
parents: 14478
diff changeset
   452
13850
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   453
subsection {*Lemmas useful with the summation operator setsum*}
6d1bb3059818 new logical equivalences
paulson
parents: 13735
diff changeset
   454
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   455
text {* For examples, see Algebra/poly/UnivPoly.thy *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   456
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   457
subsubsection {* Disjoint Unions *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   458
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   459
text {* Singletons and open intervals *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   460
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   461
lemma ivl_disj_un_singleton:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   462
  "{l::'a::linorder} Un {l<..} = {l..}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   463
  "{..<u} Un {u::'a::linorder} = {..u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   464
  "(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
   465
  "(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
   466
  "(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
   467
  "(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
   468
by auto
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   469
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   470
text {* One- and two-sided intervals *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   471
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   472
lemma ivl_disj_un_one:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   473
  "(l::'a::linorder) < u ==> {..l} Un {l<..<u} = {..<u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   474
  "(l::'a::linorder) <= u ==> {..<l} Un {l..<u} = {..<u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   475
  "(l::'a::linorder) <= u ==> {..l} Un {l<..u} = {..u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   476
  "(l::'a::linorder) <= u ==> {..<l} Un {l..u} = {..u}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   477
  "(l::'a::linorder) <= u ==> {l<..u} Un {u<..} = {l<..}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   478
  "(l::'a::linorder) < u ==> {l<..<u} Un {u..} = {l<..}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   479
  "(l::'a::linorder) <= u ==> {l..u} Un {u<..} = {l..}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   480
  "(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
   481
by auto
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   482
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   483
text {* Two- and two-sided intervals *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   484
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   485
lemma ivl_disj_un_two:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   486
  "[| (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
   487
  "[| (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
   488
  "[| (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
   489
  "[| (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
   490
  "[| (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
   491
  "[| (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
   492
  "[| (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
   493
  "[| (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
   494
by auto
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   495
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   496
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
   497
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   498
subsubsection {* Disjoint Intersections *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   499
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   500
text {* Singletons and open intervals *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   501
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   502
lemma ivl_disj_int_singleton:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   503
  "{l::'a::order} Int {l<..} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   504
  "{..<u} Int {u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   505
  "{l} Int {l<..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   506
  "{l<..<u} Int {u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   507
  "{l} Int {l<..u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   508
  "{l..<u} Int {u} = {}"
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   509
  by simp+
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   510
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   511
text {* One- and two-sided intervals *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   512
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   513
lemma ivl_disj_int_one:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   514
  "{..l::'a::order} Int {l<..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   515
  "{..<l} Int {l..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   516
  "{..l} Int {l<..u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   517
  "{..<l} Int {l..u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   518
  "{l<..u} Int {u<..} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   519
  "{l<..<u} Int {u..} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   520
  "{l..u} Int {u<..} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   521
  "{l..<u} Int {u..} = {}"
14398
c5c47703f763 Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents: 13850
diff changeset
   522
  by auto
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   523
14577
dbb95b825244 tuned document;
wenzelm
parents: 14485
diff changeset
   524
text {* Two- and two-sided intervals *}
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   525
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   526
lemma ivl_disj_int_two:
15045
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   527
  "{l::'a::order<..<m} Int {m..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   528
  "{l<..m} Int {m<..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   529
  "{l..<m} Int {m..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   530
  "{l..m} Int {m<..<u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   531
  "{l<..<m} Int {m..u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   532
  "{l<..m} Int {m<..u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   533
  "{l..<m} Int {m..u} = {}"
d59f7e2e18d3 Moved to new m<..<n syntax for set intervals.
nipkow
parents: 15042
diff changeset
   534
  "{l..m} Int {m<..u} = {}"
14398
c5c47703f763 Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents: 13850
diff changeset
   535
  by auto
13735
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   536
7de9342aca7a HOL-Algebra partially ported to Isar.
ballarin
parents: 11609
diff changeset
   537
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
   538
15041
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   539
15042
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   540
subsection {* Summation indexed over intervals *}
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   541
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   542
syntax
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   543
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(SUM _ = _.._./ _)" [0,0,0,10] 10)
15048
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
   544
  "_from_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(SUM _ = _..<_./ _)" [0,0,0,10] 10)
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
   545
  "_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(SUM _<_./ _)" [0,0,10] 10)
15042
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   546
syntax (xsymbols)
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   547
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _.._./ _)" [0,0,0,10] 10)
15048
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
   548
  "_from_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _..<_./ _)" [0,0,0,10] 10)
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
   549
  "_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_<_./ _)" [0,0,10] 10)
15042
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   550
syntax (HTML output)
fa7d27ef7e59 added {0::nat..n(} = {..n(}
nipkow
parents: 15041
diff changeset
   551
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _.._./ _)" [0,0,0,10] 10)
15048
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
   552
  "_from_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_ = _..<_./ _)" [0,0,0,10] 10)
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
   553
  "_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b" ("(3\<Sum>_<_./ _)" [0,0,10] 10)
15056
b75073d90bff Fine-tuned sum syntax.
nipkow
parents: 15052
diff changeset
   554
syntax (latex_sum output)
15052
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   555
  "_from_to_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   556
 ("(3\<^raw:$\sum_{>_ = _\<^raw:}^{>_\<^raw:}$> _)" [0,0,0,10] 10)
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   557
  "_from_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   558
 ("(3\<^raw:$\sum_{>_ = _\<^raw:}^{<>_\<^raw:}$> _)" [0,0,0,10] 10)
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   559
  "_upto_setsum" :: "idt \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> 'b"
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   560
 ("(3\<^raw:$\sum_{>_ < _\<^raw:}$> _)" [0,0,10] 10)
15041
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   561
15048
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
   562
translations
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
   563
  "\<Sum>x=a..b. t" == "setsum (%x. t) {a..b}"
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
   564
  "\<Sum>x=a..<b. t" == "setsum (%x. t) {a..<b}"
11b4dce71d73 more syntax
nipkow
parents: 15047
diff changeset
   565
  "\<Sum>i<n. t" == "setsum (\<lambda>i. t) {..<n}"
15041
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   566
15052
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   567
text{* The above introduces some pretty alternative syntaxes for
15056
b75073d90bff Fine-tuned sum syntax.
nipkow
parents: 15052
diff changeset
   568
summation over intervals:
15052
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   569
\begin{center}
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   570
\begin{tabular}{lll}
15056
b75073d90bff Fine-tuned sum syntax.
nipkow
parents: 15052
diff changeset
   571
Old & New & \LaTeX\\
b75073d90bff Fine-tuned sum syntax.
nipkow
parents: 15052
diff changeset
   572
@{term[source]"\<Sum>x\<in>{a..b}. e"} & @{term"\<Sum>x=a..b. e"} & @{term[mode=latex_sum]"\<Sum>x=a..b. e"}\\
b75073d90bff Fine-tuned sum syntax.
nipkow
parents: 15052
diff changeset
   573
@{term[source]"\<Sum>x\<in>{a..<b}. e"} & @{term"\<Sum>x=a..<b. e"} & @{term[mode=latex_sum]"\<Sum>x=a..<b. e"}\\
b75073d90bff Fine-tuned sum syntax.
nipkow
parents: 15052
diff changeset
   574
@{term[source]"\<Sum>x\<in>{..<b}. e"} & @{term"\<Sum>x<b. e"} & @{term[mode=latex_sum]"\<Sum>x<b. e"}
15052
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   575
\end{tabular}
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   576
\end{center}
15056
b75073d90bff Fine-tuned sum syntax.
nipkow
parents: 15052
diff changeset
   577
The left column shows the term before introduction of the new syntax,
b75073d90bff Fine-tuned sum syntax.
nipkow
parents: 15052
diff changeset
   578
the middle column shows the new (default) syntax, and the right column
b75073d90bff Fine-tuned sum syntax.
nipkow
parents: 15052
diff changeset
   579
shows a special syntax. The latter is only meaningful for latex output
b75073d90bff Fine-tuned sum syntax.
nipkow
parents: 15052
diff changeset
   580
and has to be activated explicitly by setting the print mode to
b75073d90bff Fine-tuned sum syntax.
nipkow
parents: 15052
diff changeset
   581
\texttt{latex\_sum} (e.g.\ via \texttt{mode=latex\_sum} in
b75073d90bff Fine-tuned sum syntax.
nipkow
parents: 15052
diff changeset
   582
antiquotations). It is not the default \LaTeX\ output because it only
b75073d90bff Fine-tuned sum syntax.
nipkow
parents: 15052
diff changeset
   583
works well with italic-style formulae, not tt-style.
15052
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   584
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   585
Note that for uniformity on @{typ nat} it is better to use
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   586
@{term"\<Sum>x::nat=0..<n. e"} rather than @{text"\<Sum>x<n. e"}: @{text setsum} may
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   587
not provide all lemmas available for @{term"{m..<n}"} also in the
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   588
special form for @{term"{..<n}"}. *}
cc562a263609 Added nice latex syntax.
nipkow
parents: 15048
diff changeset
   589
15041
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   590
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   591
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
   592
by (simp add:lessThan_Suc)
a6b1f0cef7b3 Got rid of Summation and made it a translation into setsum instead.
nipkow
parents: 14846
diff changeset
   593
8924
c434283b4cfa Added SetInterval
nipkow
parents:
diff changeset
   594
end