1 (* Title: HOL/Codatatype/Tools/bnf_fp_sugar_tactics.ML
2 Author: Jasmin Blanchette, TU Muenchen
5 Tactics for the LFP/GFP sugar.
8 signature BNF_FP_SUGAR_TACTICS =
10 val mk_case_tac: Proof.context -> int -> int -> int -> thm -> thm -> thm -> tactic
11 val mk_coiter_like_tac: thm list -> thm list -> thm -> thm -> thm -> Proof.context -> tactic
12 val mk_exhaust_tac: Proof.context -> int -> thm list -> thm -> thm -> tactic
13 val mk_fld_iff_unf_tac: Proof.context -> ctyp option list -> cterm -> cterm -> thm -> thm
15 val mk_half_distinct_tac: Proof.context -> thm -> thm list -> tactic
16 val mk_induct_tac: Proof.context -> int list -> int list list -> int list list -> thm list ->
17 thm -> thm list list -> thm list -> tactic
18 val mk_inject_tac: Proof.context -> thm -> thm -> tactic
19 val mk_iter_like_tac: thm list -> thm list -> thm list -> thm -> thm -> Proof.context -> tactic
22 structure BNF_FP_Sugar_Tactics : BNF_FP_SUGAR_TACTICS =
29 val meta_mp = @{thm meta_mp};
30 val meta_spec = @{thm meta_spec};
32 fun squash_spurious_fs lthy thm =
35 Term.add_vars (prop_of thm) []
36 |> filter (fn (_, Type (@{type_name fun}, [_, T'])) => T' <> HOLogic.boolT | _ => false);
38 map (fn s as (_, T) =>
39 (certify lthy (Var s), certify lthy (id_abs (domain_type T)))) spurious_fs;
41 Drule.cterm_instantiate cxs thm
44 val squash_spurious_fs_tac = PRIMITIVE o squash_spurious_fs;
46 fun mk_case_tac ctxt n k m case_def ctr_def unf_fld =
47 Local_Defs.unfold_tac ctxt [case_def, ctr_def, unf_fld] THEN
48 (rtac (mk_sum_casesN_balanced n k RS ssubst) THEN'
49 REPEAT_DETERM_N (Int.max (0, m - 1)) o rtac (@{thm split} RS ssubst) THEN'
52 fun mk_exhaust_tac ctxt n ctr_defs fld_iff_unf sumEN' =
53 Local_Defs.unfold_tac ctxt (fld_iff_unf :: ctr_defs) THEN rtac sumEN' 1 THEN
54 Local_Defs.unfold_tac ctxt @{thms all_prod_eq} THEN
55 EVERY' (maps (fn k => [select_prem_tac n (rotate_tac 1) k, REPEAT_DETERM o dtac meta_spec,
56 etac meta_mp, atac]) (1 upto n)) 1;
58 fun mk_fld_iff_unf_tac ctxt cTs cfld cunf fld_unf unf_fld =
60 EVERY' (map3 (fn cTs => fn cx => fn th =>
61 dtac (Drule.instantiate' cTs [NONE, NONE, SOME cx] arg_cong) THEN'
62 SELECT_GOAL (Local_Defs.unfold_tac ctxt [th]) THEN'
63 atac) [rev cTs, cTs] [cunf, cfld] [unf_fld, fld_unf])) 1;
65 fun mk_half_distinct_tac ctxt fld_inject ctr_defs =
66 Local_Defs.unfold_tac ctxt (fld_inject :: @{thms sum.inject} @ ctr_defs) THEN
67 rtac @{thm sum.distinct(1)} 1;
69 fun mk_inject_tac ctxt ctr_def fld_inject =
70 Local_Defs.unfold_tac ctxt [ctr_def] THEN rtac (fld_inject RS ssubst) 1 THEN
71 Local_Defs.unfold_tac ctxt @{thms sum.inject Pair_eq conj_assoc} THEN rtac refl 1;
74 @{thms case_unit comp_def convol_def id_apply map_pair_def sum.simps(5,6) sum_map.simps
77 fun mk_iter_like_tac pre_map_defs map_ids iter_like_defs fld_iter_like ctr_def ctxt =
78 Local_Defs.unfold_tac ctxt (ctr_def :: fld_iter_like :: iter_like_defs @ pre_map_defs @ map_ids @
79 iter_like_thms) THEN Local_Defs.unfold_tac ctxt @{thms id_def} THEN rtac refl 1;
81 val coiter_like_ss = ss_only @{thms if_True if_False};
82 val coiter_like_thms = @{thms id_apply map_pair_def sum_map.simps prod.cases};
84 fun mk_coiter_like_tac coiter_like_defs map_ids fld_unf_coiter_like pre_map_def ctr_def ctxt =
85 Local_Defs.unfold_tac ctxt (ctr_def :: coiter_like_defs) THEN
86 subst_tac ctxt [fld_unf_coiter_like] 1 THEN asm_simp_tac coiter_like_ss 1 THEN
87 Local_Defs.unfold_tac ctxt (pre_map_def :: coiter_like_thms @ map_ids) THEN
88 Local_Defs.unfold_tac ctxt @{thms id_def} THEN
89 TRY ((rtac refl ORELSE' subst_tac ctxt @{thms unit_eq} THEN' rtac refl) 1);
91 fun mk_induct_prelude_tac ctxt ctr_defs fld_induct' =
92 Local_Defs.unfold_tac ctxt ctr_defs THEN rtac fld_induct' 1 THEN squash_spurious_fs_tac ctxt;
94 fun mk_induct_prepare_prem_tac n m k =
95 EVERY' [select_prem_tac n (rotate_tac 1) k, rotate_tac ~1, hyp_subst_tac,
96 REPEAT_DETERM_N m o (dtac meta_spec THEN' rotate_tac ~1)] 1;
98 fun mk_induct_prepare_prem_prems_tac _ _ 0 = all_tac
99 | mk_induct_prepare_prem_prems_tac nn kk r =
100 REPEAT_DETERM_N r (rotate_tac (~1 + kk - nn) 1 THEN dtac meta_mp 1 THEN
101 defer_tac 2 THEN PRIMITIVE (Thm.permute_prems 0 ~1) THEN rotate_tac 1 1) THEN
102 PRIMITIVE Raw_Simplifier.norm_hhf;
104 val induct_prem_prem_thms =
105 @{thms SUP_empty Sup_empty Sup_insert UN_compreh_bex UN_insert Un_assoc[symmetric] Un_empty_left
106 Un_empty_right Union_Un_distrib collect_def[abs_def] fst_conv fsts_def[abs_def] image_def
107 map_pair_simp o_apply snd_conv snds_def[abs_def] sum.cases sum_map.simps sum_setl_def[abs_def]
108 sum_setr_def[abs_def] sup_bot_right};
110 fun mk_induct_discharge_prem_prems_tac ctxt r pre_set_defs set_natural's =
111 EVERY' (maps (fn i =>
112 [dtac meta_spec, rotate_tac ~1, etac meta_mp,
113 SELECT_GOAL (Local_Defs.unfold_tac ctxt
114 (set_natural's @ pre_set_defs @ induct_prem_prem_thms)),
117 rtac @{thm singletonI} ORELSE'
118 (REPEAT_DETERM o (atac ORELSE'
119 SELECT_GOAL (Local_Defs.unfold_tac ctxt @{thms Union_iff bex_simps(6)}) THEN'
120 etac @{thm induct_set_step}))]) (r downto 1)) 1;
122 fun mk_induct_discharge_prem_tac ctxt nn kk n m k r pre_set_defs set_natural's =
123 EVERY [mk_induct_prepare_prem_tac n m k,
124 mk_induct_prepare_prem_prems_tac nn kk r, atac 1,
125 mk_induct_discharge_prem_prems_tac ctxt r pre_set_defs set_natural's];
127 fun mk_induct_tac ctxt ns mss rss ctr_defs fld_induct' pre_set_defss set_natural's =
130 val n = Integer.sum ns;
132 mk_induct_prelude_tac ctxt ctr_defs fld_induct' THEN
133 EVERY (map5 (fn kk => fn pre_set_defs =>
134 EVERY ooo map3 (fn m => fn k => fn r =>
135 mk_induct_discharge_prem_tac ctxt nn kk n m k r pre_set_defs set_natural's))
136 (1 upto nn) pre_set_defss mss (unflat mss (1 upto Integer.sum ns)) rss)