# HG changeset patch # User paulson # Date 959186509 -7200 # Node ID 3e858b72fac98adfe043d71866a968c7d88247e1 # Parent d46adac29b713ee040a4a42c39545761c703abf0 replacing "below" by "lessThan" diff -r d46adac29b71 -r 3e858b72fac9 src/HOL/Induct/Mutil.ML --- a/src/HOL/Induct/Mutil.ML Wed May 24 18:41:09 2000 +0200 +++ b/src/HOL/Induct/Mutil.ML Wed May 24 18:41:49 2000 +0200 @@ -21,23 +21,13 @@ (*** Chess boards ***) -Goalw [below_def] "(i: below k) = (i B = ({n} <*> B) Un ((below n) <*> B)"; +Goalw [lessThan_def] + "lessThan(Suc n) <*> B = ({n} <*> B) Un ((lessThan n) <*> B)"; by Auto_tac; qed "Sigma_Suc1"; -Goalw [below_def] - "A <*> below(Suc n) = (A <*> {n}) Un (A <*> (below n))"; +Goalw [lessThan_def] + "A <*> lessThan(Suc n) = (A <*> {n}) Un (A <*> (lessThan n))"; by Auto_tac; qed "Sigma_Suc2"; @@ -47,7 +37,7 @@ by Auto_tac; qed "sing_Times_lemma"; -Goal "{i} <*> below(#2*n) : tiling domino"; +Goal "{i} <*> lessThan(#2*n) : tiling domino"; by (induct_tac "n" 1); by (ALLGOALS (asm_simp_tac (simpset() addsimps [Un_assoc RS sym]))); by (rtac tiling.Un 1); @@ -56,7 +46,7 @@ AddSIs [dominoes_tile_row]; -Goal "(below m) <*> below(#2*n) : tiling domino"; +Goal "(lessThan m) <*> lessThan(#2*n) : tiling domino"; by (induct_tac "m" 1); by Auto_tac; qed "dominoes_tile_matrix"; @@ -121,7 +111,7 @@ qed "gen_mutil_not_tiling"; (*Apply the general theorem to the well-known case*) -Goal "[| t = below(#2 * Suc m) <*> below(#2 * Suc n) |] \ +Goal "[| t = lessThan(#2 * Suc m) <*> lessThan(#2 * Suc n) |] \ \ ==> t - {(0,0)} - {(Suc(#2*m), Suc(#2*n))} ~: tiling domino"; by (rtac gen_mutil_not_tiling 1); by (blast_tac (claset() addSIs [dominoes_tile_matrix]) 1); diff -r d46adac29b71 -r 3e858b72fac9 src/HOL/Induct/Mutil.thy --- a/src/HOL/Induct/Mutil.thy Wed May 24 18:41:09 2000 +0200 +++ b/src/HOL/Induct/Mutil.thy Wed May 24 18:41:49 2000 +0200 @@ -23,9 +23,6 @@ vertl "{(i, j), (Suc i, j)} : domino" constdefs - below :: "nat => nat set" - "below n == {i. i (nat*nat)set" "colored b == {(i,j). (i+j) mod #2 = b}"