| author | kleing | 
| Tue, 21 Nov 2000 13:48:47 +0100 | |
| changeset 10501 | 98fe9e987a17 | 
| parent 5464 | 47d0d906b39a | 
| child 11317 | 7f9e4c389318 | 
| permissions | -rw-r--r-- | 
(* Title: ZF/AC/WO1_WO7.thy ID: $Id$ Author: Lawrence C Paulson, CU Computer Laboratory Copyright 1998 University of Cambridge WO7 <-> LEMMA <-> WO1 (Rubin & Rubin p. 5) LEMMA is the sentence denoted by (**) *) WO1_WO7 = AC_Equiv + constdefs LEMMA :: o "LEMMA == ALL X. ~Finite(X) --> (EX R. well_ord(X,R) & ~well_ord(X,converse(R)))" end