src/Pure/Isar/class_declaration.ML
author wenzelm
Thu Aug 26 13:09:12 2010 +0200 (2010-08-26)
changeset 38756 d07959fabde6
parent 38493 95a41e6ef5a8
child 38875 c7a66b584147
permissions -rw-r--r--
renamed ProofContext.theory(_result) to ProofContext.background_theory(_result) to emphasize that this belongs to the infrastructure and is rarely appropriate in user-space tools;
haftmann@38379
     1
(*  Title:      Pure/Isar/class_declaration.ML
haftmann@24218
     2
    Author:     Florian Haftmann, TU Muenchen
haftmann@24218
     3
haftmann@38379
     4
Declaring classes and subclass relations.
haftmann@24218
     5
*)
haftmann@24218
     6
haftmann@38379
     7
signature CLASS_DECLARATION =
haftmann@24218
     8
sig
wenzelm@30344
     9
  val class: binding -> class list -> Element.context_i list
haftmann@29378
    10
    -> theory -> string * local_theory
wenzelm@30344
    11
  val class_cmd: binding -> xstring list -> Element.context list
haftmann@29378
    12
    -> theory -> string * local_theory
haftmann@29358
    13
  val prove_subclass: tactic -> class -> local_theory -> local_theory
haftmann@29358
    14
  val subclass: class -> local_theory -> Proof.state
haftmann@29358
    15
  val subclass_cmd: xstring -> local_theory -> Proof.state
haftmann@24218
    16
end;
haftmann@24218
    17
haftmann@38379
    18
structure Class_Declaration: CLASS_DECLARATION =
haftmann@24218
    19
struct
haftmann@24218
    20
haftmann@29665
    21
(** class definitions **)
haftmann@24218
    22
haftmann@24218
    23
local
haftmann@24218
    24
haftmann@29665
    25
(* calculating class-related rules including canonical interpretation *)
haftmann@29665
    26
haftmann@29547
    27
fun calculate thy class sups base_sort param_map assm_axiom =
haftmann@29547
    28
  let
wenzelm@36610
    29
    val empty_ctxt = ProofContext.init_global thy;
haftmann@29547
    30
haftmann@29547
    31
    (* instantiation of canonical interpretation *)
haftmann@29575
    32
    val aT = TFree (Name.aT, base_sort);
haftmann@29627
    33
    val param_map_const = (map o apsnd) Const param_map;
haftmann@29627
    34
    val param_map_inst = (map o apsnd)
haftmann@29627
    35
      (Const o apsnd (map_atyps (K aT))) param_map;
haftmann@29627
    36
    val const_morph = Element.inst_morphism thy
haftmann@29627
    37
      (Symtab.empty, Symtab.make param_map_inst);
haftmann@29797
    38
    val typ_morph = Element.inst_morphism thy
haftmann@29797
    39
      (Symtab.empty |> Symtab.update (Name.aT, TFree (Name.aT, [class])), Symtab.empty);
haftmann@29797
    40
    val (([raw_props], [(_, raw_inst_morph)], export_morph), _) = empty_ctxt
haftmann@29547
    41
      |> Expression.cert_goal_expression ([(class, (("", false),
haftmann@29627
    42
           Expression.Named param_map_const))], []);
haftmann@29797
    43
    val (props, inst_morph) = if null param_map
haftmann@29797
    44
      then (raw_props |> map (Morphism.term typ_morph),
haftmann@29797
    45
        raw_inst_morph $> typ_morph)
haftmann@29797
    46
      else (raw_props, raw_inst_morph); (*FIXME proper handling in
haftmann@29797
    47
        locale.ML / expression.ML would be desirable*)
haftmann@29547
    48
haftmann@29547
    49
    (* witness for canonical interpretation *)
haftmann@29547
    50
    val prop = try the_single props;
