src/HOL/Library/Countable.thy
author haftmann
Thu, 20 Mar 2008 12:01:12 +0100
changeset 26350 a170a190c5d3
parent 26243 69592314f977
child 26580 c3e597a476fd
permissions -rw-r--r--
adjusted authorship
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
26169
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
     1
(*  Title:      HOL/Library/Countable.thy
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
     2
    ID:         $Id$
26350
a170a190c5d3 adjusted authorship
haftmann
parents: 26243
diff changeset
     3
    Author:     Alexander Krauss, TU Muenchen
26169
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
     4
*)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
     5
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
     6
header {* Encoding (almost) everything into natural numbers *}
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
     7
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
     8
theory Countable
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
     9
imports Finite_Set List Hilbert_Choice
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    10
begin
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    11
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    12
subsection {* The class of countable types *}
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    13
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    14
class countable = itself +
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    15
  assumes ex_inj: "\<exists>to_nat \<Colon> 'a \<Rightarrow> nat. inj to_nat"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    16
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    17
lemma countable_classI:
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    18
  fixes f :: "'a \<Rightarrow> nat"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    19
  assumes "\<And>x y. f x = f y \<Longrightarrow> x = y"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    20
  shows "OFCLASS('a, countable_class)"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    21
proof (intro_classes, rule exI)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    22
  show "inj f"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    23
    by (rule injI [OF assms]) assumption
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    24
qed
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    25
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    26
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    27
subsection {* Converion functions *}
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    28
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    29
definition to_nat :: "'a\<Colon>countable \<Rightarrow> nat" where
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    30
  "to_nat = (SOME f. inj f)"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    31
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    32
definition from_nat :: "nat \<Rightarrow> 'a\<Colon>countable" where
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    33
  "from_nat = inv (to_nat \<Colon> 'a \<Rightarrow> nat)"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    34
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    35
lemma inj_to_nat [simp]: "inj to_nat"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    36
  by (rule exE_some [OF ex_inj]) (simp add: to_nat_def)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    37
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    38
lemma to_nat_split [simp]: "to_nat x = to_nat y \<longleftrightarrow> x = y"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    39
  using injD [OF inj_to_nat] by auto
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    40
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    41
lemma from_nat_to_nat [simp]:
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    42
  "from_nat (to_nat x) = x"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    43
  by (simp add: from_nat_def)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    44
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    45
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    46
subsection {* Countable types *}
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    47
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    48
instance nat :: countable
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    49
  by (rule countable_classI [of "id"]) simp 
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    50
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    51
subclass (in finite) countable
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    52
proof unfold_locales
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    53
  have "finite (UNIV\<Colon>'a set)" by (rule finite_UNIV)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    54
  with finite_conv_nat_seg_image [of UNIV]
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    55
  obtain n and f :: "nat \<Rightarrow> 'a" 
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    56
    where "UNIV = f ` {i. i < n}" by auto
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    57
  then have "surj f" unfolding surj_def by auto
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    58
  then have "inj (inv f)" by (rule surj_imp_inj_inv)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    59
  then show "\<exists>to_nat \<Colon> 'a \<Rightarrow> nat. inj to_nat" by (rule exI[of inj])
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    60
qed
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    61
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    62
text {* Pairs *}
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    63
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    64
primrec sum :: "nat \<Rightarrow> nat"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    65
where
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    66
  "sum 0 = 0"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    67
