src/HOL/SetInterval.thy
 author nipkow Mon May 23 11:06:41 2005 +0200 (2005-05-23) changeset 16041 5a8736668ced parent 15911 b730b0edc085 child 16052 880b0e786c1b permissions -rw-r--r--
simplifier trace info; Suc-intervals
 nipkow@8924  1 (* Title: HOL/SetInterval.thy  nipkow@8924  2  ID: $Id$  ballarin@13735  3  Author: Tobias Nipkow and Clemens Ballarin  paulson@14485  4  Additions by Jeremy Avigad in March 2004  paulson@8957  5  Copyright 2000 TU Muenchen  nipkow@8924  6 ballarin@13735  7 lessThan, greaterThan, atLeast, atMost and two-sided intervals  nipkow@8924  8 *)  nipkow@8924  9 wenzelm@14577  10 header {* Set intervals *}  wenzelm@14577  11 nipkow@15131  12 theory SetInterval  nipkow@15140  13 imports IntArith  nipkow@15131  14 begin  nipkow@8924  15 nipkow@8924  16 constdefs  nipkow@15045  17  lessThan :: "('a::ord) => 'a set" ("(1{..<_})")  nipkow@15045  18  "{.. 'a set" ("(1{.._})")  wenzelm@11609  21  "{..u} == {x. x<=u}"  nipkow@8924  22 nipkow@15045  23  greaterThan :: "('a::ord) => 'a set" ("(1{_<..})")  nipkow@15045  24  "{l<..} == {x. l 'a set" ("(1{_..})")  wenzelm@11609  27  "{l..} == {x. l<=x}"  nipkow@8924  28 nipkow@15045  29  greaterThanLessThan :: "['a::ord, 'a] => 'a set" ("(1{_<..<_})")  nipkow@15045  30  "{l<.. 'a set" ("(1{_..<_})")  nipkow@15045  33  "{l.. 'a set" ("(1{_<.._})")  nipkow@15045  36  "{l<..u} == {l<..} Int {..u}"  ballarin@13735  37 ballarin@13735  38  atLeastAtMost :: "['a::ord, 'a] => 'a set" ("(1{_.._})")  ballarin@13735  39  "{l..u} == {l..} Int {..u}"  ballarin@13735  40 nipkow@15045  41 (* Old syntax, will disappear! *)  nipkow@15045  42 syntax  nipkow@15045  43  "_lessThan" :: "('a::ord) => 'a set" ("(1{.._'(})")  nipkow@15045  44  "_greaterThan" :: "('a::ord) => 'a set" ("(1{')_..})")  nipkow@15045  45  "_greaterThanLessThan" :: "['a::ord, 'a] => 'a set" ("(1{')_.._'(})")  nipkow@15045  46  "_atLeastLessThan" :: "['a::ord, 'a] => 'a set" ("(1{_.._'(})")  nipkow@15045  47  "_greaterThanAtMost" :: "['a::ord, 'a] => 'a set" ("(1{')_.._})")  nipkow@15045  48 translations  nipkow@15045  49  "{..m(}" => "{.. "{m<..}"  nipkow@15045  51  "{)m..n(}" => "{m<.. "{m.. "{m<..n}"  nipkow@15045  54 nipkow@15048  55 nipkow@15048  56 text{* A note of warning when using @{term"{.. nat => 'b set => 'b set" ("(3UN _<=_./ _)" 10)  kleing@14418  62  "@UNION_less" :: "nat => nat => 'b set => 'b set" ("(3UN _<_./ _)" 10)  kleing@14418  63  "@INTER_le" :: "nat => nat => 'b set => 'b set" ("(3INT _<=_./ _)" 10)  kleing@14418  64  "@INTER_less" :: "nat => nat => 'b set => 'b set" ("(3INT _<_./ _)" 10)  kleing@14418  65 kleing@14418  66 syntax (input)  kleing@14418  67  "@UNION_le" :: "nat => nat => 'b set => 'b set" ("(3\ _\_./ _)" 10)  kleing@14418  68  "@UNION_less" :: "nat => nat => 'b set => 'b set" ("(3\ _<_./ _)" 10)  kleing@14418  69  "@INTER_le" :: "nat => nat => 'b set => 'b set" ("(3\ _\_./ _)" 10)  kleing@14418  70  "@INTER_less" :: "nat => nat => 'b set => 'b set" ("(3\ _<_./ _)" 10)  kleing@14418  71 kleing@14418  72 syntax (xsymbols)  wenzelm@14846  73  "@UNION_le" :: "nat \ nat => 'b set => 'b set" ("(3\(00\<^bsub>_ \ _\<^esub>)/ _)" 10)  wenzelm@14846  74  "@UNION_less" :: "nat \ nat => 'b set => 'b set" ("(3\(00\<^bsub>_ < _\<^esub>)/ _)" 10)  wenzelm@14846  75  "@INTER_le" :: "nat \ nat => 'b set => 'b set" ("(3\(00\<^bsub>_ \ _\<^esub>)/ _)" 10)  wenzelm@14846  76  "@INTER_less" :: "nat \ nat => 'b set => 'b set" ("(3\(00\<^bsub>_ < _\<^esub>)/ _)" 10)  kleing@14418  77 kleing@14418  78 translations  kleing@14418  79  "UN i<=n. A" == "UN i:{..n}. A"  nipkow@15045  80  "UN i atLeast y) = (y \ (x::'a::order))"  paulson@15418  130 by (blast intro: order_trans)  paulson@13850  131 paulson@13850  132 lemma atLeast_eq_iff [iff]:  paulson@15418  133  "(atLeast x = atLeast y) = (x = (y::'a::linorder))"  paulson@13850  134 by (blast intro: order_antisym order_trans)  paulson@13850  135 paulson@13850  136 lemma greaterThan_subset_iff [iff]:  paulson@15418  137  "(greaterThan x \ greaterThan y) = (y \ (x::'a::linorder))"  paulson@15418  138 apply (auto simp add: greaterThan_def)  paulson@15418  139  apply (subst linorder_not_less [symmetric], blast)  paulson@13850  140 done  paulson@13850  141 paulson@13850  142 lemma greaterThan_eq_iff [iff]:  paulson@15418  143  "(greaterThan x = greaterThan y) = (x = (y::'a::linorder))"  paulson@15418  144 apply (rule iffI)  paulson@15418  145  apply (erule equalityE)  paulson@15418  146  apply (simp_all add: greaterThan_subset_iff)  paulson@13850  147 done  paulson@13850  148 paulson@15418  149 lemma atMost_subset_iff [iff]: "(atMost x \ atMost y) = (x \ (y::'a::order))"  paulson@13850  150 by (blast intro: order_trans)  paulson@13850  151 paulson@15418  152 lemma atMost_eq_iff [iff]: "(atMost x = atMost y) = (x = (y::'a::linorder))"  paulson@13850  153 by (blast intro: order_antisym order_trans)  paulson@13850  154 paulson@13850  155 lemma lessThan_subset_iff [iff]:  paulson@15418  156  "(lessThan x \ lessThan y) = (x \ (y::'a::linorder))"  paulson@15418  157 apply (auto simp add: lessThan_def)  paulson@15418  158  apply (subst linorder_not_less [symmetric], blast)  paulson@13850  159 done  paulson@13850  160 paulson@13850  161 lemma lessThan_eq_iff [iff]:  paulson@15418  162  "(lessThan x = lessThan y) = (x = (y::'a::linorder))"  paulson@15418  163 apply (rule iffI)  paulson@15418  164  apply (erule equalityE)  paulson@15418  165  apply (simp_all add: lessThan_subset_iff)  ballarin@13735  166 done  ballarin@13735  167 ballarin@13735  168 paulson@13850  169 subsection {*Two-sided intervals*}  ballarin@13735  170 ballarin@13735  171 lemma greaterThanLessThan_iff [simp]:  nipkow@15045  172  "(i : {l<.. {m::'a::order..n} = {}";  nipkow@15554  194  by (auto simp add: atLeastAtMost_def atMost_def atLeast_def);  nipkow@15554  195 nipkow@15554  196 lemma atLeastLessThan_empty[simp]: "n \ m ==> {m.. n then insert n {m.. Suc n \ {m..Suc n} = insert (Suc n) {m..n}"  nipkow@15554  301 by (auto simp add: atLeastAtMost_def)  nipkow@15554  302 paulson@14485  303 subsubsection {* Finiteness *}  paulson@14485  304 nipkow@15045  305 lemma finite_lessThan [iff]: fixes k :: nat shows "finite {.. finite N"  paulson@14485  329  -- {* A bounded set of natural numbers is finite. *}  paulson@14485  330  apply (rule finite_subset)  paulson@14485  331  apply (rule_tac [2] finite_lessThan, auto)  paulson@14485  332  done  paulson@14485  333 paulson@14485  334 subsubsection {* Cardinality *}  paulson@14485  335 nipkow@15045  336 lemma card_lessThan [simp]: "card {.. u ==>  nipkow@15045  379  {(0::int).. u")  paulson@14485  388  apply (subst image_atLeastZeroLessThan_int, assumption)  paulson@14485  389  apply (rule finite_imageI)  paulson@14485  390  apply auto  paulson@14485  391  done  paulson@14485  392 paulson@15418  393 lemma image_atLeastLessThan_int_shift:  nipkow@15045  394  "(%x. x + (l::int))  {0.. u")  paulson@14485  421  apply (subst image_atLeastZeroLessThan_int, assumption)  paulson@14485  422  apply (subst card_image)  paulson@14485  423  apply (auto simp add: inj_on_def)  paulson@14485  424  done  paulson@14485  425 nipkow@15045  426 lemma card_atLeastLessThan_int [simp]: "card {l.. {l} Un {l<.. {l<.. {l} Un {l<..u} = {l..u}"  nipkow@15045  462  "(l::'a::linorder) <= u ==> {l.. {..l} Un {l<.. {.. {..l} Un {l<..u} = {..u}"  nipkow@15045  471  "(l::'a::linorder) <= u ==> {.. {l<..u} Un {u<..} = {l<..}"  nipkow@15045  473  "(l::'a::linorder) < u ==> {l<.. {l..u} Un {u<..} = {l..}"  nipkow@15045  475  "(l::'a::linorder) <= u ==> {l.. {l<.. {l<..m} Un {m<.. {l.. {l..m} Un {m<.. {l<.. {l<..m} Un {m<..u} = {l<..u}"  nipkow@15045  487  "[| (l::'a::linorder) <= m; m <= u |] ==> {l.. {l..m} Un {m<..u} = {l..u}"  ballarin@14398  489 by auto  ballarin@13735  490 ballarin@13735  491 lemmas ivl_disj_un = ivl_disj_un_singleton ivl_disj_un_one ivl_disj_un_two  ballarin@13735  492 wenzelm@14577  493 subsubsection {* Disjoint Intersections *}  ballarin@13735  494 wenzelm@14577  495 text {* Singletons and open intervals *}  ballarin@13735  496 ballarin@13735  497 lemma ivl_disj_int_singleton:  nipkow@15045  498  "{l::'a::order} Int {l<..} = {}"  nipkow@15045  499  "{.. n \ {i.. {m.. i | m \ i & j \ (n::'a::linorder))"  nipkow@15542  545 apply(auto simp:linorder_not_le)  nipkow@15542  546 apply(rule ccontr)  nipkow@15542  547 apply(insert linorder_le_less_linear[of i n])  nipkow@15542  548 apply(clarsimp simp:linorder_not_le)  nipkow@15542  549 apply(fastsimp)  nipkow@15542  550 done  nipkow@15542  551 nipkow@15041  552 nipkow@15042  553 subsection {* Summation indexed over intervals *}  nipkow@15042  554 nipkow@15042  555 syntax  nipkow@15042  556  "_from_to_setsum" :: "idt \ 'a \ 'a \ 'b \ 'b" ("(SUM _ = _.._./ _)" [0,0,0,10] 10)  nipkow@15048  557  "_from_upto_setsum" :: "idt \ 'a \ 'a \ 'b \ 'b" ("(SUM _ = _..<_./ _)" [0,0,0,10] 10)  nipkow@15048  558  "_upto_setsum" :: "idt \ 'a \ 'b \ 'b" ("(SUM _<_./ _)" [0,0,10] 10)  nipkow@15042  559 syntax (xsymbols)  nipkow@15042  560  "_from_to_setsum" :: "idt \ 'a \ 'a \ 'b \ 'b" ("(3\_ = _.._./ _)" [0,0,0,10] 10)  nipkow@15048  561  "_from_upto_setsum" :: "idt \ 'a \ 'a \ 'b \ 'b" ("(3\_ = _..<_./ _)" [0,0,0,10] 10)  nipkow@15048  562  "_upto_setsum" :: "idt \ 'a \ 'b \ 'b" ("(3\_<_./ _)" [0,0,10] 10)  nipkow@15042  563 syntax (HTML output)  nipkow@15042  564  "_from_to_setsum" :: "idt \ 'a \ 'a \ 'b \ 'b" ("(3\_ = _.._./ _)" [0,0,0,10] 10)  nipkow@15048  565  "_from_upto_setsum" :: "idt \ 'a \ 'a \ 'b \ 'b" ("(3\_ = _..<_./ _)" [0,0,0,10] 10)  nipkow@15048  566  "_upto_setsum" :: "idt \ 'a \ 'b \ 'b" ("(3\_<_./ _)" [0,0,10] 10)  nipkow@15056  567 syntax (latex_sum output)  nipkow@15052  568  "_from_to_setsum" :: "idt \ 'a \ 'a \ 'b \ 'b"  nipkow@15052  569  ("(3\<^raw:$\sum_{>_ = _\<^raw:}^{>_\<^raw:}$> _)" [0,0,0,10] 10)  nipkow@15052  570  "_from_upto_setsum" :: "idt \ 'a \ 'a \ 'b \ 'b"  nipkow@15052  571  ("(3\<^raw:$\sum_{>_ = _\<^raw:}^{<>_\<^raw:}$> _)" [0,0,0,10] 10)  nipkow@15052  572  "_upto_setsum" :: "idt \ 'a \ 'b \ 'b"  nipkow@15052  573  ("(3\<^raw:$\sum_{>_ < _\<^raw:}$> _)" [0,0,10] 10)  nipkow@15041  574 nipkow@15048  575 translations  nipkow@15048  576  "\x=a..b. t" == "setsum (%x. t) {a..b}"  nipkow@15048  577  "\x=a..ii. t) {..x\{a..b}. e"} & @{term"\x=a..b. e"} & @{term[mode=latex_sum]"\x=a..b. e"}\\  nipkow@15056  586 @{term[source]"\x\{a..x=a..x=a..x\{..xxx::nat=0..xa = c; b = d; !!x. \ c \ x; x < d \ \ f x = g x \ \  nipkow@15542  612  setsum f {a..i < Suc n. f i) = (\i < n. f i) + f n"  nipkow@16041  619 by (simp add:lessThan_Suc add_ac)  nipkow@15041  620 nipkow@15911  621 lemma setsum_cl_ivl_Suc[simp]:  nipkow@15561  622  "setsum f {m..Suc n} = (if Suc n < m then 0 else setsum f {m..n} + f(Suc n))"  nipkow@15561  623 by (auto simp:add_ac atLeastAtMostSuc_conv)  nipkow@15561  624 nipkow@15911  625 lemma setsum_op_ivl_Suc[simp]:  nipkow@15561  626  "setsum f {m..  nipkow@15561  630  (\i=n..m+1. f i) = (\i=n..m. f i) + f(m + 1)"  nipkow@15561  631 by (auto simp:add_ac atLeastAtMostSuc_conv)  nipkow@16041  632 *)  nipkow@15539  633 lemma setsum_add_nat_ivl: "\ m \ n; n \ p \ \  nipkow@15539  634  setsum f {m.. 'a::ab_group_add"  nipkow@15539  639 shows "\ m \ n; n \ p \ \  nipkow@15539  640  setsum f {m..