src/HOL/Transfer.thy
author kuncar
Tue Aug 13 15:59:22 2013 +0200 (2013-08-13)
changeset 53011 aeee0a4be6cf
parent 52358 f4c4bcb0d564
child 53927 abe2b313f0e5
permissions -rw-r--r--
introduce locale with syntax for fun_rel and map_fun and make thus ===> and ---> local
huffman@47325
     1
(*  Title:      HOL/Transfer.thy
huffman@47325
     2
    Author:     Brian Huffman, TU Muenchen
kuncar@51956
     3
    Author:     Ondrej Kuncar, TU Muenchen
huffman@47325
     4
*)
huffman@47325
     5
huffman@47325
     6
header {* Generic theorem transfer using relations *}
huffman@47325
     7
huffman@47325
     8
theory Transfer
haftmann@51112
     9
imports Hilbert_Choice
huffman@47325
    10
begin
huffman@47325
    11
huffman@47325
    12
subsection {* Relator for function space *}
huffman@47325
    13
huffman@47325
    14
definition
kuncar@53011
    15
  fun_rel :: "('a \<Rightarrow> 'c \<Rightarrow> bool) \<Rightarrow> ('b \<Rightarrow> 'd \<Rightarrow> bool) \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> ('c \<Rightarrow> 'd) \<Rightarrow> bool"
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
kuncar@53011
    19
locale lifting_syntax
kuncar@53011
    20
begin
kuncar@53011
    21
  notation fun_rel (infixr "===>" 55)
kuncar@53011
    22
  notation map_fun (infixr "--->" 55)
kuncar@53011
    23
end
kuncar@53011
    24
kuncar@53011
    25
context
kuncar@53011
    26
begin
kuncar@53011
    27
interpretation lifting_syntax .
kuncar@53011
    28
huffman@47325
    29
lemma fun_relI [intro]:
huffman@47325
    30
  assumes "\<And>x y. A x y \<Longrightarrow> B (f x) (g y)"
huffman@47325
    31
  shows "(A ===> B) f g"
huffman@47325
    32
  using assms by (simp add: fun_rel_def)
huffman@47325
    33
huffman@47325
    34
lemma fun_relD:
huffman@47325
    35
  assumes "(A ===> B) f g" and "A x y"
huffman@47325
    36
  shows "B (f x) (g y)"
huffman@47325
    37
  using assms by (simp add: fun_rel_def)
huffman@47325
    38
kuncar@47937
    39
lemma fun_relD2:
kuncar@47937
    40
  assumes "(A ===> B) f g" and "A x x"
kuncar@47937
    41
  shows "B (f x) (g x)"
kuncar@47937
    42
  using assms unfolding fun_rel_def by auto
kuncar@47937
    43
huffman@47325
    44
lemma fun_relE:
huffman@47325
    45
  assumes "(A ===> B) f g" and "A x y"
huffman@47325
    46
  obtains "B (f x) (g y)"
huffman@47325
    47
  using assms by (simp add: fun_rel_def)
huffman@47325
    48
huffman@47325
    49
lemma fun_rel_eq:
huffman@47325
    50
  shows "((op =) ===> (op =)) = (op =)"
huffman@47325
    51
  by (auto simp add: fun_eq_iff elim: fun_relE)
huffman@47325
    52
huffman@47325
    53
lemma fun_rel_eq_rel:
huffman@47325
    54
  shows "((op =) ===> R) = (\<lambda>f g. \<forall>x. R (f x) (g x))"
huffman@47325
    55
  by (simp add: fun_rel_def)
huffman@47325
    56
huffman@47325
    57
huffman@47325
    58
subsection {* Transfer method *}
huffman@47325
    59
huffman@47789
    60
text {* Explicit tag for relation membership allows for
huffman@47789
    61
  backward proof methods. *}
huffman@47325
    62
huffman@47325
    63
definition Rel :: "('a \<Rightarrow> 'b \<Rightarrow> bool) \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> bool"
huffman@47325
    64
  where "Rel r \<equiv> r"
huffman@47325
    65
huffman@49975
    66
text {* Handling of equality relations *}
huffman@49975
    67
huffman@49975
    68
definition is_equality :: "('a \<Rightarrow> 'a \<Rightarrow> bool) \<Rightarrow> bool"
huffman@49975
    69
  where "is_equality R \<longleftrightarrow> R = (op =)"
huffman@49975
    70
kuncar@51437
    71
lemma is_equality_eq: "is_equality (op =)"
kuncar@51437
    72
  unfolding is_equality_def by simp
