# HG changeset patch # User paulson # Date 865586786 -7200 # Node ID 3684a4420a67bd5a98f81997e3821a3d2427c021 # Parent 16ae2c20801cf56d415b63e6b952b9d0dba1a341 Much polishing of proofs diff -r 16ae2c20801c -r 3684a4420a67 src/HOL/Induct/Mutil.ML --- a/src/HOL/Induct/Mutil.ML Fri Jun 06 10:22:13 1997 +0200 +++ b/src/HOL/Induct/Mutil.ML Fri Jun 06 10:46:26 1997 +0200 @@ -1,4 +1,4 @@ -(* Title: HOL/ex/Mutil +(* Title: HOL/Induct/Mutil ID: $Id$ Author: Lawrence C Paulson, Cambridge University Computer Laboratory Copyright 1996 University of Cambridge @@ -23,31 +23,29 @@ (*** Chess boards ***) -val [below_0, below_Suc] = nat_recs below_def; -Addsimps [below_0, below_Suc]; - -goal thy "ALL i. (i: below k) = (i p ~: evnodd ta b" 1); -by (asm_simp_tac (!simpset addsimps [evnodd_Un, Un_insert_left, - tiling_domino_finite, - evnodd_subset RS finite_subset]) 1); +by (asm_simp_tac (!simpset addsimps [tiling_domino_finite]) 1); by (blast_tac (!claset addSDs [evnodd_subset RS subsetD] addEs [equalityE]) 1); qed "tiling_domino_0_1"; @@ -157,14 +152,10 @@ by (subgoal_tac "(m+m)+(n+n) = (m+n)+(m+n)" 1); by (asm_simp_tac (!simpset addsimps add_ac) 2); by (asm_full_simp_tac - (!simpset addsimps [evnodd_Diff, evnodd_insert, evnodd_empty, - mod_less, tiling_domino_0_1 RS sym]) 1); + (!simpset addsimps [mod_less, tiling_domino_0_1 RS sym]) 1); by (rtac less_trans 1); by (REPEAT (rtac card_Diff 1 - THEN - asm_simp_tac (!simpset addsimps [tiling_domino_finite, finite_evnodd]) 1 - THEN - asm_simp_tac (!simpset addsimps [mod_less, evnodd_iff]) 1)); + THEN asm_simp_tac (!simpset addsimps [tiling_domino_finite]) 1 + THEN asm_simp_tac (!simpset addsimps [mod_less, evnodd_iff]) 1)); qed "mutil_not_tiling"; -