1606
|
1 |
(* Title: ZF/ex/Mutil
|
|
2 |
ID: $Id$
|
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory
|
|
4 |
Copyright 1996 University of Cambridge
|
|
5 |
|
|
6 |
The Mutilated Checkerboard Problem, formalized inductively
|
|
7 |
*)
|
|
8 |
|
|
9 |
open Mutil;
|
|
10 |
|
|
11 |
|
|
12 |
(** Basic properties of evnodd **)
|
|
13 |
|
|
14 |
goalw thy [evnodd_def]
|
|
15 |
"!!i j. [| <i,j>: A; (i#+j) mod 2 = b |] ==> <i,j>: evnodd(A,b)";
|
|
16 |
by (fast_tac ZF_cs 1);
|
|
17 |
qed "evnoddI";
|
|
18 |
|
|
19 |
val major::prems = goalw thy [evnodd_def]
|
|
20 |
"[| z: evnodd(A,b); \
|
|
21 |
\ !!i j. [| z=<i,j>; <i,j>: A; (i#+j) mod 2 = b |] ==> P |] ==> P";
|
|
22 |
br (major RS CollectE) 1;
|
|
23 |
by (REPEAT (eresolve_tac [exE,conjE] 1));
|
|
24 |
by (resolve_tac prems 1);
|
|
25 |
by (REPEAT (fast_tac ZF_cs 1));
|
|
26 |
qed "evnoddE";
|
|
27 |
|
|
28 |
|
|
29 |
goalw thy [evnodd_def] "evnodd(A, b) <= A";
|
|
30 |
by (fast_tac ZF_cs 1);
|
|
31 |
qed "evnodd_subset";
|
|
32 |
|
|
33 |
(* Finite(X) ==> Finite(evnodd(X,b)) *)
|
|
34 |
bind_thm("Finite_evnodd", evnodd_subset RS subset_imp_lepoll RS lepoll_Finite);
|
|
35 |
|
|
36 |
goalw thy [evnodd_def] "evnodd(A Un B, b) = evnodd(A,b) Un evnodd(B,b)";
|
|
37 |
by (simp_tac (ZF_ss addsimps [Collect_Un]) 1);
|
|
38 |
qed "evnodd_Un";
|
|
39 |
|
|
40 |
goalw thy [evnodd_def] "evnodd(A - B, b) = evnodd(A,b) - evnodd(B,b)";
|
|
41 |
by (simp_tac (ZF_ss addsimps [Collect_Diff]) 1);
|
|
42 |
qed "evnodd_Diff";
|
|
43 |
|
|
44 |
goalw thy [evnodd_def]
|
|
45 |
"evnodd(cons(<i,j>,C), b) = \
|
|
46 |
\ if((i#+j) mod 2 = b, cons(<i,j>, evnodd(C,b)), evnodd(C,b))";
|
|
47 |
by (asm_simp_tac (ZF_ss addsimps [evnodd_def, Collect_cons]
|
|
48 |
setloop split_tac [expand_if]) 1);
|
|
49 |
by (fast_tac ZF_cs 1);
|
|
50 |
qed "evnodd_cons";
|
|
51 |
|
|
52 |
goalw thy [evnodd_def] "evnodd(0, b) = 0";
|
|
53 |
by (simp_tac (ZF_ss addsimps [evnodd_def]) 1);
|
|
54 |
qed "evnodd_0";
|
|
55 |
|
|
56 |
|
|
57 |
(*** Dominoes ***)
|
|
58 |
|
|
59 |
goal thy "!!d. d:domino ==> Finite(d)";
|
|
60 |
by (fast_tac (ZF_cs addSIs [Finite_cons, Finite_0] addEs [domino.elim]) 1);
|
|
61 |
qed "domino_Finite";
|
|
62 |
|
|
63 |
goal thy "!!d. [| d:domino; b<2 |] ==> EX i' j'. evnodd(d,b) = {<i',j'>}";
|
|
64 |
by (eresolve_tac [domino.elim] 1);
|
|
65 |
by (res_inst_tac [("k1", "i#+j")] (mod2_cases RS disjE) 2);
|
|
66 |
by (res_inst_tac [("k1", "i#+j")] (mod2_cases RS disjE) 1);
|
|
67 |
by (REPEAT_FIRST (ares_tac [add_type]));
|
|
68 |
(*Four similar cases: case (i#+j) mod 2 = b, 2#-b, ...*)
|
|
69 |
by (REPEAT (asm_simp_tac (arith_ss addsimps [evnodd_cons, evnodd_0, mod_succ,
|
|
70 |
succ_neq_self]
|
|
71 |
setloop split_tac [expand_if]) 1
|
|
72 |
THEN fast_tac (ZF_cs addDs [ltD]) 1));
|
|
73 |
qed "domino_singleton";
|
|
74 |
|
|
75 |
val prems = goal thy "[| d:domino; b<2 |] ==> |evnodd(d,b)| = 1";
|
|
76 |
by (cut_facts_tac [prems MRS domino_singleton] 1);
|
|
77 |
by (REPEAT (etac exE 1));
|
|
78 |
by (asm_simp_tac (ZF_ss addsimps [cardinal_singleton]) 1);
|
|
79 |
qed "cardinal_evnodd_domino";
|
|
80 |
|
|
81 |
|
|
82 |
(*** Tilings ***)
|
|
83 |
|
|
84 |
(** The union of two disjoint tilings is a tiling **)
|
|
85 |
|
|
86 |
goal thy "!!t. t: tiling(A) ==> \
|
|
87 |
\ ALL u: tiling(A). t Int u = 0 --> t Un u : tiling(A)";
|
|
88 |
by (etac tiling.induct 1);
|
|
89 |
by (simp_tac (ZF_ss addsimps tiling.intrs) 1);
|
|
90 |
by (asm_full_simp_tac (ZF_ss addsimps [Int_Un_distrib, Un_assoc, Un_subset_iff,
|
|
91 |
subset_empty_iff RS iff_sym]) 1);
|
|
92 |
by (safe_tac ZF_cs);
|
|
93 |
by (resolve_tac tiling.intrs 1);
|
|
94 |
by (assume_tac 1);
|
|
95 |
by (fast_tac ZF_cs 1);
|
|
96 |
by (fast_tac eq_cs 1);
|
|
97 |
val lemma = result();
|
|
98 |
|
|
99 |
goal thy "!!t u. [| t: tiling(A); u: tiling(A); t Int u = 0 |] ==> \
|
|
100 |
\ t Un u : tiling(A)";
|
|
101 |
by (fast_tac (ZF_cs addIs [lemma RS bspec RS mp]) 1);
|
|
102 |
qed "tiling_UnI";
|
|
103 |
|
|
104 |
goal thy "!!t. t:tiling(domino) ==> Finite(t)";
|
|
105 |
by (eresolve_tac [tiling.induct] 1);
|
|
106 |
by (resolve_tac [Finite_0] 1);
|
|
107 |
by (fast_tac (ZF_cs addIs [domino_Finite, Finite_Un]) 1);
|
|
108 |
qed "tiling_domino_Finite";
|
|
109 |
|
|
110 |
(*Uses AC in the form of cardinal_disjoint_Un; could instead use
|
|
111 |
tiling_domino_Finite, well_ord_cardinal_eqE and Finite_imp_well_ord*)
|
|
112 |
goal thy "!!t. t: tiling(domino) ==> |evnodd(t,0)| = |evnodd(t,1)|";
|
|
113 |
by (eresolve_tac [tiling.induct] 1);
|
|
114 |
by (simp_tac (ZF_ss addsimps [evnodd_def]) 1);
|
|
115 |
by (asm_simp_tac (ZF_ss addsimps [evnodd_Un]) 1);
|
|
116 |
by (rtac cardinal_disjoint_Un 1);
|
|
117 |
by (asm_simp_tac (arith_ss addsimps [cardinal_evnodd_domino]) 1);
|
|
118 |
by (asm_simp_tac (arith_ss addsimps [cardinal_evnodd_domino]) 1);
|
|
119 |
bw evnodd_def;
|
|
120 |
by (fast_tac (eq_cs addSEs [equalityE]) 1);
|
|
121 |
by (fast_tac (eq_cs addSEs [equalityE]) 1);
|
|
122 |
qed "tiling_domino_0_1";
|
|
123 |
|
|
124 |
goal thy "!!i n. [| i: nat; n: nat |] ==> {i} * (n #+ n) : tiling(domino)";
|
|
125 |
by (nat_ind_tac "n" [] 1);
|
|
126 |
by (simp_tac (arith_ss addsimps tiling.intrs) 1);
|
|
127 |
by (asm_simp_tac (arith_ss addsimps [Un_assoc RS sym, Sigma_succ2]) 1);
|
|
128 |
by (resolve_tac tiling.intrs 1);
|
|
129 |
by (assume_tac 2);
|
|
130 |
by (subgoal_tac (*seems the easiest way of turning one to the other*)
|
|
131 |
"{i}*{succ(n1#+n1)} Un {i}*{n1#+n1} = {<i,n1#+n1>, <i,succ(n1#+n1)>}" 1);
|
|
132 |
by (fast_tac eq_cs 2);
|
|
133 |
by (asm_simp_tac (arith_ss addsimps [domino.horiz]) 1);
|
|
134 |
by (fast_tac (eq_cs addEs [mem_irrefl, mem_asym]) 1);
|
|
135 |
qed "dominoes_tile_row";
|
|
136 |
|
|
137 |
goal thy "!!m n. [| m: nat; n: nat |] ==> m * (n #+ n) : tiling(domino)";
|
|
138 |
by (nat_ind_tac "m" [] 1);
|
|
139 |
by (simp_tac (arith_ss addsimps tiling.intrs) 1);
|
|
140 |
by (asm_simp_tac (arith_ss addsimps [Sigma_succ1]) 1);
|
|
141 |
by (fast_tac (eq_cs addIs [tiling_UnI, dominoes_tile_row]
|
|
142 |
addEs [mem_irrefl]) 1);
|
|
143 |
qed "dominoes_tile_matrix";
|
|
144 |
|
|
145 |
|
|
146 |
goal thy "!!m n. [| m: nat; n: nat; \
|
|
147 |
\ t = (succ(m)#+succ(m))*(succ(n)#+succ(n)); \
|
|
148 |
\ t' = t - {<0,0>} - {<succ(m#+m), succ(n#+n)>} |] ==> \
|
|
149 |
\ t' ~: tiling(domino)";
|
|
150 |
by (resolve_tac [notI] 1);
|
|
151 |
by (dresolve_tac [tiling_domino_0_1] 1);
|
|
152 |
by (subgoal_tac "|evnodd(t',0)| < |evnodd(t',1)|" 1);
|
|
153 |
by (asm_full_simp_tac (ZF_ss addsimps [lt_not_refl]) 1);
|
|
154 |
by (subgoal_tac "t : tiling(domino)" 1);
|
|
155 |
by (asm_simp_tac (ZF_ss addsimps [nat_succI, add_type,
|
|
156 |
dominoes_tile_matrix]) 2);
|
|
157 |
by (subgoal_tac "(m#+m)#+(n#+n) = (m#+n)#+(m#+n)" 1);
|
|
158 |
by (asm_simp_tac (arith_ss addsimps add_ac) 2);
|
|
159 |
by (asm_full_simp_tac
|
|
160 |
(arith_ss addsimps [evnodd_Diff, evnodd_cons, evnodd_0, mod2_add_self,
|
|
161 |
mod2_succ_succ, tiling_domino_0_1 RS sym]) 1);
|
|
162 |
by (resolve_tac [lt_trans] 1);
|
|
163 |
by (REPEAT
|
|
164 |
(rtac Finite_imp_cardinal_Diff 1
|
|
165 |
THEN
|
|
166 |
asm_simp_tac (arith_ss addsimps [tiling_domino_Finite, Finite_evnodd,
|
|
167 |
Finite_Diff]) 1
|
|
168 |
THEN
|
|
169 |
asm_simp_tac (arith_ss addsimps [evnoddI, nat_0_le RS ltD, mod2_add_self]) 1));
|
|
170 |
qed "mutil_not_tiling";
|