src/HOL/TLA/Intensional.thy
author wenzelm
Wed Feb 24 22:04:10 2010 +0100 (2010-02-24)
changeset 35354 2e8dc3c64430
parent 35318 e1b61c5fd494
child 38549 d0385f2764d8
permissions -rw-r--r--
observe standard convention for syntax consts;
wenzelm@35108
     1
(*  Title:      HOL/TLA/Intensional.thy
wenzelm@35108
     2
    Author:     Stephan Merz
wenzelm@35108
     3
    Copyright:  1998 University of Munich
wenzelm@21624
     4
*)
wenzelm@3807
     5
wenzelm@21624
     6
header {* A framework for "intensional" (possible-world based) logics
wenzelm@21624
     7
  on top of HOL, with lifting of constants and functions *}
wenzelm@3807
     8
wenzelm@17309
     9
theory Intensional
wenzelm@17309
    10
imports Main
wenzelm@17309
    11
begin
wenzelm@3807
    12
haftmann@35318
    13
classes world
haftmann@35318
    14
classrel world < type
wenzelm@6255
    15
wenzelm@6255
    16
(** abstract syntax **)
wenzelm@3807
    17
wenzelm@3807
    18
types
wenzelm@17309
    19
  ('w,'a) expr = "'w => 'a"               (* intention: 'w::world, 'a::type *)
wenzelm@17309
    20
  'w form = "('w, bool) expr"
wenzelm@3807
    21
wenzelm@3807
    22
consts
wenzelm@17309
    23
  Valid    :: "('w::world) form => bool"
wenzelm@17309
    24
  const    :: "'a => ('w::world, 'a) expr"
wenzelm@17309
    25
  lift     :: "['a => 'b, ('w::world, 'a) expr] => ('w,'b) expr"
wenzelm@17309
    26
  lift2    :: "['a => 'b => 'c, ('w::world,'a) expr, ('w,'b) expr] => ('w,'c) expr"
wenzelm@17309
    27
  lift3    :: "['a => 'b => 'c => 'd, ('w::world,'a) expr, ('w,'b) expr, ('w,'c) expr] => ('w,'d) expr"
wenzelm@3807
    28
wenzelm@6255
    29
  (* "Rigid" quantification (logic level) *)
wenzelm@6255
    30
  RAll     :: "('a => ('w::world) form) => 'w form"       (binder "Rall " 10)
wenzelm@6255
    31
  REx      :: "('a => ('w::world) form) => 'w form"       (binder "Rex " 10)
wenzelm@6255
    32
  REx1     :: "('a => ('w::world) form) => 'w form"       (binder "Rex! " 10)
wenzelm@3807
    33
wenzelm@6255
    34
(** concrete syntax **)
wenzelm@3807
    35
wenzelm@6255
    36
nonterminals
wenzelm@6255
    37
  lift
wenzelm@6255
    38
  liftargs
wenzelm@3807
    39
wenzelm@3807
    40
syntax
wenzelm@17309
    41
  ""            :: "id => lift"                          ("_")
wenzelm@17309
    42
  ""            :: "longid => lift"                      ("_")
wenzelm@17309
    43
  ""            :: "var => lift"                         ("_")
wenzelm@17309
    44
  "_applC"      :: "[lift, cargs] => lift"               ("(1_/ _)" [1000, 1000] 999)
wenzelm@17309
    45
  ""            :: "lift => lift"                        ("'(_')")
wenzelm@17309
    46
  "_lambda"     :: "[idts, 'a] => lift"                  ("(3%_./ _)" [0, 3] 3)
wenzelm@17309
    47
  "_constrain"  :: "[lift, type] => lift"                ("(_::_)" [4, 0] 3)
wenzelm@17309
    48
  ""            :: "lift => liftargs"                    ("_")
wenzelm@17309
    49
  "_liftargs"   :: "[lift, liftargs] => liftargs"        ("_,/ _")
wenzelm@17309
    50
  "_Valid"      :: "lift => bool"                        ("(|- _)" 5)
wenzelm@17309
    51
  "_holdsAt"    :: "['a, lift] => bool"                  ("(_ |= _)" [100,10] 10)
wenzelm@6255
    52
wenzelm@6255
    53
  (* Syntax for lifted expressions outside the scope of |- or |= *)
wenzelm@35354
    54
  "_LIFT"       :: "lift => 'a"                          ("LIFT _")
wenzelm@6255
    55
wenzelm@6255
    56
  (* generic syntax for lifted constants and functions *)