haftmann@29547
    51
    val wit = Option.map (fn prop => let
haftmann@38379
    52
        val sup_axioms = map_filter (fst o Class.rules thy) sups;
haftmann@29547
    53
        val loc_intro_tac = case Locale.intros_of thy class
haftmann@29547
    54
          of (_, NONE) => all_tac
haftmann@29547
    55
           | (_, SOME intro) => ALLGOALS (Tactic.rtac intro);
haftmann@29547
    56
        val tac = loc_intro_tac
haftmann@29547
    57
          THEN ALLGOALS (ProofContext.fact_tac (sup_axioms @ the_list assm_axiom))
haftmann@29547
    58
      in Element.prove_witness empty_ctxt prop tac end) prop;
haftmann@29547
    59
    val axiom = Option.map Element.conclude_witness wit;
haftmann@29547
    60
haftmann@29547
    61
    (* canonical interpretation *)
haftmann@29547
    62
    val base_morph = inst_morph
haftmann@38379
    63
      $> Morphism.binding_morphism (Binding.prefix false (Class.class_prefix class))
haftmann@29547
    64
      $> Element.satisfy_morphism (the_list wit);
haftmann@38379
    65
    val eq_morph = Element.eq_morphism thy (Class.these_defs thy sups);
haftmann@29547
    66
haftmann@29547
    67
    (* assm_intro *)
wenzelm@30344
    68
    fun prove_assm_intro thm =
haftmann@29547
    69
      let
