src/HOL/Transfer.thy
author wenzelm
Thu May 24 17:25:53 2012 +0200 (2012-05-24)
changeset 47988 e4b69e10b990
parent 47937 70375fa2679d
child 48891 c0eafbd55de3
permissions -rw-r--r--
tuned proofs;
huffman@47325
     1
(*  Title:      HOL/Transfer.thy
huffman@47325
     2
    Author:     Brian Huffman, TU Muenchen
huffman@47325
     3
*)
huffman@47325
     4
huffman@47325
     5
header {* Generic theorem transfer using relations *}
huffman@47325
     6
huffman@47325
     7
theory Transfer
huffman@47325
     8
imports Plain Hilbert_Choice
huffman@47325
     9
uses ("Tools/transfer.ML")
huffman@47325
    10
begin
huffman@47325
    11
huffman@47325
    12
subsection {* Relator for function space *}
huffman@47325
    13
huffman@47325
    14
definition
huffman@47325
    15
  fun_rel :: "('a \<Rightarrow> 'c \<Rightarrow> bool) \<Rightarrow> ('b \<Rightarrow> 'd \<Rightarrow> bool) \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> ('c \<Rightarrow> 'd) \<Rightarrow> bool" (infixr "===>" 55)
huffman@47325
    16
where
huffman@47325
    17
  "fun_rel A B = (\<lambda>f g. \<forall>x y. A x y \<longrightarrow> B (f x) (g y))"
huffman@47325
    18
huffman@47325
    19
lemma fun_relI [intro]:
huffman@47325
    20
  assumes "\<And>x y. A x y \<Longrightarrow> B (f x) (g y)"
huffman@47325
    21
  shows "(A ===> B) f g"
huffman@47325
    22
  using assms by (simp add: fun_rel_def)
huffman@47325
    23
huffman@47325
    24
lemma fun_relD:
huffman@47325
    25
  assumes "(A ===> B) f g" and "A x y"
huffman@47325
    26
  shows "B (f x) (g y)"
huffman@47325
    27
  using assms by (simp add: fun_rel_def)
huffman@47325
    28
kuncar@47937
    29
lemma fun_relD2:
kuncar@47937
    30
  assumes "(A ===> B) f g" and "A x x"
kuncar@47937
    31
  shows "B (f x) (g x)"
kuncar@47937
    32
  using assms unfolding fun_rel_def by auto
kuncar@47937
    33
huffman@47325
    34
lemma fun_relE:
huffman@47325
    35
  assumes "(A ===> B) f g" and "A x y"
huffman@47325
    36
  obtains "B (f x) (g y)"
huffman@47325
    37
  using assms by (simp add: fun_rel_def)
huffman@47325
    38
huffman@47325
    39
lemma fun_rel_eq:
huffman@47325
    40
  shows "((op =) ===> (op =)) = (op =)"
huffman@47325
    41
  by (auto simp add: fun_eq_iff elim: fun_relE)
huffman@47325
    42
huffman@47325
    43
lemma fun_rel_eq_rel:
huffman@47325
    44
  shows "((op =) ===> R) = (\<lambda>f g. \<forall>x. R (f x) (g x))"
huffman@47325
    45
  by (simp add: fun_rel_def)
huffman@47325
    46
huffman@47325
    47
huffman@47325
    48
subsection {* Transfer method *}
huffman@47325
    49
huffman@47789
    50
text {* Explicit tag for relation membership allows for
huffman@47789
    51
  backward proof methods. *}
huffman@47325
    52
huffman@47325
    53
definition Rel :: "('a \<Rightarrow> 'b \<Rightarrow> bool) \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> bool"
huffman@47325
    54
  where "Rel r \<equiv> r"
huffman@47325
    55
huffman@47325
    56
text {* Handling of meta-logic connectives *}
huffman@47325
    57
huffman@47325
    58
definition transfer_forall where
huffman@47325
    59
  "transfer_forall \<equiv> All"
huffman@47325
    60
huffman@47325
    61
definition transfer_implies where
huffman@47325
    62
  "transfer_implies \<equiv> op \<longrightarrow>"
huffman@47325
    63
huffman@47355
    64
definition transfer_bforall :: "('a \<Rightarrow> bool) \<Rightarrow> ('a \<Rightarrow> bool) \<Rightarrow> bool"
huffman@47355
    65
  where "transfer_bforall \<equiv> (\<lambda>P Q. \<forall>x. P x \<longrightarrow> Q x)"
huffman@47355
    66
huffman@47325
    67