wenzelm@17309
    57
  "_const"      :: "'a => lift"                          ("(#_)" [1000] 999)
wenzelm@17309
    58
  "_lift"       :: "['a, lift] => lift"                  ("(_<_>)" [1000] 999)
wenzelm@17309
    59
  "_lift2"      :: "['a, lift, lift] => lift"            ("(_<_,/ _>)" [1000] 999)
wenzelm@17309
    60
  "_lift3"      :: "['a, lift, lift, lift] => lift"      ("(_<_,/ _,/ _>)" [1000] 999)
wenzelm@6255
    61
wenzelm@6255
    62
  (* concrete syntax for common infix functions: reuse same symbol *)
wenzelm@17309
    63
  "_liftEqu"    :: "[lift, lift] => lift"                ("(_ =/ _)" [50,51] 50)
wenzelm@17309
    64
  "_liftNeq"    :: "[lift, lift] => lift"                ("(_ ~=/ _)" [50,51] 50)
wenzelm@17309
    65
  "_liftNot"    :: "lift => lift"                        ("(~ _)" [40] 40)
wenzelm@17309
    66
  "_liftAnd"    :: "[lift, lift] => lift"                ("(_ &/ _)" [36,35] 35)
wenzelm@17309
    67
  "_liftOr"     :: "[lift, lift] => lift"                ("(_ |/ _)" [31,30] 30)
wenzelm@17309
    68
  "_liftImp"    :: "[lift, lift] => lift"                ("(_ -->/ _)" [26,25] 25)
wenzelm@17309
    69
  "_liftIf"     :: "[lift, lift, lift] => lift"          ("(if (_)/ then (_)/ else (_))" 10)
wenzelm@17309
    70
  "_liftPlus"   :: "[lift, lift] => lift"                ("(_ +/ _)" [66,65] 65)
wenzelm@17309
    71
  "_liftMinus"  :: "[lift, lift] => lift"                ("(_ -/ _)" [66,65] 65)
wenzelm@17309
    72
  "_liftTimes"  :: "[lift, lift] => lift"                ("(_ */ _)" [71,70] 70)
wenzelm@17309
    73
  "_liftDiv"    :: "[lift, lift] => lift"                ("(_ div _)" [71,70] 70)
wenzelm@17309
    74
  "_liftMod"    :: "[lift, lift] => lift"                ("(_ mod _)" [71,70] 70)
wenzelm@17309
    75
  "_liftLess"   :: "[lift, lift] => lift"                ("(_/ < _)"  [50, 51] 50)
wenzelm@17309
    76
  "_liftLeq"    :: "[lift, lift] => lift"                ("(_/ <= _)" [50, 51] 50)
wenzelm@17309
    77
  "_liftMem"    :: "[lift, lift] => lift"                ("(_/ : _)" [50, 51] 50)
wenzelm@17309
    78
  "_liftNotMem" :: "[lift, lift] => lift"                ("(_/ ~: _)" [50, 51] 50)
wenzelm@17309
    79
  "_liftFinset" :: "liftargs => lift"                    ("{(_)}")
wenzelm@6255
    80
  (** TODO: syntax for lifted collection / comprehension **)
wenzelm@17309
    81
  "_liftPair"   :: "[lift,liftargs] => lift"                   ("(1'(_,/ _'))")
wenzelm@6255
    82
  (* infix syntax for list operations *)
wenzelm@17309
    83
  "_liftCons" :: "[lift, lift] => lift"                  ("(_ #/ _)" [65,66] 65)
wenzelm@17309
    84
  "_liftApp"  :: "[lift, lift] => lift"                  ("(_ @/ _)" [65,66] 65)
wenzelm@17309
    85
  "_liftList" :: "liftargs => lift"                      ("[(_)]")
wenzelm@6255
    86
wenzelm@6255
    87
  (* Rigid quantification (syntax level) *)
wenzelm@17309
    88
  "_ARAll"  :: "[idts, lift] => lift"                    ("(3! _./ _)" [0, 10] 10)
wenzelm@17309
    89
  "_AREx"   :: "[idts, lift] => lift"                    ("(3? _./ _)" [0, 10] 10)
wenzelm@17309
    90
  "_AREx1"  :: "[idts, lift] => lift"                    ("(3?! _./ _)" [0, 10] 10)
wenzelm@17309
    91
  "_RAll" :: "[idts, lift] => lift"                      ("(3ALL _./ _)" [0, 10] 10)
