src/Pure/conjunction.ML
author wenzelm
Mon Aug 13 18:10:18 2007 +0200 (2007-08-13)
changeset 24241 424cb8b5e5b4
parent 23535 58147e5bd070
child 24976 821628d16552
permissions -rw-r--r--
SimpleSyntax.read_prop;
wenzelm@19416
     1
(*  Title:      Pure/conjunction.ML
wenzelm@19416
     2
    ID:         $Id$
wenzelm@19416
     3
    Author:     Makarius
wenzelm@19416
     4
wenzelm@19416
     5
Meta-level conjunction.
wenzelm@19416
     6
*)
wenzelm@19416
     7
wenzelm@19416
     8
signature CONJUNCTION =
wenzelm@19416
     9
sig
wenzelm@19416
    10
  val conjunction: cterm
wenzelm@19416
    11
  val mk_conjunction: cterm * cterm -> cterm
wenzelm@23422
    12
  val mk_conjunction_balanced: cterm list -> cterm
wenzelm@19416
    13
  val dest_conjunction: cterm -> cterm * cterm
wenzelm@19416
    14
  val cong: thm -> thm -> thm
wenzelm@23422
    15
  val convs: (cterm -> thm) -> cterm -> thm
wenzelm@19416
    16
  val conjunctionD1: thm
wenzelm@19416
    17
  val conjunctionD2: thm
wenzelm@19416
    18
  val conjunctionI: thm
wenzelm@19416
    19
  val intr: thm -> thm -> thm
wenzelm@23422
    20
  val intr_balanced: thm list -> thm
wenzelm@19416
    21
  val elim: thm -> thm * thm
wenzelm@23422
    22
  val elim_balanced: int -> thm -> thm list
wenzelm@23422
    23
  val curry_balanced: int -> thm -> thm
wenzelm@23422
    24
  val uncurry_balanced: int -> thm -> thm
wenzelm@19416
    25
end;
wenzelm@19416
    26
wenzelm@19416
    27
structure Conjunction: CONJUNCTION =
wenzelm@19416
    28
struct
wenzelm@19416
    29
wenzelm@19416
    30
(** abstract syntax **)
wenzelm@19416
    31
wenzelm@19416
    32
val cert = Thm.cterm_of ProtoPure.thy;
wenzelm@24241
    33
val read_prop = cert o SimpleSyntax.read_prop;
wenzelm@19416
    34
wenzelm@23422
    35
val true_prop = cert Logic.true_prop;
wenzelm@19416
    36
val conjunction = cert Logic.conjunction;
wenzelm@23422
    37
wenzelm@19416
    38
fun mk_conjunction (A, B) = Thm.capply (Thm.capply conjunction A) B;
wenzelm@19416
    39
wenzelm@23422
    40
fun mk_conjunction_balanced [] = true_prop
wenzelm@23422
    41
  | mk_conjunction_balanced ts = BalancedTree.make mk_conjunction ts;
wenzelm@23422
    42
wenzelm@19416
    43
fun dest_conjunction ct =
wenzelm@19416
    44
  (case Thm.term_of ct of
wenzelm@20666
    45
    (Const ("ProtoPure.conjunction", _) $ _ $ _) => Thm.dest_binop ct
wenzelm@23422
    46
  | _ => raise TERM ("dest_conjunction", [Thm.term_of ct]));
wenzelm@19416
    47
wenzelm@19416
    48
wenzelm@19416
    49
wenzelm@19416
    50
(** derived rules **)
wenzelm@19416
    51
wenzelm@19416
    52
(* conversion *)
wenzelm@19416
    53
wenzelm@19416
    54
val cong = Thm.combination o Thm.combination (Thm.reflexive conjunction);
wenzelm@19416
    55
wenzelm@23422
    56
fun convs cv ct =
wenzelm@23422
    57
  (case try dest_conjunction ct of
wenzelm@23422
    58
    NONE => cv ct
wenzelm@23422
    59
  | SOME (A, B) => cong (convs cv A) (convs cv B));
wenzelm@19416
    60
wenzelm@19416
    61
wenzelm@19416
    62
(* intro/elim *)
wenzelm@19416
    63
wenzelm@19416
    64
local
wenzelm@19416
    65
wenzelm@24241
    66
val A = read_prop "A" and vA = read_prop "?A";
wenzelm@24241
    67
val B = read_prop "B" and vB = read_prop "?B";
wenzelm@24241
    68
val C = read_prop "C";
wenzelm@24241
    69
val ABC = read_prop "A ==> B ==> C";
wenzelm@24241
    70
val A_B = read_prop "A && B";
wenzelm@19416
    71
wenzelm@20238
    72
val conjunction_def = Drule.unvarify ProtoPure.conjunction_def;
wenzelm@19416
    73
wenzelm@19416
    74
fun conjunctionD which =
wenzelm@19416
    75
  Drule.implies_intr_list [A, B] (Thm.assume (which (A, B))) COMP
wenzelm@19416
    76
  Drule.forall_elim_vars 0 (Thm.equal_elim conjunction_def (Thm.assume A_B));
wenzelm@19416
    77
wenzelm@19416
    78
in
wenzelm@19416
    79
wenzelm@19416
    80
