src/HOL/Bali/Basis.thy
author wenzelm
Sun Jul 29 14:29:52 2007 +0200 (2007-07-29)
changeset 24038 18182c4aec9e
parent 24019 67bde7cfcf10
child 24162 8dfd5dd65d82
permissions -rw-r--r--
replaced make_imp by rev_mp;
wenzelm@12857
     1
(*  Title:      HOL/Bali/Basis.thy
schirmer@12854
     2
    ID:         $Id$
schirmer@12854
     3
    Author:     David von Oheimb
schirmer@12854
     4
schirmer@12854
     5
*)
schirmer@12854
     6
header {* Definitions extending HOL as logical basis of Bali *}
schirmer@12854
     7
haftmann@16417
     8
theory Basis imports Main begin
schirmer@12854
     9
wenzelm@16121
    10
ML {*
schirmer@12854
    11
Unify.search_bound := 40;
schirmer@12854
    12
Unify.trace_bound  := 40;
schirmer@12854
    13
*}
schirmer@12854
    14
schirmer@12854
    15
section "misc"
schirmer@12854
    16
schirmer@12854
    17
declare same_fstI [intro!] (*### TO HOL/Wellfounded_Relations *)
schirmer@12854
    18
schirmer@12854
    19
declare split_if_asm  [split] option.split [split] option.split_asm [split]
wenzelm@24019
    20
declaration {* K (Simplifier.map_ss (fn ss => ss addloop ("split_all_tac", split_all_tac))) *}
schirmer@12854
    21
declare if_weak_cong [cong del] option.weak_case_cong [cong del]
paulson@18447
    22
declare length_Suc_conv [iff]
paulson@18447
    23
schirmer@12854
    24
lemma Collect_split_eq: "{p. P (split f p)} = {(a,b). P (f a b)}"
schirmer@12854
    25
apply auto
schirmer@12854
    26
done
schirmer@12854
    27
schirmer@12854
    28
lemma subset_insertD: 
schirmer@12854
    29
  "A <= insert x B ==> A <= B & x ~: A | (EX B'. A = insert x B' & B' <= B)"
schirmer@12854
    30
apply (case_tac "x:A")
schirmer@12854
    31
apply (rule disjI2)
schirmer@12854
    32
apply (rule_tac x = "A-{x}" in exI)
schirmer@12854
    33
apply fast+
schirmer@12854
    34
done
schirmer@12854
    35
schirmer@12854
    36
syntax
schirmer@12925
    37
  "3" :: nat   ("3") 
schirmer@12854
    38
  "4" :: nat   ("4")
schirmer@12854
    39
translations
schirmer@12854
    40
 "3" == "Suc 2"
schirmer@12854
    41
 "4" == "Suc 3"
schirmer@12854
    42
schirmer@12854
    43
(*unused*)
schirmer@12854
    44
lemma range_bool_domain: "range f = {f True, f False}"
schirmer@12854
    45
apply auto
schirmer@12854
    46
apply (case_tac "xa")
schirmer@12854
    47
apply auto
schirmer@12854
    48
done
schirmer@12854
    49
nipkow@13867
    50
(* irrefl_tranclI in Transitive_Closure.thy is more general *)
schirmer@12854
    51
lemma irrefl_tranclI': "r^-1 Int r^+ = {} ==> !x. (x, x) ~: r^+"
nipkow@13867
    52
by(blast elim: tranclE dest: trancl_into_rtrancl)
nipkow@13867
    53
schirmer@12854
    54
schirmer@12854
    55
lemma trancl_rtrancl_trancl:
schirmer@12854
    56
"\<lbrakk>(x,y)\<in>r^+; (y,z)\<in>r^*\<rbrakk> \<Longrightarrow> (x,z)\<in>r^+"
schirmer@12854
    57
by (auto dest: tranclD rtrancl_trans rtrancl_into_trancl2)
schirmer@12854
    58
schirmer@12854
    59
lemma rtrancl_into_trancl3:
schirmer@12925
    60
"\<lbrakk>(a,b)\<in>r^*; a\<noteq>b\<rbrakk> \<Longrightarrow> (a,b)\<in>r^+" 
schirmer@12854
    61
apply (drule rtranclD)
schirmer@12854
    62
apply auto
schirmer@12854
    63
done
schirmer@12854
    64
schirmer@12854
    65
lemma rtrancl_into_rtrancl2: 
schirmer@12854
    66
  "\<lbrakk> (a, b) \<in>  r; (b, c) \<in> r^* \<rbrakk> \<Longrightarrow> (a, c) \<in>  r^*"
schirmer@12854
    67
by (auto intro: r_into_rtrancl rtrancl_trans)
schirmer@12854
    68
schirmer@12854
    69
lemma triangle_lemma:
schirmer@12854
    70
 "\<lbrakk> \<And> a b c. \<lbrakk>(a,b)\<in>r; (a,c)\<in>r\<rbrakk> \<Longrightarrow> b=c; (a,x)\<in>r\<^sup>*; (a,y)\<in>r\<^sup>*\<rbrakk> 
schirmer@12854
    71
 \<Longrightarrow> (x,y)\<in>r\<^sup>* \<or> (y,x)\<in>r\<^sup>*"
schirmer@12854
    72
proof -
schirmer@12854
    73
  note converse_rtrancl_induct = converse_rtrancl_induct [consumes 1]
schirmer@12854
    74
  note converse_rtranclE = converse_rtranclE [consumes 1] 
schirmer@12854
    75
  assume unique: "\<And> a b c. \<lbrakk>(a,b)\<in>r; (a,c)\<in>r\<rbrakk> \<Longrightarrow> b=c"
schirmer@12854
    76
  assume "(a,x)\<in>r\<^sup>*" 
schirmer@12854
    77
  then show "(a,y)\<in>r\<^sup>* \<Longrightarrow> (x,y)\<in>r\<^sup>* \<or> (y,x)\<in>r\<^sup>*"
schirmer@12854
    78
  proof (induct rule: converse_rtrancl_induct)
schirmer@12854
    79
    assume "(x,y)\<in>r\<^sup>*"
schirmer@12854
    80
    then show ?thesis 
schirmer@12854
    81
      by blast
schirmer@12854
    82
  next
schirmer@12854
    83
    fix a v
schirmer@12854
    84
    assume a_v_r: "(a, v) \<in> r" and
schirmer@12854
    85
          v_x_rt: "(v, x) \<in> r\<^sup>*" and
schirmer@12854
    86
          a_y_rt: "(a, y) \<in> r\<^sup>*"  and
schirmer@12854
    87
             hyp: "(v, y) \<in> r\<^sup>* \<Longrightarrow> (x, y) \<in> r\<^sup>* \<or> (y, x) \<in> r\<^sup>*"
schirmer@12854
    88
    from a_y_rt 
schirmer@12854
    89
    show "(x, y) \<in> r\<^sup>* \<or> (y, x) \<in> r\<^sup>*"
schirmer@12854
    90
    proof (cases rule: converse_rtranclE)
schirmer@12854
    91
      assume "a=y"
schirmer@12854
    92
      with a_v_r v_x_rt have "(y,x) \<in> r\<^sup>*"
schirmer@12854
    93
	by (auto intro: r_into_rtrancl rtrancl_trans)
schirmer@12854
    94
      then show ?thesis 
schirmer@12854
    95
	by blast
schirmer@12854
    96
    next
schirmer@12854
    97
      fix w 
schirmer@12854
    98
      assume a_w_r: "(a, w) \<in> r" and
schirmer@12854
    99
            w_y_rt: "(w, y) \<in> r\<^sup>*"
schirmer@12854
   100
      from a_v_r a_w_r unique 
schirmer@12854
   101
      have "v=w" 
schirmer@12854
   102
	by auto
schirmer@12854
   103
      with w_y_rt hyp 
schirmer@12854
   104
      show ?thesis
schirmer@12854
   105
	by blast
schirmer@12854
   106
    qed
schirmer@12854
   107
  qed
schirmer@12854
   108
qed
schirmer@12854
   109
schirmer@12854
   110
schirmer@12854
   111
lemma rtrancl_cases [consumes 1, case_names Refl Trancl]:
schirmer@12854
   112
 "\<lbrakk>(a,b)\<in>r\<^sup>*;  a = b \<Longrightarrow> P; (a,b)\<in>r\<^sup>+ \<Longrightarrow> P\<rbrakk> \<Longrightarrow> P"
schirmer@12854
   113
apply (erule rtranclE)
schirmer@12854
   114
apply (auto dest: rtrancl_into_trancl1)
schirmer@12854
   115
done
schirmer@12854
   116
schirmer@12854
   117
(* ### To Transitive_Closure *)
schirmer@12854
   118
theorems converse_rtrancl_induct 
schirmer@12854
   119
 = converse_rtrancl_induct [consumes 1,case_names Id Step]
schirmer@12854
   120
schirmer@12854
   121
theorems converse_trancl_induct 
schirmer@12854
   122
         = converse_trancl_induct [consumes 1,case_names Single Step]
schirmer@12854
   123
schirmer@12854
   124
(* context (theory "Set") *)
schirmer@12854
   125
lemma Ball_weaken:"\<lbrakk>Ball s P;\<And> x. P x\<longrightarrow>Q x\<rbrakk>\<Longrightarrow>Ball s Q"
schirmer@12854
   126
by auto
schirmer@12854
   127
schirmer@12854
   128
(* context (theory "Finite") *)
schirmer@12854
   129
lemma finite_SetCompr2: "[| finite (Collect P); !y. P y --> finite (range (f y)) |] ==>  
schirmer@12854
   130
  finite {f y x |x y. P y}"
schirmer@12854
   131
apply (subgoal_tac "{f y x |x y. P y} = UNION (Collect P) (%y. range (f y))")
schirmer@12854
   132
prefer 2 apply  fast
schirmer@12854
   133
apply (erule ssubst)
schirmer@12854
   134
apply (erule finite_UN_I)
schirmer@12854
   135
apply fast
schirmer@12854
   136
done
schirmer@12854
   137
schirmer@12854
   138
schirmer@12854
   139
(* ### TO theory "List" *)
schirmer@12854
   140
lemma list_all2_trans: "\<forall> a b c. P1 a b \<longrightarrow> P2 b c \<longrightarrow> P3 a c \<Longrightarrow>
schirmer@12854
   141
 \<forall>xs2 xs3. list_all2 P1 xs1 xs2 \<longrightarrow> list_all2 P2 xs2 xs3 \<longrightarrow> list_all2 P3 xs1 xs3"
schirmer@12854
   142
apply (induct_tac "xs1")
schirmer@12854
   143
apply simp
schirmer@12854
   144
apply (rule allI)
schirmer@12854
   145
apply (induct_tac "xs2")
schirmer@12854
   146
apply simp
schirmer@12854
   147
apply (rule allI)
schirmer@12854
   148
apply (induct_tac "xs3")
schirmer@12854
   149
apply auto
schirmer@12854
   150
done
schirmer@12854
   151
schirmer@12854
   152
schirmer@12854
   153
section "pairs"
schirmer@12854
   154
schirmer@12854
   155
lemma surjective_pairing5: "p = (fst p, fst (snd p), fst (snd (snd p)), fst (snd (snd (snd p))), 
schirmer@12854
   156
  snd (snd (snd (snd p))))"
schirmer@12854
   157
apply auto
schirmer@12854
   158
done
schirmer@12854
   159
schirmer@12854
   160
lemma fst_splitE [elim!]: 
schirmer@12854
   161
"[| fst s' = x';  !!x s. [| s' = (x,s);  x = x' |] ==> Q |] ==> Q"
schirmer@12854
   162
apply (cut_tac p = "s'" in surjective_pairing)
schirmer@12854
   163
apply auto
schirmer@12854
   164
done
schirmer@12854
   165
schirmer@12854
   166
lemma fst_in_set_lemma [rule_format (no_asm)]: "(x, y) : set l --> x : fst ` set l"
schirmer@12854
   167
apply (induct_tac "l")
schirmer@12854
   168
apply  auto
schirmer@12854
   169
done
schirmer@12854
   170
schirmer@12854
   171
schirmer@12854
   172
section "quantifiers"
schirmer@12854
   173
schirmer@12854
   174
lemma All_Ex_refl_eq2 [simp]: 
schirmer@12854
   175
 "(!x. (? b. x = f b & Q b) \<longrightarrow> P x) = (!b. Q b --> P (f b))"
schirmer@12854
   176
apply auto
schirmer@12854
   177
done
schirmer@12854
   178
schirmer@12854
   179
lemma ex_ex_miniscope1 [simp]:
schirmer@12854
   180
  "(EX w v. P w v & Q v) = (EX v. (EX w. P w v) & Q v)"
schirmer@12854
   181
apply auto
schirmer@12854
   182
done
schirmer@12854
   183
schirmer@12854
   184
lemma ex_miniscope2 [simp]:
schirmer@12854
   185
  "(EX v. P v & Q & R v) = (Q & (EX v. P v & R v))" 
schirmer@12854
   186
apply auto
schirmer@12854
   187
done
schirmer@12854
   188
schirmer@12854
   189
lemma ex_reorder31: "(\<exists>z x y. P x y z) = (\<exists>x y z. P x y z)"
schirmer@12854
   190
apply auto
schirmer@12854
   191
done
schirmer@12854
   192
schirmer@12854
   193
lemma All_Ex_refl_eq1 [simp]: "(!x. (? b. x = f b) --> P x) = (!b. P (f b))"
schirmer@12854
   194
apply auto
schirmer@12854
   195
done
schirmer@12854
   196
schirmer@12854
   197
schirmer@12854
   198
section "sums"
schirmer@12854
   199
schirmer@12854
   200
hide const In0 In1
schirmer@12854
   201
schirmer@12854
   202
syntax
schirmer@12854
   203
  fun_sum :: "('a => 'c) => ('b => 'c) => (('a+'b) => 'c)" (infixr "'(+')"80)
schirmer@12854
   204
translations
berghofe@22781
   205
 "fun_sum" == "CONST sum_case"
schirmer@12854
   206
schirmer@12854
   207
consts    the_Inl  :: "'a + 'b \<Rightarrow> 'a"
schirmer@12854
   208
          the_Inr  :: "'a + 'b \<Rightarrow> 'b"
schirmer@12854
   209
primrec  "the_Inl (Inl a) = a"
schirmer@12854
   210
primrec  "the_Inr (Inr b) = b"
schirmer@12854
   211
schirmer@12854
   212
datatype ('a, 'b, 'c) sum3 = In1 'a | In2 'b | In3 'c
schirmer@12854
   213
schirmer@12854
   214
consts    the_In1  :: "('a, 'b, 'c) sum3 \<Rightarrow> 'a"
schirmer@12854
   215
          the_In2  :: "('a, 'b, 'c) sum3 \<Rightarrow> 'b"
schirmer@12854
   216
          the_In3  :: "('a, 'b, 'c) sum3 \<Rightarrow> 'c"
schirmer@12854
   217
primrec  "the_In1 (In1 a) = a"
schirmer@12854
   218
primrec  "the_In2 (In2 b) = b"
schirmer@12854
   219
primrec  "the_In3 (In3 c) = c"
schirmer@12854
   220
schirmer@12854
   221
syntax
schirmer@12854
   222
	 In1l	:: "'al \<Rightarrow> ('al + 'ar, 'b, 'c) sum3"
schirmer@12854
   223
	 In1r	:: "'ar \<Rightarrow> ('al + 'ar, 'b, 'c) sum3"
schirmer@12854
   224
translations
schirmer@12854
   225
	"In1l e" == "In1 (Inl e)"
schirmer@12854
   226
	"In1r c" == "In1 (Inr c)"
schirmer@12854
   227
schirmer@13688
   228
syntax the_In1l :: "('al + 'ar, 'b, 'c) sum3 \<Rightarrow> 'al"
schirmer@13688
   229
       the_In1r :: "('al + 'ar, 'b, 'c) sum3 \<Rightarrow> 'ar"
schirmer@13688
   230
translations
schirmer@13688
   231
   "the_In1l" == "the_Inl \<circ> the_In1"
schirmer@13688
   232
   "the_In1r" == "the_Inr \<circ> the_In1"
schirmer@13688
   233
schirmer@12854
   234
ML {*
haftmann@22633
   235
fun sum3_instantiate thm = map (fn s => simplify(simpset()delsimps[@{thm not_None_eq}])
schirmer@12854
   236
 (read_instantiate [("t","In"^s^" ?x")] thm)) ["1l","2","3","1r"]
schirmer@12854
   237
*}
schirmer@12854
   238
(* e.g. lemmas is_stmt_rews = is_stmt_def [of "In1l x", simplified] *)
schirmer@12854
   239
schirmer@12854
   240
translations
wenzelm@12919
   241
  "option"<= (type) "Datatype.option"
schirmer@12854
   242
  "list"  <= (type) "List.list"
schirmer@12854
   243
  "sum3"  <= (type) "Basis.sum3"
schirmer@12854
   244
schirmer@12854
   245
schirmer@12854
   246
section "quantifiers for option type"
schirmer@12854
   247
schirmer@12854
   248
syntax
schirmer@12854
   249
  Oall :: "[pttrn, 'a option, bool] => bool"   ("(3! _:_:/ _)" [0,0,10] 10)
schirmer@12854
   250
  Oex  :: "[pttrn, 'a option, bool] => bool"   ("(3? _:_:/ _)" [0,0,10] 10)
schirmer@12854
   251
schirmer@12854
   252
syntax (symbols)
schirmer@12854
   253
  Oall :: "[pttrn, 'a option, bool] => bool"   ("(3\<forall>_\<in>_:/ _)"  [0,0,10] 10)
schirmer@12854
   254
  Oex  :: "[pttrn, 'a option, bool] => bool"   ("(3\<exists>_\<in>_:/ _)"  [0,0,10] 10)
schirmer@12854
   255
schirmer@12854
   256
translations
schirmer@12854
   257
  "! x:A: P"    == "! x:o2s A. P"
schirmer@12854
   258
  "? x:A: P"    == "? x:o2s A. P"
schirmer@12854
   259
nipkow@19323
   260
section "Special map update"
nipkow@19323
   261
nipkow@19323
   262
text{* Deemed too special for theory Map. *}
nipkow@19323
   263
nipkow@19323
   264
constdefs
nipkow@19323
   265
  chg_map :: "('b => 'b) => 'a => ('a ~=> 'b) => ('a ~=> 'b)"
nipkow@19323
   266
 "chg_map f a m == case m a of None => m | Some b => m(a|->f b)"
nipkow@19323
   267
nipkow@19323
   268
lemma chg_map_new[simp]: "m a = None   ==> chg_map f a m = m"
nipkow@19323
   269
by (unfold chg_map_def, auto)
nipkow@19323
   270
nipkow@19323
   271
lemma chg_map_upd[simp]: "m a = Some b ==> chg_map f a m = m(a|->f b)"
nipkow@19323
   272
by (unfold chg_map_def, auto)
nipkow@19323
   273
nipkow@19323
   274
lemma chg_map_other [simp]: "a \<noteq> b \<Longrightarrow> chg_map f a m b = m b"
nipkow@19323
   275
by (auto simp: chg_map_def split add: option.split)
nipkow@19323
   276
schirmer@12854
   277
schirmer@12854
   278
section "unique association lists"
schirmer@12854
   279
schirmer@12854
   280
constdefs
schirmer@12854
   281
  unique   :: "('a \<times> 'b) list \<Rightarrow> bool"
wenzelm@12893
   282
 "unique \<equiv> distinct \<circ> map fst"
schirmer@12854
   283
schirmer@12854
   284
lemma uniqueD [rule_format (no_asm)]: 
schirmer@12854
   285
"unique l--> (!x y. (x,y):set l --> (!x' y'. (x',y'):set l --> x=x'-->  y=y'))"
schirmer@12854
   286
apply (unfold unique_def o_def)
schirmer@12854
   287
apply (induct_tac "l")
schirmer@12854
   288
apply  (auto dest: fst_in_set_lemma)
schirmer@12854
   289
done
schirmer@12854
   290
schirmer@12854
   291
lemma unique_Nil [simp]: "unique []"
schirmer@12854
   292
apply (unfold unique_def)
schirmer@12854
   293
apply (simp (no_asm))
schirmer@12854
   294
done
schirmer@12854
   295
schirmer@12854
   296
lemma unique_Cons [simp]: "unique ((x,y)#l) = (unique l & (!y. (x,y) ~: set l))"
schirmer@12854
   297
apply (unfold unique_def)
schirmer@12854
   298
apply  (auto dest: fst_in_set_lemma)
schirmer@12854
   299
done
schirmer@12854
   300
schirmer@12854
   301
lemmas unique_ConsI = conjI [THEN unique_Cons [THEN iffD2], standard]
schirmer@12854
   302
schirmer@12854
   303
lemma unique_single [simp]: "!!p. unique [p]"
schirmer@12854
   304
apply auto
schirmer@12854
   305
done
schirmer@12854
   306
schirmer@12854
   307
lemma unique_ConsD: "unique (x#xs) ==> unique xs"
schirmer@12854
   308
apply (simp add: unique_def)
schirmer@12854
   309
done
schirmer@12854
   310
schirmer@12854
   311
lemma unique_append [rule_format (no_asm)]: "unique l' ==> unique l -->  
schirmer@12854
   312
  (!(x,y):set l. !(x',y'):set l'. x' ~= x) --> unique (l @ l')"
schirmer@12854
   313
apply (induct_tac "l")
schirmer@12854
   314
apply  (auto dest: fst_in_set_lemma)
schirmer@12854
   315
done
schirmer@12854
   316
schirmer@12854
   317
lemma unique_map_inj [rule_format (no_asm)]: "unique l --> inj f --> unique (map (%(k,x). (f k, g k x)) l)"
schirmer@12854
   318
apply (induct_tac "l")
schirmer@12854
   319
apply  (auto dest: fst_in_set_lemma simp add: inj_eq)
schirmer@12854
   320
done
schirmer@12854
   321
schirmer@12854
   322
lemma map_of_SomeI [rule_format (no_asm)]: "unique l --> (k, x) : set l --> map_of l k = Some x"
schirmer@12854
   323
apply (induct_tac "l")
schirmer@12854
   324
apply auto
schirmer@12854
   325
done
schirmer@12854
   326
schirmer@12854
   327
schirmer@12854
   328
section "list patterns"
schirmer@12854
   329
schirmer@12854
   330
consts
schirmer@12854
   331
  lsplit         :: "[['a, 'a list] => 'b, 'a list] => 'b"
schirmer@12854
   332
defs
schirmer@12854
   333
  lsplit_def:    "lsplit == %f l. f (hd l) (tl l)"
schirmer@12854
   334
(*  list patterns -- extends pre-defined type "pttrn" used in abstractions *)
schirmer@12854
   335
syntax
schirmer@12854
   336
  "_lpttrn"    :: "[pttrn,pttrn] => pttrn"     ("_#/_" [901,900] 900)
schirmer@12854
   337
translations
schirmer@12854
   338
  "%y#x#xs. b"  == "lsplit (%y x#xs. b)"
schirmer@12854
   339
  "%x#xs  . b"  == "lsplit (%x xs  . b)"
schirmer@12854
   340
schirmer@12854
   341
lemma lsplit [simp]: "lsplit c (x#xs) = c x xs"
schirmer@12854
   342
apply (unfold lsplit_def)
schirmer@12854
   343
apply (simp (no_asm))
schirmer@12854
   344
done
schirmer@12854
   345
schirmer@12854
   346
lemma lsplit2 [simp]: "lsplit P (x#xs) y z = P x xs y z"
schirmer@12854
   347
apply (unfold lsplit_def)
schirmer@12854
   348
apply simp
schirmer@12854
   349
done 
schirmer@12854
   350
schirmer@12854
   351
schirmer@12854
   352
end