wenzelm@17309
    92
  "_REx"  :: "[idts, lift] => lift"                      ("(3EX _./ _)" [0, 10] 10)
wenzelm@17309
    93
  "_REx1" :: "[idts, lift] => lift"                      ("(3EX! _./ _)" [0, 10] 10)
wenzelm@3807
    94
wenzelm@3807
    95
translations
wenzelm@35108
    96
  "_const"        == "CONST const"
wenzelm@35108
    97
  "_lift"         == "CONST lift"
wenzelm@35108
    98
  "_lift2"        == "CONST lift2"
wenzelm@35108
    99
  "_lift3"        == "CONST lift3"
wenzelm@35108
   100
  "_Valid"        == "CONST Valid"
wenzelm@6255
   101
  "_RAll x A"     == "Rall x. A"
wenzelm@6255
   102
  "_REx x  A"     == "Rex x. A"
wenzelm@6255
   103
  "_REx1 x  A"    == "Rex! x. A"
wenzelm@6255
   104
  "_ARAll"        => "_RAll"
wenzelm@6255
   105
  "_AREx"         => "_REx"
wenzelm@6255
   106
  "_AREx1"        => "_REx1"
wenzelm@3807
   107
wenzelm@6255
   108
  "w |= A"        => "A w"
wenzelm@6255
   109
  "LIFT A"        => "A::_=>_"
wenzelm@3807
   110
wenzelm@6255
   111
  "_liftEqu"      == "_lift2 (op =)"
wenzelm@6255
   112
  "_liftNeq u v"  == "_liftNot (_liftEqu u v)"
wenzelm@35108
   113
  "_liftNot"      == "_lift (CONST Not)"
wenzelm@6255
   114
  "_liftAnd"      == "_lift2 (op &)"
wenzelm@6255
   115
  "_liftOr"       == "_lift2 (op | )"
wenzelm@6255
   116
  "_liftImp"      == "_lift2 (op -->)"
wenzelm@35108
   117
  "_liftIf"       == "_lift3 (CONST If)"
wenzelm@6255
   118
  "_liftPlus"     == "_lift2 (op +)"
wenzelm@6255
   119
  "_liftMinus"    == "_lift2 (op -)"
wenzelm@6255
   120
  "_liftTimes"    == "_lift2 (op *)"
wenzelm@6255
   121
  "_liftDiv"      == "_lift2 (op div)"
wenzelm@6255
   122
  "_liftMod"      == "_lift2 (op mod)"
wenzelm@6255
   123
  "_liftLess"     == "_lift2 (op <)"
wenzelm@6255
   124
  "_liftLeq"      == "_lift2 (op <=)"
wenzelm@6255
   125
  "_liftMem"      == "_lift2 (op :)"
wenzelm@6255
   126
  "_liftNotMem x xs"   == "_liftNot (_liftMem x xs)"
wenzelm@35108
   127
  "_liftFinset (_liftargs x xs)"  == "_lift2 (CONST insert) x (_liftFinset xs)"
wenzelm@35108
   128
  "_liftFinset x" == "_lift2 (CONST insert) x (_const {})"
wenzelm@6255
   129
  "_liftPair x (_liftargs y z)"       == "_liftPair x (_liftPair y z)"
wenzelm@35108
   130
  "_liftPair"     == "_lift2 (CONST Pair)"
wenzelm@35108
   131
  "_liftCons"     == "CONST lift2 (CONST Cons)"
wenzelm@35108
   132
  "_liftApp"      == "CONST lift2 (op @)"
wenzelm@6255
   133
  "_liftList (_liftargs x xs)"  == "_liftCons x (_liftList xs)"
wenzelm@6255
   134
  "_liftList x"   == "_liftCons x (_const [])"
wenzelm@3807
   135
wenzelm@17309
   136
wenzelm@3807
   137
wenzelm@6255
   138
  "w |= ~A"       <= "_liftNot A w"
wenzelm@6255
   139
  "w |= A & B"    <= "_liftAnd A B w"
wenzelm@6255
   140
  "w |= A | B"    <= "_liftOr A B w"
wenzelm@6255
   141
  "w |= A --> B"  <= "_liftImp A B w"
wenzelm@6255
   142
  "w |= u = v"    <= "_liftEqu u v w"
wenzelm@9517
   143
  "w |= ALL x. A"   <= "_RAll x A w"
wenzelm@9517
   144
  "w |= EX x. A"   <= "_REx x A w"