val conjunctionD1 = Drule.store_standard_thm "conjunctionD1" (conjunctionD #1);
wenzelm@19416
    81
val conjunctionD2 = Drule.store_standard_thm "conjunctionD2" (conjunctionD #2);
wenzelm@19416
    82
wenzelm@19416
    83
val conjunctionI = Drule.store_standard_thm "conjunctionI"
wenzelm@19416
    84
  (Drule.implies_intr_list [A, B]
wenzelm@19416
    85
    (Thm.equal_elim
wenzelm@19416
    86
      (Thm.symmetric conjunction_def)
wenzelm@19416
    87
      (Thm.forall_intr C (Thm.implies_intr ABC
wenzelm@19416
    88
        (Drule.implies_elim_list (Thm.assume ABC) [Thm.assume A, Thm.assume B])))));
wenzelm@19416
    89
wenzelm@23422
    90
wenzelm@20508
    91
fun intr tha thb =
wenzelm@20508
    92
  Thm.implies_elim
wenzelm@20508
    93
    (Thm.implies_elim
wenzelm@20508
    94
      (Thm.instantiate ([], [(vA, Thm.cprop_of tha), (vB, Thm.cprop_of thb)]) conjunctionI)
wenzelm@20508
    95
    tha)
wenzelm@20508
    96
  thb;
wenzelm@19416
    97
wenzelm@19416
    98
fun elim th =
wenzelm@20508
    99
  let
wenzelm@20508
   100
    val (A, B) = dest_conjunction (Thm.cprop_of th)
wenzelm@20508
   101
      handle TERM (msg, _) => raise THM (msg, 0, [th]);
wenzelm@20508
   102
    val inst = Thm.instantiate ([], [(vA, A), (vB, B)]);
wenzelm@20508
   103
  in
wenzelm@20508
   104
   (Thm.implies_elim (inst conjunctionD1) th,
wenzelm@20508
   105
    Thm.implies_elim (inst conjunctionD2) th)
wenzelm@20508
   106
  end;
wenzelm@19416
   107
wenzelm@23422
   108
end;
wenzelm@23422
   109
wenzelm@23422
   110
wenzelm@23535
   111
(* balanced conjuncts *)
wenzelm@23422
   112
wenzelm@23422
   113
fun intr_balanced [] = asm_rl
wenzelm@23422
   114
  | intr_balanced ths = BalancedTree.make (uncurry intr) ths;
wenzelm@23422
   115
wenzelm@23422
   116
fun elim_balanced 0 _ = []
wenzelm@23422
   117
  | elim_balanced n th = BalancedTree.dest elim n th;
wenzelm@19416
   118
wenzelm@19416
   119
wenzelm@19416
   120
(* currying *)
wenzelm@19416
   121
wenzelm@19416
   122
local
wenzelm@19416
   123
wenzelm@23422
   124
fun conjs n =
wenzelm@23422
   125
  let val As = map (fn A => cert (Free (A, propT))) (Name.invents Name.context "A" n)
wenzelm@23422
   126
  in (As, mk_conjunction_balanced As) end;
wenzelm@19416
   127
wenzelm@24241
   128
val B = read_prop "B";
wenzelm@19416
   129
wenzelm@19416
   130
fun comp_rule th rule =
wenzelm@20260
   131
  Thm.adjust_maxidx_thm ~1 (th COMP
wenzelm@19416
   132
    (rule |> Drule.forall_intr_frees |> Drule.forall_elim_vars (Thm.maxidx_of th + 1)));
wenzelm@19416
   133
wenzelm@19416
   134
in
wenzelm@19416
   135
wenzelm@19416
   136
(*
wenzelm@19416
   137
   A1 && ... && An ==> B
wenzelm@19416
   138
  -----------------------
wenzelm@19416
   139
  A1 ==> ... ==> An ==> B
wenzelm@19416
   140
*)
wenzelm@23422
   141
fun curry_balanced n th =
wenzelm@23422
   142
  if n < 2 then th
wenzelm@23422
   143
  else
wenzelm@23422
   144
    let
wenzelm@23422
   145
      val (As, C) = conjs n;
wenzelm@23422
   146
      val D = Drule.mk_implies (C, B);
wenzelm@23422
   147
    in
wenzelm@23422
   148
      comp_rule th
wenzelm@23422
   149
        (Thm.implies_elim (Thm.assume D) (intr_balanced (map Thm.assume As))
wenzelm@23422
   150
          |> Drule.implies_intr_list (D :: As))
wenzelm@23422
   151
    end;
wenzelm@19416
   152
wenzelm@19416
   153
(*
wenzelm@19416
   154
  A1 ==> ... ==> An ==> B
wenzelm@19416
   155
  -----------------------
wenzelm@23422
   156
  A1 && ... && An ==> B
wenzelm@19416
   157
*)
wenzelm@23422
   158
fun uncurry_balanced n th =
wenzelm@23422
   159
  if n < 2 then th
wenzelm@23422
   160
  else
wenzelm@23422
   161
    let
wenzelm@23422
   162
      val (As, C) = conjs n;
wenzelm@23422
   163
      val D = Drule.list_implies (As, B);
wenzelm@23422
   164
    in
wenzelm@23422
   165
      comp_rule th
wenzelm@23422
   166
        (Drule.implies_elim_list (Thm.assume D) (elim_balanced n (Thm.assume C))
wenzelm@23422
   167
          |> Drule.implies_intr_list [D, C])
wenzelm@23422
   168
    end;
wenzelm@19416
   169
wenzelm@19416
   170
end;
wenzelm@19416
   171
wenzelm@19416
   172
end;