| author | wenzelm |
| Sat, 20 Oct 2001 20:20:41 +0200 | |
| changeset 11852 | a528a716a312 |
| parent 11354 | 9b80fe19407f |
| permissions | -rw-r--r-- |
| 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 |
||
| 1702 | 6 |
The Mutilated Chess Board Problem, formalized inductively |
7 |
Originator is Max Black, according to J A Robinson. |
|
8 |
Popularized as the Mutilated Checkerboard Problem by J McCarthy |
|
| 1606 | 9 |
*) |
10 |
||
|
11354
9b80fe19407f
examples files start from Main instead of various ZF theories
paulson
parents:
11316
diff
changeset
|
11 |
Mutil = Main + |
| 1606 | 12 |
consts |
13 |
domino :: i |
|
| 1702 | 14 |
tiling :: i=>i |
| 1606 | 15 |
|
16 |
inductive |
|
17 |
domains "domino" <= "Pow(nat*nat)" |
|
18 |
intrs |
|
| 11316 | 19 |
horiz "[| i \\<in> nat; j \\<in> nat |] ==> {<i,j>, <i,succ(j)>} \\<in> domino"
|
20 |
vertl "[| i \\<in> nat; j \\<in> nat |] ==> {<i,j>, <succ(i),j>} \\<in> domino"
|
|
| 6117 | 21 |
type_intrs empty_subsetI, cons_subsetI, PowI, SigmaI, nat_succI |
| 1606 | 22 |
|
23 |
||
24 |
inductive |
|
25 |
domains "tiling(A)" <= "Pow(Union(A))" |
|
26 |
intrs |
|
| 11316 | 27 |
empty "0 \\<in> tiling(A)" |
28 |
Un "[| a \\<in> A; t \\<in> tiling(A); a Int t = 0 |] ==> a Un t \\<in> tiling(A)" |
|
| 6117 | 29 |
type_intrs empty_subsetI, Union_upper, Un_least, PowI |
| 1606 | 30 |
type_elims "[make_elim PowD]" |
31 |
||
| 1806 | 32 |
constdefs |
33 |
evnodd :: [i,i]=>i |
|
| 11316 | 34 |
"evnodd(A,b) == {z \\<in> A. \\<exists>i j. z=<i,j> & (i#+j) mod 2 = b}"
|
| 1702 | 35 |
|
| 1606 | 36 |
end |