src/HOL/Integ/int_arith1.ML
author paulson
Thu Feb 28 17:46:46 2002 +0100 (2002-02-28)
changeset 12975 d796a2fd6c69
parent 12482 d2848ccc9757
child 13462 56610e2ba220
permissions -rw-r--r--
fixing nat_combine_numerals simprocs (again)

Theorem eq_cong2 moved from Integ/int_arith1.ML to simpdata.ML, where it will
be available in all theories.

Function simplify_meta_eq now makes the meta-equality first so that eq_cong2
will work properly.
wenzelm@9436
     1
(*  Title:      HOL/Integ/int_arith1.ML
wenzelm@9436
     2
    ID:         $Id$
wenzelm@9436
     3
    Authors:    Larry Paulson and Tobias Nipkow
wenzelm@9436
     4
wenzelm@9436
     5
Simprocs and decision procedure for linear arithmetic.
wenzelm@9436
     6
*)
wenzelm@9436
     7
paulson@11868
     8
Addsimps [int_numeral_0_eq_0, int_numeral_1_eq_1];
paulson@11868
     9
wenzelm@9436
    10
(*** Simprocs for numeric literals ***)
wenzelm@9436
    11
wenzelm@9436
    12
(** Combining of literal coefficients in sums of products **)
wenzelm@9436
    13
paulson@11868
    14
Goal "(x < y) = (x-y < (0::int))";
wenzelm@9436
    15
by (simp_tac (simpset() addsimps zcompare_rls) 1);
wenzelm@9436
    16
qed "zless_iff_zdiff_zless_0";
wenzelm@9436
    17
paulson@11868
    18
Goal "(x = y) = (x-y = (0::int))";
wenzelm@9436
    19
by (simp_tac (simpset() addsimps zcompare_rls) 1);
wenzelm@9436
    20
qed "eq_iff_zdiff_eq_0";
wenzelm@9436
    21
paulson@11868
    22
Goal "(x <= y) = (x-y <= (0::int))";
wenzelm@9436
    23
by (simp_tac (simpset() addsimps zcompare_rls) 1);
wenzelm@9436
    24
qed "zle_iff_zdiff_zle_0";
wenzelm@9436
    25
wenzelm@9436
    26
wenzelm@9436
    27
(** For combine_numerals **)
wenzelm@9436
    28
wenzelm@9436
    29
Goal "i*u + (j*u + k) = (i+j)*u + (k::int)";
wenzelm@9436
    30
by (asm_simp_tac (simpset() addsimps [zadd_zmult_distrib]) 1);
wenzelm@9436
    31
qed "left_zadd_zmult_distrib";
wenzelm@9436
    32
wenzelm@9436
    33
wenzelm@9436
    34
(** For cancel_numerals **)
wenzelm@9436
    35
wenzelm@9436
    36
val rel_iff_rel_0_rls = map (inst "y" "?u+?v")
wenzelm@9436
    37
                          [zless_iff_zdiff_zless_0, eq_iff_zdiff_eq_0, 
wenzelm@9436
    38
			   zle_iff_zdiff_zle_0] @
wenzelm@9436
    39
		        map (inst "y" "n")
wenzelm@9436
    40
                          [zless_iff_zdiff_zless_0, eq_iff_zdiff_eq_0, 
wenzelm@9436
    41
			   zle_iff_zdiff_zle_0];
wenzelm@9436
    42
wenzelm@9436
    43
Goal "!!i::int. (i*u + m = j*u + n) = ((i-j)*u + m = n)";
wenzelm@9436
    44
by (asm_simp_tac (simpset() addsimps [zdiff_def, zadd_zmult_distrib]@
wenzelm@9436
    45
		                     zadd_ac@rel_iff_rel_0_rls) 1);
wenzelm@9436
    46
qed "eq_add_iff1";
wenzelm@9436
    47
wenzelm@9436
    48
Goal "!!i::int. (i*u + m = j*u + n) = (m = (j-i)*u + n)";
wenzelm@9436
    49
by (asm_simp_tac (simpset() addsimps [zdiff_def, zadd_zmult_distrib]@
wenzelm@9436
    50
                                     zadd_ac@rel_iff_rel_0_rls) 1);
wenzelm@9436
    51
qed "eq_add_iff2";
wenzelm@9436
    52
wenzelm@9436
    53
Goal "!!i::int. (i*u + m < j*u + n) = ((i-j)*u + m < n)";
wenzelm@9436
    54
by (asm_simp_tac (simpset() addsimps [zdiff_def, zadd_zmult_distrib]@
wenzelm@9436
    55
                                     zadd_ac@rel_iff_rel_0_rls) 1);
wenzelm@9436
    56
qed "less_add_iff1";
wenzelm@9436
    57
