factored out common code of HOL/simpdata.ML and FOL/simpdata.ML concerning
combination of classical reasoner and simplifier auto_tac into Provers/clasimp.ML
explicitly introducing combined type clasimpset
Lomega = Base +
rules
pi_bb "[| A:[]; !!x. x:A ==> B(x):[] |] ==> Prod(A,B):[]"
lam_bb "[| A:[]; !!x. x:A ==> f(x):B(x); !!x. x:A ==> B(x):[] |]
==> Abs(A,f) : Prod(A,B)"
end