ex/Finite.thy

tidied definitions and proofs

Finite = Lfp +
consts Fin :: "'a set => 'a set set"
rules
 Fin_def "Fin(A) == lfp(%F. insert({}, UN x:A. insert(x)``F))"
end