src/HOL/PreList.thy
author wenzelm
Tue Feb 05 23:18:08 2002 +0100 (2002-02-05)
changeset 12869 f362c0323d92
parent 12397 6766aa05e4eb
child 12919 d6a0d168291e
permissions -rw-r--r--
moved SVC stuff to ex;
nipkow@10519
     1
(*  Title:      HOL/PreList.thy
nipkow@8563
     2
    ID:         $Id$
wenzelm@10733
     3
    Author:     Tobias Nipkow and Markus Wenzel
nipkow@8563
     4
    Copyright   2000 TU Muenchen
nipkow@8563
     5
nipkow@8563
     6
A basis for building theory List on. Is defined separately to serve as a
nipkow@8563
     7
basis for theory ToyList in the documentation.
nipkow@8563
     8
*)
wenzelm@8490
     9
wenzelm@8490
    10
theory PreList =
nipkow@10212
    11
  Option + Wellfounded_Relations + NatSimprocs + Recdef + Record +
wenzelm@12869
    12
  Relation_Power:
wenzelm@12020
    13
wenzelm@12020
    14
(*belongs to theory Divides*)
wenzelm@12304
    15
declare dvdI [intro?]  dvdE [elim?]  dvd_trans [trans]
wenzelm@8490
    16
wenzelm@12397
    17
(*belongs to theory Nat*)
wenzelm@12397
    18
lemmas less_induct = nat_less_induct [rule_format, case_names less]
wenzelm@12397
    19
wenzelm@10261
    20
(*belongs to theory Wellfounded_Recursion*)
wenzelm@12397
    21
lemmas wf_induct_rule = wf_induct [rule_format, case_names less, induct set: wf]
wenzelm@9066
    22
wenzelm@10671
    23
wenzelm@10680
    24
(* generic summation indexed over nat *)
wenzelm@10680
    25
wenzelm@10671
    26
consts
wenzelm@11803
    27
  Summation :: "(nat => 'a::{zero, plus}) => nat => 'a"
wenzelm@10671
    28
primrec
wenzelm@10671
    29
  "Summation f 0 = 0"
wenzelm@10671
    30
  "Summation f (Suc n) = Summation f n + f n"
wenzelm@10671
    31
wenzelm@10671
    32
syntax
wenzelm@10671
    33
  "_Summation" :: "idt => nat => 'a => nat"    ("\<Sum>_<_. _" [0, 51, 10] 10)
wenzelm@10671
    34
translations
wenzelm@10671
    35
  "\<Sum>i < n. b" == "Summation (\<lambda>i. b) n"
wenzelm@10671
    36
wenzelm@10671
    37
theorem Summation_step:
wenzelm@10671
    38
    "0 < n ==> (\<Sum>i < n. f i) = (\<Sum>i < n - 1. f i) + f (n - 1)"
wenzelm@10671
    39
  by (induct n) simp_all
wenzelm@10671
    40
wenzelm@8490
    41
end