wenzelm@9436
    58
Goal "!!i::int. (i*u + m < j*u + n) = (m < (j-i)*u + n)";
wenzelm@9436
    59
by (asm_simp_tac (simpset() addsimps [zdiff_def, zadd_zmult_distrib]@
wenzelm@9436
    60
                                     zadd_ac@rel_iff_rel_0_rls) 1);
wenzelm@9436
    61
qed "less_add_iff2";
wenzelm@9436
    62
wenzelm@9436
    63
Goal "!!i::int. (i*u + m <= j*u + n) = ((i-j)*u + m <= n)";
wenzelm@9436
    64
by (asm_simp_tac (simpset() addsimps [zdiff_def, zadd_zmult_distrib]@
wenzelm@9436
    65
                                     zadd_ac@rel_iff_rel_0_rls) 1);
wenzelm@9436
    66
qed "le_add_iff1";
wenzelm@9436
    67
wenzelm@9436
    68
Goal "!!i::int. (i*u + m <= j*u + n) = (m <= (j-i)*u + n)";
wenzelm@9436
    69
by (asm_simp_tac (simpset() addsimps [zdiff_def, zadd_zmult_distrib]
wenzelm@9436
    70
                                     @zadd_ac@rel_iff_rel_0_rls) 1);
wenzelm@9436
    71
qed "le_add_iff2";
wenzelm@9436
    72
wenzelm@9436
    73
wenzelm@9436
    74
structure Int_Numeral_Simprocs =
wenzelm@9436
    75
struct
wenzelm@9436
    76
paulson@11868
    77