lemma transfer_forall_eq: "(\<And>x. P x) \<equiv> Trueprop (transfer_forall (\<lambda>x. P x))"
huffman@47325
    68
  unfolding atomize_all transfer_forall_def ..
huffman@47325
    69
huffman@47325
    70
lemma transfer_implies_eq: "(A \<Longrightarrow> B) \<equiv> Trueprop (transfer_implies A B)"
huffman@47325
    71
  unfolding atomize_imp transfer_implies_def ..
huffman@47325
    72
huffman@47355
    73
lemma transfer_bforall_unfold:
huffman@47355
    74
  "Trueprop (transfer_bforall P (\<lambda>x. Q x)) \<equiv> (\<And>x. P x \<Longrightarrow> Q x)"
huffman@47355
    75
  unfolding transfer_bforall_def atomize_imp atomize_all ..
huffman@47355
    76
huffman@47658
    77
lemma transfer_start: "\<lbrakk>P; Rel (op =) P Q\<rbrakk> \<Longrightarrow> Q"
huffman@47325
    78
  unfolding Rel_def by simp
huffman@47325
    79
huffman@47658
    80
lemma transfer_start': "\<lbrakk>P; Rel (op \<longrightarrow>) P Q\<rbrakk> \<Longrightarrow> Q"
huffman@47325
    81
  unfolding Rel_def by simp
huffman@47325
    82
huffman@47635
    83
lemma transfer_prover_start: "\<lbrakk>x = x'; Rel R x' y\<rbrakk> \<Longrightarrow> Rel R x y"
huffman@47618
    84
  by simp
huffman@47618
    85
huffman@47325
    86
lemma Rel_eq_refl: "Rel (op =) x x"
huffman@47325
    87
  unfolding Rel_def ..
huffman@47325
    88
huffman@47789
    89
lemma Rel_app:
huffman@47523
    90
  assumes "Rel (A ===> B) f g" and "Rel A x y"
huffman@47789
    91
  shows "Rel B (f x) (g y)"
huffman@47789
    92
  using assms unfolding Rel_def fun_rel_def by fast
huffman@47523
    93
huffman@47789
    94
lemma Rel_abs:
huffman@47523
    95
  assumes "\<And>x y. Rel A x y \<Longrightarrow> Rel B (f x) (g y)"
huffman@47789
    96
  shows "Rel (A ===> B) (\<lambda>x. f x) (\<lambda>y. g y)"
huffman@47789
    97
  using assms unfolding Rel_def fun_rel_def by fast
huffman@47523
    98
huffman@47325
    99
use "Tools/transfer.ML"
huffman@47325
   100
huffman@47325
   101
setup Transfer.setup
huffman@47325
   102
huffman@47503
   103
declare fun_rel_eq [relator_eq]
huffman@47503
   104
huffman@47789
   105
hide_const (open) Rel
huffman@47325
   106
huffman@47325
   107
huffman@47325
   108
subsection {* Predicates on relations, i.e. ``class constraints'' *}
huffman@47325
   109
huffman@47325
   110
definition right_total :: "('a \<Rightarrow> 'b \<Rightarrow> bool) \<Rightarrow> bool"
huffman@47325
   111
  where "right_total R \<longleftrightarrow> (\<forall>y. \<exists>x. R x y)"
huffman@47325
   112
huffman@47325
   113
definition right_unique :: "('a \<Rightarrow> 'b \<Rightarrow> bool) \<Rightarrow> bool"
huffman@47325
   114
  where "right_unique R \<longleftrightarrow> (\<forall>x y z. R x y \<longrightarrow> R x z \<longrightarrow> y = z)"
huffman@47325
   115
huffman@47325
   116
definition bi_total :: "('a \<Rightarrow> 'b \<Rightarrow> bool) \<Rightarrow> bool"
huffman@47325
   117
  where "bi_total R \<longleftrightarrow> (\<forall>x. \<exists>y. R x y) \<and> (\<forall>y. \<exists>x. R x y)"
huffman@47325
   118
huffman@47325
   119
definition bi_unique :: "('a \<Rightarrow> 'b \<Rightarrow> bool) \<Rightarrow> bool"
huffman@47325
   120
  where "bi_unique R \<longleftrightarrow>
huffman@47325
   121
    (\<forall>x y z. R x y \<longrightarrow> R x z \<longrightarrow> y = z) \<and>
huffman@47325
   122
    (\<forall>x y z. R x z \<longrightarrow> R y z \<longrightarrow> x = y)"
huffman@47325
   123
huffman@47325
   124