kuncar@51437
    73
huffman@52354
    74
text {* Reverse implication for monotonicity rules *}
huffman@52354
    75
huffman@52354
    76
definition rev_implies where
huffman@52354
    77
  "rev_implies x y \<longleftrightarrow> (y \<longrightarrow> x)"
huffman@52354
    78
huffman@47325
    79
text {* Handling of meta-logic connectives *}
huffman@47325
    80
huffman@47325
    81
definition transfer_forall where
huffman@47325
    82
  "transfer_forall \<equiv> All"
huffman@47325
    83
huffman@47325
    84
definition transfer_implies where
huffman@47325
    85
  "transfer_implies \<equiv> op \<longrightarrow>"
huffman@47325
    86
huffman@47355
    87
definition transfer_bforall :: "('a \<Rightarrow> bool) \<Rightarrow> ('a \<Rightarrow> bool) \<Rightarrow> bool"
huffman@47355
    88
  where "transfer_bforall \<equiv> (\<lambda>P Q. \<forall>x. P x \<longrightarrow> Q x)"
huffman@47355
    89
huffman@47325
    90
lemma transfer_forall_eq: "(\<And>x. P x) \<equiv> Trueprop (transfer_forall (\<lambda>x. P x))"
huffman@47325
    91
  unfolding atomize_all transfer_forall_def ..
huffman@47325
    92
huffman@47325
    93
lemma transfer_implies_eq: "(A \<Longrightarrow> B) \<equiv> Trueprop (transfer_implies A B)"
huffman@47325
    94
  unfolding atomize_imp transfer_implies_def ..
huffman@47325
    95
huffman@47355
    96
lemma transfer_bforall_unfold:
huffman@47355
    97
  "Trueprop (transfer_bforall P (\<lambda>x. Q x)) \<equiv> (\<And>x. P x \<Longrightarrow> Q x)"
huffman@47355
    98
  unfolding transfer_bforall_def atomize_imp atomize_all ..
huffman@47355
    99
huffman@47658
   100
lemma transfer_start: "\<lbrakk>P; Rel (op =) P Q\<rbrakk> \<Longrightarrow> Q"
huffman@47325
   101
  unfolding Rel_def by simp
huffman@47325
   102
huffman@47658
   103
lemma transfer_start': "\<lbrakk>P; Rel (op \<longrightarrow>) P Q\<rbrakk> \<Longrightarrow> Q"
huffman@47325
   104
  unfolding Rel_def by simp
huffman@47325
   105
huffman@47635
   106
lemma transfer_prover_start: "\<lbrakk>x = x'; Rel R x' y\<rbrakk> \<Longrightarrow> Rel R x y"
huffman@47618
   107
  by simp
huffman@47618
   108
huffman@52358
   109
lemma untransfer_start: "\<lbrakk>Q; Rel (op =) P Q\<rbrakk> \<Longrightarrow> P"
huffman@52358
   110
  unfolding Rel_def by simp
huffman@52358
   111
huffman@47325
   112
lemma Rel_eq_refl: "Rel (op =) x x"
huffman@47325
   113
  unfolding Rel_def ..
huffman@47325
   114
huffman@47789
   115
lemma Rel_app:
huffman@47523
   116
  assumes "Rel (A ===> B) f g" and "Rel A x y"
huffman@47789
   117
  shows "Rel B (f x) (g y)"
huffman@47789
   118
  using assms unfolding Rel_def fun_rel_def by fast
huffman@47523
   119
huffman@47789
   120
lemma Rel_abs:
huffman@47523
   121
  assumes "\<And>x y. Rel A x y \<Longrightarrow> Rel B (f x) (g y)"
huffman@47789
   122
  shows "Rel (A ===> B) (\<lambda>x. f x) (\<lambda>y. g y)"
huffman@47789
   123
  using assms unfolding Rel_def fun_rel_def by fast
huffman@47523
   124
kuncar@53011
   125
end
kuncar@53011
   126
wenzelm@48891
   127
ML_file "Tools/transfer.ML"
huffman@47325
   128
setup Transfer.setup
huffman@47325
   129
huffman@49975
   130
declare refl [transfer_rule]
huffman@49975
   131
huffman@47503
   132
declare fun_rel_eq [relator_eq]
huffman@47503
   133
huffman@47789
   134
hide_const (open) Rel
huffman@47325
   135
kuncar@53011
   136
context
kuncar@53011
   137
begin
kuncar@53011
   138
