author | blanchet |
Wed, 21 Dec 2016 11:14:37 +0100 | |
changeset 64624 | f3f457535fe2 |
parent 64607 | 20f3dbfe4b24 |
child 64628 | 19bc22274cd9 |
permissions | -rw-r--r-- |
55061 | 1 |
(* Title: HOL/Tools/BNF/bnf_fp_def_sugar_tactics.ML |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
2 |
Author: Jasmin Blanchette, TU Muenchen |
57668 | 3 |
Author: Martin Desharnais, TU Muenchen |
4 |
Copyright 2012, 2013, 2014 |
|
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
5 |
|
49389 | 6 |
Tactics for datatype and codatatype sugar. |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
7 |
*) |
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
8 |
|
49636 | 9 |
signature BNF_FP_DEF_SUGAR_TACTICS = |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
10 |
sig |
63842 | 11 |
val sumprod_thms_rel: thm list |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
12 |
|
64607 | 13 |
val co_induct_inst_as_projs_tac: Proof.context -> int -> tactic |
58093 | 14 |
val mk_case_transfer_tac: Proof.context -> thm -> thm list -> tactic |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
15 |
val mk_coinduct_tac: Proof.context -> thm list -> int -> int list -> thm -> thm list -> |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
16 |
thm list -> thm list -> thm list -> thm list -> thm list list -> thm list list list -> |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
17 |
thm list list list -> tactic |
55867 | 18 |
val mk_corec_tac: thm list -> thm list -> thm -> thm -> thm -> thm -> Proof.context -> tactic |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
19 |
val mk_corec_disc_iff_tac: thm list -> thm list -> thm list -> Proof.context -> tactic |
58734 | 20 |
val mk_co_rec_o_map_tac: Proof.context -> thm -> thm list -> thm list -> thm list -> thm -> thm -> |
21 |
thm Seq.seq |
|
58448 | 22 |
val mk_corec_transfer_tac: Proof.context -> cterm list -> cterm list -> thm list -> thm list -> |
23 |
thm list -> thm list -> thm list -> ''a list -> ''a list list -> ''a list list list list -> |
|
24 |
''a list list list list -> tactic |
|
49501 | 25 |
val mk_ctor_iff_dtor_tac: Proof.context -> ctyp option list -> cterm -> cterm -> thm -> thm -> |
26 |
tactic |
|
58327 | 27 |
val mk_ctr_transfer_tac: Proof.context -> thm list -> thm list -> tactic |
60728 | 28 |
val mk_disc_transfer_tac: Proof.context -> thm -> thm -> thm list -> tactic |
49161
a8e74375d971
fixed (n + 1)st bug in "mk_exhaust_tac" -- arose with uncurried constructors
blanchet
parents:
49160
diff
changeset
|
29 |
val mk_exhaust_tac: Proof.context -> int -> thm list -> thm -> thm -> tactic |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
30 |
val mk_half_distinct_tac: Proof.context -> thm -> thm -> thm list -> tactic |
49590 | 31 |
val mk_induct_tac: Proof.context -> int -> int list -> int list list -> int list list list -> |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
32 |
thm list -> thm -> thm list -> thm list -> thm list -> thm list list -> tactic |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
33 |
val mk_inject_tac: Proof.context -> thm -> thm -> thm -> tactic |
64415
7ca48c274553
more uniform treatment of codatatype vs. datatype map and rel theorem generation (towards nonuniform codatatypes)
blanchet
parents:
64067
diff
changeset
|
34 |
val mk_map_tac: Proof.context -> thm list -> thm -> thm -> thm list -> thm list -> thm list -> |
7ca48c274553
more uniform treatment of codatatype vs. datatype map and rel theorem generation (towards nonuniform codatatypes)
blanchet
parents:
64067
diff
changeset
|
35 |
tactic |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
36 |
val mk_map_disc_iff_tac: Proof.context -> cterm -> thm -> thm list -> thm list -> tactic |
58326
7e142efcee1a
make 'rel_sel' and 'map_sel' tactics more robust
desharna
parents:
58181
diff
changeset
|
37 |
val mk_map_sel_tac: Proof.context -> cterm -> thm -> thm list -> thm list -> thm list -> |
7e142efcee1a
make 'rel_sel' and 'map_sel' tactics more robust
desharna
parents:
58181
diff
changeset
|
38 |
thm list -> tactic |
55867 | 39 |
val mk_rec_tac: thm list -> thm list -> thm list -> thm -> thm -> thm -> thm -> Proof.context -> |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
40 |
tactic |
58446 | 41 |
val mk_rec_transfer_tac: Proof.context -> int -> int list -> cterm list -> cterm list -> |
58966 | 42 |
term list list list list -> thm list -> thm list -> thm list -> thm list -> tactic |
64415
7ca48c274553
more uniform treatment of codatatype vs. datatype map and rel theorem generation (towards nonuniform codatatypes)
blanchet
parents:
64067
diff
changeset
|
43 |
val mk_rel_tac: Proof.context -> thm list -> thm -> thm -> thm list -> thm list -> thm list -> |
7ca48c274553
more uniform treatment of codatatype vs. datatype map and rel theorem generation (towards nonuniform codatatypes)
blanchet
parents:
64067
diff
changeset
|
44 |
tactic |
62335 | 45 |
val mk_rel_case_tac: Proof.context -> cterm -> cterm -> thm -> thm list -> thm list -> thm list -> |
46 |
thm list -> thm list -> tactic |
|
57301
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57152
diff
changeset
|
47 |
val mk_rel_coinduct0_tac: Proof.context -> thm -> cterm list -> thm list -> thm list -> |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57152
diff
changeset
|
48 |
thm list list -> thm list list -> thm list list -> thm list -> thm list -> thm list -> |
57471 | 49 |
thm list -> thm list -> thm list -> tactic |
50 |
val mk_rel_induct0_tac: Proof.context -> thm -> thm list -> cterm list -> thm list -> |
|
51 |
thm list list -> thm list -> thm list -> thm list -> thm list -> tactic |
|
57563 | 52 |
val mk_rel_sel_tac: Proof.context -> cterm -> cterm -> thm -> thm list -> thm list -> thm list -> |
58326
7e142efcee1a
make 'rel_sel' and 'map_sel' tactics more robust
desharna
parents:
58181
diff
changeset
|
53 |
thm list -> thm list -> thm list -> tactic |
58676 | 54 |
val mk_sel_transfer_tac: Proof.context -> int -> thm list -> thm -> tactic |
63851 | 55 |
val mk_set0_tac: Proof.context -> thm list -> thm list -> thm -> thm list -> thm list -> |
56 |
thm list -> thm list -> thm list -> tactic |
|
57893 | 57 |
val mk_set_cases_tac: Proof.context -> cterm -> thm list -> thm -> thm list -> tactic |
57700 | 58 |
val mk_set_induct0_tac: Proof.context -> cterm list -> thm list -> thm list -> thm list -> |
59 |
thm list -> thm list -> thm list -> thm list -> tactic |
|
57891 | 60 |
val mk_set_intros_tac: Proof.context -> thm list -> tactic |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
61 |
val mk_set_sel_tac: Proof.context -> cterm -> thm -> thm list -> thm list -> thm list -> tactic |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
62 |
end; |
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
63 |
|
49636 | 64 |
structure BNF_FP_Def_Sugar_Tactics : BNF_FP_DEF_SUGAR_TACTICS = |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
65 |
struct |
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
66 |
|
56991
8e9ca31e9b8e
generate 'disc_map_iff[simp]' theorem for (co)datatypes
desharna
parents:
56990
diff
changeset
|
67 |
open Ctr_Sugar_Util |
49125 | 68 |
open BNF_Tactics |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
69 |
open BNF_Util |
51850
106afdf5806c
renamed a few FP-related files, to make it clear that these are not the sum of LFP + GFP but rather shared basic libraries
blanchet
parents:
51843
diff
changeset
|
70 |
open BNF_FP_Util |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
71 |
|
58446 | 72 |
val case_sum_transfer = @{thm case_sum_transfer}; |
63170 | 73 |
val case_sum_transfer_eq = @{thm case_sum_transfer[of "op =" _ "op =", simplified sum.rel_eq]}; |
58446 | 74 |
val case_prod_transfer = @{thm case_prod_transfer}; |
63170 | 75 |
val case_prod_transfer_eq = @{thm case_prod_transfer[of "op =" "op =", simplified prod.rel_eq]}; |
58446 | 76 |
|
49590 | 77 |
val basic_simp_thms = @{thms simp_thms(7,8,12,14,22,24)}; |
78 |
val more_simp_thms = basic_simp_thms @ @{thms simp_thms(11,15,16,21)}; |
|
57303 | 79 |
val simp_thms' = @{thms simp_thms(6,7,8,11,12,15,16,22,24)}; |
49590 | 80 |
|
55966 | 81 |
val sumprod_thms_map = @{thms id_apply map_prod_simp prod.case sum.case map_sum.simps}; |
63841 | 82 |
val sumprod_thms_rel = @{thms rel_sum_simps rel_prod_inject prod.inject id_apply conj_assoc}; |
57891 | 83 |
val basic_sumprod_thms_set = |
63852 | 84 |
@{thms UN_empty UN_insert UN_iff Un_empty_left Un_empty_right Un_iff Union_Un_distrib o_apply |
85 |
map_prod_simp mem_Collect_eq prod_set_simps map_sum.simps sum_set_simps}; |
|
57891 | 86 |
val sumprod_thms_set = @{thms UN_simps(10) image_iff} @ basic_sumprod_thms_set; |
49368 | 87 |
|
58359
3782c7b0d1cc
avoid 'subst_tac' when possible (it is suspected of not helping 'HOL-Proofs')
blanchet
parents:
58353
diff
changeset
|
88 |
fun is_def_looping def = |
3782c7b0d1cc
avoid 'subst_tac' when possible (it is suspected of not helping 'HOL-Proofs')
blanchet
parents:
58353
diff
changeset
|
89 |
(case Thm.prop_of def of |
63835 | 90 |
Const (@{const_name Pure.eq}, _) $ lhs $ rhs => Term.exists_subterm (curry (op aconv) lhs) rhs |
58359
3782c7b0d1cc
avoid 'subst_tac' when possible (it is suspected of not helping 'HOL-Proofs')
blanchet
parents:
58353
diff
changeset
|
91 |
| _ => false); |
3782c7b0d1cc
avoid 'subst_tac' when possible (it is suspected of not helping 'HOL-Proofs')
blanchet
parents:
58353
diff
changeset
|
92 |
|
49668 | 93 |
fun hhf_concl_conv cv ctxt ct = |
94 |
(case Thm.term_of ct of |
|
56245 | 95 |
Const (@{const_name Pure.all}, _) $ Abs _ => |
49668 | 96 |
Conv.arg_conv (Conv.abs_conv (hhf_concl_conv cv o snd) ctxt) ct |
97 |
| _ => Conv.concl_conv ~1 cv ct); |
|
98 |
||
54922 | 99 |
fun co_induct_inst_as_projs ctxt k thm = |
49368 | 100 |
let |
59582 | 101 |
val fs = Term.add_vars (Thm.prop_of thm) [] |
49368 | 102 |
|> filter (fn (_, Type (@{type_name fun}, [_, T'])) => T' <> HOLogic.boolT | _ => false); |
60784 | 103 |
fun mk_inst (xi, T) = (xi, Thm.cterm_of ctxt (mk_proj T (num_binder_types T) k)); |
49368 | 104 |
in |
60784 | 105 |
infer_instantiate ctxt (map mk_inst fs) thm |
49368 | 106 |
end; |
107 |
||
54922 | 108 |
val co_induct_inst_as_projs_tac = PRIMITIVE oo co_induct_inst_as_projs; |
49368 | 109 |
|
62335 | 110 |
fun mk_case_transfer_tac ctxt rel_case cases = |
111 |
let val n = length (tl (Thm.prems_of rel_case)) in |
|
60728 | 112 |
REPEAT_DETERM (HEADGOAL (rtac ctxt rel_funI)) THEN |
62335 | 113 |
HEADGOAL (etac ctxt rel_case) THEN |
58093 | 114 |
ALLGOALS (hyp_subst_tac ctxt) THEN |
115 |
unfold_thms_tac ctxt cases THEN |
|
60728 | 116 |
ALLGOALS (fn k => (select_prem_tac ctxt n (dtac ctxt asm_rl) k) k) THEN |
117 |
ALLGOALS (REPEAT_DETERM o (rotate_tac ~1 THEN' dtac ctxt rel_funD THEN' |
|
60752 | 118 |
(assume_tac ctxt THEN' etac ctxt thin_rl ORELSE' rtac ctxt refl)) THEN' assume_tac ctxt) |
58093 | 119 |
end; |
120 |
||
58327 | 121 |
fun mk_ctr_transfer_tac ctxt rel_intros rel_eqs = |
58095 | 122 |
HEADGOAL Goal.conjunction_tac THEN |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59270
diff
changeset
|
123 |
ALLGOALS (REPEAT o (resolve_tac ctxt (rel_funI :: rel_intros) THEN' |
62535 | 124 |
TRY o (REPEAT_DETERM1 o (SELECT_GOAL (unfold_thms_tac ctxt rel_eqs) THEN' |
125 |
(assume_tac ctxt ORELSE' hyp_subst_tac ctxt THEN' rtac ctxt refl))))); |
|
58095 | 126 |
|
60728 | 127 |
fun mk_disc_transfer_tac ctxt rel_sel exhaust_disc distinct_disc = |
58095 | 128 |
let |
129 |
fun last_disc_tac iffD = |
|
60752 | 130 |
HEADGOAL (rtac ctxt (rotate_prems ~1 exhaust_disc) THEN' assume_tac ctxt THEN' |
131 |
REPEAT_DETERM o (rotate_tac ~1 THEN' dtac ctxt (rotate_prems 1 iffD) THEN' |
|
132 |
assume_tac ctxt THEN' rotate_tac ~1 THEN' |
|
60757 | 133 |
etac ctxt (rotate_prems 1 notE) THEN' eresolve_tac ctxt distinct_disc)); |
58095 | 134 |
in |
135 |
HEADGOAL Goal.conjunction_tac THEN |
|
60728 | 136 |
REPEAT_DETERM (HEADGOAL (rtac ctxt rel_funI THEN' dtac ctxt (rel_sel RS iffD1) THEN' |
60752 | 137 |
REPEAT_DETERM o (etac ctxt conjE) THEN' (assume_tac ctxt ORELSE' rtac ctxt iffI))) THEN |
58095 | 138 |
TRY (last_disc_tac iffD2) THEN TRY (last_disc_tac iffD1) |
139 |
end; |
|
140 |
||
49501 | 141 |
fun mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor sumEN' = |
60728 | 142 |
unfold_thms_tac ctxt (ctor_iff_dtor :: ctr_defs) THEN HEADGOAL (rtac ctxt sumEN') THEN |
143 |
HEADGOAL (EVERY' (maps (fn k => [select_prem_tac ctxt n (rotate_tac 1) k, |
|
60752 | 144 |
REPEAT_DETERM o dtac ctxt meta_spec, etac ctxt meta_mp, assume_tac ctxt]) (1 upto n))); |
49125 | 145 |
|
49501 | 146 |
fun mk_ctor_iff_dtor_tac ctxt cTs cctor cdtor ctor_dtor dtor_ctor = |
60728 | 147 |
HEADGOAL (rtac ctxt iffI THEN' |
58634
9f10d82e8188
added parameterized ML antiquotations @{map N}, @{fold N}, @{fold_map N}, @{split_list N};
wenzelm
parents:
58507
diff
changeset
|
148 |
EVERY' (@{map 3} (fn cTs => fn cx => fn th => |
60801 | 149 |
dtac ctxt (Thm.instantiate' cTs [NONE, NONE, SOME cx] arg_cong) THEN' |
52324 | 150 |
SELECT_GOAL (unfold_thms_tac ctxt [th]) THEN' |
60752 | 151 |
assume_tac ctxt) [rev cTs, cTs] [cdtor, cctor] [dtor_ctor, ctor_dtor])); |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
152 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
153 |
fun mk_half_distinct_tac ctxt ctor_inject abs_inject ctr_defs = |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
154 |
unfold_thms_tac ctxt (ctor_inject :: abs_inject :: @{thms sum.inject} @ ctr_defs) THEN |
60728 | 155 |
HEADGOAL (rtac ctxt @{thm sum.distinct(1)}); |
49127 | 156 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
157 |
fun mk_inject_tac ctxt ctr_def ctor_inject abs_inject = |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
158 |
unfold_thms_tac ctxt [ctr_def] THEN |
60728 | 159 |
HEADGOAL (rtac ctxt (ctor_inject RS ssubst)) THEN |
56765 | 160 |
unfold_thms_tac ctxt (abs_inject :: @{thms sum.inject prod.inject conj_assoc}) THEN |
60728 | 161 |
HEADGOAL (rtac ctxt refl); |
49126 | 162 |
|
55867 | 163 |
val rec_unfold_thms = |
55414
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
55083
diff
changeset
|
164 |
@{thms comp_def convol_def fst_conv id_def case_prod_Pair_iden snd_conv split_conv |
55966 | 165 |
case_unit_Unity} @ sumprod_thms_map; |
49205 | 166 |
|
58734 | 167 |
fun mk_co_rec_o_map_tac ctxt co_rec_def pre_map_defs map_ident0s abs_inverses xtor_co_rec_o_map = |
58732 | 168 |
let |
58734 | 169 |
val rec_o_map_simps = @{thms o_def[abs_def] id_def case_prod_app case_sum_map_sum map_sum.simps |
170 |
case_prod_map_prod id_bnf_def map_prod_simp map_sum_if_distrib_then map_sum_if_distrib_else |
|
171 |
if_distrib[THEN sym]}; |
|
58732 | 172 |
in |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59270
diff
changeset
|
173 |
HEADGOAL (subst_tac ctxt (SOME [1, 2]) [co_rec_def] THEN' |
60728 | 174 |
rtac ctxt (xtor_co_rec_o_map RS trans) THEN' |
58732 | 175 |
CONVERSION Thm.eta_long_conversion THEN' |
176 |
asm_simp_tac (ss_only (pre_map_defs @ distinct Thm.eq_thm_prop (map_ident0s @ abs_inverses) @ |
|
177 |
rec_o_map_simps) ctxt)) |
|
178 |
end; |
|
179 |
||
64624 | 180 |
fun mk_rec_tac pre_map_defs map_ident0s rec_defs ctor_rec pre_abs_inverse abs_inverse ctr_def ctxt = |
58359
3782c7b0d1cc
avoid 'subst_tac' when possible (it is suspected of not helping 'HOL-Proofs')
blanchet
parents:
58353
diff
changeset
|
181 |
HEADGOAL ((if is_def_looping ctr_def then subst_tac ctxt NONE |
3782c7b0d1cc
avoid 'subst_tac' when possible (it is suspected of not helping 'HOL-Proofs')
blanchet
parents:
58353
diff
changeset
|
182 |
else SELECT_GOAL o unfold_thms_tac ctxt) [ctr_def]) THEN |
64624 | 183 |
unfold_thms_tac ctxt (ctor_rec :: pre_abs_inverse :: abs_inverse :: rec_defs @ |
60728 | 184 |
pre_map_defs @ map_ident0s @ rec_unfold_thms) THEN HEADGOAL (rtac ctxt refl); |
49205 | 185 |
|
58966 | 186 |
fun mk_rec_transfer_tac ctxt nn ns actives passives xssss rec_defs ctor_rec_transfers rel_pre_T_defs |
58446 | 187 |
rel_eqs = |
188 |
let |
|
189 |
val ctor_rec_transfers' = |
|
60784 | 190 |
map (infer_instantiate' ctxt (map SOME (passives @ actives))) ctor_rec_transfers; |
58507 | 191 |
val total_n = Integer.sum ns; |
58966 | 192 |
val True = @{term True}; |
58446 | 193 |
in |
194 |
HEADGOAL Goal.conjunction_tac THEN |
|
195 |
EVERY (map (fn ctor_rec_transfer => |
|
60728 | 196 |
REPEAT_DETERM (HEADGOAL (rtac ctxt rel_funI)) THEN |
58446 | 197 |
unfold_thms_tac ctxt rec_defs THEN |
60728 | 198 |
HEADGOAL (etac ctxt (mk_rel_funDN_rotated (nn + 1) ctor_rec_transfer)) THEN |
58446 | 199 |
unfold_thms_tac ctxt rel_pre_T_defs THEN |
58966 | 200 |
EVERY (fst (@{fold_map 2} (fn k => fn xsss => fn acc => |
201 |
rpair (k + acc) |
|
60728 | 202 |
(HEADGOAL (rtac ctxt (mk_rel_funDN_rotated 2 @{thm comp_transfer})) THEN |
203 |
HEADGOAL (rtac ctxt @{thm vimage2p_rel_fun}) THEN |
|
58446 | 204 |
unfold_thms_tac ctxt rel_eqs THEN |
58966 | 205 |
EVERY (@{map 2} (fn n => fn xss => |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59270
diff
changeset
|
206 |
REPEAT_DETERM (HEADGOAL (resolve_tac ctxt |
58966 | 207 |
[mk_rel_funDN 2 case_sum_transfer_eq, mk_rel_funDN 2 case_sum_transfer])) THEN |
60728 | 208 |
HEADGOAL (select_prem_tac ctxt total_n (dtac ctxt asm_rl) (acc + n)) THEN |
58446 | 209 |
HEADGOAL (SELECT_GOAL (HEADGOAL |
60752 | 210 |
(REPEAT_DETERM o (assume_tac ctxt ORELSE' resolve_tac ctxt |
58966 | 211 |
[mk_rel_funDN 1 case_prod_transfer_eq, |
212 |
mk_rel_funDN 1 case_prod_transfer, |
|
213 |
rel_funI]) THEN_ALL_NEW |
|
214 |
(Subgoal.FOCUS (fn {prems, ...} => |
|
215 |
let val thm = prems |
|
216 |
|> permute_like (op =) (True :: flat xss) (True :: flat_rec_arg_args xss) |
|
217 |
|> Library.foldl1 (fn (acc, elem) => elem RS (acc RS rel_funD)) |
|
60728 | 218 |
in HEADGOAL (rtac ctxt thm) end) ctxt))))) |
58966 | 219 |
(1 upto k) xsss))) |
220 |
ns xssss 0))) |
|
58446 | 221 |
ctor_rec_transfers') |
222 |
end; |
|
223 |
||
55966 | 224 |
val corec_unfold_thms = @{thms id_def} @ sumprod_thms_map; |
49683 | 225 |
|
57399 | 226 |
fun mk_corec_tac corec_defs map_ident0s ctor_dtor_corec pre_map_def abs_inverse ctr_def ctxt = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
227 |
let |
57399 | 228 |
val ss = ss_only (pre_map_def :: abs_inverse :: map_ident0s @ corec_unfold_thms @ |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
229 |
@{thms o_apply vimage2p_def if_True if_False}) ctxt; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
230 |
in |
55867 | 231 |
unfold_thms_tac ctxt (ctr_def :: corec_defs) THEN |
60728 | 232 |
HEADGOAL (rtac ctxt (ctor_dtor_corec RS trans) THEN' asm_simp_tac ss) THEN_MAYBE |
233 |
HEADGOAL (rtac ctxt refl ORELSE' rtac ctxt (@{thm unit_eq} RS arg_cong)) |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
234 |
end; |
49213 | 235 |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
236 |
fun mk_corec_disc_iff_tac case_splits' corecs discs ctxt = |
58634
9f10d82e8188
added parameterized ML antiquotations @{map N}, @{fold N}, @{fold_map N}, @{split_list N};
wenzelm
parents:
58507
diff
changeset
|
237 |
EVERY (@{map 3} (fn case_split_tac => fn corec_thm => fn disc => |
55867 | 238 |
HEADGOAL case_split_tac THEN unfold_thms_tac ctxt [corec_thm] THEN |
52324 | 239 |
HEADGOAL (asm_simp_tac (ss_only basic_simp_thms ctxt)) THEN |
60728 | 240 |
(if is_refl disc then all_tac else HEADGOAL (rtac ctxt disc))) |
241 |
(map (rtac ctxt) case_splits' @ [K all_tac]) corecs discs); |
|
49482 | 242 |
|
58448 | 243 |
fun mk_corec_transfer_tac ctxt actives passives type_definitions corec_defs dtor_corec_transfers |
244 |
rel_pre_T_defs rel_eqs pgs pss qssss gssss = |
|
245 |
let |
|
246 |
val num_pgs = length pgs; |
|
247 |
fun prem_no_of x = 1 + find_index (curry (op =) x) pgs; |
|
248 |
||
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59270
diff
changeset
|
249 |
val Inl_Inr_Pair_tac = REPEAT_DETERM o (resolve_tac ctxt |
58968 | 250 |
[mk_rel_funDN 1 @{thm Inl_transfer}, |
63170 | 251 |
mk_rel_funDN 1 @{thm Inl_transfer[of "op =" "op =", simplified sum.rel_eq]}, |
58968 | 252 |
mk_rel_funDN 1 @{thm Inr_transfer}, |
63170 | 253 |
mk_rel_funDN 1 @{thm Inr_transfer[of "op =" "op =", simplified sum.rel_eq]}, |
58968 | 254 |
mk_rel_funDN 2 @{thm Pair_transfer}, |
63170 | 255 |
mk_rel_funDN 2 @{thm Pair_transfer[of "op =" "op =", simplified prod.rel_eq]}]); |
58448 | 256 |
|
257 |
fun mk_unfold_If_tac total pos = |
|
258 |
HEADGOAL (Inl_Inr_Pair_tac THEN' |
|
60728 | 259 |
rtac ctxt (mk_rel_funDN 3 @{thm If_transfer}) THEN' |
260 |
select_prem_tac ctxt total (dtac ctxt asm_rl) pos THEN' |
|
60752 | 261 |
dtac ctxt rel_funD THEN' assume_tac ctxt THEN' assume_tac ctxt); |
58448 | 262 |
|
263 |
fun mk_unfold_Inl_Inr_Pair_tac total pos = |
|
264 |
HEADGOAL (Inl_Inr_Pair_tac THEN' |
|
60728 | 265 |
select_prem_tac ctxt total (dtac ctxt asm_rl) pos THEN' |
60752 | 266 |
dtac ctxt rel_funD THEN' assume_tac ctxt THEN' assume_tac ctxt); |
58448 | 267 |
|
268 |
fun mk_unfold_arg_tac qs gs = |
|
269 |
EVERY (map (mk_unfold_If_tac num_pgs o prem_no_of) qs) THEN |
|
270 |
EVERY (map (mk_unfold_Inl_Inr_Pair_tac num_pgs o prem_no_of) gs); |
|
271 |
||
272 |
fun mk_unfold_ctr_tac type_definition qss gss = |
|
60728 | 273 |
HEADGOAL (rtac ctxt (mk_rel_funDN 1 (@{thm Abs_transfer} OF |
58448 | 274 |
[type_definition, type_definition])) THEN' Inl_Inr_Pair_tac) THEN |
275 |
(case (qss, gss) of |
|
60728 | 276 |
([], []) => HEADGOAL (rtac ctxt refl) |
58448 | 277 |
| _ => EVERY (map2 mk_unfold_arg_tac qss gss)); |
278 |
||
279 |
fun mk_unfold_type_tac type_definition ps qsss gsss = |
|
280 |
let |
|
281 |
val p_tacs = map (mk_unfold_If_tac num_pgs o prem_no_of) ps; |
|
282 |
val qg_tacs = map2 (mk_unfold_ctr_tac type_definition) qsss gsss; |
|
283 |
fun mk_unfold_ty [] [qg_tac] = qg_tac |
|
284 |
| mk_unfold_ty (p_tac :: p_tacs) (qg_tac :: qg_tacs) = |
|
285 |
p_tac THEN qg_tac THEN mk_unfold_ty p_tacs qg_tacs |
|
286 |
in |
|
60728 | 287 |
HEADGOAL (rtac ctxt rel_funI) THEN mk_unfold_ty p_tacs qg_tacs |
58448 | 288 |
end; |
289 |
||
290 |
fun mk_unfold_corec_type_tac dtor_corec_transfer corec_def = |
|
291 |
let |
|
292 |
val active :: actives' = actives; |
|
60784 | 293 |
val dtor_corec_transfer' = |
294 |
infer_instantiate' ctxt |
|
295 |
(SOME active :: map SOME passives @ map SOME actives') dtor_corec_transfer; |
|
58448 | 296 |
in |
60728 | 297 |
HEADGOAL Goal.conjunction_tac THEN REPEAT_DETERM (HEADGOAL (rtac ctxt rel_funI)) THEN |
58448 | 298 |
unfold_thms_tac ctxt [corec_def] THEN |
60728 | 299 |
HEADGOAL (etac ctxt (mk_rel_funDN_rotated (1 + length actives) dtor_corec_transfer')) THEN |
58448 | 300 |
unfold_thms_tac ctxt (rel_pre_T_defs @ rel_eqs) |
301 |
end; |
|
302 |
||
303 |
fun mk_unfold_prop_tac dtor_corec_transfer corec_def = |
|
304 |
mk_unfold_corec_type_tac dtor_corec_transfer corec_def THEN |
|
58634
9f10d82e8188
added parameterized ML antiquotations @{map N}, @{fold N}, @{fold_map N}, @{split_list N};
wenzelm
parents:
58507
diff
changeset
|
305 |
EVERY (@{map 4} mk_unfold_type_tac type_definitions pss qssss gssss); |
58448 | 306 |
in |
307 |
HEADGOAL Goal.conjunction_tac THEN |
|
308 |
EVERY (map2 mk_unfold_prop_tac dtor_corec_transfers corec_defs) |
|
309 |
end; |
|
310 |
||
51798 | 311 |
fun solve_prem_prem_tac ctxt = |
61760 | 312 |
REPEAT o (eresolve_tac ctxt @{thms bexE rev_bexI} ORELSE' |
313 |
rtac ctxt @{thm rev_bexI[OF UNIV_I]} ORELSE' hyp_subst_tac ctxt ORELSE' |
|
314 |
resolve_tac ctxt @{thms disjI1 disjI2}) THEN' |
|
60752 | 315 |
(rtac ctxt refl ORELSE' assume_tac ctxt ORELSE' rtac ctxt @{thm singletonI}); |
49426 | 316 |
|
64624 | 317 |
fun mk_induct_leverage_prem_prems_tac ctxt nn kks pre_abs_inverses abs_inverses set_maps |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
318 |
pre_set_defs = |
61760 | 319 |
HEADGOAL (EVERY' (maps (fn kk => [select_prem_tac ctxt nn (dtac ctxt meta_spec) kk, |
320 |
etac ctxt meta_mp, |
|
64624 | 321 |
SELECT_GOAL (unfold_thms_tac ctxt (pre_set_defs @ pre_abs_inverses @ abs_inverses @ set_maps @ |
55966 | 322 |
sumprod_thms_set)), |
52324 | 323 |
solve_prem_prem_tac ctxt]) (rev kks))); |
49368 | 324 |
|
64624 | 325 |
fun mk_induct_discharge_prem_tac ctxt nn n pre_abs_inverses abs_inverses set_maps pre_set_defs m k |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
326 |
kks = |
49429
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
327 |
let val r = length kks in |
60728 | 328 |
HEADGOAL (EVERY' [select_prem_tac ctxt n (rotate_tac 1) k, rotate_tac ~1, hyp_subst_tac ctxt, |
329 |
REPEAT_DETERM_N m o (dtac ctxt meta_spec THEN' rotate_tac ~1)]) THEN |
|
49391 | 330 |
EVERY [REPEAT_DETERM_N r |
60728 | 331 |
(HEADGOAL (rotate_tac ~1 THEN' dtac ctxt meta_mp THEN' rotate_tac 1) THEN prefer_tac 2), |
60752 | 332 |
if r > 0 then ALLGOALS (Goal.norm_hhf_tac ctxt) else all_tac, HEADGOAL (assume_tac ctxt), |
64624 | 333 |
mk_induct_leverage_prem_prems_tac ctxt nn kks pre_abs_inverses abs_inverses set_maps |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
334 |
pre_set_defs] |
49391 | 335 |
end; |
49368 | 336 |
|
64624 | 337 |
fun mk_induct_tac ctxt nn ns mss kksss ctr_defs ctor_induct' pre_abs_inverses abs_inverses set_maps |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
338 |
pre_set_defss = |
49590 | 339 |
let val n = Integer.sum ns in |
58359
3782c7b0d1cc
avoid 'subst_tac' when possible (it is suspected of not helping 'HOL-Proofs')
blanchet
parents:
58353
diff
changeset
|
340 |
(if exists is_def_looping ctr_defs then |
3782c7b0d1cc
avoid 'subst_tac' when possible (it is suspected of not helping 'HOL-Proofs')
blanchet
parents:
58353
diff
changeset
|
341 |
EVERY (map (fn def => HEADGOAL (subst_asm_tac ctxt NONE [def])) ctr_defs) |
3782c7b0d1cc
avoid 'subst_tac' when possible (it is suspected of not helping 'HOL-Proofs')
blanchet
parents:
58353
diff
changeset
|
342 |
else |
3782c7b0d1cc
avoid 'subst_tac' when possible (it is suspected of not helping 'HOL-Proofs')
blanchet
parents:
58353
diff
changeset
|
343 |
unfold_thms_tac ctxt ctr_defs) THEN |
60728 | 344 |
HEADGOAL (rtac ctxt ctor_induct') THEN co_induct_inst_as_projs_tac ctxt 0 THEN |
58634
9f10d82e8188
added parameterized ML antiquotations @{map N}, @{fold N}, @{fold_map N}, @{split_list N};
wenzelm
parents:
58507
diff
changeset
|
345 |
EVERY (@{map 4} (EVERY oooo @{map 3} o |
64624 | 346 |
mk_induct_discharge_prem_tac ctxt nn n pre_abs_inverses abs_inverses set_maps) |
347 |
pre_set_defss mss (unflat mss (1 upto n)) kksss) |
|
49368 | 348 |
end; |
349 |
||
64624 | 350 |
fun mk_coinduct_same_ctr_tac ctxt rel_eqs pre_rel_def pre_abs_inverse abs_inverse dtor_ctor ctr_def |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
351 |
discs sels = |
51798 | 352 |
hyp_subst_tac ctxt THEN' |
49665 | 353 |
CONVERSION (hhf_concl_conv |
354 |
(Conv.top_conv (K (Conv.try_conv (Conv.rewr_conv ctr_def))) ctxt) ctxt) THEN' |
|
49642
9f884142334c
fixed simplification of prod and sum relators to avoid issues with e.g. codata ('a, 'b) k = K "'a + 'b"
blanchet
parents:
49639
diff
changeset
|
355 |
SELECT_GOAL (unfold_thms_tac ctxt (pre_rel_def :: dtor_ctor :: sels)) THEN' |
64624 | 356 |
SELECT_GOAL (unfold_thms_tac ctxt (pre_rel_def :: pre_abs_inverse :: abs_inverse :: dtor_ctor :: |
55966 | 357 |
sels @ sumprod_thms_rel @ @{thms o_apply vimage2p_def})) THEN' |
60752 | 358 |
(assume_tac ctxt ORELSE' REPEAT o etac ctxt conjE THEN' |
56765 | 359 |
full_simp_tac (ss_only (no_refl discs @ rel_eqs @ more_simp_thms) ctxt) THEN' |
60728 | 360 |
REPEAT o etac ctxt conjE THEN_MAYBE' REPEAT o hyp_subst_tac ctxt THEN' |
60752 | 361 |
REPEAT o (resolve_tac ctxt [refl, conjI] ORELSE' assume_tac ctxt)); |
49590 | 362 |
|
52966 | 363 |
fun mk_coinduct_distinct_ctrs_tac ctxt discs discs' = |
54198
4fadf746f2d5
got rid of annoying duplicate rewrite rule warnings
blanchet
parents:
53690
diff
changeset
|
364 |
let |
4fadf746f2d5
got rid of annoying duplicate rewrite rule warnings
blanchet
parents:
53690
diff
changeset
|
365 |
val discs'' = map (perhaps (try (fn th => th RS @{thm notnotD}))) (discs @ discs') |
4fadf746f2d5
got rid of annoying duplicate rewrite rule warnings
blanchet
parents:
53690
diff
changeset
|
366 |
|> distinct Thm.eq_thm_prop; |
4fadf746f2d5
got rid of annoying duplicate rewrite rule warnings
blanchet
parents:
53690
diff
changeset
|
367 |
in |
60728 | 368 |
hyp_subst_tac ctxt THEN' REPEAT o etac ctxt conjE THEN' |
54198
4fadf746f2d5
got rid of annoying duplicate rewrite rule warnings
blanchet
parents:
53690
diff
changeset
|
369 |
full_simp_tac (ss_only (refl :: no_refl discs'' @ basic_simp_thms) ctxt) |
4fadf746f2d5
got rid of annoying duplicate rewrite rule warnings
blanchet
parents:
53690
diff
changeset
|
370 |
end; |
49590 | 371 |
|
64624 | 372 |
fun mk_coinduct_discharge_prem_tac ctxt rel_eqs' nn kk n pre_rel_def pre_abs_inverse abs_inverse |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
373 |
dtor_ctor exhaust ctr_defs discss selss = |
49590 | 374 |
let val ks = 1 upto n in |
61760 | 375 |
EVERY' ([rtac ctxt allI, rtac ctxt allI, rtac ctxt impI, |
376 |
select_prem_tac ctxt nn (dtac ctxt meta_spec) kk, dtac ctxt meta_spec, dtac ctxt meta_mp, |
|
377 |
assume_tac ctxt, rtac ctxt exhaust, K (co_induct_inst_as_projs_tac ctxt 0), |
|
378 |
hyp_subst_tac ctxt] @ |
|
58634
9f10d82e8188
added parameterized ML antiquotations @{map N}, @{fold N}, @{fold_map N}, @{split_list N};
wenzelm
parents:
58507
diff
changeset
|
379 |
@{map 4} (fn k => fn ctr_def => fn discs => fn sels => |
60728 | 380 |
EVERY' ([rtac ctxt exhaust, K (co_induct_inst_as_projs_tac ctxt 1)] @ |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
381 |
map2 (fn k' => fn discs' => |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
382 |
if k' = k then |
64624 | 383 |
mk_coinduct_same_ctr_tac ctxt rel_eqs' pre_rel_def pre_abs_inverse abs_inverse |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
384 |
dtor_ctor ctr_def discs sels |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
385 |
else |
52966 | 386 |
mk_coinduct_distinct_ctrs_tac ctxt discs discs') ks discss)) ks ctr_defs discss selss) |
49590 | 387 |
end; |
388 |
||
64624 | 389 |
fun mk_coinduct_tac ctxt rel_eqs' nn ns dtor_coinduct' pre_rel_defs pre_abs_inverses abs_inverses |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55642
diff
changeset
|
390 |
dtor_ctors exhausts ctr_defss discsss selsss = |
60728 | 391 |
HEADGOAL (rtac ctxt dtor_coinduct' THEN' |
58634
9f10d82e8188
added parameterized ML antiquotations @{map N}, @{fold N}, @{fold_map N}, @{split_list N};
wenzelm
parents:
58507
diff
changeset
|
392 |
EVERY' (@{map 10} (mk_coinduct_discharge_prem_tac ctxt rel_eqs' nn) |
64624 | 393 |
(1 upto nn) ns pre_rel_defs pre_abs_inverses abs_inverses dtor_ctors exhausts ctr_defss |
394 |
discsss selsss)); |
|
49590 | 395 |
|
64415
7ca48c274553
more uniform treatment of codatatype vs. datatype map and rel theorem generation (towards nonuniform codatatypes)
blanchet
parents:
64067
diff
changeset
|
396 |
fun mk_map_tac ctxt abs_inverses pre_map_def map_ctor live_nesting_map_id0s ctr_defs' |
63845
61a03e429cbd
generalized code towards nonuniform (co)datatypes
blanchet
parents:
63842
diff
changeset
|
397 |
extra_unfolds = |
63840 | 398 |
TRYALL Goal.conjunction_tac THEN |
64415
7ca48c274553
more uniform treatment of codatatype vs. datatype map and rel theorem generation (towards nonuniform codatatypes)
blanchet
parents:
64067
diff
changeset
|
399 |
unfold_thms_tac ctxt (pre_map_def :: map_ctor :: abs_inverses @ live_nesting_map_id0s @ |
7ca48c274553
more uniform treatment of codatatype vs. datatype map and rel theorem generation (towards nonuniform codatatypes)
blanchet
parents:
64067
diff
changeset
|
400 |
ctr_defs' @ extra_unfolds @ sumprod_thms_map @ |
64067 | 401 |
@{thms o_apply id_apply id_o o_id}) THEN |
63840 | 402 |
ALLGOALS (rtac ctxt refl); |
403 |
||
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
404 |
fun mk_map_disc_iff_tac ctxt ct exhaust discs maps = |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
405 |
TRYALL Goal.conjunction_tac THEN |
60784 | 406 |
ALLGOALS (rtac ctxt (infer_instantiate' ctxt [SOME ct] exhaust) THEN_ALL_NEW |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
407 |
REPEAT_DETERM o hyp_subst_tac ctxt) THEN |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
408 |
unfold_thms_tac ctxt maps THEN |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
409 |
unfold_thms_tac ctxt (map (fn thm => thm RS eqFalseI |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
410 |
handle THM _ => thm RS eqTrueI) discs) THEN |
60728 | 411 |
ALLGOALS (rtac ctxt refl ORELSE' rtac ctxt TrueI); |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
412 |
|
58326
7e142efcee1a
make 'rel_sel' and 'map_sel' tactics more robust
desharna
parents:
58181
diff
changeset
|
413 |
fun mk_map_sel_tac ctxt ct exhaust discs maps sels map_id0s = |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
414 |
TRYALL Goal.conjunction_tac THEN |
63841 | 415 |
ALLGOALS (rtac ctxt (infer_instantiate' ctxt [SOME ct] exhaust) THEN_ALL_NEW |
416 |
REPEAT_DETERM o hyp_subst_tac ctxt) THEN |
|
417 |
unfold_thms_tac ctxt ((discs RL [eqTrueI, eqFalseI]) @ |
|
418 |
@{thms not_True_eq_False not_False_eq_True}) THEN |
|
419 |
TRYALL (etac ctxt FalseE ORELSE' etac ctxt @{thm TrueE}) THEN |
|
420 |
unfold_thms_tac ctxt (@{thm id_apply} :: maps @ sels @ map_id0s) THEN |
|
421 |
ALLGOALS (rtac ctxt refl); |
|
422 |
||
64415
7ca48c274553
more uniform treatment of codatatype vs. datatype map and rel theorem generation (towards nonuniform codatatypes)
blanchet
parents:
64067
diff
changeset
|
423 |
fun mk_rel_tac ctxt abs_inverses pre_rel_def rel_ctor live_nesting_rel_eqs ctr_defs' extra_unfolds = |
63841 | 424 |
TRYALL Goal.conjunction_tac THEN |
64415
7ca48c274553
more uniform treatment of codatatype vs. datatype map and rel theorem generation (towards nonuniform codatatypes)
blanchet
parents:
64067
diff
changeset
|
425 |
unfold_thms_tac ctxt (pre_rel_def :: rel_ctor :: abs_inverses @ live_nesting_rel_eqs @ ctr_defs' @ |
7ca48c274553
more uniform treatment of codatatype vs. datatype map and rel theorem generation (towards nonuniform codatatypes)
blanchet
parents:
64067
diff
changeset
|
426 |
extra_unfolds @ sumprod_thms_rel @ @{thms vimage2p_def o_apply sum.inject |
63842 | 427 |
sum.distinct(1)[THEN eq_False[THEN iffD2]] not_False_eq_True}) THEN |
63841 | 428 |
ALLGOALS (resolve_tac ctxt [TrueI, refl]); |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
429 |
|
62335 | 430 |
fun mk_rel_case_tac ctxt ct1 ct2 exhaust injects rel_injects distincts rel_distincts rel_eqs = |
60784 | 431 |
HEADGOAL (rtac ctxt (infer_instantiate' ctxt [SOME ct1] exhaust) THEN_ALL_NEW |
432 |
rtac ctxt (infer_instantiate' ctxt [SOME ct2] exhaust) THEN_ALL_NEW |
|
57525 | 433 |
hyp_subst_tac ctxt) THEN |
61344 | 434 |
unfold_thms_tac ctxt (rel_eqs @ injects @ rel_injects @ |
435 |
@{thms conj_imp_eq_imp_imp simp_thms(6) True_implies_equals} @ |
|
57529 | 436 |
map (fn thm => thm RS eqFalseI) (distincts @ rel_distincts) @ |
437 |
map (fn thm => thm RS eqTrueI) rel_injects) THEN |
|
60752 | 438 |
TRYALL (assume_tac ctxt ORELSE' etac ctxt FalseE ORELSE' |
61344 | 439 |
(REPEAT_DETERM o dtac ctxt meta_spec THEN' |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59270
diff
changeset
|
440 |
TRY o filter_prems_tac ctxt |
57562 | 441 |
(forall (curry (op <>) (HOLogic.mk_Trueprop @{term False})) o Logic.strip_imp_prems) THEN' |
61344 | 442 |
REPEAT_DETERM o (dtac ctxt meta_mp THEN' rtac ctxt refl) THEN' |
443 |
(assume_tac ctxt ORELSE' Goal.assume_rule_tac ctxt))); |
|
57525 | 444 |
|
57301
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57152
diff
changeset
|
445 |
fun mk_rel_coinduct0_tac ctxt dtor_rel_coinduct cts assms exhausts discss selss ctor_defss |
57558
6bb3dd7f8097
took out 'rel_cases' for now because of failing tactic
blanchet
parents:
57529
diff
changeset
|
446 |
dtor_ctors ctor_injects abs_injects rel_pre_defs abs_inverses nesting_rel_eqs = |
60728 | 447 |
rtac ctxt dtor_rel_coinduct 1 THEN |
58634
9f10d82e8188
added parameterized ML antiquotations @{map N}, @{fold N}, @{fold_map N}, @{split_list N};
wenzelm
parents:
58507
diff
changeset
|
448 |
EVERY (@{map 11} (fn ct => fn assm => fn exhaust => fn discs => fn sels => fn ctor_defs => |
57670 | 449 |
fn dtor_ctor => fn ctor_inject => fn abs_inject => fn rel_pre_def => fn abs_inverse => |
60728 | 450 |
(rtac ctxt exhaust THEN_ALL_NEW (rtac ctxt exhaust THEN_ALL_NEW |
60784 | 451 |
(dtac ctxt (rotate_prems ~1 (infer_instantiate' ctxt [NONE, NONE, NONE, NONE, SOME ct] |
57670 | 452 |
@{thm arg_cong2} RS iffD1)) THEN' |
60752 | 453 |
assume_tac ctxt THEN' assume_tac ctxt THEN' hyp_subst_tac ctxt THEN' dtac ctxt assm THEN' |
60728 | 454 |
REPEAT_DETERM o etac ctxt conjE))) 1 THEN |
57668 | 455 |
unfold_thms_tac ctxt ((discs RL [eqTrueI, eqFalseI]) @ sels @ simp_thms') THEN |
57528 | 456 |
unfold_thms_tac ctxt (dtor_ctor :: rel_pre_def :: abs_inverse :: ctor_inject :: |
58128 | 457 |
abs_inject :: ctor_defs @ nesting_rel_eqs @ simp_thms' @ |
62335 | 458 |
@{thms id_bnf_def rel_sum_simps rel_prod_inject vimage2p_def Inl_Inr_False |
58353 | 459 |
iffD2[OF eq_False Inr_not_Inl] sum.inject prod.inject}) THEN |
61760 | 460 |
REPEAT_DETERM (HEADGOAL ((REPEAT_DETERM o etac ctxt conjE) THEN' |
461 |
(REPEAT_DETERM o rtac ctxt conjI) THEN' (rtac ctxt refl ORELSE' assume_tac ctxt)))) |
|
57301
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57152
diff
changeset
|
462 |
cts assms exhausts discss selss ctor_defss dtor_ctors ctor_injects abs_injects rel_pre_defs |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57152
diff
changeset
|
463 |
abs_inverses); |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57152
diff
changeset
|
464 |
|
57471 | 465 |
fun mk_rel_induct0_tac ctxt ctor_rel_induct assms cterms exhausts ctor_defss ctor_injects |
466 |
rel_pre_list_defs Abs_inverses nesting_rel_eqs = |
|
60728 | 467 |
rtac ctxt ctor_rel_induct 1 THEN EVERY (@{map 6} (fn cterm => fn exhaust => fn ctor_defs => |
57471 | 468 |
fn ctor_inject => fn rel_pre_list_def => fn Abs_inverse => |
60728 | 469 |
HEADGOAL (rtac ctxt exhaust THEN_ALL_NEW (rtac ctxt exhaust THEN_ALL_NEW |
61760 | 470 |
(rtac ctxt (infer_instantiate' ctxt (replicate 4 NONE @ [SOME cterm]) @{thm arg_cong2} |
471 |
RS iffD2) |
|
60752 | 472 |
THEN' assume_tac ctxt THEN' assume_tac ctxt THEN' TRY o resolve_tac ctxt assms))) THEN |
57700 | 473 |
unfold_thms_tac ctxt (ctor_inject :: rel_pre_list_def :: ctor_defs @ nesting_rel_eqs @ |
58353 | 474 |
@{thms id_bnf_def vimage2p_def}) THEN |
57471 | 475 |
TRYALL (hyp_subst_tac ctxt) THEN |
62335 | 476 |
unfold_thms_tac ctxt (Abs_inverse :: @{thms rel_sum_simps rel_prod_inject Inl_Inr_False |
57471 | 477 |
Inr_Inl_False sum.inject prod.inject}) THEN |
60752 | 478 |
TRYALL (rtac ctxt refl ORELSE' etac ctxt FalseE ORELSE' |
479 |
(REPEAT_DETERM o etac ctxt conjE) THEN' assume_tac ctxt)) |
|
57471 | 480 |
cterms exhausts ctor_defss ctor_injects rel_pre_list_defs Abs_inverses); |
481 |
||
58326
7e142efcee1a
make 'rel_sel' and 'map_sel' tactics more robust
desharna
parents:
58181
diff
changeset
|
482 |
fun mk_rel_sel_tac ctxt ct1 ct2 exhaust discs sels rel_injects distincts rel_distincts rel_eqs = |
60784 | 483 |
HEADGOAL (rtac ctxt (infer_instantiate' ctxt [SOME ct1] exhaust) THEN_ALL_NEW |
63851 | 484 |
rtac ctxt (infer_instantiate' ctxt [SOME ct2] exhaust) THEN_ALL_NEW hyp_subst_tac ctxt) THEN |
59270 | 485 |
unfold_thms_tac ctxt (sels @ rel_injects @ rel_eqs @ |
486 |
@{thms simp_thms(6,7,8,11,12,15,16,21,22,24)} @ ((discs @ distincts) RL [eqTrueI, eqFalseI]) @ |
|
487 |
(rel_injects RL [eqTrueI]) @ (rel_distincts RL [eqFalseI])) THEN |
|
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59270
diff
changeset
|
488 |
TRYALL (resolve_tac ctxt [TrueI, refl]); |
57563 | 489 |
|
58676 | 490 |
fun mk_sel_transfer_tac ctxt n sel_defs case_transfer = |
491 |
TRYALL Goal.conjunction_tac THEN |
|
63068
8b9401bfd9fd
unfold is subject to unfold_abs_def (still inactive);
wenzelm
parents:
62535
diff
changeset
|
492 |
unfold_thms_tac ctxt (map (Local_Defs.abs_def_rule ctxt) sel_defs) THEN |
60728 | 493 |
ALLGOALS (rtac ctxt (mk_rel_funDN n case_transfer) THEN_ALL_NEW |
60752 | 494 |
REPEAT_DETERM o (assume_tac ctxt ORELSE' rtac ctxt rel_funI)); |
58676 | 495 |
|
63851 | 496 |
fun mk_set0_tac ctxt abs_inverses pre_set_defs dtor_ctor fp_sets fp_nesting_set_maps |
497 |
live_nesting_set_maps ctr_defs' extra_unfolds = |
|
498 |
TRYALL Goal.conjunction_tac THEN |
|
63852 | 499 |
unfold_thms_tac ctxt ctr_defs' THEN |
500 |
ALLGOALS (subst_tac ctxt NONE fp_sets) THEN |
|
501 |
unfold_thms_tac ctxt (dtor_ctor :: abs_inverses @ pre_set_defs @ fp_nesting_set_maps @ |
|
502 |
live_nesting_set_maps @ extra_unfolds @ basic_sumprod_thms_set @ |
|
63854 | 503 |
@{thms UN_UN_flatten UN_Un_distrib UN_Un sup_assoc[THEN sym]}) THEN |
63852 | 504 |
ALLGOALS (rtac ctxt @{thm set_eqI[OF iffI]}) THEN |
505 |
ALLGOALS (REPEAT_DETERM o etac ctxt UnE) THEN |
|
506 |
ALLGOALS (REPEAT o resolve_tac ctxt @{thms UnI1 UnI2} THEN' assume_tac ctxt); |
|
63851 | 507 |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57893
diff
changeset
|
508 |
fun mk_set_sel_tac ctxt ct exhaust discs sels sets = |
57152 | 509 |
TRYALL Goal.conjunction_tac THEN |
63841 | 510 |
ALLGOALS (rtac ctxt (infer_instantiate' ctxt [SOME ct] exhaust) THEN_ALL_NEW |
511 |
REPEAT_DETERM o hyp_subst_tac ctxt) THEN |
|
512 |
unfold_thms_tac ctxt ((discs RL [eqTrueI, eqFalseI]) @ |
|
513 |
@{thms not_True_eq_False not_False_eq_True}) THEN |
|
514 |
TRYALL (etac ctxt FalseE ORELSE' etac ctxt @{thm TrueE}) THEN |
|
515 |
unfold_thms_tac ctxt (sels @ sets) THEN |
|
516 |
ALLGOALS (REPEAT o (resolve_tac ctxt @{thms UnI1 UnI2 imageI} ORELSE' |
|
517 |
eresolve_tac ctxt @{thms UN_I UN_I[rotated] imageE} ORELSE' |
|
518 |
hyp_subst_tac ctxt) THEN' |
|
519 |
(rtac ctxt @{thm singletonI} ORELSE' assume_tac ctxt)); |
|
57152 | 520 |
|
57893 | 521 |
fun mk_set_cases_tac ctxt ct assms exhaust sets = |
61760 | 522 |
HEADGOAL (rtac ctxt (infer_instantiate' ctxt [SOME ct] exhaust) |
523 |
THEN_ALL_NEW hyp_subst_tac ctxt) THEN |
|
57893 | 524 |
unfold_thms_tac ctxt sets THEN |
525 |
REPEAT_DETERM (HEADGOAL |
|
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59270
diff
changeset
|
526 |
(eresolve_tac ctxt @{thms FalseE emptyE singletonE UnE UN_E insertE} ORELSE' |
57893 | 527 |
hyp_subst_tac ctxt ORELSE' |
61760 | 528 |
SELECT_GOAL (SOLVE (HEADGOAL (eresolve_tac ctxt assms THEN' REPEAT_DETERM o |
529 |
assume_tac ctxt))))); |
|
57893 | 530 |
|
57891 | 531 |
fun mk_set_intros_tac ctxt sets = |
59856
ed0ca9029021
export more low-level theorems in data structure (partly for 'corec')
blanchet
parents:
59794
diff
changeset
|
532 |
TRYALL Goal.conjunction_tac THEN unfold_thms_tac ctxt sets THEN |
57891 | 533 |
TRYALL (REPEAT o |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59270
diff
changeset
|
534 |
(resolve_tac ctxt @{thms UnI1 UnI2} ORELSE' |
60752 | 535 |
eresolve_tac ctxt @{thms UN_I UN_I[rotated]}) THEN' |
536 |
(rtac ctxt @{thm singletonI} ORELSE' assume_tac ctxt)); |
|
57891 | 537 |
|
57700 | 538 |
fun mk_set_induct0_tac ctxt cts assms dtor_set_inducts exhausts set_pre_defs ctor_defs dtor_ctors |
539 |
Abs_pre_inverses = |
|
540 |
let |
|
58417
fa50722ad6cb
make 'set_induct0' tactic more robust w.r.t multiple arguments constructors
desharna
parents:
58359
diff
changeset
|
541 |
val assms_tac = |
fa50722ad6cb
make 'set_induct0' tactic more robust w.r.t multiple arguments constructors
desharna
parents:
58359
diff
changeset
|
542 |
let val assms' = map (unfold_thms ctxt (@{thm id_bnf_def} :: ctor_defs)) assms in |
fa50722ad6cb
make 'set_induct0' tactic more robust w.r.t multiple arguments constructors
desharna
parents:
58359
diff
changeset
|
543 |
fold (curry (op ORELSE')) (map (fn thm => |
61760 | 544 |
funpow (length (Thm.prems_of thm)) (fn tac => tac THEN' assume_tac ctxt) |
545 |
(rtac ctxt thm)) assms') |
|
60728 | 546 |
(etac ctxt FalseE) |
58417
fa50722ad6cb
make 'set_induct0' tactic more robust w.r.t multiple arguments constructors
desharna
parents:
58359
diff
changeset
|
547 |
end; |
57700 | 548 |
val exhausts' = map (fn thm => thm RS @{thm asm_rl[of "P x y" for P x y]}) exhausts |
60784 | 549 |
|> map2 (fn ct => infer_instantiate' ctxt [NONE, SOME ct]) cts; |
57700 | 550 |
in |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59270
diff
changeset
|
551 |
ALLGOALS (resolve_tac ctxt dtor_set_inducts) THEN |
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59270
diff
changeset
|
552 |
TRYALL (resolve_tac ctxt exhausts' THEN_ALL_NEW |
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59270
diff
changeset
|
553 |
(resolve_tac ctxt (map (fn ct => refl RS |
60784 | 554 |
infer_instantiate' ctxt (replicate 4 NONE @ [SOME ct]) @{thm arg_cong2} RS iffD2) cts) |
60752 | 555 |
THEN' assume_tac ctxt THEN' hyp_subst_tac ctxt)) THEN |
57700 | 556 |
unfold_thms_tac ctxt (Abs_pre_inverses @ dtor_ctors @ set_pre_defs @ ctor_defs @ |
58353 | 557 |
@{thms id_bnf_def o_apply sum_set_simps prod_set_simps UN_empty UN_insert Un_empty_left |
558 |
Un_empty_right empty_iff singleton_iff}) THEN |
|
61760 | 559 |
REPEAT (HEADGOAL (hyp_subst_tac ctxt ORELSE' |
560 |
eresolve_tac ctxt @{thms UN_E UnE singletonE} ORELSE' assms_tac)) |
|
57700 | 561 |
end; |
562 |
||
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
563 |
end; |