lemma right_total_alt_def:
huffman@47325
   125
  "right_total R \<longleftrightarrow> ((R ===> op \<longrightarrow>) ===> op \<longrightarrow>) All All"
huffman@47325
   126
  unfolding right_total_def fun_rel_def
huffman@47325
   127
  apply (rule iffI, fast)
huffman@47325
   128
  apply (rule allI)
huffman@47325
   129
  apply (drule_tac x="\<lambda>x. True" in spec)
huffman@47325
   130
  apply (drule_tac x="\<lambda>y. \<exists>x. R x y" in spec)
huffman@47325
   131
  apply fast
huffman@47325
   132
  done
huffman@47325
   133
huffman@47325
   134
lemma right_unique_alt_def:
huffman@47325
   135
  "right_unique R \<longleftrightarrow> (R ===> R ===> op \<longrightarrow>) (op =) (op =)"
huffman@47325
   136
  unfolding right_unique_def fun_rel_def by auto
huffman@47325
   137
huffman@47325
   138
lemma bi_total_alt_def:
huffman@47325
   139
  "bi_total R \<longleftrightarrow> ((R ===> op =) ===> op =) All All"
huffman@47325
   140
  unfolding bi_total_def fun_rel_def
huffman@47325
   141
  apply (rule iffI, fast)
huffman@47325
   142
  apply safe
huffman@47325
   143
  apply (drule_tac x="\<lambda>x. \<exists>y. R x y" in spec)
huffman@47325
   144
  apply (drule_tac x="\<lambda>y. True" in spec)
huffman@47325
   145
  apply fast
huffman@47325
   146
  apply (drule_tac x="\<lambda>x. True" in spec)
huffman@47325
   147
  apply (drule_tac x="\<lambda>y. \<exists>x. R x y" in spec)
huffman@47325
   148
  apply fast
huffman@47325
   149
  done
huffman@47325
   150
huffman@47325
   151
lemma bi_unique_alt_def:
huffman@47325
   152
  "bi_unique R \<longleftrightarrow> (R ===> R ===> op =) (op =) (op =)"
huffman@47325
   153
  unfolding bi_unique_def fun_rel_def by auto
huffman@47325
   154
huffman@47660
   155
text {* Properties are preserved by relation composition. *}
huffman@47660
   156
huffman@47660
   157
lemma OO_def: "R OO S = (\<lambda>x z. \<exists>y. R x y \<and> S y z)"
huffman@47660
   158
  by auto
huffman@47660
   159
huffman@47660
   160
lemma bi_total_OO: "\<lbrakk>bi_total A; bi_total B\<rbrakk> \<Longrightarrow> bi_total (A OO B)"
huffman@47660
   161
  unfolding bi_total_def OO_def by metis
huffman@47660
   162
huffman@47660
   163
lemma bi_unique_OO: "\<lbrakk>bi_unique A; bi_unique B\<rbrakk> \<Longrightarrow> bi_unique (A OO B)"
huffman@47660
   164
  unfolding bi_unique_def OO_def by metis
huffman@47660
   165
huffman@47660
   166
lemma right_total_OO:
huffman@47660
   167
  "\<lbrakk>right_total A; right_total B\<rbrakk> \<Longrightarrow> right_total (A OO B)"
huffman@47660
   168
  unfolding right_total_def OO_def by metis
huffman@47660
   169
huffman@47660
   170
lemma right_unique_OO:
huffman@47660
   171
  "\<lbrakk>right_unique A; right_unique B\<rbrakk> \<Longrightarrow> right_unique (A OO B)"
huffman@47660
   172
  unfolding right_unique_def OO_def by metis
huffman@47660
   173
huffman@47325
   174
huffman@47325
   175
subsection {* Properties of relators *}
huffman@47325
   176
huffman@47325
   177
lemma right_total_eq [transfer_rule]: "right_total (op =)"
huffman@47325
   178
  unfolding right_total_def by simp
huffman@47325
   179
huffman@47325
   180
lemma right_unique_eq [transfer_rule]: "right_unique (op =)"
huffman@47325
   181
  unfolding right_unique_def by simp
huffman@47325
   182
huffman@47325
   183
lemma bi_total_eq [transfer_rule]: "bi_total (op =)"
huffman@47325
   184
  unfolding bi_total_def by simp
huffman@47325
   185
huffman@47325
   186
lemma bi_unique_eq [transfer_rule]: "bi_unique (op =)"
huffman@47325
   187
  unfolding bi_unique_def by simp
huffman@47325
   188
huffman@47325
   189