(*Maps 0 to Numeral0 and 1 to Numeral1 so that arithmetic in simprocs
paulson@11868
    78
  isn't complicated by the abstract 0 and 1.*)
paulson@11868
    79
val numeral_syms = [int_numeral_0_eq_0 RS sym, int_numeral_1_eq_1 RS sym];
paulson@11868
    80
val numeral_sym_ss = HOL_ss addsimps numeral_syms;
paulson@11868
    81
paulson@11868
    82
fun rename_numerals th = 
paulson@11868
    83
    simplify numeral_sym_ss (Thm.transfer (the_context ()) th);
paulson@11868
    84
wenzelm@9436
    85
(*Utilities*)
wenzelm@9436
    86
nipkow@10693
    87
fun mk_numeral n = HOLogic.number_of_const HOLogic.intT $ HOLogic.mk_bin n;
wenzelm@9436
    88
wenzelm@9436
    89
(*Decodes a binary INTEGER*)
paulson@11868
    90
fun dest_numeral (Const("0", _)) = 0
paulson@11868
    91
  | dest_numeral (Const("1", _)) = 1
paulson@11868
    92
  | dest_numeral (Const("Numeral.number_of", _) $ w) = 
wenzelm@10890
    93
     (HOLogic.dest_binum w
wenzelm@10890
    94
      handle TERM _ => raise TERM("Int_Numeral_Simprocs.dest_numeral:1", [w]))
wenzelm@9436
    95
  | dest_numeral t = raise TERM("Int_Numeral_Simprocs.dest_numeral:2", [t]);
wenzelm@9436
    96
wenzelm@9436
    97
fun find_first_numeral past (t::terms) =
wenzelm@9436
    98
	((dest_numeral t, rev past @ terms)
wenzelm@9436
    99
	 handle TERM _ => find_first_numeral (t::past) terms)
wenzelm@9436
   100
  | find_first_numeral past [] = raise TERM("find_first_numeral", []);
wenzelm@9436
   101
wenzelm@9436
   102
val zero = mk_numeral 0;
wenzelm@9436
   103
val mk_plus = HOLogic.mk_binop "op +";
wenzelm@9436
   104
wenzelm@9436
   105
val uminus_const = Const ("uminus", HOLogic.intT --> HOLogic.intT);
wenzelm@9436
   106
paulson@11868
   107
(*Thus mk_sum[t] yields t+0; longer sums don't have a trailing zero*)
wenzelm@9436
   108
fun mk_sum []        = zero
wenzelm@9436
   109
  | mk_sum [t,u]     = mk_plus (t, u)
wenzelm@9436
   110
  | mk_sum (t :: ts) = mk_plus (t, mk_sum ts);
wenzelm@9436
   111
wenzelm@9436
   112
(*this version ALWAYS includes a trailing zero*)
wenzelm@9436
   113
fun long_mk_sum []        = zero
wenzelm@9436
   114
  | long_mk_sum (t :: ts) = mk_plus (t, mk_sum ts);
wenzelm@9436
   115
wenzelm@9436
   116
val dest_plus = HOLogic.dest_bin "op +" HOLogic.intT;
wenzelm@9436
   117
wenzelm@9436
   118
(*decompose additions AND subtractions as a sum*)
wenzelm@9436
   119
fun dest_summing (pos, Const ("op +", _) $ t $ u, ts) =
wenzelm@9436
   120
        dest_summing (pos, t, dest_summing (pos, u, ts))
wenzelm@9436
   121
  | dest_summing (pos, Const ("op -", _) $ t $ u, ts) =
wenzelm@9436
   122
        dest_summing (pos, t, dest_summing (not pos, u, ts))
wenzelm@9436
   123
  | dest_summing (pos, t, ts) =
wenzelm@9436
   124
	if pos then t::ts else uminus_const$t :: ts;
wenzelm@9436
   125
wenzelm@9436
   126
fun dest_sum t = dest_summing (true, t, []);
wenzelm@9436
   127
wenzelm@9436
   128
val mk_diff = HOLogic.mk_binop "op -";
wenzelm@9436
   129
val dest_diff = HOLogic.dest_bin "op -" HOLogic.intT;
wenzelm@9436
   130
wenzelm@9436
   131
val one = mk_numeral 1;
wenzelm@9436
   132
val mk_times = HOLogic.mk_binop "op *";
wenzelm@9436
   133
wenzelm@9436
   134
fun mk_prod [] = one
wenzelm@9436
   135
  | mk_prod [t] = t
wenzelm@9436
   136
  | mk_prod (t :: ts) = if t = one then mk_prod ts
wenzelm@9436
   137
                        else mk_times (t, mk_prod ts);
wenzelm@9436
   138
wenzelm@9436
   139
val dest_times = HOLogic.dest_bin "op *" HOLogic.intT;
wenzelm@9436
   140
wenzelm@9436
   141
fun dest_prod t =
wenzelm@9436
   142
      let val (t,u) = dest_times t 
wenzelm@9436
   143
      in  dest_prod t @ dest_prod u  end
wenzelm@9436
   144
      handle TERM _ => [t];
wenzelm@9436
   145
wenzelm@9436
   146
(*DON'T do the obvious simplifications; that would create special cases*) 
wenzelm@9436
   147
fun mk_coeff (k, ts) = mk_times (mk_numeral k, ts);
wenzelm@9436
   148
wenzelm@9436
   149
(*Express t as a product of (possibly) a numeral with other sorted terms*)
wenzelm@9436
   150
fun dest_coeff sign (Const ("uminus", _) $ t) = dest_coeff (~sign) t
wenzelm@9436
   151
  | dest_coeff sign t =
wenzelm@9436
   152
    let val ts = sort Term.term_ord (dest_prod t)
wenzelm@9436
   153
	val (n, ts') = find_first_numeral [] ts
wenzelm@9436
   154
                          handle TERM _ => (1, ts)
wenzelm@9436
   155
    in (sign*n, mk_prod ts') end;
wenzelm@9436
   156
wenzelm@9436
   157
(*Find first coefficient-term THAT MATCHES u*)
wenzelm@9436
   158
fun find_first_coeff past u [] = raise TERM("find_first_coeff", []) 
wenzelm@9436
   159
  | find_first_coeff past u (t::terms) =
wenzelm@9436
   160
	let val (n,u') = dest_coeff 1 t
wenzelm@9436
   161
	in  if u aconv u' then (n, rev past @ terms)
wenzelm@9436
   162
			  else find_first_coeff (t::past) u terms
wenzelm@9436
   163
	end
wenzelm@9436
   164
	handle TERM _ => find_first_coeff (t::past) u terms;
wenzelm@9436
   165
wenzelm@9436
   166
paulson@11868
   167
(*Simplify Numeral0+n, n+Numeral0, Numeral1*n, n*Numeral1*)
paulson@11868
   168
val add_0s =  map rename_numerals [zadd_0, zadd_0_right];
paulson@11868
   169
val mult_1s = map rename_numerals [zmult_1, zmult_1_right] @
paulson@11868
   170
              [zmult_minus1, zmult_minus1_right];
wenzelm@9436
   171
paulson@11868
   172
(*To perform binary arithmetic.  The "left" rewriting handles patterns
paulson@11868
   173
  created by the simprocs, such as 3 * (5 * x). *)
paulson@11868
   174
val bin_simps = [int_numeral_0_eq_0 RS sym, int_numeral_1_eq_1 RS sym,
paulson@11868
   175
                 add_number_of_left, mult_number_of_left] @ 
paulson@11868
   176
                bin_arith_simps @ bin_rel_simps;
wenzelm@9436
   177
wenzelm@9436
   178
(*To evaluate binary negations of coefficients*)
wenzelm@9436
   179
val zminus_simps = NCons_simps @
paulson@11868
   180
                   [zminus_1_eq_m1, number_of_minus RS sym, 
wenzelm@9436
   181
		    bin_minus_1, bin_minus_0, bin_minus_Pls, bin_minus_Min,
wenzelm@9436
   182
		    bin_pred_1, bin_pred_0, bin_pred_Pls, bin_pred_Min];
wenzelm@9436
   183
wenzelm@9436
   184
(*To let us treat subtraction as addition*)
wenzelm@9436
   185
val diff_simps = [zdiff_def, zminus_zadd_distrib, zminus_zminus];
wenzelm@9436
   186
paulson@10713
   187
(*push the unary minus down: - x * y = x * - y *)
paulson@10713
   188
val int_minus_mult_eq_1_to_2 = 
paulson@10713
   189
    [zmult_zminus, zmult_zminus_right RS sym] MRS trans |> standard;
paulson@10713
   190
paulson@10713
   191
(*to extract again any uncancelled minuses*)
paulson@10713
   192
val int_minus_from_mult_simps = 
paulson@10713
   193
    [zminus_zminus, zmult_zminus, zmult_zminus_right];
paulson@10713
   194
paulson@10713
   195
(*combine unary minus with numeric literals, however nested within a product*)
paulson@10713
   196
val int_mult_minus_simps =
paulson@10713
   197
    [zmult_assoc, zmult_zminus RS sym, int_minus_mult_eq_1_to_2];
paulson@10713
   198
wenzelm@9436
   199
(*Apply the given rewrite (if present) just once*)
wenzelm@9436
   200
fun trans_tac None      = all_tac
wenzelm@9436
   201
  | trans_tac (Some th) = ALLGOALS (rtac (th RS trans));
wenzelm@9436
   202
wenzelm@9436
   203
fun simplify_meta_eq rules =
wenzelm@9436
   204
    simplify (HOL_basic_ss addeqcongs[eq_cong2] addsimps rules)
paulson@12975
   205
    o mk_meta_eq;
wenzelm@9436
   206
wenzelm@9436
   207
structure CancelNumeralsCommon =
wenzelm@9436
   208
  struct
wenzelm@9436
   209
  val mk_sum    	= mk_sum
wenzelm@9436
   210
  val dest_sum		= dest_sum
wenzelm@9436
   211
  val mk_coeff		= mk_coeff
wenzelm@9436
   212
  val dest_coeff	= dest_coeff 1
wenzelm@9436
   213
  val find_first_coeff	= find_first_coeff []
wenzelm@9436
   214
  val trans_tac         = trans_tac
paulson@10713
   215
  val norm_tac = 
paulson@11868
   216
     ALLGOALS (simp_tac (HOL_ss addsimps numeral_syms@add_0s@mult_1s@
paulson@11868
   217
                                         diff_simps@zminus_simps@zadd_ac))
paulson@10713
   218
     THEN ALLGOALS (simp_tac (HOL_ss addsimps bin_simps@int_mult_minus_simps))
paulson@10713
   219
     THEN ALLGOALS (simp_tac (HOL_ss addsimps int_minus_from_mult_simps@
paulson@10713
   220
                                              zadd_ac@zmult_ac))
wenzelm@9436
   221
  val numeral_simp_tac	= ALLGOALS (simp_tac (HOL_ss addsimps add_0s@bin_simps))
wenzelm@9436
   222
  val simplify_meta_eq  = simplify_meta_eq (add_0s@mult_1s)
wenzelm@9436
   223
  end;
wenzelm@9436
   224
wenzelm@9436
   225
wenzelm@9436
   226
structure EqCancelNumerals = CancelNumeralsFun
wenzelm@9436
   227
 (open CancelNumeralsCommon
paulson@11868
   228
  val prove_conv = Bin_Simprocs.prove_conv "inteq_cancel_numerals"
wenzelm@9436
   229
  val mk_bal   = HOLogic.mk_eq
wenzelm@9436
   230
  val dest_bal = HOLogic.dest_bin "op =" HOLogic.intT
wenzelm@9436
   231
  val bal_add1 = eq_add_iff1 RS trans
wenzelm@9436
   232
  val bal_add2 = eq_add_iff2 RS trans
wenzelm@9436
   233
);
wenzelm@9436
   234
wenzelm@9436
   235
structure LessCancelNumerals = CancelNumeralsFun
wenzelm@9436
   236
 (open CancelNumeralsCommon
paulson@11868
   237
  val prove_conv = Bin_Simprocs.prove_conv "intless_cancel_numerals"
wenzelm@9436
   238
  val mk_bal   = HOLogic.mk_binrel "op <"
wenzelm@9436
   239
  val dest_bal = HOLogic.dest_bin "op <" HOLogic.intT
wenzelm@9436
   240
  val bal_add1 = less_add_iff1 RS trans
wenzelm@9436
   241
  val bal_add2 = less_add_iff2 RS trans
wenzelm@9436
   242
);
wenzelm@9436
   243
wenzelm@9436
   244
structure LeCancelNumerals = CancelNumeralsFun
wenzelm@9436
   245
 (open CancelNumeralsCommon
paulson@11868
   246
  val prove_conv = Bin_Simprocs.prove_conv "intle_cancel_numerals"
wenzelm@9436
   247
  val mk_bal   = HOLogic.mk_binrel "op <="
wenzelm@9436
   248
  val dest_bal = HOLogic.dest_bin "op <=" HOLogic.intT
wenzelm@9436
   249
  val bal_add1 = le_add_iff1 RS trans
wenzelm@9436
   250
  val bal_add2 = le_add_iff2 RS trans
wenzelm@9436
   251
);
wenzelm@9436
   252
wenzelm@9436
   253
val cancel_numerals = 
paulson@11868
   254
  map Bin_Simprocs.prep_simproc
wenzelm@9436
   255
   [("inteq_cancel_numerals",
paulson@11868
   256
     Bin_Simprocs.prep_pats
paulson@11868
   257
               ["(l::int) + m = n", "(l::int) = m + n", 
wenzelm@9436
   258
		"(l::int) - m = n", "(l::int) = m - n", 
wenzelm@9436
   259
		"(l::int) * m = n", "(l::int) = m * n"], 
wenzelm@9436
   260
     EqCancelNumerals.proc),
wenzelm@9436
   261
    ("intless_cancel_numerals", 
paulson@11868
   262
     Bin_Simprocs.prep_pats
paulson@11868
   263
               ["(l::int) + m < n", "(l::int) < m + n", 
wenzelm@9436
   264
		"(l::int) - m < n", "(l::int) < m - n", 
wenzelm@9436
   265
		"(l::int) * m < n", "(l::int) < m * n"], 
wenzelm@9436
   266
     LessCancelNumerals.proc),
wenzelm@9436
   267
    ("intle_cancel_numerals", 
paulson@11868
   268
     Bin_Simprocs.prep_pats
paulson@11868
   269
               ["(l::int) + m <= n", "(l::int) <= m + n", 
wenzelm@9436
   270
		"(l::int) - m <= n", "(l::int) <= m - n", 
wenzelm@9436
   271
		"(l::int) * m <= n", "(l::int) <= m * n"], 
wenzelm@9436
   272
     LeCancelNumerals.proc)];
wenzelm@9436
   273
wenzelm@9436
   274
wenzelm@9436
   275
structure CombineNumeralsData =
wenzelm@9436
   276
  struct
paulson@9571
   277
  val add		= op + : int*int -> int 
wenzelm@11704
   278
  val mk_sum    	= long_mk_sum    (*to work for e.g. 2*x + 3*x *)
wenzelm@9436
   279
  val dest_sum		= dest_sum
wenzelm@9436
   280
  val mk_coeff		= mk_coeff
wenzelm@9436
   281
  val dest_coeff	= dest_coeff 1
wenzelm@9436
   282
  val left_distrib	= left_zadd_zmult_distrib RS trans
paulson@11868
   283
  val prove_conv        = Bin_Simprocs.prove_conv_nohyps "int_combine_numerals"
wenzelm@9436
   284
  val trans_tac          = trans_tac
paulson@10713
   285
  val norm_tac = 
paulson@11868
   286
     ALLGOALS (simp_tac (HOL_ss addsimps numeral_syms@add_0s@mult_1s@
paulson@11868
   287
                                         diff_simps@zminus_simps@zadd_ac))
paulson@10713
   288
     THEN ALLGOALS (simp_tac (HOL_ss addsimps bin_simps@int_mult_minus_simps))
paulson@10713
   289
     THEN ALLGOALS (simp_tac (HOL_ss addsimps int_minus_from_mult_simps@
paulson@10713
   290
                                              zadd_ac@zmult_ac))
wenzelm@9436
   291
  val numeral_simp_tac	= ALLGOALS 
wenzelm@9436
   292
                    (simp_tac (HOL_ss addsimps add_0s@bin_simps))
wenzelm@9436
   293
  val simplify_meta_eq  = simplify_meta_eq (add_0s@mult_1s)
wenzelm@9436
   294
  end;
wenzelm@9436
   295
wenzelm@9436
   296
structure CombineNumerals = CombineNumeralsFun(CombineNumeralsData);
wenzelm@9436
   297
  
paulson@11868
   298
val combine_numerals = Bin_Simprocs.prep_simproc
paulson@11868
   299
                 ("int_combine_numerals",
paulson@11868
   300
		  Bin_Simprocs.prep_pats ["(i::int) + j", "(i::int) - j"],
wenzelm@9436
   301
		  CombineNumerals.proc);
wenzelm@9436
   302
wenzelm@9436
   303
end;
wenzelm@9436
   304
wenzelm@9436
   305
Addsimprocs Int_Numeral_Simprocs.cancel_numerals;
wenzelm@9436
   306
Addsimprocs [Int_Numeral_Simprocs.combine_numerals];
wenzelm@9436
   307
wenzelm@9436
   308
(*The Abel_Cancel simprocs are now obsolete*)
wenzelm@9436
   309
Delsimprocs [Int_Cancel.sum_conv, Int_Cancel.rel_conv];
wenzelm@9436
   310
wenzelm@9436
   311
(*examples:
wenzelm@9436
   312
print_depth 22;
wenzelm@9436
   313
set timing;
wenzelm@9436
   314
set trace_simp;
paulson@11868
   315
fun test s = (Goal s, by (Simp_tac 1)); 
wenzelm@9436
   316
wenzelm@11704
   317
test "l + 2 + 2 + 2 + (l + 2) + (oo + 2) = (uu::int)";
wenzelm@9436
   318
wenzelm@11704
   319
test "2*u = (u::int)";
wenzelm@11704
   320
test "(i + j + 12 + (k::int)) - 15 = y";
wenzelm@11704
   321
test "(i + j + 12 + (k::int)) - 5 = y";
wenzelm@9436
   322
wenzelm@9436
   323
test "y - b < (b::int)";
wenzelm@11704
   324
test "y - (3*b + c) < (b::int) - 2*c";
wenzelm@9436
   325
wenzelm@11704
   326
test "(2*x - (u*v) + y) - v*3*u = (w::int)";
wenzelm@11704
   327
test "(2*x*u*v + (u*v)*4 + y) - v*u*4 = (w::int)";
wenzelm@11704
   328
test "(2*x*u*v + (u*v)*4 + y) - v*u = (w::int)";
wenzelm@11704
   329
test "u*v - (x*u*v + (u*v)*4 + y) = (w::int)";
wenzelm@9436
   330
wenzelm@11704
   331
test "(i + j + 12 + (k::int)) = u + 15 + y";
wenzelm@11704
   332
test "(i + j*2 + 12 + (k::int)) = j + 5 + y";
wenzelm@9436
   333
wenzelm@11704
   334
test "2*y + 3*z + 6*w + 2*y + 3*z + 2*u = 2*y' + 3*z' + 6*w' + 2*y' + 3*z' + u + (vv::int)";
wenzelm@9436
   335
wenzelm@9436
   336
test "a + -(b+c) + b = (d::int)";
wenzelm@9436
   337
test "a + -(b+c) - b = (d::int)";
wenzelm@9436
   338
wenzelm@9436
   339
(*negative numerals*)
wenzelm@11704
   340
test "(i + j + -2 + (k::int)) - (u + 5 + y) = zz";
wenzelm@11704
   341
test "(i + j + -3 + (k::int)) < u + 5 + y";
wenzelm@11704
   342
test "(i + j + 3 + (k::int)) < u + -6 + y";
wenzelm@11704
   343
test "(i + j + -12 + (k::int)) - 15 = y";
wenzelm@11704
   344
test "(i + j + 12 + (k::int)) - -15 = y";
wenzelm@11704
   345
test "(i + j + -12 + (k::int)) - -15 = y";
wenzelm@9436
   346
*)
wenzelm@9436
   347
wenzelm@9436
   348
wenzelm@9436
   349
(** Constant folding for integer plus and times **)
wenzelm@9436
   350
wenzelm@9436
   351
(*We do not need
wenzelm@9436
   352
    structure Nat_Plus_Assoc = Assoc_Fold (Nat_Plus_Assoc_Data);
wenzelm@9436
   353
    structure Int_Plus_Assoc = Assoc_Fold (Int_Plus_Assoc_Data);
wenzelm@9436
   354
  because combine_numerals does the same thing*)
wenzelm@9436
   355
wenzelm@9436
   356
structure Int_Times_Assoc_Data : ASSOC_FOLD_DATA =
wenzelm@9436
   357
struct
wenzelm@9436
   358
  val ss		= HOL_ss
wenzelm@9436
   359
  val eq_reflection	= eq_reflection
wenzelm@9436
   360
  val sg_ref = Sign.self_ref (Theory.sign_of (the_context ()))
wenzelm@9436
   361
  val T	     = HOLogic.intT
wenzelm@9436
   362
  val plus   = Const ("op *", [HOLogic.intT,HOLogic.intT] ---> HOLogic.intT);
wenzelm@9436
   363
  val add_ac = zmult_ac
wenzelm@9436
   364
end;
wenzelm@9436
   365
wenzelm@9436
   366
structure Int_Times_Assoc = Assoc_Fold (Int_Times_Assoc_Data);
wenzelm@9436
   367
wenzelm@9436
   368
Addsimprocs [Int_Times_Assoc.conv];
wenzelm@9436
   369
wenzelm@9436
   370
wenzelm@9436
   371
(** The same for the naturals **)
wenzelm@9436
   372
wenzelm@9436
   373
structure Nat_Times_Assoc_Data : ASSOC_FOLD_DATA =
wenzelm@9436
   374
struct
wenzelm@9436
   375
  val ss		= HOL_ss
wenzelm@9436
   376
  val eq_reflection	= eq_reflection
wenzelm@9436
   377
  val sg_ref = Sign.self_ref (Theory.sign_of (the_context ()))
wenzelm@9436
   378
  val T	     = HOLogic.natT
wenzelm@9436
   379
  val plus   = Const ("op *", [HOLogic.natT,HOLogic.natT] ---> HOLogic.natT);
wenzelm@9436
   380
  val add_ac = mult_ac
wenzelm@9436
   381
end;
wenzelm@9436
   382
wenzelm@9436
   383
structure Nat_Times_Assoc = Assoc_Fold (Nat_Times_Assoc_Data);
wenzelm@9436
   384
wenzelm@9436
   385
Addsimprocs [Nat_Times_Assoc.conv];
wenzelm@9436
   386
wenzelm@9436
   387
wenzelm@9436
   388
(*** decision procedure for linear arithmetic ***)
wenzelm@9436
   389
wenzelm@9436
   390
(*---------------------------------------------------------------------------*)
wenzelm@9436
   391
(* Linear arithmetic                                                         *)
wenzelm@9436
   392
(*---------------------------------------------------------------------------*)
wenzelm@9436
   393
wenzelm@9436
   394
(*
wenzelm@9436
   395
Instantiation of the generic linear arithmetic package for int.
wenzelm@9436
   396
*)
wenzelm@9436
   397
wenzelm@9436
   398
(* Update parameters of arithmetic prover *)
wenzelm@9436
   399
local
wenzelm@9436
   400
wenzelm@9436
   401
(* reduce contradictory <= to False *)
paulson@11868
   402
val add_rules = 
paulson@11868
   403
    simp_thms @ bin_arith_simps @ bin_rel_simps @ 
paulson@11868
   404
    [int_numeral_0_eq_0, int_numeral_1_eq_1,
paulson@12018
   405
     zminus_0, zadd_0, zadd_0_right, zdiff_def,
paulson@11868
   406
     zadd_zminus_inverse, zadd_zminus_inverse2, 
paulson@11868
   407
     zmult_0, zmult_0_right, 
nipkow@12482
   408
     zmult_1, zmult_1_right,
nipkow@12482
   409
     zmult_zminus, zmult_zminus_right,
paulson@11868
   410
     zminus_zadd_distrib, zminus_zminus, zmult_assoc,
paulson@11868
   411
     int_0, int_1, zadd_int RS sym, int_Suc];
wenzelm@9436
   412
wenzelm@9436
   413
val simprocs = [Int_Times_Assoc.conv, Int_Numeral_Simprocs.combine_numerals]@
paulson@11868
   414
               Int_Numeral_Simprocs.cancel_numerals @ 
paulson@11868
   415
               Bin_Simprocs.eval_numerals;
wenzelm@9436
   416
wenzelm@9436
   417
val add_mono_thms_int =
wenzelm@9436
   418
  map (fn s => prove_goal (the_context ()) s
wenzelm@9436
   419
                 (fn prems => [cut_facts_tac prems 1,
wenzelm@9436
   420
                      asm_simp_tac (simpset() addsimps [zadd_zle_mono]) 1]))
wenzelm@9436
   421
    ["(i <= j) & (k <= l) ==> i + k <= j + (l::int)",
wenzelm@9436
   422
     "(i  = j) & (k <= l) ==> i + k <= j + (l::int)",
wenzelm@9436
   423
     "(i <= j) & (k  = l) ==> i + k <= j + (l::int)",
wenzelm@9436
   424
     "(i  = j) & (k  = l) ==> i + k  = j + (l::int)"
wenzelm@9436
   425
    ];
wenzelm@9436
   426
wenzelm@9436
   427
in
wenzelm@9436
   428
wenzelm@9436
   429
val int_arith_setup =
nipkow@10693
   430
 [Fast_Arith.map_data (fn {add_mono_thms, mult_mono_thms, inj_thms, lessD, simpset} =>
wenzelm@9436
   431
   {add_mono_thms = add_mono_thms @ add_mono_thms_int,
nipkow@10693
   432
    mult_mono_thms = mult_mono_thms,
nipkow@10574
   433
    inj_thms = [zle_int RS iffD2,int_int_eq RS iffD2] @ inj_thms,
wenzelm@9436
   434
    lessD = lessD @ [add1_zle_eq RS iffD2],
wenzelm@9436
   435
    simpset = simpset addsimps add_rules
wenzelm@9436
   436
                      addsimprocs simprocs
wenzelm@9436
   437
                      addcongs [if_weak_cong]}),
nipkow@10834
   438
  arith_inj_const ("IntDef.int", HOLogic.natT --> HOLogic.intT),
wenzelm@9436
   439
  arith_discrete ("IntDef.int", true)];
wenzelm@9436
   440
wenzelm@9436
   441
end;
wenzelm@9436
   442
wenzelm@9436
   443
let
wenzelm@9436
   444
val int_arith_simproc_pats =
wenzelm@9436
   445
  map (fn s => Thm.read_cterm (Theory.sign_of (the_context())) (s, HOLogic.boolT))
wenzelm@9436
   446
      ["(m::int) < n","(m::int) <= n", "(m::int) = n"];
wenzelm@9436
   447
wenzelm@9436
   448
val fast_int_arith_simproc = mk_simproc
wenzelm@9436
   449
  "fast_int_arith" int_arith_simproc_pats Fast_Arith.lin_arith_prover;
wenzelm@9436
   450
in
wenzelm@9436
   451
Addsimprocs [fast_int_arith_simproc]
wenzelm@9436
   452
end;
wenzelm@9436
   453
wenzelm@9436
   454
(* Some test data
wenzelm@9436
   455
Goal "!!a::int. [| a <= b; c <= d; x+y<z |] ==> a+c <= b+d";
wenzelm@9436
   456
by (fast_arith_tac 1);
wenzelm@11704
   457
Goal "!!a::int. [| a < b; c < d |] ==> a-d+ 2 <= b+(-c)";
wenzelm@9436
   458
by (fast_arith_tac 1);
paulson@11868
   459
Goal "!!a::int. [| a < b; c < d |] ==> a+c+ 1 < b+d";
wenzelm@9436
   460
by (fast_arith_tac 1);
wenzelm@9436
   461
Goal "!!a::int. [| a <= b; b+b <= c |] ==> a+a <= c";
wenzelm@9436
   462
by (fast_arith_tac 1);
wenzelm@9436
   463
Goal "!!a::int. [| a+b <= i+j; a<=b; i<=j |] \
wenzelm@9436
   464
\     ==> a+a <= j+j";
wenzelm@9436
   465
by (fast_arith_tac 1);
wenzelm@9436
   466
Goal "!!a::int. [| a+b < i+j; a<b; i<j |] \
wenzelm@11704
   467
\     ==> a+a - - -1 < j+j - 3";
wenzelm@9436
   468
by (fast_arith_tac 1);
wenzelm@9436
   469
Goal "!!a::int. a+b+c <= i+j+k & a<=b & b<=c & i<=j & j<=k --> a+a+a <= k+k+k";
wenzelm@9436
   470
by (arith_tac 1);
wenzelm@9436
   471
Goal "!!a::int. [| a+b+c+d <= i+j+k+l; a<=b; b<=c; c<=d; i<=j; j<=k; k<=l |] \
wenzelm@9436
   472
\     ==> a <= l";
wenzelm@9436
   473
by (fast_arith_tac 1);
wenzelm@9436
   474
Goal "!!a::int. [| a+b+c+d <= i+j+k+l; a<=b; b<=c; c<=d; i<=j; j<=k; k<=l |] \
wenzelm@9436
   475
\     ==> a+a+a+a <= l+l+l+l";
wenzelm@9436
   476
by (fast_arith_tac 1);
wenzelm@9436
   477
Goal "!!a::int. [| a+b+c+d <= i+j+k+l; a<=b; b<=c; c<=d; i<=j; j<=k; k<=l |] \
wenzelm@9436
   478
\     ==> a+a+a+a+a <= l+l+l+l+i";
wenzelm@9436
   479
by (fast_arith_tac 1);
wenzelm@9436
   480
Goal "!!a::int. [| a+b+c+d <= i+j+k+l; a<=b; b<=c; c<=d; i<=j; j<=k; k<=l |] \
wenzelm@9436
   481
\     ==> a+a+a+a+a+a <= l+l+l+l+i+l";
wenzelm@9436
   482
by (fast_arith_tac 1);
wenzelm@9436
   483
Goal "!!a::int. [| a+b+c+d <= i+j+k+l; a<=b; b<=c; c<=d; i<=j; j<=k; k<=l |] \
wenzelm@11704
   484
\     ==> 6*a <= 5*l+i";
wenzelm@9436
   485
by (fast_arith_tac 1);
wenzelm@9436
   486
*)