wenzelm@9517
   145
  "w |= EX! x. A"  <= "_REx1 x A w"
wenzelm@3807
   146
wenzelm@12114
   147
syntax (xsymbols)
wenzelm@17309
   148
  "_Valid"      :: "lift => bool"                        ("(\<turnstile> _)" 5)
wenzelm@17309
   149
  "_holdsAt"    :: "['a, lift] => bool"                  ("(_ \<Turnstile> _)" [100,10] 10)
wenzelm@17309
   150
  "_liftNeq"    :: "[lift, lift] => lift"                (infixl "\<noteq>" 50)
wenzelm@17309
   151
  "_liftNot"    :: "lift => lift"                        ("\<not> _" [40] 40)
wenzelm@17309
   152
  "_liftAnd"    :: "[lift, lift] => lift"                (infixr "\<and>" 35)
wenzelm@17309
   153
  "_liftOr"     :: "[lift, lift] => lift"                (infixr "\<or>" 30)
wenzelm@17309
   154
  "_liftImp"    :: "[lift, lift] => lift"                (infixr "\<longrightarrow>" 25)
wenzelm@17309
   155
  "_RAll"       :: "[idts, lift] => lift"                ("(3\<forall>_./ _)" [0, 10] 10)
wenzelm@17309
   156
  "_REx"        :: "[idts, lift] => lift"                ("(3\<exists>_./ _)" [0, 10] 10)
wenzelm@17309
   157
  "_REx1"       :: "[idts, lift] => lift"                ("(3\<exists>!_./ _)" [0, 10] 10)
wenzelm@17309
   158
  "_liftLeq"    :: "[lift, lift] => lift"                ("(_/ \<le> _)" [50, 51] 50)
wenzelm@17309
   159
  "_liftMem"    :: "[lift, lift] => lift"                ("(_/ \<in> _)" [50, 51] 50)
wenzelm@17309
   160
  "_liftNotMem" :: "[lift, lift] => lift"                ("(_/ \<notin> _)" [50, 51] 50)
wenzelm@3808
   161
wenzelm@6340
   162
syntax (HTML output)
wenzelm@17309
   163
  "_liftNeq"    :: "[lift, lift] => lift"                (infixl "\<noteq>" 50)
wenzelm@17309
   164
  "_liftNot"    :: "lift => lift"                        ("\<not> _" [40] 40)
wenzelm@17309
   165
  "_liftAnd"    :: "[lift, lift] => lift"                (infixr "\<and>" 35)
wenzelm@17309
   166
  "_liftOr"     :: "[lift, lift] => lift"                (infixr "\<or>" 30)
wenzelm@17309
   167
  "_RAll"       :: "[idts, lift] => lift"                ("(3\<forall>_./ _)" [0, 10] 10)
wenzelm@17309
   168
  "_REx"        :: "[idts, lift] => lift"                ("(3\<exists>_./ _)" [0, 10] 10)
wenzelm@17309
   169
  "_REx1"       :: "[idts, lift] => lift"                ("(3\<exists>!_./ _)" [0, 10] 10)
wenzelm@17309
   170
  "_liftLeq"    :: "[lift, lift] => lift"                ("(_/ \<le> _)" [50, 51] 50)
wenzelm@17309
   171
  "_liftMem"    :: "[lift, lift] => lift"                ("(_/ \<in> _)" [50, 51] 50)
wenzelm@17309
   172
  "_liftNotMem" :: "[lift, lift] => lift"                ("(_/ \<notin> _)" [50, 51] 50)
wenzelm@6340
   173
haftmann@35318
   174
defs
wenzelm@17309
   175
  Valid_def:   "|- A    ==  ALL w. w |= A"
wenzelm@17309
   176
wenzelm@17309
   177
  unl_con:     "LIFT #c w  ==  c"
berghofe@21020
   178
  unl_lift:    "lift f x w == f (x w)"
wenzelm@17309
   179
  unl_lift2:   "LIFT f<x, y> w == f (x w) (y w)"
wenzelm@17309
   180
  unl_lift3:   "LIFT f<x, y, z> w == f (x w) (y w) (z w)"
wenzelm@3807
   181
wenzelm@17309
   182
  unl_Rall:    "w |= ALL x. A x  ==  ALL x. (w |= A x)"
wenzelm@17309
   183
  unl_Rex:     "w |= EX x. A x   ==  EX x. (w |= A x)"
wenzelm@17309
   184
  unl_Rex1:    "w |= EX! x. A x  ==  EX! x. (w |= A x)"
