597
+ − 1
theory QuotMain
600
+ − 2
imports QuotScript QuotProd Prove
597
+ − 3
uses ("quotient_info.ML")
+ − 4
("quotient.ML")
+ − 5
("quotient_def.ML")
+ − 6
begin
+ − 7
+ − 8
+ − 9
locale QUOT_TYPE =
+ − 10
fixes R :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
+ − 11
and Abs :: "('a \<Rightarrow> bool) \<Rightarrow> 'b"
+ − 12
and Rep :: "'b \<Rightarrow> ('a \<Rightarrow> bool)"
+ − 13
assumes equivp: "equivp R"
+ − 14
and rep_prop: "\<And>y. \<exists>x. Rep y = R x"
+ − 15
and rep_inverse: "\<And>x. Abs (Rep x) = x"
+ − 16
and abs_inverse: "\<And>x. (Rep (Abs (R x))) = (R x)"
+ − 17
and rep_inject: "\<And>x y. (Rep x = Rep y) = (x = y)"
+ − 18
begin
+ − 19
+ − 20
definition
+ − 21
ABS::"'a \<Rightarrow> 'b"
+ − 22
where
+ − 23
"ABS x \<equiv> Abs (R x)"
+ − 24
+ − 25
definition
+ − 26
REP::"'b \<Rightarrow> 'a"
+ − 27
where
+ − 28
"REP a = Eps (Rep a)"
+ − 29
+ − 30
lemma lem9:
+ − 31
shows "R (Eps (R x)) = R x"
+ − 32
proof -
+ − 33
have a: "R x x" using equivp by (simp add: equivp_reflp_symp_transp reflp_def)
+ − 34
then have "R x (Eps (R x))" by (rule someI)
+ − 35
then show "R (Eps (R x)) = R x"
+ − 36
using equivp unfolding equivp_def by simp
+ − 37
qed
+ − 38
+ − 39
theorem thm10:
+ − 40
shows "ABS (REP a) \<equiv> a"
+ − 41
apply (rule eq_reflection)
+ − 42
unfolding ABS_def REP_def
+ − 43
proof -
+ − 44
from rep_prop
+ − 45
obtain x where eq: "Rep a = R x" by auto
+ − 46
have "Abs (R (Eps (Rep a))) = Abs (R (Eps (R x)))" using eq by simp
+ − 47
also have "\<dots> = Abs (R x)" using lem9 by simp
+ − 48
also have "\<dots> = Abs (Rep a)" using eq by simp
+ − 49
also have "\<dots> = a" using rep_inverse by simp
+ − 50
finally
+ − 51
show "Abs (R (Eps (Rep a))) = a" by simp
+ − 52
qed
+ − 53
+ − 54
lemma REP_refl:
+ − 55
shows "R (REP a) (REP a)"
+ − 56
unfolding REP_def
+ − 57
by (simp add: equivp[simplified equivp_def])
+ − 58
+ − 59
lemma lem7:
+ − 60
shows "(R x = R y) = (Abs (R x) = Abs (R y))"
+ − 61
apply(rule iffI)
+ − 62
apply(simp)
+ − 63
apply(drule rep_inject[THEN iffD2])
+ − 64
apply(simp add: abs_inverse)
+ − 65
done
+ − 66
+ − 67
theorem thm11:
+ − 68
shows "R r r' = (ABS r = ABS r')"
+ − 69
unfolding ABS_def
+ − 70
by (simp only: equivp[simplified equivp_def] lem7)
+ − 71
+ − 72
+ − 73
lemma REP_ABS_rsp:
+ − 74
shows "R f (REP (ABS g)) = R f g"
+ − 75
and "R (REP (ABS g)) f = R g f"
+ − 76
by (simp_all add: thm10 thm11)
+ − 77
+ − 78
lemma Quotient:
+ − 79
"Quotient R ABS REP"
+ − 80
apply(unfold Quotient_def)
+ − 81
apply(simp add: thm10)
+ − 82
apply(simp add: REP_refl)
+ − 83
apply(subst thm11[symmetric])
+ − 84
apply(simp add: equivp[simplified equivp_def])
+ − 85
done
+ − 86
+ − 87
lemma R_trans:
+ − 88
assumes ab: "R a b"
+ − 89
and bc: "R b c"
+ − 90
shows "R a c"
+ − 91
proof -
+ − 92
have tr: "transp R" using equivp equivp_reflp_symp_transp[of R] by simp
+ − 93
moreover have ab: "R a b" by fact
+ − 94
moreover have bc: "R b c" by fact
+ − 95
ultimately show "R a c" unfolding transp_def by blast
+ − 96
qed
+ − 97
+ − 98
lemma R_sym:
+ − 99
assumes ab: "R a b"
+ − 100
shows "R b a"
+ − 101
proof -
+ − 102
have re: "symp R" using equivp equivp_reflp_symp_transp[of R] by simp
+ − 103
then show "R b a" using ab unfolding symp_def by blast
+ − 104
qed
+ − 105
+ − 106
lemma R_trans2:
+ − 107
assumes ac: "R a c"
+ − 108
and bd: "R b d"
+ − 109
shows "R a b = R c d"
+ − 110
using ac bd
+ − 111
by (blast intro: R_trans R_sym)
+ − 112
+ − 113
lemma REPS_same:
+ − 114
shows "R (REP a) (REP b) \<equiv> (a = b)"
+ − 115
proof -
+ − 116
have "R (REP a) (REP b) = (a = b)"
+ − 117
proof
+ − 118
assume as: "R (REP a) (REP b)"
+ − 119
from rep_prop
+ − 120
obtain x y
+ − 121
where eqs: "Rep a = R x" "Rep b = R y" by blast
+ − 122
from eqs have "R (Eps (R x)) (Eps (R y))" using as unfolding REP_def by simp
+ − 123
then have "R x (Eps (R y))" using lem9 by simp
+ − 124
then have "R (Eps (R y)) x" using R_sym by blast
+ − 125
then have "R y x" using lem9 by simp
+ − 126
then have "R x y" using R_sym by blast
+ − 127
then have "ABS x = ABS y" using thm11 by simp
+ − 128
then have "Abs (Rep a) = Abs (Rep b)" using eqs unfolding ABS_def by simp
+ − 129
then show "a = b" using rep_inverse by simp
+ − 130
next
+ − 131
assume ab: "a = b"
+ − 132
have "reflp R" using equivp equivp_reflp_symp_transp[of R] by simp
+ − 133
then show "R (REP a) (REP b)" unfolding reflp_def using ab by auto
+ − 134
qed
+ − 135
then show "R (REP a) (REP b) \<equiv> (a = b)" by simp
+ − 136
qed
+ − 137
+ − 138
end
+ − 139
+ − 140
section {* type definition for the quotient type *}
+ − 141
+ − 142
(* the auxiliary data for the quotient types *)
+ − 143
use "quotient_info.ML"
+ − 144
+ − 145
declare [[map * = (prod_fun, prod_rel)]]
+ − 146
declare [[map "fun" = (fun_map, fun_rel)]]
615
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 147
613
+ − 148
(* Throws now an exception: *)
612
+ − 149
(* declare [[map "option" = (bla, blu)]] *)
+ − 150
636
+ − 151
lemmas [quot_thm] =
600
+ − 152
fun_quotient prod_quotient
597
+ − 153
636
+ − 154
lemmas [quot_respect] =
600
+ − 155
quot_rel_rsp pair_rsp
597
+ − 156
+ − 157
(* fun_map is not here since equivp is not true *)
+ − 158
(* TODO: option, ... *)
636
+ − 159
lemmas [quot_equiv] =
600
+ − 160
identity_equivp prod_equivp
597
+ − 161
+ − 162
(* definition of the quotient types *)
+ − 163
(* FIXME: should be called quotient_typ.ML *)
+ − 164
use "quotient.ML"
+ − 165
+ − 166
(* lifting of constants *)
+ − 167
use "quotient_def.ML"
+ − 168
+ − 169
section {* Simset setup *}
+ − 170
614
+ − 171
(* Since HOL_basic_ss is too "big" for us, *)
+ − 172
(* we set up our own minimal simpset. *)
597
+ − 173
ML {*
+ − 174
fun mk_minimal_ss ctxt =
+ − 175
Simplifier.context ctxt empty_ss
+ − 176
setsubgoaler asm_simp_tac
+ − 177
setmksimps (mksimps [])
+ − 178
*}
+ − 179
605
120e479ed367
first attempt to deal with Babs in regularise and cleaning (not yet working)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 180
ML {*
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 181
fun OF1 thm1 thm2 = thm2 RS thm1
605
120e479ed367
first attempt to deal with Babs in regularise and cleaning (not yet working)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 182
*}
120e479ed367
first attempt to deal with Babs in regularise and cleaning (not yet working)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 183
614
+ − 184
section {* Atomize Infrastructure *}
597
+ − 185
+ − 186
lemma atomize_eqv[atomize]:
+ − 187
shows "(Trueprop A \<equiv> Trueprop B) \<equiv> (A \<equiv> B)"
+ − 188
proof
+ − 189
assume "A \<equiv> B"
+ − 190
then show "Trueprop A \<equiv> Trueprop B" by unfold
+ − 191
next
+ − 192
assume *: "Trueprop A \<equiv> Trueprop B"
+ − 193
have "A = B"
+ − 194
proof (cases A)
+ − 195
case True
+ − 196
have "A" by fact
+ − 197
then show "A = B" using * by simp
+ − 198
next
+ − 199
case False
+ − 200
have "\<not>A" by fact
+ − 201
then show "A = B" using * by auto
+ − 202
qed
+ − 203
then show "A \<equiv> B" by (rule eq_reflection)
+ − 204
qed
+ − 205
+ − 206
ML {*
+ − 207
fun atomize_thm thm =
+ − 208
let
+ − 209
val thm' = Thm.freezeT (forall_intr_vars thm)
+ − 210
val thm'' = ObjectLogic.atomize (cprop_of thm')
+ − 211
in
+ − 212
@{thm equal_elim_rule1} OF [thm'', thm']
+ − 213
end
+ − 214
*}
+ − 215
614
+ − 216
section {* Infrastructure about id *}
+ − 217
+ − 218
print_attributes
597
+ − 219
600
+ − 220
(* TODO: think where should this be *)
597
+ − 221
lemma prod_fun_id: "prod_fun id id \<equiv> id"
+ − 222
by (rule eq_reflection) (simp add: prod_fun_def)
+ − 223
614
+ − 224
lemmas [id_simps] =
597
+ − 225
fun_map_id[THEN eq_reflection]
+ − 226
id_apply[THEN eq_reflection]
+ − 227
id_def[THEN eq_reflection,symmetric]
600
+ − 228
prod_fun_id
597
+ − 229
+ − 230
section {* Debugging infrastructure for testing tactics *}
+ − 231
+ − 232
ML {*
+ − 233
fun my_print_tac ctxt s i thm =
+ − 234
let
+ − 235
val prem_str = nth (prems_of thm) (i - 1)
+ − 236
|> Syntax.string_of_term ctxt
+ − 237
handle Subscript => "no subgoal"
+ − 238
val _ = tracing (s ^ "\n" ^ prem_str)
+ − 239
in
+ − 240
Seq.single thm
+ − 241
end *}
+ − 242
+ − 243
ML {*
+ − 244
fun DT ctxt s tac i thm =
+ − 245
let
+ − 246
val before_goal = nth (prems_of thm) (i - 1)
+ − 247
|> Syntax.string_of_term ctxt
+ − 248
val before_msg = ["before: " ^ s, before_goal, "after: " ^ s]
+ − 249
|> cat_lines
+ − 250
in
+ − 251
EVERY [tac i, my_print_tac ctxt before_msg i] thm
+ − 252
end
+ − 253
+ − 254
fun NDT ctxt s tac thm = tac thm
+ − 255
*}
+ − 256
615
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 257
section {* Matching of Terms and Types *}
597
+ − 258
+ − 259
ML {*
+ − 260
fun matches_typ (ty, ty') =
+ − 261
case (ty, ty') of
+ − 262
(_, TVar _) => true
+ − 263
| (TFree x, TFree x') => x = x'
+ − 264
| (Type (s, tys), Type (s', tys')) =>
+ − 265
s = s' andalso
+ − 266
if (length tys = length tys')
+ − 267
then (List.all matches_typ (tys ~~ tys'))
+ − 268
else false
+ − 269
| _ => false
+ − 270
+ − 271
fun matches_term (trm, trm') =
+ − 272
case (trm, trm') of
+ − 273
(_, Var _) => true
+ − 274
| (Const (s, ty), Const (s', ty')) => s = s' andalso matches_typ (ty, ty')
+ − 275
| (Free (x, ty), Free (x', ty')) => x = x' andalso matches_typ (ty, ty')
+ − 276
| (Bound i, Bound j) => i = j
+ − 277
| (Abs (_, T, t), Abs (_, T', t')) => matches_typ (T, T') andalso matches_term (t, t')
+ − 278
| (t $ s, t' $ s') => matches_term (t, t') andalso matches_term (s, s')
+ − 279
| _ => false
+ − 280
*}
+ − 281
612
+ − 282
section {* Computation of the Regularize Goal *}
597
+ − 283
+ − 284
(*
+ − 285
Regularizing an rtrm means:
+ − 286
- quantifiers over a type that needs lifting are replaced by
+ − 287
bounded quantifiers, for example:
+ − 288
\<forall>x. P \<Longrightarrow> \<forall>x \<in> (Respects R). P / All (Respects R) P
+ − 289
+ − 290
the relation R is given by the rty and qty;
+ − 291
+ − 292
- abstractions over a type that needs lifting are replaced
+ − 293
by bounded abstractions:
+ − 294
\<lambda>x. P \<Longrightarrow> Ball (Respects R) (\<lambda>x. P)
+ − 295
+ − 296
- equalities over the type being lifted are replaced by
+ − 297
corresponding relations:
+ − 298
A = B \<Longrightarrow> A \<approx> B
+ − 299
+ − 300
example with more complicated types of A, B:
+ − 301
A = B \<Longrightarrow> (op = \<Longrightarrow> op \<approx>) A B
+ − 302
*)
+ − 303
+ − 304
ML {*
+ − 305
(* builds the relation that is the argument of respects *)
+ − 306
fun mk_resp_arg lthy (rty, qty) =
+ − 307
let
+ − 308
val thy = ProofContext.theory_of lthy
+ − 309
in
+ − 310
if rty = qty
+ − 311
then HOLogic.eq_const rty
+ − 312
else
+ − 313
case (rty, qty) of
+ − 314
(Type (s, tys), Type (s', tys')) =>
+ − 315
if s = s'
+ − 316
then let
+ − 317
val SOME map_info = maps_lookup thy s
+ − 318
val args = map (mk_resp_arg lthy) (tys ~~ tys')
+ − 319
in
+ − 320
list_comb (Const (#relfun map_info, dummyT), args)
+ − 321
end
+ − 322
else let
+ − 323
val SOME qinfo = quotdata_lookup_thy thy s'
+ − 324
(* FIXME: check in this case that the rty and qty *)
+ − 325
(* FIXME: correspond to each other *)
+ − 326
val (s, _) = dest_Const (#rel qinfo)
+ − 327
(* FIXME: the relation should only be the string *)
+ − 328
(* FIXME: and the type needs to be calculated as below; *)
+ − 329
(* FIXME: maybe one should actually have a term *)
+ − 330
(* FIXME: and one needs to force it to have this type *)
+ − 331
in
+ − 332
Const (s, rty --> rty --> @{typ bool})
+ − 333
end
+ − 334
| _ => HOLogic.eq_const dummyT
+ − 335
(* FIXME: check that the types correspond to each other? *)
+ − 336
end
+ − 337
*}
+ − 338
+ − 339
ML {*
+ − 340
val mk_babs = Const (@{const_name Babs}, dummyT)
+ − 341
val mk_ball = Const (@{const_name Ball}, dummyT)
+ − 342
val mk_bex = Const (@{const_name Bex}, dummyT)
+ − 343
val mk_resp = Const (@{const_name Respects}, dummyT)
+ − 344
*}
+ − 345
+ − 346
ML {*
+ − 347
(* - applies f to the subterm of an abstraction, *)
+ − 348
(* otherwise to the given term, *)
+ − 349
(* - used by regularize, therefore abstracted *)
+ − 350
(* variables do not have to be treated specially *)
+ − 351
+ − 352
fun apply_subt f trm1 trm2 =
+ − 353
case (trm1, trm2) of
+ − 354
(Abs (x, T, t), Abs (x', T', t')) => Abs (x, T, f t t')
+ − 355
| _ => f trm1 trm2
+ − 356
+ − 357
(* the major type of All and Ex quantifiers *)
+ − 358
fun qnt_typ ty = domain_type (domain_type ty)
+ − 359
*}
+ − 360
+ − 361
ML {*
632
+ − 362
(* produces a regularized version of rtrm *)
+ − 363
(* - the result is contains dummyT *)
597
+ − 364
(* - does not need any special treatment of *)
+ − 365
(* bound variables *)
+ − 366
+ − 367
fun regularize_trm lthy rtrm qtrm =
+ − 368
case (rtrm, qtrm) of
+ − 369
(Abs (x, ty, t), Abs (x', ty', t')) =>
+ − 370
let
+ − 371
val subtrm = Abs(x, ty, regularize_trm lthy t t')
+ − 372
in
632
+ − 373
if ty = ty' then subtrm
597
+ − 374
else mk_babs $ (mk_resp $ mk_resp_arg lthy (ty, ty')) $ subtrm
+ − 375
end
+ − 376
+ − 377
| (Const (@{const_name "All"}, ty) $ t, Const (@{const_name "All"}, ty') $ t') =>
+ − 378
let
+ − 379
val subtrm = apply_subt (regularize_trm lthy) t t'
+ − 380
in
+ − 381
if ty = ty'
+ − 382
then Const (@{const_name "All"}, ty) $ subtrm
+ − 383
else mk_ball $ (mk_resp $ mk_resp_arg lthy (qnt_typ ty, qnt_typ ty')) $ subtrm
+ − 384
end
+ − 385
+ − 386
| (Const (@{const_name "Ex"}, ty) $ t, Const (@{const_name "Ex"}, ty') $ t') =>
+ − 387
let
+ − 388
val subtrm = apply_subt (regularize_trm lthy) t t'
+ − 389
in
+ − 390
if ty = ty'
+ − 391
then Const (@{const_name "Ex"}, ty) $ subtrm
+ − 392
else mk_bex $ (mk_resp $ mk_resp_arg lthy (qnt_typ ty, qnt_typ ty')) $ subtrm
+ − 393
end
+ − 394
+ − 395
| (* equalities need to be replaced by appropriate equivalence relations *)
+ − 396
(Const (@{const_name "op ="}, ty), Const (@{const_name "op ="}, ty')) =>
632
+ − 397
if ty = ty' then rtrm
597
+ − 398
else mk_resp_arg lthy (domain_type ty, domain_type ty')
+ − 399
+ − 400
| (* in this case we check whether the given equivalence relation is correct *)
+ − 401
(rel, Const (@{const_name "op ="}, ty')) =>
+ − 402
let
+ − 403
val exc = LIFT_MATCH "regularise (relation mismatch)"
+ − 404
val rel_ty = (fastype_of rel) handle TERM _ => raise exc
+ − 405
val rel' = mk_resp_arg lthy (domain_type rel_ty, domain_type ty')
+ − 406
in
+ − 407
if rel' = rel
632
+ − 408
then rtrm else raise exc
597
+ − 409
end
+ − 410
| (_, Const (s, _)) =>
+ − 411
let
+ − 412
fun same_name (Const (s, _)) (Const (s', _)) = (s = s')
+ − 413
| same_name _ _ = false
+ − 414
in
+ − 415
if same_name rtrm qtrm
+ − 416
then rtrm
+ − 417
else
+ − 418
let
+ − 419
fun exc1 s = LIFT_MATCH ("regularize (constant " ^ s ^ " not found)")
+ − 420
val exc2 = LIFT_MATCH ("regularize (constant mismatch)")
+ − 421
val thy = ProofContext.theory_of lthy
+ − 422
val rtrm' = (#rconst (qconsts_lookup thy s)) handle NotFound => raise (exc1 s)
+ − 423
in
+ − 424
if matches_term (rtrm, rtrm')
+ − 425
then rtrm
+ − 426
else raise exc2
+ − 427
end
+ − 428
end
+ − 429
+ − 430
| (t1 $ t2, t1' $ t2') =>
+ − 431
(regularize_trm lthy t1 t1') $ (regularize_trm lthy t2 t2')
+ − 432
+ − 433
| (Free (x, ty), Free (x', ty')) =>
+ − 434
(* this case cannot arrise as we start with two fully atomized terms *)
+ − 435
raise (LIFT_MATCH "regularize (frees)")
+ − 436
+ − 437
| (Bound i, Bound i') =>
632
+ − 438
if i = i' then rtrm
597
+ − 439
else raise (LIFT_MATCH "regularize (bounds mismatch)")
+ − 440
+ − 441
| (rt, qt) =>
632
+ − 442
raise (LIFT_MATCH "regularize failed (default)")
597
+ − 443
*}
+ − 444
612
+ − 445
section {* Regularize Tactic *}
+ − 446
597
+ − 447
ML {*
+ − 448
fun equiv_tac ctxt =
605
120e479ed367
first attempt to deal with Babs in regularise and cleaning (not yet working)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 449
(K (print_tac "equiv tac")) THEN'
120e479ed367
first attempt to deal with Babs in regularise and cleaning (not yet working)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 450
REPEAT_ALL_NEW (resolve_tac (equiv_rules_get ctxt))
597
+ − 451
+ − 452
fun equiv_solver_tac ss = equiv_tac (Simplifier.the_context ss)
+ − 453
val equiv_solver = Simplifier.mk_solver' "Equivalence goal solver" equiv_solver_tac
+ − 454
*}
+ − 455
+ − 456
ML {*
+ − 457
fun prep_trm thy (x, (T, t)) =
+ − 458
(cterm_of thy (Var (x, T)), cterm_of thy t)
+ − 459
+ − 460
fun prep_ty thy (x, (S, ty)) =
+ − 461
(ctyp_of thy (TVar (x, S)), ctyp_of thy ty)
+ − 462
*}
+ − 463
+ − 464
ML {*
+ − 465
fun matching_prs thy pat trm =
+ − 466
let
+ − 467
val univ = Unify.matchers thy [(pat, trm)]
+ − 468
val SOME (env, _) = Seq.pull univ
+ − 469
val tenv = Vartab.dest (Envir.term_env env)
+ − 470
val tyenv = Vartab.dest (Envir.type_env env)
+ − 471
in
+ − 472
(map (prep_ty thy) tyenv, map (prep_trm thy) tenv)
+ − 473
end
+ − 474
*}
+ − 475
+ − 476
ML {*
+ − 477
fun calculate_instance ctxt thm redex R1 R2 =
+ − 478
let
+ − 479
val thy = ProofContext.theory_of ctxt
+ − 480
val goal = Const (@{const_name "equivp"}, dummyT) $ R2
+ − 481
|> Syntax.check_term ctxt
+ − 482
|> HOLogic.mk_Trueprop
+ − 483
val eqv_prem = Goal.prove ctxt [] [] goal (fn {context,...} => equiv_tac context 1)
+ − 484
val thm = (@{thm eq_reflection} OF [thm OF [eqv_prem]])
+ − 485
val R1c = cterm_of thy R1
+ − 486
val thmi = Drule.instantiate' [] [SOME R1c] thm
+ − 487
val inst = matching_prs thy (term_of (Thm.lhs_of thmi)) redex
+ − 488
val thm2 = Drule.eta_contraction_rule (Drule.instantiate inst thmi)
+ − 489
in
+ − 490
SOME thm2
+ − 491
end
+ − 492
handle _ => NONE
615
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 493
(* FIXME/TODO: what is the place where the exception is raised: matching_prs? *)
597
+ − 494
*}
+ − 495
+ − 496
ML {*
+ − 497
fun ball_bex_range_simproc ss redex =
+ − 498
let
+ − 499
val ctxt = Simplifier.the_context ss
+ − 500
in
+ − 501
case redex of
+ − 502
(Const (@{const_name "Ball"}, _) $ (Const (@{const_name "Respects"}, _) $
+ − 503
(Const (@{const_name "fun_rel"}, _) $ R1 $ R2)) $ _) =>
+ − 504
calculate_instance ctxt @{thm ball_reg_eqv_range} redex R1 R2
+ − 505
| (Const (@{const_name "Bex"}, _) $ (Const (@{const_name "Respects"}, _) $
+ − 506
(Const (@{const_name "fun_rel"}, _) $ R1 $ R2)) $ _) =>
+ − 507
calculate_instance ctxt @{thm bex_reg_eqv_range} redex R1 R2
+ − 508
| _ => NONE
+ − 509
end
+ − 510
*}
+ − 511
+ − 512
lemma eq_imp_rel:
+ − 513
shows "equivp R \<Longrightarrow> a = b \<longrightarrow> R a b"
+ − 514
by (simp add: equivp_reflp)
+ − 515
+ − 516
612
+ − 517
(* Regularize Tactic *)
597
+ − 518
612
+ − 519
(* 0. preliminary simplification step according to *)
+ − 520
thm ball_reg_eqv bex_reg_eqv babs_reg_eqv (* the latter of no use *)
+ − 521
ball_reg_eqv_range bex_reg_eqv_range
+ − 522
(* 1. eliminating simple Ball/Bex instances*)
+ − 523
thm ball_reg_right bex_reg_left
+ − 524
(* 2. monos *)
+ − 525
(* 3. commutation rules for ball and bex *)
+ − 526
thm ball_all_comm bex_ex_comm
+ − 527
(* 4. then rel-equality (which need to be instantiated to avoid loops *)
+ − 528
thm eq_imp_rel
+ − 529
(* 5. then simplification like 0 *)
+ − 530
(* finally jump back to 1 *)
597
+ − 531
612
+ − 532
597
+ − 533
ML {*
+ − 534
fun regularize_tac ctxt =
+ − 535
let
+ − 536
val thy = ProofContext.theory_of ctxt
+ − 537
val pat_ball = @{term "Ball (Respects (R1 ===> R2)) P"}
+ − 538
val pat_bex = @{term "Bex (Respects (R1 ===> R2)) P"}
+ − 539
val simproc = Simplifier.simproc_i thy "" [pat_ball, pat_bex] (K (ball_bex_range_simproc))
+ − 540
val simpset = (mk_minimal_ss ctxt)
605
120e479ed367
first attempt to deal with Babs in regularise and cleaning (not yet working)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 541
addsimps @{thms ball_reg_eqv bex_reg_eqv babs_reg_eqv}
597
+ − 542
addsimprocs [simproc] addSolver equiv_solver
+ − 543
(* TODO: Make sure that there are no list_rel, pair_rel etc involved *)
605
120e479ed367
first attempt to deal with Babs in regularise and cleaning (not yet working)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 544
(* can this cause loops in equiv_tac ? *)
612
+ − 545
val eq_eqvs = map (OF1 @{thm eq_imp_rel}) (equiv_rules_get ctxt)
597
+ − 546
in
+ − 547
simp_tac simpset THEN'
605
120e479ed367
first attempt to deal with Babs in regularise and cleaning (not yet working)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 548
REPEAT_ALL_NEW (CHANGED o FIRST' [
612
+ − 549
resolve_tac @{thms ball_reg_right bex_reg_left},
597
+ − 550
resolve_tac (Inductive.get_monos ctxt),
612
+ − 551
resolve_tac @{thms ball_all_comm bex_ex_comm},
605
120e479ed367
first attempt to deal with Babs in regularise and cleaning (not yet working)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 552
resolve_tac eq_eqvs,
597
+ − 553
simp_tac simpset])
+ − 554
end
+ − 555
*}
+ − 556
612
+ − 557
section {* Calculation of the Injected Goal *}
597
+ − 558
+ − 559
(*
+ − 560
Injecting repabs means:
+ − 561
+ − 562
For abstractions:
+ − 563
* If the type of the abstraction doesn't need lifting we recurse.
+ − 564
* If it does we add RepAbs around the whole term and check if the
+ − 565
variable needs lifting.
+ − 566
* If it doesn't then we recurse
+ − 567
* If it does we recurse and put 'RepAbs' around all occurences
+ − 568
of the variable in the obtained subterm. This in combination
+ − 569
with the RepAbs above will let us change the type of the
+ − 570
abstraction with rewriting.
+ − 571
For applications:
+ − 572
* If the term is 'Respects' applied to anything we leave it unchanged
+ − 573
* If the term needs lifting and the head is a constant that we know
+ − 574
how to lift, we put a RepAbs and recurse
+ − 575
* If the term needs lifting and the head is a free applied to subterms
+ − 576
(if it is not applied we treated it in Abs branch) then we
+ − 577
put RepAbs and recurse
+ − 578
* Otherwise just recurse.
+ − 579
*)
+ − 580
+ − 581
ML {*
+ − 582
fun mk_repabs lthy (T, T') trm =
+ − 583
Quotient_Def.get_fun repF lthy (T, T')
+ − 584
$ (Quotient_Def.get_fun absF lthy (T, T') $ trm)
+ − 585
*}
+ − 586
+ − 587
ML {*
+ − 588
(* bound variables need to be treated properly, *)
+ − 589
(* as the type of subterms need to be calculated *)
+ − 590
(* in the abstraction case *)
+ − 591
+ − 592
fun inj_repabs_trm lthy (rtrm, qtrm) =
+ − 593
case (rtrm, qtrm) of
+ − 594
(Const (@{const_name "Ball"}, T) $ r $ t, Const (@{const_name "All"}, _) $ t') =>
+ − 595
Const (@{const_name "Ball"}, T) $ r $ (inj_repabs_trm lthy (t, t'))
+ − 596
+ − 597
| (Const (@{const_name "Bex"}, T) $ r $ t, Const (@{const_name "Ex"}, _) $ t') =>
+ − 598
Const (@{const_name "Bex"}, T) $ r $ (inj_repabs_trm lthy (t, t'))
+ − 599
+ − 600
| (Const (@{const_name "Babs"}, T) $ r $ t, t' as (Abs _)) =>
621
c10a46fa0de9
Added a 'rep_abs' in inj_repabs_trm of babs; and proved two lam examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 601
let
c10a46fa0de9
Added a 'rep_abs' in inj_repabs_trm of babs; and proved two lam examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 602
val rty = fastype_of rtrm
c10a46fa0de9
Added a 'rep_abs' in inj_repabs_trm of babs; and proved two lam examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 603
val qty = fastype_of qtrm
c10a46fa0de9
Added a 'rep_abs' in inj_repabs_trm of babs; and proved two lam examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 604
in
c10a46fa0de9
Added a 'rep_abs' in inj_repabs_trm of babs; and proved two lam examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 605
mk_repabs lthy (rty, qty) (Const (@{const_name "Babs"}, T) $ r $ (inj_repabs_trm lthy (t, t')))
c10a46fa0de9
Added a 'rep_abs' in inj_repabs_trm of babs; and proved two lam examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 606
end
597
+ − 607
+ − 608
| (Abs (x, T, t), Abs (x', T', t')) =>
+ − 609
let
+ − 610
val rty = fastype_of rtrm
+ − 611
val qty = fastype_of qtrm
+ − 612
val (y, s) = Term.dest_abs (x, T, t)
+ − 613
val (_, s') = Term.dest_abs (x', T', t')
+ − 614
val yvar = Free (y, T)
+ − 615
val result = Term.lambda_name (y, yvar) (inj_repabs_trm lthy (s, s'))
+ − 616
in
615
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 617
if rty = qty then result
597
+ − 618
else mk_repabs lthy (rty, qty) result
+ − 619
end
+ − 620
+ − 621
| (t $ s, t' $ s') =>
+ − 622
(inj_repabs_trm lthy (t, t')) $ (inj_repabs_trm lthy (s, s'))
+ − 623
+ − 624
| (Free (_, T), Free (_, T')) =>
615
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 625
if T = T' then rtrm
597
+ − 626
else mk_repabs lthy (T, T') rtrm
+ − 627
+ − 628
| (_, Const (@{const_name "op ="}, _)) => rtrm
+ − 629
+ − 630
(* FIXME: check here that rtrm is the corresponding definition for the const *)
+ − 631
| (_, Const (_, T')) =>
+ − 632
let
+ − 633
val rty = fastype_of rtrm
+ − 634
in
615
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 635
if rty = T' then rtrm
597
+ − 636
else mk_repabs lthy (rty, T') rtrm
+ − 637
end
+ − 638
+ − 639
| _ => raise (LIFT_MATCH "injection")
+ − 640
*}
+ − 641
612
+ − 642
section {* Injection Tactic *}
597
+ − 643
+ − 644
ML {*
+ − 645
fun quotient_tac ctxt =
+ − 646
REPEAT_ALL_NEW (FIRST'
+ − 647
[rtac @{thm identity_quotient},
+ − 648
resolve_tac (quotient_rules_get ctxt)])
+ − 649
+ − 650
fun quotient_solver_tac ss = quotient_tac (Simplifier.the_context ss)
+ − 651
val quotient_solver = Simplifier.mk_solver' "Quotient goal solver" quotient_solver_tac
+ − 652
*}
+ − 653
+ − 654
ML {*
+ − 655
fun solve_quotient_assums ctxt thm =
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 656
let
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 657
val goal = hd (Drule.strip_imp_prems (cprop_of thm))
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 658
in
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 659
thm OF [Goal.prove_internal [] goal (fn _ => quotient_tac ctxt 1)]
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 660
end
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 661
handle _ => error "solve_quotient_assums failed. Maybe a quotient_thm is missing"
597
+ − 662
*}
+ − 663
+ − 664
(* Not used *)
+ − 665
(* It proves the Quotient assumptions by calling quotient_tac *)
+ − 666
ML {*
+ − 667
fun solve_quotient_assum i ctxt thm =
+ − 668
let
+ − 669
val tac =
+ − 670
(compose_tac (false, thm, i)) THEN_ALL_NEW
+ − 671
(quotient_tac ctxt);
+ − 672
val gc = Drule.strip_imp_concl (cprop_of thm);
+ − 673
in
+ − 674
Goal.prove_internal [] gc (fn _ => tac 1)
+ − 675
end
+ − 676
handle _ => error "solve_quotient_assum"
+ − 677
*}
+ − 678
+ − 679
definition
+ − 680
"QUOT_TRUE x \<equiv> True"
+ − 681
+ − 682
ML {*
+ − 683
fun find_qt_asm asms =
+ − 684
let
+ − 685
fun find_fun trm =
+ − 686
case trm of
+ − 687
(Const(@{const_name Trueprop}, _) $ (Const (@{const_name QUOT_TRUE}, _) $ _)) => true
+ − 688
| _ => false
+ − 689
in
+ − 690
case find_first find_fun asms of
+ − 691
SOME (_ $ (_ $ (f $ a))) => (f, a)
+ − 692
| SOME _ => error "find_qt_asm: no pair"
+ − 693
| NONE => error "find_qt_asm: no assumption"
+ − 694
end
+ − 695
*}
+ − 696
+ − 697
(*
+ − 698
To prove that the regularised theorem implies the abs/rep injected,
+ − 699
we try:
+ − 700
+ − 701
1) theorems 'trans2' from the appropriate QUOT_TYPE
+ − 702
2) remove lambdas from both sides: lambda_rsp_tac
+ − 703
3) remove Ball/Bex from the right hand side
+ − 704
4) use user-supplied RSP theorems
+ − 705
5) remove rep_abs from the right side
+ − 706
6) reflexivity of equality
+ − 707
7) split applications of lifted type (apply_rsp)
+ − 708
8) split applications of non-lifted type (cong_tac)
+ − 709
9) apply extentionality
+ − 710
A) reflexivity of the relation
+ − 711
B) assumption
+ − 712
(Lambdas under respects may have left us some assumptions)
+ − 713
C) proving obvious higher order equalities by simplifying fun_rel
+ − 714
(not sure if it is still needed?)
+ − 715
D) unfolding lambda on one side
+ − 716
E) simplifying (= ===> =) for simpler respectfulness
+ − 717
+ − 718
*)
+ − 719
+ − 720
lemma quot_true_dests:
+ − 721
shows QT_all: "QUOT_TRUE (All P) \<Longrightarrow> QUOT_TRUE P"
+ − 722
and QT_ex: "QUOT_TRUE (Ex P) \<Longrightarrow> QUOT_TRUE P"
+ − 723
and QT_lam: "QUOT_TRUE (\<lambda>x. P x) \<Longrightarrow> (\<And>x. QUOT_TRUE (P x))"
+ − 724
and QT_ext: "(\<And>x. QUOT_TRUE (a x) \<Longrightarrow> f x = g x) \<Longrightarrow> (QUOT_TRUE a \<Longrightarrow> f = g)"
+ − 725
apply(simp_all add: QUOT_TRUE_def ext)
+ − 726
done
+ − 727
+ − 728
lemma QUOT_TRUE_i: "(QUOT_TRUE (a :: bool) \<Longrightarrow> P) \<Longrightarrow> P"
+ − 729
by (simp add: QUOT_TRUE_def)
+ − 730
+ − 731
lemma QUOT_TRUE_imp: "QUOT_TRUE a \<equiv> QUOT_TRUE b"
+ − 732
by (simp add: QUOT_TRUE_def)
+ − 733
+ − 734
ML {*
+ − 735
fun quot_true_conv1 ctxt fnctn ctrm =
+ − 736
case (term_of ctrm) of
+ − 737
(Const (@{const_name QUOT_TRUE}, _) $ x) =>
+ − 738
let
+ − 739
val fx = fnctn x;
+ − 740
val thy = ProofContext.theory_of ctxt;
+ − 741
val cx = cterm_of thy x;
+ − 742
val cfx = cterm_of thy fx;
+ − 743
val cxt = ctyp_of thy (fastype_of x);
+ − 744
val cfxt = ctyp_of thy (fastype_of fx);
+ − 745
val thm = Drule.instantiate' [SOME cxt, SOME cfxt] [SOME cx, SOME cfx] @{thm QUOT_TRUE_imp}
+ − 746
in
+ − 747
Conv.rewr_conv thm ctrm
+ − 748
end
+ − 749
*}
+ − 750
+ − 751
ML {*
+ − 752
fun quot_true_conv ctxt fnctn ctrm =
+ − 753
case (term_of ctrm) of
+ − 754
(Const (@{const_name QUOT_TRUE}, _) $ _) =>
+ − 755
quot_true_conv1 ctxt fnctn ctrm
+ − 756
| _ $ _ => Conv.comb_conv (quot_true_conv ctxt fnctn) ctrm
+ − 757
| Abs _ => Conv.abs_conv (fn (_, ctxt) => quot_true_conv ctxt fnctn) ctxt ctrm
+ − 758
| _ => Conv.all_conv ctrm
+ − 759
*}
+ − 760
+ − 761
ML {*
+ − 762
fun quot_true_tac ctxt fnctn = CONVERSION
+ − 763
((Conv.params_conv ~1 (fn ctxt =>
+ − 764
(Conv.prems_conv ~1 (quot_true_conv ctxt fnctn)))) ctxt)
+ − 765
*}
+ − 766
+ − 767
ML {* fun dest_comb (f $ a) = (f, a) *}
+ − 768
ML {* fun dest_bcomb ((_ $ l) $ r) = (l, r) *}
+ − 769
(* TODO: Can this be done easier? *)
+ − 770
ML {*
+ − 771
fun unlam t =
+ − 772
case t of
+ − 773
(Abs a) => snd (Term.dest_abs a)
+ − 774
| _ => unlam (Abs("", domain_type (fastype_of t), (incr_boundvars 1 t) $ (Bound 0)))
+ − 775
*}
+ − 776
+ − 777
ML {*
+ − 778
fun dest_fun_type (Type("fun", [T, S])) = (T, S)
+ − 779
| dest_fun_type _ = error "dest_fun_type"
+ − 780
*}
+ − 781
+ − 782
ML {*
+ − 783
val bare_concl = HOLogic.dest_Trueprop o Logic.strip_assums_concl
+ − 784
*}
+ − 785
+ − 786
ML {*
+ − 787
val apply_rsp_tac =
+ − 788
Subgoal.FOCUS (fn {concl, asms, context,...} =>
+ − 789
case ((HOLogic.dest_Trueprop (term_of concl))) of
+ − 790
((R2 $ (f $ x) $ (g $ y))) =>
+ − 791
(let
+ − 792
val (asmf, asma) = find_qt_asm (map term_of asms);
+ − 793
in
+ − 794
if (fastype_of asmf) = (fastype_of f) then no_tac else let
+ − 795
val ty_a = fastype_of x;
+ − 796
val ty_b = fastype_of asma;
+ − 797
val ty_c = range_type (type_of f);
+ − 798
val thy = ProofContext.theory_of context;
+ − 799
val ty_inst = map (SOME o (ctyp_of thy)) [ty_a, ty_b, ty_c];
+ − 800
val thm = Drule.instantiate' ty_inst [] @{thm apply_rsp}
+ − 801
val te = solve_quotient_assums context thm
+ − 802
val t_inst = map (SOME o (cterm_of thy)) [R2, f, g, x, y];
+ − 803
val thm = Drule.instantiate' [] t_inst te
+ − 804
in
+ − 805
compose_tac (false, thm, 2) 1
+ − 806
end
+ − 807
end
+ − 808
handle ERROR "find_qt_asm: no pair" => no_tac)
+ − 809
| _ => no_tac)
+ − 810
*}
+ − 811
+ − 812
ML {*
629
+ − 813
fun equals_rsp_tac R ctxt =
+ − 814
let
+ − 815
val t = domain_type (fastype_of R);
+ − 816
val thy = ProofContext.theory_of ctxt
+ − 817
val thm = Drule.instantiate' [SOME (ctyp_of thy t)] [SOME (cterm_of thy R)] @{thm equals_rsp}
+ − 818
in
+ − 819
rtac thm THEN' RANGE [quotient_tac ctxt]
+ − 820
end
+ − 821
handle THM _ => K no_tac | TYPE _ => K no_tac | TERM _ => K no_tac
+ − 822
*}
+ − 823
+ − 824
ML {*
597
+ − 825
fun rep_abs_rsp_tac ctxt =
+ − 826
SUBGOAL (fn (goal, i) =>
+ − 827
case (bare_concl goal) of
+ − 828
(rel $ _ $ (rep $ (abs $ _))) =>
+ − 829
(let
+ − 830
val thy = ProofContext.theory_of ctxt;
+ − 831
val (ty_a, ty_b) = dest_fun_type (fastype_of abs);
+ − 832
val ty_inst = map (SOME o (ctyp_of thy)) [ty_a, ty_b];
+ − 833
val t_inst = map (SOME o (cterm_of thy)) [rel, abs, rep];
+ − 834
val thm = Drule.instantiate' ty_inst t_inst @{thm rep_abs_rsp}
+ − 835
val te = solve_quotient_assums ctxt thm
+ − 836
in
+ − 837
rtac te i
+ − 838
end
+ − 839
handle _ => no_tac)
+ − 840
| _ => no_tac)
+ − 841
*}
+ − 842
+ − 843
ML {*
629
+ − 844
fun inj_repabs_tac_match ctxt = SUBGOAL (fn (goal, i) =>
597
+ − 845
(case (bare_concl goal) of
+ − 846
(* (R1 ===> R2) (\<lambda>x\<dots>) (\<lambda>y\<dots>) ----> \<lbrakk>R1 x y\<rbrakk> \<Longrightarrow> R2 (\<dots>x) (\<dots>y) *)
+ − 847
((Const (@{const_name fun_rel}, _) $ _ $ _) $ (Abs _) $ (Abs _))
+ − 848
=> rtac @{thm fun_rel_id} THEN' quot_true_tac ctxt unlam
+ − 849
+ − 850
(* (op =) (Ball\<dots>) (Ball\<dots>) ----> (op =) (\<dots>) (\<dots>) *)
+ − 851
| (Const (@{const_name "op ="},_) $
+ − 852
(Const(@{const_name Ball},_) $ (Const (@{const_name Respects}, _) $ _) $ _) $
+ − 853
(Const(@{const_name Ball},_) $ (Const (@{const_name Respects}, _) $ _) $ _))
+ − 854
=> rtac @{thm ball_rsp} THEN' dtac @{thm QT_all}
+ − 855
+ − 856
(* (R1 ===> op =) (Ball\<dots>) (Ball\<dots>) ----> \<lbrakk>R1 x y\<rbrakk> \<Longrightarrow> (Ball\<dots>x) = (Ball\<dots>y) *)
+ − 857
| (Const (@{const_name fun_rel}, _) $ _ $ _) $
+ − 858
(Const(@{const_name Ball},_) $ (Const (@{const_name Respects}, _) $ _) $ _) $
+ − 859
(Const(@{const_name Ball},_) $ (Const (@{const_name Respects}, _) $ _) $ _)
+ − 860
=> rtac @{thm fun_rel_id} THEN' quot_true_tac ctxt unlam
+ − 861
+ − 862
(* (op =) (Bex\<dots>) (Bex\<dots>) ----> (op =) (\<dots>) (\<dots>) *)
+ − 863
| Const (@{const_name "op ="},_) $
+ − 864
(Const(@{const_name Bex},_) $ (Const (@{const_name Respects}, _) $ _) $ _) $
+ − 865
(Const(@{const_name Bex},_) $ (Const (@{const_name Respects}, _) $ _) $ _)
+ − 866
=> rtac @{thm bex_rsp} THEN' dtac @{thm QT_ex}
+ − 867
+ − 868
(* (R1 ===> op =) (Bex\<dots>) (Bex\<dots>) ----> \<lbrakk>R1 x y\<rbrakk> \<Longrightarrow> (Bex\<dots>x) = (Bex\<dots>y) *)
+ − 869
| (Const (@{const_name fun_rel}, _) $ _ $ _) $
+ − 870
(Const(@{const_name Bex},_) $ (Const (@{const_name Respects}, _) $ _) $ _) $
+ − 871
(Const(@{const_name Bex},_) $ (Const (@{const_name Respects}, _) $ _) $ _)
+ − 872
=> rtac @{thm fun_rel_id} THEN' quot_true_tac ctxt unlam
+ − 873
+ − 874
| (_ $
+ − 875
(Const(@{const_name Babs},_) $ (Const (@{const_name Respects}, _) $ _) $ _) $
+ − 876
(Const(@{const_name Babs},_) $ (Const (@{const_name Respects}, _) $ _) $ _))
+ − 877
=> rtac @{thm babs_rsp} THEN' RANGE [quotient_tac ctxt]
+ − 878
629
+ − 879
| Const (@{const_name "op ="},_) $ (R $ _ $ _) $ (_ $ _ $ _) => (rtac @{thm refl} ORELSE'
+ − 880
(equals_rsp_tac R ctxt THEN' RANGE [
+ − 881
quot_true_tac ctxt (fst o dest_bcomb), quot_true_tac ctxt (snd o dest_bcomb)]))
+ − 882
597
+ − 883
(* reflexivity of operators arising from Cong_tac *)
629
+ − 884
| Const (@{const_name "op ="},_) $ _ $ _ => rtac @{thm refl}
597
+ − 885
+ − 886
(* respectfulness of constants; in particular of a simple relation *)
+ − 887
| _ $ (Const _) $ (Const _) (* fun_rel, list_rel, etc but not equality *)
+ − 888
=> resolve_tac (rsp_rules_get ctxt) THEN_ALL_NEW quotient_tac ctxt
+ − 889
+ − 890
(* R (\<dots>) (Rep (Abs \<dots>)) ----> R (\<dots>) (\<dots>) *)
+ − 891
(* observe ---> *)
624
c4299ce27e46
Removed pattern from quot_rel_rsp, since list_rel and all used introduced ones cannot be patterned
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 892
| _ $ _ $ _
c4299ce27e46
Removed pattern from quot_rel_rsp, since list_rel and all used introduced ones cannot be patterned
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 893
=> (rtac @{thm quot_rel_rsp} THEN_ALL_NEW quotient_tac ctxt) ORELSE' rep_abs_rsp_tac ctxt
597
+ − 894
+ − 895
| _ => error "inj_repabs_tac not a relation"
+ − 896
) i)
+ − 897
*}
+ − 898
+ − 899
ML {*
629
+ − 900
fun inj_repabs_step_tac ctxt rel_refl =
597
+ − 901
(FIRST' [
629
+ − 902
NDT ctxt "0" (inj_repabs_tac_match ctxt),
597
+ − 903
(* R (t $ \<dots>) (t' $ \<dots>) ----> apply_rsp provided type of t needs lifting *)
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 904
597
+ − 905
NDT ctxt "A" (apply_rsp_tac ctxt THEN'
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 906
RANGE [quot_true_tac ctxt (fst o dest_comb), quot_true_tac ctxt (snd o dest_comb)]),
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 907
597
+ − 908
(* (op =) (t $ \<dots>) (t' $ \<dots>) ----> Cong provided type of t does not need lifting *)
+ − 909
(* merge with previous tactic *)
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 910
NDT ctxt "C" (Cong_Tac.cong_tac @{thm cong} THEN'
597
+ − 911
(RANGE [quot_true_tac ctxt (fst o dest_comb), quot_true_tac ctxt (snd o dest_comb)])),
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 912
597
+ − 913
(* (op =) (\<lambda>x\<dots>) (\<lambda>x\<dots>) ----> (op =) (\<dots>) (\<dots>) *)
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 914
NDT ctxt "D" (rtac @{thm ext} THEN' quot_true_tac ctxt unlam),
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 915
597
+ − 916
(* resolving with R x y assumptions *)
+ − 917
NDT ctxt "E" (atac),
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 918
597
+ − 919
(* reflexivity of the basic relations *)
+ − 920
(* R \<dots> \<dots> *)
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 921
NDT ctxt "F" (resolve_tac rel_refl)
597
+ − 922
])
+ − 923
*}
+ − 924
+ − 925
ML {*
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 926
fun inj_repabs_tac ctxt =
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 927
let
612
+ − 928
val rel_refl = map (OF1 @{thm equivp_reflp}) (equiv_rules_get ctxt)
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 929
in
629
+ − 930
inj_repabs_step_tac ctxt rel_refl
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 931
end
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 932
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 933
fun all_inj_repabs_tac ctxt =
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 934
REPEAT_ALL_NEW (inj_repabs_tac ctxt)
597
+ − 935
*}
+ − 936
615
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 937
section {* Cleaning of the Theorem *}
597
+ − 938
631
+ − 939
(* Since the patterns for the lhs are different; there are 3 different make-insts *)
+ − 940
(* 1: does ? \<rightarrow> id *)
+ − 941
(* 2: does id \<rightarrow> ? *)
+ − 942
(* 3: does ? \<rightarrow> ? *)
597
+ − 943
ML {*
+ − 944
fun make_inst lhs t =
+ − 945
let
+ − 946
val _ $ (Abs (_, _, (f as Var (_, Type ("fun", [T, _]))) $ u)) = lhs;
+ − 947
val _ $ (Abs (_, _, g)) = t;
+ − 948
fun mk_abs i t =
+ − 949
if incr_boundvars i u aconv t then Bound i
+ − 950
else (case t of
+ − 951
t1 $ t2 => mk_abs i t1 $ mk_abs i t2
+ − 952
| Abs (s, T, t') => Abs (s, T, mk_abs (i + 1) t')
+ − 953
| Bound j => if i = j then error "make_inst" else t
+ − 954
| _ => t);
+ − 955
in (f, Abs ("x", T, mk_abs 0 g)) end;
+ − 956
*}
+ − 957
602
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 958
ML {*
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 959
fun make_inst2 lhs t =
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 960
let
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 961
val _ $ (Abs (_, _, (_ $ ((f as Var (_, Type ("fun", [T, _]))) $ u)))) = lhs;
631
+ − 962
val _ $ (Abs (_, _, (_ $ g))) = t;
+ − 963
fun mk_abs i t =
+ − 964
if incr_boundvars i u aconv t then Bound i
+ − 965
else (case t of
+ − 966
t1 $ t2 => mk_abs i t1 $ mk_abs i t2
+ − 967
| Abs (s, T, t') => Abs (s, T, mk_abs (i + 1) t')
+ − 968
| Bound j => if i = j then error "make_inst" else t
+ − 969
| _ => t);
+ − 970
in (f, Abs ("x", T, mk_abs 0 g)) end;
+ − 971
*}
+ − 972
+ − 973
ML {*
+ − 974
fun make_inst3 lhs t =
+ − 975
let
+ − 976
val _ $ (Abs (_, _, (_ $ ((f as Var (_, Type ("fun", [T, _]))) $ u)))) = lhs;
602
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 977
val _ $ (Abs (_, _, (_ $ g))) = t;
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 978
fun mk_abs i t =
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 979
if incr_boundvars i u aconv t then Bound i
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 980
else (case t of
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 981
t1 $ t2 => mk_abs i t1 $ mk_abs i t2
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 982
| Abs (s, T, t') => Abs (s, T, mk_abs (i + 1) t')
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 983
| Bound j => if i = j then error "make_inst" else t
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 984
| _ => t);
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 985
in (f, Abs ("x", T, mk_abs 0 g)) end;
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 986
*}
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 987
597
+ − 988
ML {*
+ − 989
fun lambda_prs_simple_conv ctxt ctrm =
+ − 990
case (term_of ctrm) of
602
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 991
((Const (@{const_name fun_map}, _) $ r1 $ a2) $ (Abs _)) =>
608
+ − 992
(let
597
+ − 993
val thy = ProofContext.theory_of ctxt
+ − 994
val (ty_b, ty_a) = dest_fun_type (fastype_of r1)
+ − 995
val (ty_c, ty_d) = dest_fun_type (fastype_of a2)
+ − 996
val tyinst = map (SOME o (ctyp_of thy)) [ty_a, ty_b, ty_c, ty_d]
+ − 997
val tinst = [NONE, NONE, SOME (cterm_of thy r1), NONE, SOME (cterm_of thy a2)]
+ − 998
val lpi = Drule.instantiate' tyinst tinst @{thm lambda_prs}
+ − 999
val te = @{thm eq_reflection} OF [solve_quotient_assums ctxt (solve_quotient_assums ctxt lpi)]
602
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 1000
val ti =
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 1001
(let
614
+ − 1002
val ts = MetaSimplifier.rewrite_rule (id_simps_get ctxt) te
602
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 1003
val (insp, inst) = make_inst (term_of (Thm.lhs_of ts)) (term_of ctrm)
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 1004
in
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 1005
Drule.instantiate ([], [(cterm_of thy insp, cterm_of thy inst)]) ts
608
+ − 1006
end handle _ => (* TODO handle only Bind | Error "make_inst" *)
602
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 1007
let
631
+ − 1008
val ts = MetaSimplifier.rewrite_rule (id_simps_get ctxt) te
+ − 1009
val _ = tracing ("ts rule:\n" ^ (Syntax.string_of_term ctxt (prop_of ts)));
+ − 1010
val _ = tracing ("redex:\n" ^ (Syntax.string_of_term ctxt (term_of ctrm)));
+ − 1011
val (insp, inst) = make_inst2 (term_of (Thm.lhs_of ts)) (term_of ctrm)
+ − 1012
in
+ − 1013
Drule.instantiate ([], [(cterm_of thy insp, cterm_of thy inst)]) ts
+ − 1014
end handle _ => (* TODO handle only Bind | Error "make_inst" *)
+ − 1015
let
+ − 1016
val (insp, inst) = make_inst3 (term_of (Thm.lhs_of te)) (term_of ctrm)
602
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 1017
val td = Drule.instantiate ([], [(cterm_of thy insp, cterm_of thy inst)]) te
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 1018
in
614
+ − 1019
MetaSimplifier.rewrite_rule (id_simps_get ctxt) td
602
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 1020
end);
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 1021
val _ = if not (Term.is_Const a2 andalso fst (dest_Const a2) = @{const_name "id"}) then
597
+ − 1022
(tracing "lambda_prs";
+ − 1023
tracing ("redex:\n" ^ (Syntax.string_of_term ctxt (term_of ctrm)));
+ − 1024
tracing ("lpi rule:\n" ^ (Syntax.string_of_term ctxt (prop_of lpi)));
+ − 1025
tracing ("te rule:\n" ^ (Syntax.string_of_term ctxt (prop_of te)));
602
e56eeb9fedb3
make_inst for lambda_prs where the second quotient is not identity.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 1026
tracing ("ti rule:\n" ^ (Syntax.string_of_term ctxt (prop_of ti))))
597
+ − 1027
else ()
631
+ − 1028
597
+ − 1029
in
+ − 1030
Conv.rewr_conv ti ctrm
+ − 1031
end
608
+ − 1032
handle _ => Conv.all_conv ctrm)
597
+ − 1033
| _ => Conv.all_conv ctrm
+ − 1034
*}
+ − 1035
+ − 1036
ML {*
+ − 1037
val lambda_prs_conv =
+ − 1038
More_Conv.top_conv lambda_prs_simple_conv
+ − 1039
+ − 1040
fun lambda_prs_tac ctxt = CONVERSION (lambda_prs_conv ctxt)
+ − 1041
*}
+ − 1042
612
+ − 1043
(* 1. conversion (is not a pattern) *)
+ − 1044
thm lambda_prs
+ − 1045
(* 2. folding of definitions: (rep ---> abs) oldConst == newconst *)
+ − 1046
(* and simplification with *)
+ − 1047
thm all_prs ex_prs
615
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1048
(* 3. simplification with *)
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1049
thm fun_map.simps Quotient_abs_rep Quotient_rel_rep id_simps
612
+ − 1050
(* 4. Test for refl *)
597
+ − 1051
+ − 1052
ML {*
+ − 1053
fun clean_tac lthy =
+ − 1054
let
+ − 1055
val thy = ProofContext.theory_of lthy;
+ − 1056
val defs = map (Thm.varifyT o symmetric o #def) (qconsts_dest thy)
615
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1057
(* FIXME: why is the Thm.varifyT needed: example where it fails is LamEx *)
597
+ − 1058
val thms1 = @{thms all_prs ex_prs} @ defs
639
+ − 1059
val thms2 = @{thms fun_map.simps Quotient_abs_rep Quotient_rel_rep} @ (id_simps_get lthy)
597
+ − 1060
fun simps thms = (mk_minimal_ss lthy) addsimps thms addSolver quotient_solver
+ − 1061
in
+ − 1062
EVERY' [lambda_prs_tac lthy,
+ − 1063
simp_tac (simps thms1),
+ − 1064
simp_tac (simps thms2),
636
+ − 1065
lambda_prs_tac lthy,
597
+ − 1066
TRY o rtac refl]
+ − 1067
end
+ − 1068
*}
+ − 1069
612
+ − 1070
section {* Tactic for genralisation of free variables in a goal *}
597
+ − 1071
+ − 1072
ML {*
+ − 1073
fun inst_spec ctrm =
+ − 1074
Drule.instantiate' [SOME (ctyp_of_term ctrm)] [NONE, SOME ctrm] @{thm spec}
+ − 1075
+ − 1076
fun inst_spec_tac ctrms =
+ − 1077
EVERY' (map (dtac o inst_spec) ctrms)
+ − 1078
+ − 1079
fun all_list xs trm =
+ − 1080
fold (fn (x, T) => fn t' => HOLogic.mk_all (x, T, t')) xs trm
+ − 1081
+ − 1082
fun apply_under_Trueprop f =
+ − 1083
HOLogic.dest_Trueprop #> f #> HOLogic.mk_Trueprop
+ − 1084
+ − 1085
fun gen_frees_tac ctxt =
+ − 1086
SUBGOAL (fn (concl, i) =>
+ − 1087
let
+ − 1088
val thy = ProofContext.theory_of ctxt
+ − 1089
val vrs = Term.add_frees concl []
+ − 1090
val cvrs = map (cterm_of thy o Free) vrs
+ − 1091
val concl' = apply_under_Trueprop (all_list vrs) concl
+ − 1092
val goal = Logic.mk_implies (concl', concl)
+ − 1093
val rule = Goal.prove ctxt [] [] goal
+ − 1094
(K (EVERY1 [inst_spec_tac (rev cvrs), atac]))
+ − 1095
in
+ − 1096
rtac rule i
+ − 1097
end)
+ − 1098
*}
+ − 1099
616
+ − 1100
section {* General Shape of the Lifting Procedure *}
597
+ − 1101
+ − 1102
(* - A is the original raw theorem *)
+ − 1103
(* - B is the regularized theorem *)
+ − 1104
(* - C is the rep/abs injected version of B *)
+ − 1105
(* - D is the lifted theorem *)
+ − 1106
(* *)
+ − 1107
(* - b is the regularization step *)
+ − 1108
(* - c is the rep/abs injection step *)
+ − 1109
(* - d is the cleaning part *)
+ − 1110
+ − 1111
lemma lifting_procedure:
+ − 1112
assumes a: "A"
606
+ − 1113
and b: "A \<longrightarrow> B"
597
+ − 1114
and c: "B = C"
+ − 1115
and d: "C = D"
+ − 1116
shows "D"
612
+ − 1117
using a b c d
+ − 1118
by simp
597
+ − 1119
+ − 1120
ML {*
+ − 1121
fun lift_match_error ctxt fun_str rtrm qtrm =
+ − 1122
let
+ − 1123
val rtrm_str = Syntax.string_of_term ctxt rtrm
+ − 1124
val qtrm_str = Syntax.string_of_term ctxt qtrm
+ − 1125
val msg = [enclose "[" "]" fun_str, "The quotient theorem\n", qtrm_str,
+ − 1126
"and the lifted theorem\n", rtrm_str, "do not match"]
+ − 1127
in
+ − 1128
error (space_implode " " msg)
+ − 1129
end
+ − 1130
*}
+ − 1131
+ − 1132
ML {*
+ − 1133
fun procedure_inst ctxt rtrm qtrm =
+ − 1134
let
+ − 1135
val thy = ProofContext.theory_of ctxt
+ − 1136
val rtrm' = HOLogic.dest_Trueprop rtrm
+ − 1137
val qtrm' = HOLogic.dest_Trueprop qtrm
+ − 1138
val reg_goal =
+ − 1139
Syntax.check_term ctxt (regularize_trm ctxt rtrm' qtrm')
+ − 1140
handle (LIFT_MATCH s) => lift_match_error ctxt s rtrm qtrm
+ − 1141
val inj_goal =
+ − 1142
Syntax.check_term ctxt (inj_repabs_trm ctxt (reg_goal, qtrm'))
+ − 1143
handle (LIFT_MATCH s) => lift_match_error ctxt s rtrm qtrm
+ − 1144
in
+ − 1145
Drule.instantiate' []
+ − 1146
[SOME (cterm_of thy rtrm'),
+ − 1147
SOME (cterm_of thy reg_goal),
+ − 1148
SOME (cterm_of thy inj_goal)] @{thm lifting_procedure}
+ − 1149
end
+ − 1150
*}
+ − 1151
+ − 1152
ML {*
616
+ − 1153
(* the tactic leaves three subgoals to be proved *)
597
+ − 1154
fun procedure_tac ctxt rthm =
+ − 1155
ObjectLogic.full_atomize_tac
+ − 1156
THEN' gen_frees_tac ctxt
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1157
THEN' CSUBGOAL (fn (goal, i) =>
597
+ − 1158
let
+ − 1159
val rthm' = atomize_thm rthm
610
2bee5ca44ef5
removed "global" data and lookup functions; had to move a tactic out from the inj_repabs_match tactic since apply_rsp interferes with a trans2 rule for ===>
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1160
val rule = procedure_inst ctxt (prop_of rthm') (term_of goal)
612
+ − 1161
val bare_goal = snd (Thm.dest_comb goal)
+ − 1162
val quot_weak = Drule.instantiate' [] [SOME bare_goal] @{thm QUOT_TRUE_i}
597
+ − 1163
in
612
+ − 1164
(rtac rule THEN' RANGE [rtac rthm', K all_tac, rtac quot_weak]) i
597
+ − 1165
end)
+ − 1166
*}
+ − 1167
616
+ − 1168
(* automatic proofs *)
612
+ − 1169
ML {*
616
+ − 1170
fun SOLVES' tac = tac THEN_ALL_NEW (K no_tac)
615
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1171
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1172
fun WARN (tac, msg) i st =
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1173
case Seq.pull ((SOLVES' tac) i st) of
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1174
NONE => (warning msg; Seq.single st)
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1175
| seqcell => Seq.make (fn () => seqcell)
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1176
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1177
fun RANGE_WARN xs = RANGE (map WARN xs)
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1178
*}
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1179
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1180
ML {*
612
+ − 1181
fun lift_tac ctxt rthm =
+ − 1182
procedure_tac ctxt rthm
615
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1183
THEN' RANGE_WARN [(regularize_tac ctxt, "Regularize proof failed."),
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1184
(all_inj_repabs_tac ctxt, "Injection proof failed."),
386a6b1a5203
the lift_tac produces a warning message if one of the three automatic proofs fails
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1185
(clean_tac ctxt, "Cleaning proof failed.")]
612
+ − 1186
*}
+ − 1187
636
+ − 1188
(* methods / interface *)
632
+ − 1189
ML {*
+ − 1190
(* FIXME: if the argument order changes then this can be just one function *)
+ − 1191
fun mk_method1 tac thm ctxt =
+ − 1192
SIMPLE_METHOD (HEADGOAL (tac ctxt thm))
+ − 1193
+ − 1194
fun mk_method2 tac ctxt =
+ − 1195
SIMPLE_METHOD (HEADGOAL (tac ctxt))
+ − 1196
*}
+ − 1197
+ − 1198
method_setup lifting =
637
+ − 1199
{* Attrib.thm >> (mk_method1 lift_tac) *}
632
+ − 1200
{* Lifting of theorems to quotient types. *}
+ − 1201
+ − 1202
method_setup lifting_setup =
637
+ − 1203
{* Attrib.thm >> (mk_method1 procedure_tac) *}
632
+ − 1204
{* Sets up the three goals for the lifting procedure. *}
+ − 1205
+ − 1206
method_setup regularize =
+ − 1207
{* Scan.succeed (mk_method2 regularize_tac) *}
+ − 1208
{* Proves automatically the regularization goals from the lifting procedure. *}
+ − 1209
+ − 1210
method_setup injection =
+ − 1211
{* Scan.succeed (mk_method2 all_inj_repabs_tac) *}
+ − 1212
{* Proves automatically the rep/abs injection goals from the lifting procedure. *}
+ − 1213
+ − 1214
method_setup cleaning =
+ − 1215
{* Scan.succeed (mk_method2 clean_tac) *}
+ − 1216
{* Proves automatically the cleaning goals from the lifting procedure. *}
+ − 1217
597
+ − 1218
end
+ − 1219