src/ZF/Ordinal.thy
author paulson
Fri Jan 03 15:01:55 1997 +0100 (1997-01-03)
changeset 2469 b50b8c0eec01
parent 1478 2b8c2a7547ab
child 2539 ddd22ceee8cc
permissions -rw-r--r--
Implicit simpsets and clasets for FOL and ZF
clasohm@1478
     1
(*  Title:      ZF/Ordinal.thy
lcp@435
     2
    ID:         $Id$
clasohm@1478
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
lcp@435
     4
    Copyright   1994  University of Cambridge
lcp@435
     5
lcp@435
     6
Ordinals in Zermelo-Fraenkel Set Theory 
lcp@435
     7
*)
lcp@435
     8
paulson@2469
     9
Ordinal = WF + Bool + equalities +
lcp@435
    10
consts
clasohm@1478
    11
  Memrel        :: i=>i
clasohm@1401
    12
  Transset,Ord  :: i=>o
clasohm@1401
    13
  "<"           :: [i,i] => o  (infixl 50) (*less than on ordinals*)
clasohm@1401
    14
  "le"          :: [i,i] => o  (infixl 50) (*less than or equals*)
clasohm@1401
    15
  Limit         :: i=>o
lcp@435
    16
lcp@435
    17
translations
lcp@435
    18
  "x le y"      == "x < succ(y)"
lcp@435
    19
lcp@753
    20
defs
clasohm@1478
    21
  Memrel_def    "Memrel(A)   == {z: A*A . EX x y. z=<x,y> & x:y }"
clasohm@1478
    22
  Transset_def  "Transset(i) == ALL x:i. x<=i"
clasohm@1478
    23
  Ord_def       "Ord(i)      == Transset(i) & (ALL x:i. Transset(x))"
lcp@435
    24
  lt_def        "i<j         == i:j & Ord(j)"
lcp@435
    25
  Limit_def     "Limit(i)    == Ord(i) & 0<i & (ALL y. y<i --> succ(y)<i)"
lcp@435
    26
lcp@435
    27
end