| "sum (Suc n) = Suc n + sum n"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    68
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    69
lemma sum_arith: "sum n = n * Suc n div 2"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    70
  by (induct n) auto
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    71
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    72
lemma sum_mono: "n \<ge> m \<Longrightarrow> sum n \<ge> sum m"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    73
  by (induct n m rule: diff_induct) auto
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    74
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    75
definition
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    76
  "pair_encode = (\<lambda>(m, n). sum (m + n) + m)"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    77
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    78
lemma inj_pair_cencode: "inj pair_encode"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    79
  unfolding pair_encode_def
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    80
proof (rule injI, simp only: split_paired_all split_conv)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    81
  fix a b c d
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    82
  assume eq: "sum (a + b) + a = sum (c + d) + c"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    83
  have "a + b = c + d \<or> a + b \<ge> Suc (c + d) \<or> c + d \<ge> Suc (a + b)" by arith
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    84
  then
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    85
  show "(a, b) = (c, d)"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    86
  proof (elim disjE)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    87
    assume sumeq: "a + b = c + d"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    88
    then have "a = c" using eq by auto
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    89
    moreover from sumeq this have "b = d" by auto
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    90
    ultimately show ?thesis by simp
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    91
  next
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    92
    assume "a + b \<ge> Suc (c + d)"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    93
    from sum_mono[OF this] eq
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    94
    show ?thesis by auto
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    95
  next
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    96
    assume "c + d \<ge> Suc (a + b)"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    97
    from sum_mono[OF this] eq
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    98
    show ?thesis by auto
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
    99
  qed
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   100
qed
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   101
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   102
instance "*" :: (countable, countable) countable
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   103
by (rule countable_classI [of "\<lambda>(x, y). pair_encode (to_nat x, to_nat y)"])
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   104
  (auto dest: injD [OF inj_pair_cencode] injD [OF inj_to_nat])
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   105
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   106
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   107
text {* Sums *}
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   108
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   109
instance "+":: (countable, countable) countable
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   110
  by (rule countable_classI [of "(\<lambda>x. case x of Inl a \<Rightarrow> to_nat (False, to_nat a)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   111
                                     | Inr b \<Rightarrow> to_nat (True, to_nat b))"])
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   112
    (auto split:sum.splits)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   113
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   114
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   115
text {* Integers *}
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   116
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   117
lemma int_cases: "(i::int) = 0 \<or> i < 0 \<or> i > 0"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   118
by presburger
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   119
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   120
lemma int_pos_neg_zero:
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   121
  obtains (zero) "(z::int) = 0" "sgn z = 0" "abs z = 0"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   122
  | (pos) n where "z = of_nat n" "sgn z = 1" "abs z = of_nat n"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   123
  | (neg) n where "z = - (of_nat n)" "sgn z = -1" "abs z = of_nat n"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   124
apply elim_to_cases
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   125
apply (insert int_cases[of z])
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   126
apply (auto simp:zsgn_def)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   127
apply (rule_tac x="nat (-z)" in exI, simp)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   128
apply (rule_tac x="nat z" in exI, simp)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   129
done
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   130
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   131
instance int :: countable
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   132
proof (rule countable_classI [of "(\<lambda>i. to_nat (nat (sgn i + 1), nat (abs i)))"], 
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   133
    auto dest: injD [OF inj_to_nat])
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   134
  fix x y 
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   135
  assume a: "nat (sgn x + 1) = nat (sgn y + 1)" "nat (abs x) = nat (abs y)"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   136
  show "x = y"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   137
  proof (cases rule: int_pos_neg_zero[of x])
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   138
    case zero 
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   139
    with a show "x = y" by (cases rule: int_pos_neg_zero[of y]) auto
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   140
  next
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   141
    case (pos n)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   142
    with a show "x = y" by (cases rule: int_pos_neg_zero[of y]) auto
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   143
  next
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   144
    case (neg n)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   145
    with a show "x = y" by (cases rule: int_pos_neg_zero[of y]) auto
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   146
  qed
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   147
qed
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   148
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   149
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   150
text {* Options *}
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   151
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   152
instance option :: (countable) countable
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   153
by (rule countable_classI[of "\<lambda>x. case x of None \<Rightarrow> 0
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   154
                                     | Some y \<Rightarrow> Suc (to_nat y)"])
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   155
 (auto split:option.splits)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   156
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   157
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   158
text {* Lists *}
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   159
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   160
lemma from_nat_to_nat_map [simp]: "map from_nat (map to_nat xs) = xs"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   161
  by (simp add: comp_def map_compose [symmetric])
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   162
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   163
primrec
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   164
  list_encode :: "'a\<Colon>countable list \<Rightarrow> nat"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   165
where
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   166
  "list_encode [] = 0"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   167
| "list_encode (x#xs) = Suc (to_nat (x, list_encode xs))"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   168
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   169
instance list :: (countable) countable
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   170
proof (rule countable_classI [of "list_encode"])
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   171
  fix xs ys :: "'a list"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   172
  assume cenc: "list_encode xs = list_encode ys"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   173
  then show "xs = ys"
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   174
  proof (induct xs arbitrary: ys)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   175
    case (Nil ys)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   176
    with cenc show ?case by (cases ys, auto)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   177
  next
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   178
    case (Cons x xs' ys)
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   179
    thus ?case by (cases ys) auto
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   180
  qed
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   181
qed
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   182
26243
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   183
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   184
text {* Functions *}
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   185
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   186
instance "fun" :: (finite, countable) countable
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   187
proof
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   188
  obtain xs :: "'a list" where xs: "set xs = UNIV"
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   189
    using finite_list [OF finite_UNIV] ..
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   190
  show "\<exists>to_nat::('a \<Rightarrow> 'b) \<Rightarrow> nat. inj to_nat"
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   191
  proof
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   192
    show "inj (\<lambda>f. to_nat (map f xs))"
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   193
      by (rule injI, simp add: xs expand_fun_eq)
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   194
  qed
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   195
qed
69592314f977 instance fun :: (finite, countable) countable
huffman
parents: 26169
diff changeset
   196
26169
73027318f9ba added theory for countable types
haftmann
parents:
diff changeset
   197
end