src/HOLCF/holcfb.thy

Simplified proofs by omitting PA = {|XA, ...|} from RA2

(*  Title: 	HOLCF/holcfb.thy
    ID:         $Id$
    Author: 	Franz Regensburger
    Copyright   1993  Technische Universitaet Muenchen

Basic definitions for the embedding of LCF into HOL.

*)

Holcfb = Nat + 

consts

theleast     :: "(nat=>bool)=>nat"

rules

theleast_def    "theleast(P) == (@z.(P(z) & (!n.P(n)-->z<=n)))"

end