wenzelm@31794
    70
        val ((_, [thm']), _) = Variable.import true [thm] empty_ctxt;
haftmann@36674
    71
        val const_eq_morph = case eq_morph
haftmann@36674
    72
         of SOME eq_morph => const_morph $> eq_morph
haftmann@36674
    73
          | NONE => const_morph
haftmann@36674
    74
        val thm'' = Morphism.thm const_eq_morph thm';
haftmann@29627
    75
        val tac = ALLGOALS (ProofContext.fact_tac [thm'']);
wenzelm@32970
    76
      in Skip_Proof.prove_global thy [] [] (Thm.prop_of thm'') (K tac) end;
haftmann@29547
    77
    val assm_intro = Option.map prove_assm_intro
haftmann@29547
    78
      (fst (Locale.intros_of thy class));
haftmann@29547
    79
haftmann@29547
    80
    (* of_class *)
wenzelm@31943
    81
    val of_class_prop_concl = Logic.mk_of_class (aT, class);
haftmann@29547
    82
    val of_class_prop = case prop of NONE => of_class_prop_concl
haftmann@29627
    83
      | SOME prop => Logic.mk_implies (Morphism.term const_morph
haftmann@29627
    84
          ((map_types o map_atyps) (K aT) prop), of_class_prop_concl);
haftmann@38379
    85
    val sup_of_classes = map (snd o Class.rules thy) sups;
wenzelm@35021
    86
    val loc_axiom_intros = map Drule.export_without_context_open (Locale.axioms_of thy class);
haftmann@29547
    87
    val axclass_intro = #intro (AxClass.get_info thy class);
wenzelm@31944
    88
    val base_sort_trivs = Thm.of_sort (Thm.ctyp_of thy aT, base_sort);
haftmann@29547
    89
    val tac = REPEAT (SOMEGOAL
haftmann@29547
    90
      (Tactic.match_tac (axclass_intro :: sup_of_classes
haftmann@29547
    91
         @ loc_axiom_intros @ base_sort_trivs)
haftmann@29547
    92
           ORELSE' Tactic.assume_tac));
wenzelm@32970
    93
    val of_class = Skip_Proof.prove_global thy [] [] of_class_prop (K tac);
haftmann@29547
    94
haftmann@32886
    95
  in (base_morph, eq_morph, export_morph, axiom, assm_intro, of_class) end;
haftmann@29547
    96
haftmann@29632
    97
haftmann@29665
    98
(* reading and processing class specifications *)
haftmann@29665
    99
haftmann@36460
   100
fun prep_class_elems prep_decl thy sups raw_elems =
haftmann@29632
   101
  let
haftmann@29665
   102
haftmann@29665
   103
    (* user space type system: only permits 'a type variable, improves towards 'a *)
haftmann@36460
   104
    val algebra = Sign.classes_of thy;
haftmann@36460
   105
    val inter_sort = curry (Sorts.inter_sort algebra);
haftmann@36460
   106
    val proto_base_sort = if null sups then Sign.defaultS thy
haftmann@38379
   107
      else fold inter_sort (map (Class.base_sort thy) sups) [];
haftmann@29665
   108
    val base_constraints = (map o apsnd)
haftmann@29665
   109
      (map_type_tfree (K (TVar ((Name.aT, 0), proto_base_sort))) o fst o snd)
haftmann@38379
   110
        (Class.these_operations thy sups);
haftmann@29665
   111
    val reject_bcd_etc = (map o map_atyps) (fn T as TFree (v, sort) =>
haftmann@29665
   112
          if v = Name.aT then T
haftmann@29665
   113
          else error ("No type variable other than " ^ Name.aT ^ " allowed in class specification")
haftmann@29665
   114
      | T => T);
haftmann@36460
   115
    fun singleton_fixate Ts =
haftmann@29665
   116
      let
haftmann@29665
   117
        fun extract f = (fold o fold_atyps) f Ts [];
haftmann@29665
   118
        val tfrees = extract
haftmann@29665
   119
          (fn TFree (v, sort) => insert (op =) (v, sort) | _ => I);
haftmann@29665
   120
        val inferred_sort = extract
haftmann@36460
   121
          (fn TVar (_, sort) => inter_sort sort | _ => I);
haftmann@29665
   122
        val fixate_sort = if null tfrees then inferred_sort
haftmann@29816
   123
          else case tfrees
haftmann@29816
   124
           of [(_, a_sort)] => if Sorts.sort_le algebra (a_sort, inferred_sort)
haftmann@36460
   125
                then inter_sort a_sort inferred_sort
haftmann@29816
   126
                else error ("Type inference imposes additional sort constraint "
haftmann@29816
   127
                  ^ Syntax.string_of_sort_global thy inferred_sort
haftmann@29816
   128
                  ^ " of type parameter " ^ Name.aT ^ " of sort "
haftmann@29816
   129
                  ^ Syntax.string_of_sort_global thy a_sort ^ ".")
haftmann@29816
   130
            | _ => error "Multiple type variables in class specification.";
haftmann@29665
   131
      in (map o map_atyps) (K (TFree (Name.aT, fixate_sort))) Ts end;
haftmann@38493
   132
    val after_infer_fixate = (map o map_atyps)
haftmann@38493
   133
      (fn T as TFree _ => T | T as TVar (vi, sort) =>
haftmann@38493
   134
        if Type_Infer.is_param vi then Type_Infer.param 0 (Name.aT, sort) else T);
haftmann@32206
   135
    fun add_typ_check level name f = Context.proof_map
haftmann@38435
   136
      (Syntax.add_typ_check level name (fn Ts => fn ctxt =>
haftmann@38435
   137
        let val Ts' = f Ts in if eq_list (op =) (Ts, Ts') then NONE else SOME (Ts', ctxt) end));
haftmann@29632
   138
haftmann@35120
   139
    (* preprocessing elements, retrieving base sort from type-checked elements *)
haftmann@38493
   140
    val raw_supexpr = (map (fn sup => (sup, (("", false),
haftmann@38493
   141
      Expression.Positional []))) sups, []);
haftmann@29702
   142
    val init_class_body = fold (ProofContext.add_const_constraint o apsnd SOME) base_constraints
haftmann@38379
   143
      #> Class.redeclare_operations thy sups
haftmann@29702
   144
      #> add_typ_check 10 "reject_bcd_etc" reject_bcd_etc
haftmann@36460
   145
      #> add_typ_check ~10 "singleton_fixate" singleton_fixate;
haftmann@38435
   146
    val ((raw_supparams, _, raw_inferred_elems), _) = ProofContext.init_global thy
haftmann@38493
   147
      |> add_typ_check 5 "after_infer_fixate" after_infer_fixate
haftmann@32206
   148
      |> prep_decl raw_supexpr init_class_body raw_elems;
haftmann@38435
   149
    fun filter_element (Element.Fixes []) = NONE
haftmann@38435
   150
      | filter_element (e as Element.Fixes _) = SOME e
haftmann@38435
   151
      | filter_element (Element.Constrains []) = NONE
haftmann@38435
   152
      | filter_element (e as Element.Constrains _) = SOME e
haftmann@38435
   153
      | filter_element (Element.Assumes []) = NONE
haftmann@38435
   154
      | filter_element (e as Element.Assumes _) = SOME e
haftmann@38435
   155
      | filter_element (Element.Defines _) = error ("\"defines\" element not allowed in class specification.")
haftmann@38435
   156
      | filter_element (Element.Notes _) = error ("\"notes\" element not allowed in class specification.");
haftmann@38435
   157
    val inferred_elems = map_filter filter_element raw_inferred_elems;
haftmann@29665
   158
    fun fold_element_types f (Element.Fixes fxs) = fold (fn (_, SOME T, _) => f T) fxs
haftmann@29665
   159
      | fold_element_types f (Element.Constrains cnstrs) = fold (f o snd) cnstrs
haftmann@29665
   160
      | fold_element_types f (Element.Assumes assms) = fold (fold (fn (t, ts) =>
haftmann@29665
   161
          fold_types f t #> (fold o fold_types) f ts) o snd) assms
haftmann@29665
   162
    val base_sort = if null inferred_elems then proto_base_sort else
haftmann@29665
   163
      case (fold o fold_element_types) Term.add_tfreesT inferred_elems []
haftmann@29665
   164
       of [] => error "No type variable in class specification"
haftmann@29665
   165
        | [(_, sort)] => sort
haftmann@32206
   166
        | _ => error "Multiple type variables in class specification";
haftmann@32206
   167
    val supparams = map (fn ((c, T), _) =>
haftmann@32206
   168
      (c, map_atyps (K (TFree (Name.aT, base_sort))) T)) raw_supparams;
haftmann@32206
   169
    val supparam_names = map fst supparams;
haftmann@32206
   170
    fun mk_param ((c, _), _) = Free (c, (the o AList.lookup (op =) supparams) c);
haftmann@32206
   171
    val supexpr = (map (fn sup => (sup, (("", false),
haftmann@32206
   172
      Expression.Positional (map (SOME o mk_param) (Locale.params_of thy sup))))) sups,
haftmann@32206
   173
        map (fn (c, T) => (Binding.name c, SOME T, NoSyn)) supparams);
haftmann@29575
   174
haftmann@32206
   175
  in (base_sort, supparam_names, supexpr, inferred_elems) end;
haftmann@29575
   176
haftmann@29665
   177
val cert_class_elems = prep_class_elems Expression.cert_declaration;
haftmann@29665
   178
val read_class_elems = prep_class_elems Expression.cert_read_declaration;
haftmann@29575
   179
haftmann@29665
   180
fun prep_class_spec prep_class prep_class_elems thy raw_supclasses raw_elems =
haftmann@29575
   181
  let
haftmann@29665
   182
haftmann@29575
   183
    (* prepare import *)
haftmann@29575
   184
    val inter_sort = curry (Sorts.inter_sort (Sign.classes_of thy));
haftmann@29608
   185
    val sups = map (prep_class thy) raw_supclasses
haftmann@29608
   186
      |> Sign.minimize_sort thy;
haftmann@38379
   187
    val _ = case filter_out (Class.is_class thy) sups
haftmann@29608
   188
     of [] => ()
haftmann@29797
   189
      | no_classes => error ("No (proper) classes: " ^ commas (map quote no_classes));
haftmann@38379
   190
    val raw_supparams = (map o apsnd) (snd o snd) (Class.these_params thy sups);
haftmann@32206
   191
    val raw_supparam_names = map fst raw_supparams;
haftmann@32206
   192
    val _ = if has_duplicates (op =) raw_supparam_names
haftmann@29575
   193
      then error ("Duplicate parameter(s) in superclasses: "
haftmann@32206
   194
        ^ (commas o map quote o duplicates (op =)) raw_supparam_names)
haftmann@29575
   195
      else ();
haftmann@29575
   196
haftmann@29575
   197
    (* infer types and base sort *)
haftmann@32206
   198
    val (base_sort, supparam_names, supexpr, inferred_elems) =
haftmann@36460
   199
      prep_class_elems thy sups raw_elems;
haftmann@32206
   200
    val sup_sort = inter_sort base_sort sups;
haftmann@29575
   201
haftmann@29575
   202
    (* process elements as class specification *)
haftmann@38379
   203
    val class_ctxt = Class.begin sups base_sort (ProofContext.init_global thy);
haftmann@29665
   204
    val ((_, _, syntax_elems), _) = class_ctxt
haftmann@29702
   205
      |> Expression.cert_declaration supexpr I inferred_elems;
haftmann@29665
   206
    fun check_vars e vs = if null vs
haftmann@29665
   207
      then error ("No type variable in part of specification element "
wenzelm@36746
   208
        ^ (Pretty.string_of o Pretty.chunks) (Element.pretty_ctxt class_ctxt e))
haftmann@29665
   209
      else ();
haftmann@29665
   210
    fun check_element (e as Element.Fixes fxs) =
haftmann@29665
   211
          map (fn (_, SOME T, _) => check_vars e (Term.add_tfreesT T [])) fxs
haftmann@29665
   212
      | check_element (e as Element.Assumes assms) =
haftmann@29665
   213
          maps (fn (_, ts_pss) => map
haftmann@29665
   214
            (fn (t, _) => check_vars e (Term.add_tfrees t [])) ts_pss) assms
haftmann@29665
   215
      | check_element e = [()];
haftmann@29665
   216
    val _ = map check_element syntax_elems;
haftmann@29665
   217
    fun fork_syn (Element.Fixes xs) =
wenzelm@30344
   218
          fold_map (fn (c, ty, syn) => cons (c, syn) #> pair (c, ty, NoSyn)) xs
haftmann@29665
   219
          #>> Element.Fixes
haftmann@29665
   220
      | fork_syn x = pair x;
haftmann@29575
   221
    val (elems, global_syntax) = fold_map fork_syn syntax_elems [];
haftmann@29665
   222
haftmann@32713
   223
  in (((sups, supparam_names), (sup_sort, base_sort, supexpr)), (elems, global_syntax)) end;
haftmann@29575
   224
haftmann@29665
   225
val cert_class_spec = prep_class_spec (K I) cert_class_elems;
haftmann@29665
   226
val read_class_spec = prep_class_spec Sign.intern_class read_class_elems;
haftmann@29665
   227
haftmann@29665
   228
haftmann@29665
   229
(* class establishment *)
haftmann@29575
   230
haftmann@32206
   231
fun add_consts class base_sort sups supparam_names global_syntax thy =
wenzelm@24968
   232
  let
haftmann@29816
   233
    (*FIXME simplify*)
haftmann@32206
   234
    val supconsts = supparam_names
haftmann@38379
   235
      |> AList.make (snd o the o AList.lookup (op =) (Class.these_params thy sups))
haftmann@25683
   236
      |> (map o apsnd o apsnd o map_atyps o K o TFree) (Name.aT, [class]);
haftmann@29509
   237
    val all_params = Locale.params_of thy class;
haftmann@32206
   238
    val raw_params = (snd o chop (length supparam_names)) all_params;
wenzelm@30755
   239
    fun add_const ((raw_c, raw_ty), _) thy =
haftmann@25683
   240
      let
wenzelm@30755
   241
        val b = Binding.name raw_c;
wenzelm@30344
   242
        val c = Sign.full_name thy b;
haftmann@25683
   243
        val ty = map_atyps (K (TFree (Name.aT, base_sort))) raw_ty;
haftmann@25683
   244
        val ty0 = Type.strip_sorts ty;
haftmann@25683
   245
        val ty' = map_atyps (K (TFree (Name.aT, [class]))) ty0;
wenzelm@30344
   246
        val syn = (the_default NoSyn o AList.lookup Binding.eq_name global_syntax) b;
haftmann@25683
   247
      in
haftmann@25683
   248
        thy
wenzelm@33173
   249
        |> Sign.declare_const ((b, ty0), syn)
haftmann@25683
   250
        |> snd
wenzelm@30585
   251
        |> pair ((Name.of_binding b, ty), (c, ty'))
haftmann@25683
   252
      end;
haftmann@28715
   253
  in
haftmann@28715
   254
    thy
haftmann@38379
   255
    |> Sign.add_path (Class.class_prefix class)
haftmann@28715
   256
    |> fold_map add_const raw_params
haftmann@28715
   257
    ||> Sign.restore_naming thy
haftmann@28715
   258
    |-> (fn params => pair (supconsts @ (map o apfst) fst params, params))
haftmann@28715
   259
  end;
haftmann@28715
   260
haftmann@32206
   261
fun adjungate_axclass bname class base_sort sups supsort supparam_names global_syntax thy =
haftmann@28715
   262
  let
haftmann@29816
   263
    (*FIXME simplify*)
haftmann@25683
   264
    fun globalize param_map = map_aterms
haftmann@25683
   265
      (fn Free (v, ty) => Const ((fst o the o AList.lookup (op =) param_map) v, ty)
haftmann@25683
   266
        | t => t);
haftmann@29509
   267
    val raw_pred = Locale.intros_of thy class
haftmann@25683
   268
      |> fst
wenzelm@35845
   269
      |> Option.map (Logic.unvarify_global o Logic.strip_imp_concl o Thm.prop_of);
haftmann@25683
   270
    fun get_axiom thy = case (#axioms o AxClass.get_info thy) class
haftmann@25683
   271
     of [] => NONE
haftmann@25683
   272
      | [thm] => SOME thm;
wenzelm@24968
   273
  in
wenzelm@24968
   274
    thy
haftmann@32206
   275
    |> add_consts class base_sort sups supparam_names global_syntax
haftmann@25683
   276
    |-> (fn (param_map, params) => AxClass.define_class (bname, supsort)
haftmann@26518
   277
          (map (fst o snd) params)
wenzelm@30211
   278
          [(Thm.empty_binding, Option.map (globalize param_map) raw_pred |> the_list)]
haftmann@25683
   279
    #> snd
haftmann@25683
   280
    #> `get_axiom
haftmann@25683
   281
    #-> (fn assm_axiom => fold (Sign.add_const_constraint o apsnd SOME o snd) params
haftmann@29526
   282
    #> pair (param_map, params, assm_axiom)))
wenzelm@24968
   283
  end;
wenzelm@24968
   284
haftmann@36635
   285
fun gen_class prep_class_spec b raw_supclasses raw_elems thy =
haftmann@24748
   286
  let
haftmann@36635
   287
    val class = Sign.full_name thy b;
haftmann@32206
   288
    val (((sups, supparam_names), (supsort, base_sort, supexpr)), (elems, global_syntax)) =
haftmann@32206
   289
      prep_class_spec thy raw_supclasses raw_elems;
haftmann@24218
   290
  in
haftmann@24218
   291
    thy
haftmann@36635
   292
    |> Expression.add_locale b (Binding.qualify true "class" b) supexpr elems
wenzelm@33671
   293
    |> snd |> Local_Theory.exit_global
haftmann@36635
   294
    |> adjungate_axclass b class base_sort sups supsort supparam_names global_syntax
haftmann@31696
   295
    ||> Theory.checkpoint
haftmann@29526
   296
    |-> (fn (param_map, params, assm_axiom) =>
haftmann@29547
   297
       `(fn thy => calculate thy class sups base_sort param_map assm_axiom)
haftmann@32886
   298
    #-> (fn (base_morph, eq_morph, export_morph, axiom, assm_intro, of_class) =>
ballarin@38107
   299
       Context.theory_map (Locale.add_registration (class, base_morph)
ballarin@38107
   300
         (Option.map (rpair true) eq_morph) export_morph)
haftmann@38379
   301
    #> Class.register class sups params base_sort base_morph export_morph axiom assm_intro of_class))
haftmann@38389
   302
    |> Named_Target.init class
haftmann@25038
   303
    |> pair class
haftmann@24218
   304
  end;
haftmann@24218
   305
haftmann@24218
   306
in
haftmann@24218
   307
haftmann@29509
   308
val class = gen_class cert_class_spec;
haftmann@26518
   309
val class_cmd = gen_class read_class_spec;
haftmann@24218
   310
haftmann@24218
   311
end; (*local*)
haftmann@24218
   312
haftmann@24218
   313
haftmann@29358
   314
(** subclass relations **)
haftmann@25462
   315
haftmann@29358
   316
local
haftmann@25462
   317
haftmann@29358
   318
fun gen_subclass prep_class do_proof raw_sup lthy =
haftmann@25462
   319
  let
haftmann@29358
   320
    val thy = ProofContext.theory_of lthy;
haftmann@29558
   321
    val proto_sup = prep_class thy raw_sup;
haftmann@38350
   322
    val proto_sub = case Named_Target.peek lthy
haftmann@38390
   323
     of SOME {target, is_class = true, ...} => target
haftmann@38390
   324
      | _ => error "Not in a class target";
haftmann@31987
   325
    val (sub, sup) = AxClass.cert_classrel thy (proto_sub, proto_sup);
haftmann@29509
   326
haftmann@29509
   327
    val expr = ([(sup, (("", false), Expression.Positional []))], []);
haftmann@29558
   328
    val (([props], deps, export), goal_ctxt) =
haftmann@29509
   329
      Expression.cert_goal_expression expr lthy;
haftmann@29526
   330
    val some_prop = try the_single props;
haftmann@29558
   331
    val some_dep_morph = try the_single (map snd deps);
haftmann@29558
   332
    fun after_qed some_wit =
wenzelm@38756
   333
      ProofContext.background_theory (Class.register_subclass (sub, sup)
haftmann@29558
   334
        some_dep_morph some_wit export)
haftmann@38389
   335
      #> ProofContext.theory_of #> Named_Target.init sub;
haftmann@29558
   336
  in do_proof after_qed some_prop goal_ctxt end;
haftmann@25485
   337
haftmann@29575
   338
fun user_proof after_qed some_prop =
haftmann@29575
   339
  Element.witness_proof (after_qed o try the_single o the_single)
haftmann@29575
   340
    [the_list some_prop];
haftmann@25485
   341
haftmann@29575
   342
fun tactic_proof tac after_qed some_prop ctxt =
haftmann@29575
   343
  after_qed (Option.map
haftmann@29575
   344
    (fn prop => Element.prove_witness ctxt prop tac) some_prop) ctxt;
haftmann@28666
   345
haftmann@29358
   346
in
haftmann@28666
   347
haftmann@29358
   348
val subclass = gen_subclass (K I) user_proof;
haftmann@29358
   349
fun prove_subclass tac = gen_subclass (K I) (tactic_proof tac);
wenzelm@36610
   350
val subclass_cmd = gen_subclass (ProofContext.read_class o ProofContext.init_global) user_proof;
haftmann@25462
   351
haftmann@29358
   352
end; (*local*)
haftmann@29358
   353
haftmann@24218
   354
end;