interpretation lifting_syntax .
kuncar@53011
   139
kuncar@51956
   140
text {* Handling of domains *}
kuncar@51956
   141
kuncar@51956
   142
lemma Domaimp_refl[transfer_domain_rule]:
kuncar@51956
   143
  "Domainp T = Domainp T" ..
huffman@47325
   144
huffman@47325
   145
subsection {* Predicates on relations, i.e. ``class constraints'' *}
huffman@47325
   146
huffman@47325
   147
definition right_total :: "('a \<Rightarrow> 'b \<Rightarrow> bool) \<Rightarrow> bool"
huffman@47325
   148
  where "right_total R \<longleftrightarrow> (\<forall>y. \<exists>x. R x y)"
huffman@47325
   149
huffman@47325
   150
definition right_unique :: "('a \<Rightarrow> 'b \<Rightarrow> bool) \<Rightarrow> bool"
huffman@47325
   151
  where "right_unique R \<longleftrightarrow> (\<forall>x y z. R x y \<longrightarrow> R x z \<longrightarrow> y = z)"
huffman@47325
   152
huffman@47325
   153
definition bi_total :: "('a \<Rightarrow> 'b \<Rightarrow> bool) \<Rightarrow> bool"
huffman@47325
   154
  where "bi_total R \<longleftrightarrow> (\<forall>x. \<exists>y. R x y) \<and> (\<forall>y. \<exists>x. R x y)"
huffman@47325
   155
huffman@47325
   156
definition bi_unique :: "('a \<Rightarrow> 'b \<Rightarrow> bool) \<Rightarrow> bool"
huffman@47325
   157
  where "bi_unique R \<longleftrightarrow>
huffman@47325
   158
    (\<forall>x y z. R x y \<longrightarrow> R x z \<longrightarrow> y = z) \<and>
huffman@47325
   159
    (\<forall>x y z. R x z \<longrightarrow> R y z \<longrightarrow> x = y)"
huffman@47325
   160
huffman@47325
   161
lemma right_total_alt_def:
huffman@47325
   162
  "right_total R \<longleftrightarrow> ((R ===> op \<longrightarrow>) ===> op \<longrightarrow>) All All"
huffman@47325
   163
  unfolding right_total_def fun_rel_def
huffman@47325
   164
  apply (rule iffI, fast)
huffman@47325
   165
  apply (rule allI)
huffman@47325
   166
  apply (drule_tac x="\<lambda>x. True" in spec)
huffman@47325
   167
  apply (drule_tac x="\<lambda>y. \<exists>x. R x y" in spec)
huffman@47325
   168
  apply fast
huffman@47325
   169
  done
huffman@47325
   170
huffman@47325
   171
lemma right_unique_alt_def:
huffman@47325
   172
  "right_unique R \<longleftrightarrow> (R ===> R ===> op \<longrightarrow>) (op =) (op =)"
huffman@47325
   173
  unfolding right_unique_def fun_rel_def by auto
huffman@47325
   174
huffman@47325
   175
lemma bi_total_alt_def:
huffman@47325
   176
  "bi_total R \<longleftrightarrow> ((R ===> op =) ===> op =) All All"
huffman@47325
   177
  unfolding bi_total_def fun_rel_def
huffman@47325
   178
  apply (rule iffI, fast)
huffman@47325
   179
  apply safe
huffman@47325
   180
  apply (drule_tac x="\<lambda>x. \<exists>y. R x y" in spec)
huffman@47325
   181
  apply (drule_tac x="\<lambda>y. True" in spec)
huffman@47325
   182
  apply fast
huffman@47325
   183
  apply (drule_tac x="\<lambda>x. True" in spec)
huffman@47325
   184
  apply (drule_tac x="\<lambda>y. \<exists>x. R x y" in spec)
huffman@47325
   185
  apply fast
huffman@47325
   186
  done
huffman@47325
   187
huffman@47325
   188
lemma bi_unique_alt_def:
huffman@47325
   189
  "bi_unique R \<longleftrightarrow> (R ===> R ===> op =) (op =) (op =)"
huffman@47325
   190
  unfolding bi_unique_def fun_rel_def by auto
huffman@47325
   191
huffman@47660
   192
text {* Properties are preserved by relation composition. *}
huffman@47660
   193
huffman@47660
   194
lemma OO_def: "R OO S = (\<lambda>x z. \<exists>y. R x y \<and> S y z)"
huffman@47660
   195
  by auto
huffman@47660
   196
huffman@47660
   197
