src/ZF/Ordinal.thy
author paulson
Thu, 21 Mar 1996 13:02:26 +0100
changeset 1601 0ef6ea27ab15
parent 1478 2b8c2a7547ab
child 2469 b50b8c0eec01
permissions -rw-r--r--
Changes required by removal of the theory argument of Theorem

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

Ordinals in Zermelo-Fraenkel Set Theory 
*)

Ordinal = WF + Bool + "simpdata" + "equalities" +
consts
  Memrel        :: i=>i
  Transset,Ord  :: i=>o
  "<"           :: [i,i] => o  (infixl 50) (*less than on ordinals*)
  "le"          :: [i,i] => o  (infixl 50) (*less than or equals*)
  Limit         :: i=>o

translations
  "x le y"      == "x < succ(y)"

defs
  Memrel_def    "Memrel(A)   == {z: A*A . EX x y. z=<x,y> & x:y }"
  Transset_def  "Transset(i) == ALL x:i. x<=i"
  Ord_def       "Ord(i)      == Transset(i) & (ALL x:i. Transset(x))"
  lt_def        "i<j         == i:j & Ord(j)"
  Limit_def     "Limit(i)    == Ord(i) & 0<i & (ALL y. y<i --> succ(y)<i)"

end