|
435
|
1 |
(* Title: ZF/OrderType.thy
|
|
|
2 |
ID: $Id$
|
|
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory
|
|
|
4 |
Copyright 1994 University of Cambridge
|
|
|
5 |
|
|
|
6 |
Order types.
|
|
|
7 |
|
|
|
8 |
The order type of a well-ordering is the least ordinal isomorphic to it.
|
|
|
9 |
*)
|
|
|
10 |
|
|
467
|
11 |
OrderType = OrderArith + Ordinal +
|
|
435
|
12 |
consts
|
|
|
13 |
ordermap :: "[i,i]=>i"
|
|
|
14 |
ordertype :: "[i,i]=>i"
|
|
|
15 |
|
|
|
16 |
rules
|
|
|
17 |
ordermap_def
|
|
|
18 |
"ordermap(A,r) == lam x:A. wfrec[A](r, x, %x f. f `` pred(A,x,r))"
|
|
|
19 |
|
|
|
20 |
ordertype_def "ordertype(A,r) == ordermap(A,r)``A"
|
|
|
21 |
|
|
|
22 |
end
|