Gfp.thy

HOL/ex/cla: proofs now use deepen_tac instead of best_tac HOL_dup_cs

(*  Title: 	HOL/gfp.thy
    ID:         $Id$
    Author: 	Lawrence C Paulson, Cambridge University Computer Laboratory
    Copyright   1994  University of Cambridge

Greatest fixed points (requires Lfp too!)
*)

Gfp = Lfp +
consts gfp :: "['a set=>'a set] => 'a set"
rules
 (*greatest fixed point*)
 gfp_def "gfp(f) == Union({u. u <= f(u)})"
end