lemma bi_total_OO: "\<lbrakk>bi_total A; bi_total B\<rbrakk> \<Longrightarrow> bi_total (A OO B)"
huffman@47660
   198
  unfolding bi_total_def OO_def by metis
huffman@47660
   199
huffman@47660
   200
lemma bi_unique_OO: "\<lbrakk>bi_unique A; bi_unique B\<rbrakk> \<Longrightarrow> bi_unique (A OO B)"
huffman@47660
   201
  unfolding bi_unique_def OO_def by metis
huffman@47660
   202
huffman@47660
   203
lemma right_total_OO:
huffman@47660
   204
  "\<lbrakk>right_total A; right_total B\<rbrakk> \<Longrightarrow> right_total (A OO B)"
huffman@47660
   205
  unfolding right_total_def OO_def by metis
huffman@47660
   206
huffman@47660
   207
lemma right_unique_OO:
huffman@47660
   208
  "\<lbrakk>right_unique A; right_unique B\<rbrakk> \<Longrightarrow> right_unique (A OO B)"
huffman@47660
   209
  unfolding right_unique_def OO_def by metis
huffman@47660
   210
huffman@47325
   211
huffman@47325
   212
subsection {* Properties of relators *}
huffman@47325
   213
huffman@47325
   214
lemma right_total_eq [transfer_rule]: "right_total (op =)"
huffman@47325
   215
  unfolding right_total_def by simp
huffman@47325
   216
huffman@47325
   217
lemma right_unique_eq [transfer_rule]: "right_unique (op =)"
huffman@47325
   218
  unfolding right_unique_def by simp
huffman@47325
   219
huffman@47325
   220
lemma bi_total_eq [transfer_rule]: "bi_total (op =)"
huffman@47325
   221
  unfolding bi_total_def by simp
huffman@47325
   222
huffman@47325
   223
lemma bi_unique_eq [transfer_rule]: "bi_unique (op =)"
huffman@47325
   224
  unfolding bi_unique_def by simp
huffman@47325
   225
huffman@47325
   226
lemma right_total_fun [transfer_rule]:
huffman@47325
   227
  "\<lbrakk>right_unique A; right_total B\<rbrakk> \<Longrightarrow> right_total (A ===> B)"
huffman@47325
   228
  unfolding right_total_def fun_rel_def
huffman@47325
   229
  apply (rule allI, rename_tac g)
huffman@47325
   230
  apply (rule_tac x="\<lambda>x. SOME z. B z (g (THE y. A x y))" in exI)
huffman@47325
   231
  apply clarify
huffman@47325
   232
  apply (subgoal_tac "(THE y. A x y) = y", simp)
huffman@47325
   233
  apply (rule someI_ex)
huffman@47325
   234
  apply (simp)
huffman@47325
   235
  apply (rule the_equality)
huffman@47325
   236
  apply assumption
huffman@47325
   237
  apply (simp add: right_unique_def)
huffman@47325
   238
  done
huffman@47325
   239
huffman@47325
   240
lemma right_unique_fun [transfer_rule]:
huffman@47325
   241
  "\<lbrakk>right_total A; right_unique B\<rbrakk> \<Longrightarrow> right_unique (A ===> B)"
huffman@47325
   242
  unfolding right_total_def right_unique_def fun_rel_def
huffman@47325
   243
  by (clarify, rule ext, fast)
huffman@47325
   244
huffman@47325
   245
lemma bi_total_fun [transfer_rule]:
huffman@47325
   246
  "\<lbrakk>bi_unique A; bi_total B\<rbrakk> \<Longrightarrow> bi_total (A ===> B)"
huffman@47325
   247
  unfolding bi_total_def fun_rel_def
huffman@47325
   248
  apply safe
huffman@47325
   249
  apply (rename_tac f)
huffman@47325
   250
  apply (rule_tac x="\<lambda>y. SOME z. B (f (THE x. A x y)) z" in exI)
huffman@47325
   251
  apply clarify
huffman@47325
   252
  apply (subgoal_tac "(THE x. A x y) = x", simp)
huffman@47325
   253
  apply (rule someI_ex)
huffman@47325
   254
  apply (simp)
huffman@47325
   255
  apply (rule the_equality)
huffman@47325
   256
  apply assumption
huffman@47325
   257
  apply (simp add: bi_unique_def)
huffman@47325
   258
  apply (rename_tac g)
huffman@47325
   259
  apply (rule_tac x="\<lambda>x. SOME z. B z (g (THE y. A x y))" in exI)
