1621
|
1 |
(* Title: HOL/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 |
Mutil = Finite +
|
|
10 |
consts
|
|
11 |
below :: nat => nat set
|
|
12 |
evnodd :: "[(nat*nat)set, nat] => (nat*nat)set"
|
|
13 |
domino :: "(nat*nat)set set"
|
|
14 |
tiling :: 'a set set => 'a set set
|
|
15 |
|
|
16 |
defs
|
|
17 |
below_def "below n == nat_rec n {} insert"
|
|
18 |
evnodd_def "evnodd A b == A Int {(i,j). (i+j) mod 2 = b}"
|
|
19 |
|
|
20 |
inductive "domino"
|
|
21 |
intrs
|
|
22 |
horiz "{(i, j), (i, Suc j)} : domino"
|
|
23 |
vertl "{(i, j), (Suc i, j)} : domino"
|
|
24 |
|
|
25 |
inductive "tiling A"
|
|
26 |
intrs
|
|
27 |
empty "{} : tiling A"
|
|
28 |
Un "[| a: A; t: tiling A; a Int t = {} |] ==> a Un t : tiling A"
|
|
29 |
|
|
30 |
end
|