lemma right_total_fun [transfer_rule]:
huffman@47325
   190
  "\<lbrakk>right_unique A; right_total B\<rbrakk> \<Longrightarrow> right_total (A ===> B)"
huffman@47325
   191
  unfolding right_total_def fun_rel_def
huffman@47325
   192
  apply (rule allI, rename_tac g)
huffman@47325
   193
  apply (rule_tac x="\<lambda>x. SOME z. B z (g (THE y. A x y))" in exI)
huffman@47325
   194
  apply clarify
huffman@47325
   195
  apply (subgoal_tac "(THE y. A x y) = y", simp)
huffman@47325
   196
  apply (rule someI_ex)
huffman@47325
   197
  apply (simp)
huffman@47325
   198
  apply (rule the_equality)
huffman@47325
   199
  apply assumption
huffman@47325
   200
  apply (simp add: right_unique_def)
huffman@47325
   201
  done
huffman@47325
   202
huffman@47325
   203
lemma right_unique_fun [transfer_rule]:
huffman@47325
   204
  "\<lbrakk>right_total A; right_unique B\<rbrakk> \<Longrightarrow> right_unique (A ===> B)"
huffman@47325
   205
  unfolding right_total_def right_unique_def fun_rel_def
huffman@47325
   206
  by (clarify, rule ext, fast)
huffman@47325
   207
huffman@47325
   208
lemma bi_total_fun [transfer_rule]:
huffman@47325
   209
  "\<lbrakk>bi_unique A; bi_total B\<rbrakk> \<Longrightarrow> bi_total (A ===> B)"
huffman@47325
   210
  unfolding bi_total_def fun_rel_def
huffman@47325
   211
  apply safe
huffman@47325
   212
  apply (rename_tac f)
huffman@47325
   213
  apply (rule_tac x="\<lambda>y. SOME z. B (f (THE x. A x y)) z" in exI)
huffman@47325
   214
  apply clarify
huffman@47325
   215
  apply (subgoal_tac "(THE x. A x y) = x", simp)
huffman@47325
   216
  apply (rule someI_ex)
huffman@47325
   217
  apply (simp)
huffman@47325
   218
  apply (rule the_equality)
huffman@47325
   219
  apply assumption
huffman@47325
   220
  apply (simp add: bi_unique_def)
huffman@47325
   221
  apply (rename_tac g)
huffman@47325
   222
  apply (rule_tac x="\<lambda>x. SOME z. B z (g (THE y. A x y))" in exI)
huffman@47325
   223
  apply clarify
huffman@47325
   224
  apply (subgoal_tac "(THE y. A x y) = y", simp)
huffman@47325
   225
  apply (rule someI_ex)
huffman@47325
   226
  apply (simp)
huffman@47325
   227
  apply (rule the_equality)
huffman@47325
   228
  apply assumption
huffman@47325
   229
  apply (simp add: bi_unique_def)
huffman@47325
   230
  done
huffman@47325
   231
huffman@47325
   232
lemma bi_unique_fun [transfer_rule]:
huffman@47325
   233
  "\<lbrakk>bi_total A; bi_unique B\<rbrakk> \<Longrightarrow> bi_unique (A ===> B)"
huffman@47325
   234
  unfolding bi_total_def bi_unique_def fun_rel_def fun_eq_iff
huffman@47325
   235
  by (safe, metis, fast)
huffman@47325
   236
huffman@47325
   237
huffman@47635
   238
subsection {* Transfer rules *}
huffman@47325
   239
huffman@47684
   240
text {* Transfer rules using implication instead of equality on booleans. *}
huffman@47684
   241
huffman@47684
   242
lemma eq_imp_transfer [transfer_rule]:
huffman@47684
   243
  "right_unique A \<Longrightarrow> (A ===> A ===> op \<longrightarrow>) (op =) (op =)"
huffman@47684
   244
  unfolding right_unique_alt_def .
huffman@47684
   245
huffman@47684
   246
lemma forall_imp_transfer [transfer_rule]:
huffman@47684
   247
  "right_total A \<Longrightarrow> ((A ===> op \<longrightarrow>) ===> op \<longrightarrow>) transfer_forall transfer_forall"
huffman@47684
   248
  unfolding right_total_alt_def transfer_forall_def .
huffman@47684
   249
huffman@47636
   250
lemma eq_transfer [transfer_rule]:
huffman@47325
   251
  assumes "bi_unique A"
huffman@47325
   252
  shows "(A ===> A ===> op =) (op =) (op =)"
huffman@47325
   253
  using assms unfolding bi_unique_def fun_rel_def by auto