huffman@47325
   260
  apply clarify
huffman@47325
   261
  apply (subgoal_tac "(THE y. A x y) = y", simp)
huffman@47325
   262
  apply (rule someI_ex)
huffman@47325
   263
  apply (simp)
huffman@47325
   264
  apply (rule the_equality)
huffman@47325
   265
  apply assumption
huffman@47325
   266
  apply (simp add: bi_unique_def)
huffman@47325
   267
  done
huffman@47325
   268
huffman@47325
   269
lemma bi_unique_fun [transfer_rule]:
huffman@47325
   270
  "\<lbrakk>bi_total A; bi_unique B\<rbrakk> \<Longrightarrow> bi_unique (A ===> B)"
huffman@47325
   271
  unfolding bi_total_def bi_unique_def fun_rel_def fun_eq_iff
huffman@47325
   272
  by (safe, metis, fast)
huffman@47325
   273
huffman@47325
   274
huffman@47635
   275
subsection {* Transfer rules *}
huffman@47325
   276
huffman@47684
   277
text {* Transfer rules using implication instead of equality on booleans. *}
huffman@47684
   278
huffman@52354
   279
lemma transfer_forall_transfer [transfer_rule]:
huffman@52354
   280
  "bi_total A \<Longrightarrow> ((A ===> op =) ===> op =) transfer_forall transfer_forall"
huffman@52354
   281
  "right_total A \<Longrightarrow> ((A ===> op =) ===> implies) transfer_forall transfer_forall"
huffman@52354
   282
  "right_total A \<Longrightarrow> ((A ===> implies) ===> implies) transfer_forall transfer_forall"
huffman@52354
   283
  "bi_total A \<Longrightarrow> ((A ===> op =) ===> rev_implies) transfer_forall transfer_forall"
huffman@52354
   284
  "bi_total A \<Longrightarrow> ((A ===> rev_implies) ===> rev_implies) transfer_forall transfer_forall"
huffman@52354
   285
  unfolding transfer_forall_def rev_implies_def fun_rel_def right_total_def bi_total_def
huffman@52354
   286
  by metis+
huffman@52354
   287
huffman@52354
   288
lemma transfer_implies_transfer [transfer_rule]:
huffman@52354
   289
  "(op =        ===> op =        ===> op =       ) transfer_implies transfer_implies"
huffman@52354
   290
  "(rev_implies ===> implies     ===> implies    ) transfer_implies transfer_implies"
huffman@52354
   291
  "(rev_implies ===> op =        ===> implies    ) transfer_implies transfer_implies"
huffman@52354
   292
  "(op =        ===> implies     ===> implies    ) transfer_implies transfer_implies"
huffman@52354
   293
  "(op =        ===> op =        ===> implies    ) transfer_implies transfer_implies"
huffman@52354
   294
  "(implies     ===> rev_implies ===> rev_implies) transfer_implies transfer_implies"
huffman@52354
   295
  "(implies     ===> op =        ===> rev_implies) transfer_implies transfer_implies"
huffman@52354
   296
  "(op =        ===> rev_implies ===> rev_implies) transfer_implies transfer_implies"
huffman@52354
   297
  "(op =        ===> op =        ===> rev_implies) transfer_implies transfer_implies"
huffman@52354
   298
  unfolding transfer_implies_def rev_implies_def fun_rel_def by auto
huffman@52354
   299
huffman@47684
   300
lemma eq_imp_transfer [transfer_rule]:
huffman@47684
   301
  "right_unique A \<Longrightarrow> (A ===> A ===> op \<longrightarrow>) (op =) (op =)"
huffman@47684
   302
  unfolding right_unique_alt_def .
huffman@47684
   303
huffman@47636
   304
lemma eq_transfer [transfer_rule]:
huffman@47325
   305
  assumes "bi_unique A"
huffman@47325
   306
  shows "(A ===> A ===> op =) (op =) (op =)"
huffman@47325
   307
  using assms unfolding bi_unique_def fun_rel_def by auto
huffman@47325
   308
kuncar@51956
   309
lemma Domainp_iff: "Domainp T x \<longleftrightarrow> (\<exists>y. T x y)"
kuncar@51956
   310
  by auto
kuncar@51956
   311
kuncar@51956
   312
lemma right_total_Ex_transfer[transfer_rule]:
kuncar@51956
   313
  assumes "right_total A"
kuncar@51956
   314
  shows "((A ===> op=) ===> op=) (Bex (Collect (Domainp A))) Ex"
kuncar@51956
   315