wenzelm@3807
   185
wenzelm@21624
   186
wenzelm@21624
   187
subsection {* Lemmas and tactics for "intensional" logics. *}
wenzelm@21624
   188
wenzelm@21624
   189
lemmas intensional_rews [simp] =
wenzelm@21624
   190
  unl_con unl_lift unl_lift2 unl_lift3 unl_Rall unl_Rex unl_Rex1
wenzelm@21624
   191
wenzelm@21624
   192
lemma inteq_reflection: "|- x=y  ==>  (x==y)"
wenzelm@21624
   193
  apply (unfold Valid_def unl_lift2)
wenzelm@21624
   194
  apply (rule eq_reflection)
wenzelm@21624
   195
  apply (rule ext)
wenzelm@21624
   196
  apply (erule spec)
wenzelm@21624
   197
  done
wenzelm@21624
   198
wenzelm@21624
   199
lemma intI [intro!]: "(!!w. w |= A) ==> |- A"
wenzelm@21624
   200
  apply (unfold Valid_def)
wenzelm@21624
   201
  apply (rule allI)
wenzelm@21624
   202
  apply (erule meta_spec)
wenzelm@21624
   203
  done
wenzelm@21624
   204
wenzelm@21624
   205
lemma intD [dest]: "|- A ==> w |= A"
wenzelm@21624
   206
  apply (unfold Valid_def)
wenzelm@21624
   207
  apply (erule spec)
wenzelm@21624
   208
  done
wenzelm@21624
   209
wenzelm@21624
   210
(** Lift usual HOL simplifications to "intensional" level. **)
wenzelm@21624
   211
wenzelm@21624
   212
lemma int_simps:
wenzelm@21624
   213
  "|- (x=x) = #True"
wenzelm@21624
   214
  "|- (~#True) = #False"  "|- (~#False) = #True"  "|- (~~ P) = P"
wenzelm@21624
   215
  "|- ((~P) = P) = #False"  "|- (P = (~P)) = #False"
wenzelm@21624
   216
  "|- (P ~= Q) = (P = (~Q))"
wenzelm@21624
   217
  "|- (#True=P) = P"  "|- (P=#True) = P"
wenzelm@21624
   218
  "|- (#True --> P) = P"  "|- (#False --> P) = #True"
wenzelm@21624
   219
  "|- (P --> #True) = #True"  "|- (P --> P) = #True"
wenzelm@21624
   220
  "|- (P --> #False) = (~P)"  "|- (P --> ~P) = (~P)"
wenzelm@21624
   221
  "|- (P & #True) = P"  "|- (#True & P) = P"
wenzelm@21624
   222
  "|- (P & #False) = #False"  "|- (#False & P) = #False"
wenzelm@21624
   223
  "|- (P & P) = P"  "|- (P & ~P) = #False"  "|- (~P & P) = #False"
wenzelm@21624
   224
  "|- (P | #True) = #True"  "|- (#True | P) = #True"
wenzelm@21624
   225
  "|- (P | #False) = P"  "|- (#False | P) = P"
wenzelm@21624
   226
  "|- (P | P) = P"  "|- (P | ~P) = #True"  "|- (~P | P) = #True"
wenzelm@21624
   227
  "|- (! x. P) = P"  "|- (? x. P) = P"
wenzelm@21624
   228
  "|- (~Q --> ~P) = (P --> Q)"
wenzelm@21624
   229
  "|- (P|Q --> R) = ((P-->R)&(Q-->R))"
wenzelm@21624
   230
  apply (unfold Valid_def intensional_rews)
wenzelm@21624
   231
  apply blast+
wenzelm@21624
   232
  done
wenzelm@21624
   233
wenzelm@21624
   234
declare int_simps [THEN inteq_reflection, simp]
wenzelm@21624
   235
wenzelm@21624
   236
lemma TrueW [simp]: "|- #True"
wenzelm@21624
   237
  by (simp add: Valid_def unl_con)
wenzelm@21624
   238
wenzelm@21624
   239
wenzelm@21624
   240
wenzelm@21624
   241
(* ======== Functions to "unlift" intensional implications into HOL rules ====== *)
wenzelm@21624
   242
wenzelm@21624
   243
