src/ZF/Arith.thy

ZF/Inductive.thy,.ML: renamed from "inductive" to allow re-building without
the keyword "inductive" making the theory file fail

ZF/Makefile: now has Inductive.thy,.ML

ZF/Datatype,Finite,Zorn: depend upon Inductive
ZF/intr_elim: now checks that the inductive name does not clash with
existing theory names
ZF/ind_section: deleted things replicated in Pure/section_utils.ML
ZF/ROOT: now loads Pure/section_utils

(*  Title: 	ZF/arith.thy
    ID:         $Id$
    Author: 	Lawrence C Paulson, Cambridge University Computer Laboratory
    Copyright   1992  University of Cambridge

Arithmetic operators and their definitions
*)

Arith = Epsilon + "simpdata" +
consts
    rec  :: "[i, i, [i,i]=>i]=>i"
    "#*" :: "[i,i]=>i"      		(infixl 70)
    div  :: "[i,i]=>i"      		(infixl 70) 
    mod  :: "[i,i]=>i"      		(infixl 70)
    "#+" :: "[i,i]=>i"      		(infixl 65)
    "#-" :: "[i,i]=>i"      		(infixl 65)

rules
    rec_def  "rec(k,a,b) ==  transrec(k, %n f. nat_case(a, %m. b(m, f`m), n))"

    add_def  "m#+n == rec(m, n, %u v.succ(v))"
    diff_def "m#-n == rec(n, m, %u v. rec(v, 0, %x y.x))"
    mult_def "m#*n == rec(m, 0, %u v. n #+ v)"
    mod_def  "m mod n == transrec(m, %j f. if(j<n, j, f`(j#-n)))"
    div_def  "m div n == transrec(m, %j f. if(j<n, 0, succ(f`(j#-n))))"
end