using assms unfolding right_total_def Bex_def fun_rel_def Domainp_iff[abs_def]
kuncar@51956
   316
by blast
kuncar@51956
   317
kuncar@51956
   318
lemma right_total_All_transfer[transfer_rule]:
kuncar@51956
   319
  assumes "right_total A"
kuncar@51956
   320
  shows "((A ===> op =) ===> op =) (Ball (Collect (Domainp A))) All"
kuncar@51956
   321
using assms unfolding right_total_def Ball_def fun_rel_def Domainp_iff[abs_def]
kuncar@51956
   322
by blast
kuncar@51956
   323
huffman@47636
   324
lemma All_transfer [transfer_rule]:
huffman@47325
   325
  assumes "bi_total A"
huffman@47325
   326
  shows "((A ===> op =) ===> op =) All All"
huffman@47325
   327
  using assms unfolding bi_total_def fun_rel_def by fast
huffman@47325
   328
huffman@47636
   329
lemma Ex_transfer [transfer_rule]:
huffman@47325
   330
  assumes "bi_total A"
huffman@47325
   331
  shows "((A ===> op =) ===> op =) Ex Ex"
huffman@47325
   332
  using assms unfolding bi_total_def fun_rel_def by fast
huffman@47325
   333
huffman@47636
   334
lemma If_transfer [transfer_rule]: "(op = ===> A ===> A ===> A) If If"
huffman@47325
   335
  unfolding fun_rel_def by simp
huffman@47325
   336
huffman@47636
   337
lemma Let_transfer [transfer_rule]: "(A ===> (A ===> B) ===> B) Let Let"
huffman@47612
   338
  unfolding fun_rel_def by simp
huffman@47612
   339
huffman@47636
   340
lemma id_transfer [transfer_rule]: "(A ===> A) id id"
huffman@47625
   341
  unfolding fun_rel_def by simp
huffman@47625
   342
huffman@47636
   343
lemma comp_transfer [transfer_rule]:
huffman@47325
   344
  "((B ===> C) ===> (A ===> B) ===> (A ===> C)) (op \<circ>) (op \<circ>)"
huffman@47325
   345
  unfolding fun_rel_def by simp
huffman@47325
   346
huffman@47636
   347
lemma fun_upd_transfer [transfer_rule]:
huffman@47325
   348
  assumes [transfer_rule]: "bi_unique A"
huffman@47325
   349
  shows "((A ===> B) ===> A ===> B ===> A ===> B) fun_upd fun_upd"
huffman@47635
   350
  unfolding fun_upd_def [abs_def] by transfer_prover
huffman@47325
   351
huffman@47637
   352
lemma nat_case_transfer [transfer_rule]:
huffman@47637
   353
  "(A ===> (op = ===> A) ===> op = ===> A) nat_case nat_case"
huffman@47637
   354
  unfolding fun_rel_def by (simp split: nat.split)
huffman@47627
   355
huffman@47924
   356
lemma nat_rec_transfer [transfer_rule]:
huffman@47924
   357
  "(A ===> (op = ===> A ===> A) ===> op = ===> A) nat_rec nat_rec"
huffman@47924
   358
  unfolding fun_rel_def by (clarsimp, rename_tac n, induct_tac n, simp_all)
huffman@47924
   359
huffman@47924
   360
lemma funpow_transfer [transfer_rule]:
huffman@47924
   361
  "(op = ===> (A ===> A) ===> (A ===> A)) compow compow"
huffman@47924
   362
  unfolding funpow_def by transfer_prover
huffman@47924
   363
huffman@47627
   364
lemma Domainp_forall_transfer [transfer_rule]:
huffman@47627
   365
  assumes "right_total A"
huffman@47627
   366
  shows "((A ===> op =) ===> op =)
huffman@47627
   367
    (transfer_bforall (Domainp A)) transfer_forall"
huffman@47627
   368
  using assms unfolding right_total_def
huffman@47627
   369
  unfolding transfer_forall_def transfer_bforall_def fun_rel_def Domainp_iff
huffman@47627
   370
  by metis
huffman@47627
   371
huffman@47636
   372
lemma forall_transfer [transfer_rule]:
huffman@47627
   373
  "bi_total A \<Longrightarrow> ((A ===> op =) ===> op =) transfer_forall transfer_forall"
huffman@47636
   374
  unfolding transfer_forall_def by (rule All_transfer)
huffman@47325
   375
huffman@47325
   376
end
kuncar@53011
   377
kuncar@53011
   378
end