src/ZF/Ordinal.thy
 changeset 1478 2b8c2a7547ab parent 1401 0c439768f45c child 2469 b50b8c0eec01
```     1.1 --- a/src/ZF/Ordinal.thy	Mon Feb 05 21:33:14 1996 +0100
1.2 +++ b/src/ZF/Ordinal.thy	Tue Feb 06 12:27:17 1996 +0100
1.3 @@ -1,6 +1,6 @@
1.4 -(*  Title: 	ZF/Ordinal.thy
1.5 +(*  Title:      ZF/Ordinal.thy
1.6      ID:         \$Id\$
1.7 -    Author: 	Lawrence C Paulson, Cambridge University Computer Laboratory
1.8 +    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
1.9      Copyright   1994  University of Cambridge
1.10
1.11  Ordinals in Zermelo-Fraenkel Set Theory
1.12 @@ -8,7 +8,7 @@
1.13
1.14  Ordinal = WF + Bool + "simpdata" + "equalities" +
1.15  consts
1.16 -  Memrel      	:: i=>i
1.17 +  Memrel        :: i=>i
1.18    Transset,Ord  :: i=>o
1.19    "<"           :: [i,i] => o  (infixl 50) (*less than on ordinals*)
1.20    "le"          :: [i,i] => o  (infixl 50) (*less than or equals*)
1.21 @@ -18,9 +18,9 @@
1.22    "x le y"      == "x < succ(y)"
1.23
1.24  defs
1.25 -  Memrel_def  	"Memrel(A)   == {z: A*A . EX x y. z=<x,y> & x:y }"
1.26 -  Transset_def	"Transset(i) == ALL x:i. x<=i"
1.27 -  Ord_def     	"Ord(i)      == Transset(i) & (ALL x:i. Transset(x))"
1.28 +  Memrel_def    "Memrel(A)   == {z: A*A . EX x y. z=<x,y> & x:y }"
1.29 +  Transset_def  "Transset(i) == ALL x:i. x<=i"
1.30 +  Ord_def       "Ord(i)      == Transset(i) & (ALL x:i. Transset(x))"
1.31    lt_def        "i<j         == i:j & Ord(j)"
1.32    Limit_def     "Limit(i)    == Ord(i) & 0<i & (ALL y. y<i --> succ(y)<i)"
1.33
```