huffman@47325
   254
huffman@47636
   255
lemma All_transfer [transfer_rule]:
huffman@47325
   256
  assumes "bi_total A"
huffman@47325
   257
  shows "((A ===> op =) ===> op =) All All"
huffman@47325
   258
  using assms unfolding bi_total_def fun_rel_def by fast
huffman@47325
   259
huffman@47636
   260
lemma Ex_transfer [transfer_rule]:
huffman@47325
   261
  assumes "bi_total A"
huffman@47325
   262
  shows "((A ===> op =) ===> op =) Ex Ex"
huffman@47325
   263
  using assms unfolding bi_total_def fun_rel_def by fast
huffman@47325
   264
huffman@47636
   265
lemma If_transfer [transfer_rule]: "(op = ===> A ===> A ===> A) If If"
huffman@47325
   266
  unfolding fun_rel_def by simp
huffman@47325
   267
huffman@47636
   268
lemma Let_transfer [transfer_rule]: "(A ===> (A ===> B) ===> B) Let Let"
huffman@47612
   269
  unfolding fun_rel_def by simp
huffman@47612
   270
huffman@47636
   271
lemma id_transfer [transfer_rule]: "(A ===> A) id id"
huffman@47625
   272
  unfolding fun_rel_def by simp
huffman@47625
   273
huffman@47636
   274
lemma comp_transfer [transfer_rule]:
huffman@47325
   275
  "((B ===> C) ===> (A ===> B) ===> (A ===> C)) (op \<circ>) (op \<circ>)"
huffman@47325
   276
  unfolding fun_rel_def by simp
huffman@47325
   277
huffman@47636
   278
lemma fun_upd_transfer [transfer_rule]:
huffman@47325
   279
  assumes [transfer_rule]: "bi_unique A"
huffman@47325
   280
  shows "((A ===> B) ===> A ===> B ===> A ===> B) fun_upd fun_upd"
huffman@47635
   281
  unfolding fun_upd_def [abs_def] by transfer_prover
huffman@47325
   282
huffman@47637
   283
lemma nat_case_transfer [transfer_rule]:
huffman@47637
   284
  "(A ===> (op = ===> A) ===> op = ===> A) nat_case nat_case"
huffman@47637
   285
  unfolding fun_rel_def by (simp split: nat.split)
huffman@47627
   286
huffman@47924
   287
lemma nat_rec_transfer [transfer_rule]:
huffman@47924
   288
  "(A ===> (op = ===> A ===> A) ===> op = ===> A) nat_rec nat_rec"
huffman@47924
   289
  unfolding fun_rel_def by (clarsimp, rename_tac n, induct_tac n, simp_all)
huffman@47924
   290
huffman@47924
   291
lemma funpow_transfer [transfer_rule]:
huffman@47924
   292
  "(op = ===> (A ===> A) ===> (A ===> A)) compow compow"
huffman@47924
   293
  unfolding funpow_def by transfer_prover
huffman@47924
   294
huffman@47627
   295
text {* Fallback rule for transferring universal quantifiers over
huffman@47627
   296
  correspondence relations that are not bi-total, and do not have
huffman@47627
   297
  custom transfer rules (e.g. relations between function types). *}
huffman@47627
   298
huffman@47637
   299
lemma Domainp_iff: "Domainp T x \<longleftrightarrow> (\<exists>y. T x y)"
huffman@47637
   300
  by auto
huffman@47637
   301
huffman@47627
   302
lemma Domainp_forall_transfer [transfer_rule]:
huffman@47627
   303
  assumes "right_total A"
huffman@47627
   304
  shows "((A ===> op =) ===> op =)
huffman@47627
   305
    (transfer_bforall (Domainp A)) transfer_forall"
huffman@47627
   306
  using assms unfolding right_total_def
huffman@47627
   307
  unfolding transfer_forall_def transfer_bforall_def fun_rel_def Domainp_iff
huffman@47627
   308
  by metis
huffman@47627
   309
huffman@47627
   310
text {* Preferred rule for transferring universal quantifiers over
huffman@47627
   311
  bi-total correspondence relations (later rules are tried first). *}
huffman@47627
   312
huffman@47636
   313
lemma forall_transfer [transfer_rule]:
huffman@47627
   314
  "bi_total A \<Longrightarrow> ((A ===> op =) ===> op =) transfer_forall transfer_forall"
huffman@47636
   315
  unfolding transfer_forall_def by (rule All_transfer)
huffman@47325
   316
huffman@47325
   317
end