author | paulson |
Fri, 11 Sep 1998 16:25:24 +0200 | |
changeset 5478 | 33fcf0e60547 |
parent 5477 | 41ab0f44dd8f |
child 5479 | 5a5dfb0f0d7d |
src/HOL/NatDef.ML | file | annotate | diff | comparison | revisions |
--- a/src/HOL/NatDef.ML Fri Sep 11 14:09:46 1998 +0200 +++ b/src/HOL/NatDef.ML Fri Sep 11 16:25:24 1998 +0200 @@ -2,10 +2,6 @@ ID: $Id$ Author: Tobias Nipkow, Cambridge University Computer Laboratory Copyright 1991 University of Cambridge - -Blast_tac proofs here can get PROOF FAILED of Ord theorems like order_refl -and order_less_irrefl. We do not add the "nat" versions to the basic claset -because the type will be promoted to type class "order". *) Goal "mono(%X. {Zero_Rep} Un (Suc_Rep``X))";