ML {*
wenzelm@21624
   244
(* Basic unlifting introduces a parameter "w" and applies basic rewrites, e.g.
wenzelm@21624
   245
   |- F = G    becomes   F w = G w
wenzelm@21624
   246
   |- F --> G  becomes   F w --> G w
wenzelm@21624
   247
*)
wenzelm@21624
   248
wenzelm@21624
   249
fun int_unlift th =
wenzelm@24180
   250
  rewrite_rule @{thms intensional_rews} (th RS @{thm intD} handle THM _ => th);
wenzelm@21624
   251
wenzelm@21624
   252
(* Turn  |- F = G  into meta-level rewrite rule  F == G *)
wenzelm@21624
   253
fun int_rewrite th =
wenzelm@24180
   254
  zero_var_indexes (rewrite_rule @{thms intensional_rews} (th RS @{thm inteq_reflection}))
wenzelm@21624
   255
wenzelm@21624
   256
(* flattening turns "-->" into "==>" and eliminates conjunctions in the
wenzelm@21624
   257
   antecedent. For example,
wenzelm@21624
   258
wenzelm@21624
   259
         P & Q --> (R | S --> T)    becomes   [| P; Q; R | S |] ==> T
wenzelm@21624
   260
wenzelm@21624
   261
   Flattening can be useful with "intensional" lemmas (after unlifting).
wenzelm@21624
   262
   Naive resolution with mp and conjI may run away because of higher-order
wenzelm@21624
   263
   unification, therefore the code is a little awkward.
wenzelm@21624
   264
*)
wenzelm@21624
   265
fun flatten t =
wenzelm@21624
   266
  let
wenzelm@21624
   267
    (* analogous to RS, but using matching instead of resolution *)
wenzelm@21624
   268
    fun matchres tha i thb =
wenzelm@31945
   269
      case Seq.chop 2 (Thm.biresolution true [(false,tha)] i thb) of
wenzelm@21624
   270
          ([th],_) => th
wenzelm@21624
   271
        | ([],_)   => raise THM("matchres: no match", i, [tha,thb])
wenzelm@21624
   272
        |      _   => raise THM("matchres: multiple unifiers", i, [tha,thb])
wenzelm@21624
   273
wenzelm@21624
   274
    (* match tha with some premise of thb *)
wenzelm@21624
   275
    fun matchsome tha thb =
wenzelm@21624
   276
      let fun hmatch 0 = raise THM("matchsome: no match", 0, [tha,thb])
wenzelm@21624
   277
            | hmatch n = matchres tha n thb handle THM _ => hmatch (n-1)
wenzelm@21624
   278
      in hmatch (nprems_of thb) end
wenzelm@21624
   279
wenzelm@21624
   280
    fun hflatten t =
wenzelm@21624
   281
        case (concl_of t) of
wenzelm@21624
   282
          Const _ $ (Const ("op -->", _) $ _ $ _) => hflatten (t RS mp)
wenzelm@21624
   283
        | _ => (hflatten (matchsome conjI t)) handle THM _ => zero_var_indexes t
wenzelm@21624
   284
  in
wenzelm@21624
   285
    hflatten t
wenzelm@21624
   286
  end
wenzelm@21624
   287
wenzelm@21624
   288
fun int_use th =
wenzelm@21624
   289
    case (concl_of th) of
wenzelm@21624
   290
      Const _ $ (Const ("Intensional.Valid", _) $ _) =>
wenzelm@21624
   291
              (flatten (int_unlift th) handle THM _ => th)
wenzelm@21624
   292
    | _ => th
wenzelm@21624
   293
*}
wenzelm@21624
   294
wenzelm@30528
   295
attribute_setup int_unlift = {* Scan.succeed (Thm.rule_attribute (K int_unlift)) *} ""
wenzelm@30528
   296
attribute_setup int_rewrite = {* Scan.succeed (Thm.rule_attribute (K int_rewrite)) *} ""
wenzelm@30528
   297
attribute_setup flatten = {* Scan.succeed (Thm.rule_attribute (K flatten)) *} ""
wenzelm@30528
   298
attribute_setup int_use = {* Scan.succeed (Thm.rule_attribute (K int_use)) *} ""
wenzelm@21624
   299
wenzelm@21624
   300
lemma Not_Rall: "|- (~(! x. F x)) = (? x. ~F x)"
wenzelm@21624
   301
  by (simp add: Valid_def)
wenzelm@21624
   302
wenzelm@21624
   303
lemma Not_Rex: "|- (~ (? x. F x)) = (! x. ~ F x)"
wenzelm@21624
   304
  by (simp add: Valid_def)
wenzelm@21624
   305
wenzelm@21624
   306
end