author | paulson |
Thu, 10 Sep 1998 17:49:36 +0200 | |
changeset 5472 | 746cd24ee3ac |
parent 5464 | 47d0d906b39a |
child 11317 | 7f9e4c389318 |
permissions | -rw-r--r-- |
5464 | 1 |
(* Title: ZF/AC/WO1_WO7.thy |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson, CU Computer Laboratory |
|
4 |
Copyright 1998 University of Cambridge |
|
5 |
||
6 |
WO7 <-> LEMMA <-> WO1 (Rubin & Rubin p. 5) |
|
7 |
LEMMA is the sentence denoted by (**) |
|
8 |
*) |
|
9 |
||
10 |
WO1_WO7 = AC_Equiv + |
|
11 |
||
12 |
constdefs |
|
13 |
LEMMA :: o |
|
14 |
"LEMMA == |
|
15 |
ALL X. ~Finite(X) --> (EX R. well_ord(X,R) & ~well_ord(X,converse(R)))" |
|
16 |
||
17 |
end |