src/HOL/Decision_Procs/Rat_Pair.thy
author haftmann
Thu Oct 30 21:02:01 2014 +0100 (2014-10-30)
changeset 58834 773b378d9313
parent 57512 cc97b347b301
child 58889 5b7a9633cfa8
permissions -rw-r--r--
more simp rules concerning dvd and even/odd
haftmann@54220
     1
(*  Title:      HOL/Decision_Procs/Rat_Pair.thy
haftmann@24197
     2
    Author:     Amine Chaieb
haftmann@24197
     3
*)
haftmann@24197
     4
haftmann@54220
     5
header {* Rational numbers as pairs *}
haftmann@24197
     6
haftmann@54220
     7
theory Rat_Pair
haftmann@36411
     8
imports Complex_Main
haftmann@24197
     9
begin
haftmann@24197
    10
wenzelm@42463
    11
type_synonym Num = "int \<times> int"
wenzelm@25005
    12
wenzelm@44780
    13
abbreviation Num0_syn :: Num  ("0\<^sub>N")
wenzelm@44779
    14
  where "0\<^sub>N \<equiv> (0, 0)"
wenzelm@25005
    15
wenzelm@50282
    16
abbreviation Numi_syn :: "int \<Rightarrow> Num"  ("'((_)')\<^sub>N")
wenzelm@50282
    17
  where "(i)\<^sub>N \<equiv> (i, 1)"
haftmann@24197
    18
wenzelm@44779
    19
definition isnormNum :: "Num \<Rightarrow> bool" where
huffman@31706
    20
  "isnormNum = (\<lambda>(a,b). (if a = 0 then b = 0 else b > 0 \<and> gcd a b = 1))"
haftmann@24197
    21
wenzelm@44779
    22
definition normNum :: "Num \<Rightarrow> Num" where
wenzelm@44779
    23
  "normNum = (\<lambda>(a,b).
wenzelm@44779
    24
    (if a=0 \<or> b = 0 then (0,0) else
wenzelm@44780
    25
      (let g = gcd a b
wenzelm@44779
    26
       in if b > 0 then (a div g, b div g) else (- (a div g), - (b div g)))))"
haftmann@24197
    27
wenzelm@44779
    28
declare gcd_dvd1_int[presburger] gcd_dvd2_int[presburger]
wenzelm@44779
    29
haftmann@24197
    30
lemma normNum_isnormNum [simp]: "isnormNum (normNum x)"
haftmann@24197
    31
proof -
wenzelm@44780
    32
  obtain a b where x: "x = (a, b)" by (cases x)
wenzelm@44780
    33
  { assume "a=0 \<or> b = 0" hence ?thesis by (simp add: x normNum_def isnormNum_def) }
haftmann@24197
    34
  moreover
wenzelm@44779
    35
  { assume anz: "a \<noteq> 0" and bnz: "b \<noteq> 0"
huffman@31706
    36
    let ?g = "gcd a b"
haftmann@24197
    37
    let ?a' = "a div ?g"
haftmann@24197
    38
    let ?b' = "b div ?g"
huffman@31706
    39
    let ?g' = "gcd ?a' ?b'"
wenzelm@44779
    40
    from anz bnz have "?g \<noteq> 0" by simp  with gcd_ge_0_int[of a b]
wenzelm@41528
    41
    have gpos: "?g > 0" by arith
wenzelm@44779
    42
    have gdvd: "?g dvd a" "?g dvd b" by arith+
huffman@47162
    43
    from dvd_mult_div_cancel[OF gdvd(1)] dvd_mult_div_cancel[OF gdvd(2)] anz bnz
wenzelm@44780
    44
    have nz': "?a' \<noteq> 0" "?b' \<noteq> 0" by - (rule notI, simp)+
wenzelm@44779
    45
    from anz bnz have stupid: "a \<noteq> 0 \<or> b \<noteq> 0" by arith
nipkow@31952
    46
    from div_gcd_coprime_int[OF stupid] have gp1: "?g' = 1" .
haftmann@24197
    47
    from bnz have "b < 0 \<or> b > 0" by arith
haftmann@24197
    48
    moreover
wenzelm@44779
    49
    { assume b: "b > 0"
wenzelm@44779
    50
      from b have "?b' \<ge> 0"
wenzelm@44779
    51
        by (presburger add: pos_imp_zdiv_nonneg_iff[OF gpos])
wenzelm@44780
    52
      with nz' have b': "?b' > 0" by arith
wenzelm@44780
    53
      from b b' anz bnz nz' gp1 have ?thesis
wenzelm@44780
    54
        by (simp add: x isnormNum_def normNum_def Let_def split_def) }
wenzelm@44779
    55
    moreover {
wenzelm@44779
    56
      assume b: "b < 0"
wenzelm@44780
    57
      { assume b': "?b' \<ge> 0"
wenzelm@32960
    58
        from gpos have th: "?g \<ge> 0" by arith
huffman@47162
    59
        from mult_nonneg_nonneg[OF th b'] dvd_mult_div_cancel[OF gdvd(2)]
wenzelm@32960
    60
        have False using b by arith }
wenzelm@44779
    61
      hence b': "?b' < 0" by (presburger add: linorder_not_le[symmetric])
wenzelm@44780
    62
      from anz bnz nz' b b' gp1 have ?thesis
wenzelm@44780
    63
        by (simp add: x isnormNum_def normNum_def Let_def split_def) }
haftmann@24197
    64
    ultimately have ?thesis by blast
haftmann@24197
    65
  }
haftmann@24197
    66
  ultimately show ?thesis by blast
haftmann@24197
    67
qed
haftmann@24197
    68
haftmann@24197
    69
text {* Arithmetic over Num *}
haftmann@24197
    70
wenzelm@44780
    71
definition Nadd :: "Num \<Rightarrow> Num \<Rightarrow> Num"  (infixl "+\<^sub>N" 60) where
wenzelm@44779
    72
  "Nadd = (\<lambda>(a,b) (a',b'). if a = 0 \<or> b = 0 then normNum(a',b')
wenzelm@44780
    73
    else if a'=0 \<or> b' = 0 then normNum(a,b)
haftmann@24197
    74
    else normNum(a*b' + b*a', b*b'))"
haftmann@24197
    75
wenzelm@44780
    76
definition Nmul :: "Num \<Rightarrow> Num \<Rightarrow> Num"  (infixl "*\<^sub>N" 60) where
wenzelm@44780
    77
  "Nmul = (\<lambda>(a,b) (a',b'). let g = gcd (a*a') (b*b')
haftmann@24197
    78
    in (a*a' div g, b*b' div g))"
haftmann@24197
    79
wenzelm@44779
    80
definition Nneg :: "Num \<Rightarrow> Num" ("~\<^sub>N")
wenzelm@44779
    81
  where "Nneg \<equiv> (\<lambda>(a,b). (-a,b))"
haftmann@24197
    82
wenzelm@44780
    83
definition Nsub :: "Num \<Rightarrow> Num \<Rightarrow> Num"  (infixl "-\<^sub>N" 60)
wenzelm@44779
    84
  where "Nsub = (\<lambda>a b. a +\<^sub>N ~\<^sub>N b)"
haftmann@24197
    85
wenzelm@44779
    86
definition Ninv :: "Num \<Rightarrow> Num"
wenzelm@44779
    87
  where "Ninv = (\<lambda>(a,b). if a < 0 then (-b, \<bar>a\<bar>) else (b,a))"
haftmann@24197
    88
wenzelm@44780
    89
definition Ndiv :: "Num \<Rightarrow> Num \<Rightarrow> Num"  (infixl "\<div>\<^sub>N" 60)
wenzelm@44779
    90
  where "Ndiv = (\<lambda>a b. a *\<^sub>N Ninv b)"
haftmann@24197
    91
haftmann@24197
    92
lemma Nneg_normN[simp]: "isnormNum x \<Longrightarrow> isnormNum (~\<^sub>N x)"
wenzelm@44779
    93
  by (simp add: isnormNum_def Nneg_def split_def)
wenzelm@44779
    94
haftmann@24197
    95
lemma Nadd_normN[simp]: "isnormNum (x +\<^sub>N y)"
haftmann@24197
    96
  by (simp add: Nadd_def split_def)
wenzelm@44779
    97
haftmann@24197
    98
lemma Nsub_normN[simp]: "\<lbrakk> isnormNum y\<rbrakk> \<Longrightarrow> isnormNum (x -\<^sub>N y)"
haftmann@24197
    99
  by (simp add: Nsub_def split_def)
wenzelm@44779
   100
wenzelm@44779
   101
lemma Nmul_normN[simp]:
wenzelm@44780
   102
  assumes xn: "isnormNum x" and yn: "isnormNum y"
haftmann@24197
   103
  shows "isnormNum (x *\<^sub>N y)"
wenzelm@44779
   104
proof -
wenzelm@44780
   105
  obtain a b where x: "x = (a, b)" by (cases x)
wenzelm@44780
   106
  obtain a' b' where y: "y = (a', b')" by (cases y)
wenzelm@44780
   107
  { assume "a = 0"
wenzelm@44780
   108
    hence ?thesis using xn x y
wenzelm@44780
   109
      by (simp add: isnormNum_def Let_def Nmul_def split_def) }
haftmann@24197
   110
  moreover
wenzelm@44780
   111
  { assume "a' = 0"
wenzelm@44780
   112
    hence ?thesis using yn x y
wenzelm@44780
   113
      by (simp add: isnormNum_def Let_def Nmul_def split_def) }
haftmann@24197
   114
  moreover
wenzelm@44780
   115
  { assume a: "a \<noteq>0" and a': "a'\<noteq>0"
wenzelm@44780
   116
    hence bp: "b > 0" "b' > 0" using xn yn x y by (simp_all add: isnormNum_def)
nipkow@56544
   117
    from bp have "x *\<^sub>N y = normNum (a * a', b * b')"
wenzelm@44780
   118
      using x y a a' bp by (simp add: Nmul_def Let_def split_def normNum_def)
wenzelm@44780
   119
    hence ?thesis by simp }
haftmann@24197
   120
  ultimately show ?thesis by blast
haftmann@24197
   121
qed
haftmann@24197
   122
haftmann@24197
   123
lemma Ninv_normN[simp]: "isnormNum x \<Longrightarrow> isnormNum (Ninv x)"
wenzelm@25005
   124
  by (simp add: Ninv_def isnormNum_def split_def)
nipkow@31952
   125
    (cases "fst x = 0", auto simp add: gcd_commute_int)
haftmann@24197
   126
wenzelm@44780
   127
lemma isnormNum_int[simp]:
wenzelm@50282
   128
  "isnormNum 0\<^sub>N" "isnormNum ((1::int)\<^sub>N)" "i \<noteq> 0 \<Longrightarrow> isnormNum (i)\<^sub>N"
huffman@31706
   129
  by (simp_all add: isnormNum_def)
haftmann@24197
   130
haftmann@24197
   131
haftmann@24197
   132
text {* Relations over Num *}
haftmann@24197
   133
wenzelm@44780
   134
definition Nlt0:: "Num \<Rightarrow> bool"  ("0>\<^sub>N")
wenzelm@44779
   135
  where "Nlt0 = (\<lambda>(a,b). a < 0)"
haftmann@24197
   136
wenzelm@44780
   137
definition Nle0:: "Num \<Rightarrow> bool"  ("0\<ge>\<^sub>N")
wenzelm@44779
   138
  where "Nle0 = (\<lambda>(a,b). a \<le> 0)"
haftmann@24197
   139
wenzelm@44780
   140
definition Ngt0:: "Num \<Rightarrow> bool"  ("0<\<^sub>N")
wenzelm@44779
   141
  where "Ngt0 = (\<lambda>(a,b). a > 0)"
haftmann@24197
   142
wenzelm@44780
   143
definition Nge0:: "Num \<Rightarrow> bool"  ("0\<le>\<^sub>N")
wenzelm@44779
   144
  where "Nge0 = (\<lambda>(a,b). a \<ge> 0)"
haftmann@24197
   145
wenzelm@44780
   146
definition Nlt :: "Num \<Rightarrow> Num \<Rightarrow> bool"  (infix "<\<^sub>N" 55)
wenzelm@44779
   147
  where "Nlt = (\<lambda>a b. 0>\<^sub>N (a -\<^sub>N b))"
haftmann@24197
   148
wenzelm@44779
   149
definition Nle :: "Num \<Rightarrow> Num \<Rightarrow> bool"  (infix "\<le>\<^sub>N" 55)
wenzelm@44779
   150
  where "Nle = (\<lambda>a b. 0\<ge>\<^sub>N (a -\<^sub>N b))"
haftmann@24197
   151
wenzelm@44779
   152
definition "INum = (\<lambda>(a,b). of_int a / of_int b)"
haftmann@24197
   153
wenzelm@50282
   154
lemma INum_int [simp]: "INum (i)\<^sub>N = ((of_int i) ::'a::field)" "INum 0\<^sub>N = (0::'a::field)"
haftmann@24197
   155
  by (simp_all add: INum_def)
haftmann@24197
   156
wenzelm@44780
   157
lemma isnormNum_unique[simp]:
wenzelm@44780
   158
  assumes na: "isnormNum x" and nb: "isnormNum y"
haftmann@36409
   159
  shows "((INum x ::'a::{field_char_0, field_inverse_zero}) = INum y) = (x = y)" (is "?lhs = ?rhs")
haftmann@24197
   160
proof
wenzelm@44780
   161
  obtain a b where x: "x = (a, b)" by (cases x)
wenzelm@44780
   162
  obtain a' b' where y: "y = (a', b')" by (cases y)
wenzelm@44780
   163
  assume H: ?lhs
wenzelm@44779
   164
  { assume "a = 0 \<or> b = 0 \<or> a' = 0 \<or> b' = 0"
nipkow@32456
   165
    hence ?rhs using na nb H
wenzelm@44780
   166
      by (simp add: x y INum_def split_def isnormNum_def split: split_if_asm) }
haftmann@24197
   167
  moreover
haftmann@24197
   168
  { assume az: "a \<noteq> 0" and bz: "b \<noteq> 0" and a'z: "a'\<noteq>0" and b'z: "b'\<noteq>0"
wenzelm@44780
   169
    from az bz a'z b'z na nb have pos: "b > 0" "b' > 0" by (simp_all add: x y isnormNum_def)
wenzelm@44780
   170
    from H bz b'z have eq: "a * b' = a'*b"
wenzelm@44780
   171
      by (simp add: x y INum_def eq_divide_eq divide_eq_eq of_int_mult[symmetric] del: of_int_mult)
wenzelm@44780
   172
    from az a'z na nb have gcd1: "gcd a b = 1" "gcd b a = 1" "gcd a' b' = 1" "gcd b' a' = 1"
wenzelm@44780
   173
      by (simp_all add: x y isnormNum_def add: gcd_commute_int)
wenzelm@44780
   174
    from eq have raw_dvd: "a dvd a' * b" "b dvd b' * a" "a' dvd a * b'" "b' dvd b * a'"
wenzelm@44780
   175
      apply -
chaieb@27668
   176
      apply algebra
chaieb@27668
   177
      apply algebra
chaieb@27668
   178
      apply simp
chaieb@27668
   179
      apply algebra
haftmann@24197
   180
      done
nipkow@33657
   181
    from zdvd_antisym_abs[OF coprime_dvd_mult_int[OF gcd1(2) raw_dvd(2)]
wenzelm@44780
   182
        coprime_dvd_mult_int[OF gcd1(4) raw_dvd(4)]]
wenzelm@41528
   183
      have eq1: "b = b'" using pos by arith
haftmann@24197
   184
      with eq have "a = a'" using pos by simp
wenzelm@44780
   185
      with eq1 have ?rhs by (simp add: x y) }
haftmann@24197
   186
  ultimately show ?rhs by blast
haftmann@24197
   187
next
haftmann@24197
   188
  assume ?rhs thus ?lhs by simp
haftmann@24197
   189
qed
haftmann@24197
   190
haftmann@24197
   191
wenzelm@44779
   192
lemma isnormNum0[simp]:
wenzelm@44779
   193
    "isnormNum x \<Longrightarrow> (INum x = (0::'a::{field_char_0, field_inverse_zero})) = (x = 0\<^sub>N)"
haftmann@24197
   194
  unfolding INum_int(2)[symmetric]
wenzelm@44779
   195
  by (rule isnormNum_unique) simp_all
haftmann@24197
   196
wenzelm@44780
   197
lemma of_int_div_aux: "d ~= 0 ==> ((of_int x)::'a::field_char_0) / (of_int d) =
haftmann@24197
   198
    of_int (x div d) + (of_int (x mod d)) / ((of_int d)::'a)"
haftmann@24197
   199
proof -
haftmann@24197
   200
  assume "d ~= 0"
haftmann@24197
   201
  let ?t = "of_int (x div d) * ((of_int d)::'a) + of_int(x mod d)"
haftmann@24197
   202
  let ?f = "\<lambda>x. x / of_int d"
haftmann@24197
   203
  have "x = (x div d) * d + x mod d"
haftmann@24197
   204
    by auto
haftmann@24197
   205
  then have eq: "of_int x = ?t"
haftmann@24197
   206
    by (simp only: of_int_mult[symmetric] of_int_add [symmetric])
wenzelm@44780
   207
  then have "of_int x / of_int d = ?t / of_int d"
haftmann@24197
   208
    using cong[OF refl[of ?f] eq] by simp
wenzelm@41528
   209
  then show ?thesis by (simp add: add_divide_distrib algebra_simps `d ~= 0`)
haftmann@24197
   210
qed
haftmann@24197
   211
haftmann@24197
   212
lemma of_int_div: "(d::int) ~= 0 ==> d dvd n ==>
haftmann@36409
   213
    (of_int(n div d)::'a::field_char_0) = of_int n / of_int d"
haftmann@58834
   214
  using of_int_div_aux [of d n, where ?'a = 'a] by simp
haftmann@24197
   215
haftmann@36409
   216
lemma normNum[simp]: "INum (normNum x) = (INum x :: 'a::{field_char_0, field_inverse_zero})"
wenzelm@44779
   217
proof -
wenzelm@44780
   218
  obtain a b where x: "x = (a, b)" by (cases x)
wenzelm@44780
   219
  { assume "a = 0 \<or> b = 0"
wenzelm@44780
   220
    hence ?thesis by (simp add: x INum_def normNum_def split_def Let_def) }
wenzelm@44780
   221
  moreover
wenzelm@44780
   222
  { assume a: "a \<noteq> 0" and b: "b \<noteq> 0"
huffman@31706
   223
    let ?g = "gcd a b"
haftmann@24197
   224
    from a b have g: "?g \<noteq> 0"by simp
haftmann@24197
   225
    from of_int_div[OF g, where ?'a = 'a]
hoelzl@56479
   226
    have ?thesis by (auto simp add: x INum_def normNum_def split_def Let_def) }
haftmann@24197
   227
  ultimately show ?thesis by blast
haftmann@24197
   228
qed
haftmann@24197
   229
wenzelm@44779
   230
lemma INum_normNum_iff:
wenzelm@44779
   231
  "(INum x ::'a::{field_char_0, field_inverse_zero}) = INum y \<longleftrightarrow> normNum x = normNum y"
wenzelm@44779
   232
  (is "?lhs = ?rhs")
haftmann@24197
   233
proof -
haftmann@24197
   234
  have "normNum x = normNum y \<longleftrightarrow> (INum (normNum x) :: 'a) = INum (normNum y)"
haftmann@24197
   235
    by (simp del: normNum)
haftmann@24197
   236
  also have "\<dots> = ?lhs" by simp
haftmann@24197
   237
  finally show ?thesis by simp
haftmann@24197
   238
qed
haftmann@24197
   239
haftmann@36409
   240
lemma Nadd[simp]: "INum (x +\<^sub>N y) = INum x + (INum y :: 'a :: {field_char_0, field_inverse_zero})"
wenzelm@44779
   241
proof -
wenzelm@44779
   242
  let ?z = "0:: 'a"
wenzelm@44780
   243
  obtain a b where x: "x = (a, b)" by (cases x)
wenzelm@44780
   244
  obtain a' b' where y: "y = (a', b')" by (cases y)
wenzelm@44779
   245
  { assume "a=0 \<or> a'= 0 \<or> b =0 \<or> b' = 0"
wenzelm@44780
   246
    hence ?thesis
wenzelm@44780
   247
      apply (cases "a=0", simp_all add: x y Nadd_def)
wenzelm@44779
   248
      apply (cases "b= 0", simp_all add: INum_def)
wenzelm@44779
   249
       apply (cases "a'= 0", simp_all)
wenzelm@44779
   250
       apply (cases "b'= 0", simp_all)
haftmann@24197
   251
       done }
wenzelm@44780
   252
  moreover
wenzelm@44780
   253
  { assume aa': "a \<noteq> 0" "a'\<noteq> 0" and bb': "b \<noteq> 0" "b' \<noteq> 0"
wenzelm@44779
   254
    { assume z: "a * b' + b * a' = 0"
haftmann@24197
   255
      hence "of_int (a*b' + b*a') / (of_int b* of_int b') = ?z" by simp
wenzelm@44780
   256
      hence "of_int b' * of_int a / (of_int b * of_int b') +
wenzelm@44780
   257
          of_int b * of_int a' / (of_int b * of_int b') = ?z"
wenzelm@44780
   258
        by (simp add:add_divide_distrib)
wenzelm@44779
   259
      hence th: "of_int a / of_int b + of_int a' / of_int b' = ?z" using bb' aa'
wenzelm@44780
   260
        by simp
wenzelm@44780
   261
      from z aa' bb' have ?thesis
wenzelm@44780
   262
        by (simp add: x y th Nadd_def normNum_def INum_def split_def) }
wenzelm@44779
   263
    moreover {
wenzelm@44779
   264
      assume z: "a * b' + b * a' \<noteq> 0"
haftmann@54230
   265
      let ?g = "gcd (a * b' + b * a') (b * b')"
haftmann@24197
   266
      have gz: "?g \<noteq> 0" using z by simp
haftmann@24197
   267
      have ?thesis using aa' bb' z gz
wenzelm@44779
   268
        of_int_div[where ?'a = 'a, OF gz gcd_dvd1_int[where x="a * b' + b * a'" and y="b*b'"]]
wenzelm@44779
   269
        of_int_div[where ?'a = 'a, OF gz gcd_dvd2_int[where x="a * b' + b * a'" and y="b*b'"]]
haftmann@54230
   270
        by (simp add: x y Nadd_def INum_def normNum_def Let_def) (simp add: field_simps)
haftmann@54230
   271
    }
wenzelm@44779
   272
    ultimately have ?thesis using aa' bb'
wenzelm@44780
   273
      by (simp add: x y Nadd_def INum_def normNum_def Let_def) }
haftmann@24197
   274
  ultimately show ?thesis by blast
haftmann@24197
   275
qed
haftmann@24197
   276
wenzelm@44779
   277
lemma Nmul[simp]: "INum (x *\<^sub>N y) = INum x * (INum y:: 'a :: {field_char_0, field_inverse_zero})"
wenzelm@44779
   278
proof -
haftmann@24197
   279
  let ?z = "0::'a"
wenzelm@44780
   280
  obtain a b where x: "x = (a, b)" by (cases x)
wenzelm@44780
   281
  obtain a' b' where y: "y = (a', b')" by (cases y)
wenzelm@44779
   282
  { assume "a=0 \<or> a'= 0 \<or> b = 0 \<or> b' = 0"
wenzelm@44780
   283
    hence ?thesis
wenzelm@44779
   284
      apply (cases "a=0", simp_all add: x y Nmul_def INum_def Let_def)
wenzelm@44779
   285
      apply (cases "b=0", simp_all)
wenzelm@44780
   286
      apply (cases "a'=0", simp_all)
haftmann@24197
   287
      done }
haftmann@24197
   288
  moreover
wenzelm@44779
   289
  { assume z: "a \<noteq> 0" "a' \<noteq> 0" "b \<noteq> 0" "b' \<noteq> 0"
huffman@31706
   290
    let ?g="gcd (a*a') (b*b')"
haftmann@24197
   291
    have gz: "?g \<noteq> 0" using z by simp
wenzelm@44779
   292
    from z of_int_div[where ?'a = 'a, OF gz gcd_dvd1_int[where x="a*a'" and y="b*b'"]]
wenzelm@44780
   293
      of_int_div[where ?'a = 'a , OF gz gcd_dvd2_int[where x="a*a'" and y="b*b'"]]
wenzelm@44779
   294
    have ?thesis by (simp add: Nmul_def x y Let_def INum_def) }
haftmann@24197
   295
  ultimately show ?thesis by blast
haftmann@24197
   296
qed
haftmann@24197
   297
haftmann@24197
   298
lemma Nneg[simp]: "INum (~\<^sub>N x) = - (INum x ::'a:: field)"
hoelzl@56479
   299
  by (simp add: Nneg_def split_def INum_def)
haftmann@24197
   300
wenzelm@44779
   301
lemma Nsub[simp]: "INum (x -\<^sub>N y) = INum x - (INum y:: 'a :: {field_char_0, field_inverse_zero})"
wenzelm@44779
   302
  by (simp add: Nsub_def split_def)
haftmann@24197
   303
haftmann@36409
   304
lemma Ninv[simp]: "INum (Ninv x) = (1::'a :: field_inverse_zero) / (INum x)"
hoelzl@56479
   305
  by (simp add: Ninv_def INum_def split_def)
haftmann@24197
   306
wenzelm@44779
   307
lemma Ndiv[simp]: "INum (x \<div>\<^sub>N y) = INum x / (INum y ::'a :: {field_char_0, field_inverse_zero})"
wenzelm@44779
   308
  by (simp add: Ndiv_def)
haftmann@24197
   309
wenzelm@44779
   310
lemma Nlt0_iff[simp]:
wenzelm@44780
   311
  assumes nx: "isnormNum x"
wenzelm@44779
   312
  shows "((INum x :: 'a :: {field_char_0, linordered_field_inverse_zero})< 0) = 0>\<^sub>N x"
wenzelm@44779
   313
proof -
wenzelm@44780
   314
  obtain a b where x: "x = (a, b)" by (cases x)
wenzelm@44780
   315
  { assume "a = 0" hence ?thesis by (simp add: x Nlt0_def INum_def) }
haftmann@24197
   316
  moreover
wenzelm@44780
   317
  { assume a: "a \<noteq> 0" hence b: "(of_int b::'a) > 0"
wenzelm@44780
   318
      using nx by (simp add: x isnormNum_def)
haftmann@24197
   319
    from pos_divide_less_eq[OF b, where b="of_int a" and a="0::'a"]
wenzelm@44780
   320
    have ?thesis by (simp add: x Nlt0_def INum_def) }
haftmann@24197
   321
  ultimately show ?thesis by blast
haftmann@24197
   322
qed
haftmann@24197
   323
wenzelm@44779
   324
lemma Nle0_iff[simp]:
wenzelm@44779
   325
  assumes nx: "isnormNum x"
haftmann@36409
   326
  shows "((INum x :: 'a :: {field_char_0, linordered_field_inverse_zero}) \<le> 0) = 0\<ge>\<^sub>N x"
wenzelm@44779
   327
proof -
wenzelm@44780
   328
  obtain a b where x: "x = (a, b)" by (cases x)
wenzelm@44780
   329
  { assume "a = 0" hence ?thesis by (simp add: x Nle0_def INum_def) }
haftmann@24197
   330
  moreover
wenzelm@44780
   331
  { assume a: "a \<noteq> 0" hence b: "(of_int b :: 'a) > 0"
wenzelm@44780
   332
      using nx by (simp add: x isnormNum_def)
haftmann@24197
   333
    from pos_divide_le_eq[OF b, where b="of_int a" and a="0::'a"]
wenzelm@44780
   334
    have ?thesis by (simp add: x Nle0_def INum_def) }
haftmann@24197
   335
  ultimately show ?thesis by blast
haftmann@24197
   336
qed
haftmann@24197
   337
wenzelm@44779
   338
lemma Ngt0_iff[simp]:
wenzelm@44779
   339
  assumes nx: "isnormNum x"
wenzelm@44779
   340
  shows "((INum x :: 'a :: {field_char_0, linordered_field_inverse_zero})> 0) = 0<\<^sub>N x"
wenzelm@44779
   341
proof -
wenzelm@44780
   342
  obtain a b where x: "x = (a, b)" by (cases x)
wenzelm@44780
   343
  { assume "a = 0" hence ?thesis by (simp add: x Ngt0_def INum_def) }
haftmann@24197
   344
  moreover
wenzelm@44780
   345
  { assume a: "a \<noteq> 0" hence b: "(of_int b::'a) > 0" using nx
wenzelm@44780
   346
      by (simp add: x isnormNum_def)
haftmann@24197
   347
    from pos_less_divide_eq[OF b, where b="of_int a" and a="0::'a"]
wenzelm@44780
   348
    have ?thesis by (simp add: x Ngt0_def INum_def) }
haftmann@24197
   349
  ultimately show ?thesis by blast
haftmann@24197
   350
qed
haftmann@24197
   351
wenzelm@44779
   352
lemma Nge0_iff[simp]:
wenzelm@44779
   353
  assumes nx: "isnormNum x"
wenzelm@44779
   354
  shows "((INum x :: 'a :: {field_char_0, linordered_field_inverse_zero}) \<ge> 0) = 0\<le>\<^sub>N x"
wenzelm@44779
   355
proof -
wenzelm@44780
   356
  obtain a b where x: "x = (a, b)" by (cases x)
wenzelm@44780
   357
  { assume "a = 0" hence ?thesis by (simp add: x Nge0_def INum_def) }
wenzelm@44779
   358
  moreover
wenzelm@44779
   359
  { assume "a \<noteq> 0" hence b: "(of_int b::'a) > 0" using nx
wenzelm@44780
   360
      by (simp add: x isnormNum_def)
wenzelm@44779
   361
    from pos_le_divide_eq[OF b, where b="of_int a" and a="0::'a"]
wenzelm@44780
   362
    have ?thesis by (simp add: x Nge0_def INum_def) }
wenzelm@44779
   363
  ultimately show ?thesis by blast
wenzelm@44779
   364
qed
wenzelm@44779
   365
wenzelm@44779
   366
lemma Nlt_iff[simp]:
wenzelm@44779
   367
  assumes nx: "isnormNum x" and ny: "isnormNum y"
haftmann@36409
   368
  shows "((INum x :: 'a :: {field_char_0, linordered_field_inverse_zero}) < INum y) = (x <\<^sub>N y)"
wenzelm@44779
   369
proof -
haftmann@24197
   370
  let ?z = "0::'a"
wenzelm@44779
   371
  have "((INum x ::'a) < INum y) = (INum (x -\<^sub>N y) < ?z)"
wenzelm@44779
   372
    using nx ny by simp
wenzelm@44779
   373
  also have "\<dots> = (0>\<^sub>N (x -\<^sub>N y))"
wenzelm@44779
   374
    using Nlt0_iff[OF Nsub_normN[OF ny]] by simp
haftmann@24197
   375
  finally show ?thesis by (simp add: Nlt_def)
haftmann@24197
   376
qed
haftmann@24197
   377
wenzelm@44779
   378
lemma Nle_iff[simp]:
wenzelm@44779
   379
  assumes nx: "isnormNum x" and ny: "isnormNum y"
haftmann@36409
   380
  shows "((INum x :: 'a :: {field_char_0, linordered_field_inverse_zero})\<le> INum y) = (x \<le>\<^sub>N y)"
wenzelm@44779
   381
proof -
wenzelm@44779
   382
  have "((INum x ::'a) \<le> INum y) = (INum (x -\<^sub>N y) \<le> (0::'a))"
wenzelm@44779
   383
    using nx ny by simp
wenzelm@44779
   384
  also have "\<dots> = (0\<ge>\<^sub>N (x -\<^sub>N y))"
wenzelm@44779
   385
    using Nle0_iff[OF Nsub_normN[OF ny]] by simp
haftmann@24197
   386
  finally show ?thesis by (simp add: Nle_def)
haftmann@24197
   387
qed
haftmann@24197
   388
wenzelm@28615
   389
lemma Nadd_commute:
haftmann@36409
   390
  assumes "SORT_CONSTRAINT('a::{field_char_0, field_inverse_zero})"
wenzelm@28615
   391
  shows "x +\<^sub>N y = y +\<^sub>N x"
wenzelm@44779
   392
proof -
haftmann@24197
   393
  have n: "isnormNum (x +\<^sub>N y)" "isnormNum (y +\<^sub>N x)" by simp_all
chaieb@31964
   394
  have "(INum (x +\<^sub>N y)::'a) = INum (y +\<^sub>N x)" by simp
haftmann@24197
   395
  with isnormNum_unique[OF n] show ?thesis by simp
haftmann@24197
   396
qed
haftmann@24197
   397
wenzelm@28615
   398
lemma [simp]:
haftmann@36409
   399
  assumes "SORT_CONSTRAINT('a::{field_char_0, field_inverse_zero})"
wenzelm@28615
   400
  shows "(0, b) +\<^sub>N y = normNum y"
wenzelm@44780
   401
    and "(a, 0) +\<^sub>N y = normNum y"
wenzelm@28615
   402
    and "x +\<^sub>N (0, b) = normNum x"
wenzelm@28615
   403
    and "x +\<^sub>N (a, 0) = normNum x"
wenzelm@28615
   404
  apply (simp add: Nadd_def split_def)
wenzelm@28615
   405
  apply (simp add: Nadd_def split_def)
wenzelm@28615
   406
  apply (subst Nadd_commute, simp add: Nadd_def split_def)
wenzelm@28615
   407
  apply (subst Nadd_commute, simp add: Nadd_def split_def)
haftmann@24197
   408
  done
haftmann@24197
   409
wenzelm@28615
   410
lemma normNum_nilpotent_aux[simp]:
haftmann@36409
   411
  assumes "SORT_CONSTRAINT('a::{field_char_0, field_inverse_zero})"
wenzelm@44780
   412
  assumes nx: "isnormNum x"
haftmann@24197
   413
  shows "normNum x = x"
wenzelm@44779
   414
proof -
haftmann@24197
   415
  let ?a = "normNum x"
haftmann@24197
   416
  have n: "isnormNum ?a" by simp
wenzelm@44779
   417
  have th: "INum ?a = (INum x ::'a)" by simp
wenzelm@44779
   418
  with isnormNum_unique[OF n nx] show ?thesis by simp
haftmann@24197
   419
qed
haftmann@24197
   420
wenzelm@28615
   421
lemma normNum_nilpotent[simp]:
haftmann@36409
   422
  assumes "SORT_CONSTRAINT('a::{field_char_0, field_inverse_zero})"
wenzelm@28615
   423
  shows "normNum (normNum x) = normNum x"
haftmann@24197
   424
  by simp
wenzelm@28615
   425
haftmann@24197
   426
lemma normNum0[simp]: "normNum (0,b) = 0\<^sub>N" "normNum (a,0) = 0\<^sub>N"
haftmann@24197
   427
  by (simp_all add: normNum_def)
wenzelm@28615
   428
wenzelm@28615
   429
lemma normNum_Nadd:
haftmann@36409
   430
  assumes "SORT_CONSTRAINT('a::{field_char_0, field_inverse_zero})"
wenzelm@28615
   431
  shows "normNum (x +\<^sub>N y) = x +\<^sub>N y" by simp
wenzelm@28615
   432
wenzelm@28615
   433
lemma Nadd_normNum1[simp]:
haftmann@36409
   434
  assumes "SORT_CONSTRAINT('a::{field_char_0, field_inverse_zero})"
wenzelm@28615
   435
  shows "normNum x +\<^sub>N y = x +\<^sub>N y"
wenzelm@44779
   436
proof -
haftmann@24197
   437
  have n: "isnormNum (normNum x +\<^sub>N y)" "isnormNum (x +\<^sub>N y)" by simp_all
chaieb@31964
   438
  have "INum (normNum x +\<^sub>N y) = INum x + (INum y :: 'a)" by simp
haftmann@24197
   439
  also have "\<dots> = INum (x +\<^sub>N y)" by simp
haftmann@24197
   440
  finally show ?thesis using isnormNum_unique[OF n] by simp
haftmann@24197
   441
qed
haftmann@24197
   442
wenzelm@28615
   443
lemma Nadd_normNum2[simp]:
haftmann@36409
   444
  assumes "SORT_CONSTRAINT('a::{field_char_0, field_inverse_zero})"
wenzelm@28615
   445
  shows "x +\<^sub>N normNum y = x +\<^sub>N y"
wenzelm@44779
   446
proof -
wenzelm@28615
   447
  have n: "isnormNum (x +\<^sub>N normNum y)" "isnormNum (x +\<^sub>N y)" by simp_all
chaieb@31964
   448
  have "INum (x +\<^sub>N normNum y) = INum x + (INum y :: 'a)" by simp
wenzelm@28615
   449
  also have "\<dots> = INum (x +\<^sub>N y)" by simp
wenzelm@28615
   450
  finally show ?thesis using isnormNum_unique[OF n] by simp
wenzelm@28615
   451
qed
wenzelm@28615
   452
wenzelm@28615
   453
lemma Nadd_assoc:
haftmann@36409
   454
  assumes "SORT_CONSTRAINT('a::{field_char_0, field_inverse_zero})"
wenzelm@28615
   455
  shows "x +\<^sub>N y +\<^sub>N z = x +\<^sub>N (y +\<^sub>N z)"
wenzelm@44779
   456
proof -
haftmann@24197
   457
  have n: "isnormNum (x +\<^sub>N y +\<^sub>N z)" "isnormNum (x +\<^sub>N (y +\<^sub>N z))" by simp_all
chaieb@31964
   458
  have "INum (x +\<^sub>N y +\<^sub>N z) = (INum (x +\<^sub>N (y +\<^sub>N z)) :: 'a)" by simp
haftmann@24197
   459
  with isnormNum_unique[OF n] show ?thesis by simp
haftmann@24197
   460
qed
haftmann@24197
   461
haftmann@24197
   462
lemma Nmul_commute: "isnormNum x \<Longrightarrow> isnormNum y \<Longrightarrow> x *\<^sub>N y = y *\<^sub>N x"
haftmann@57512
   463
  by (simp add: Nmul_def split_def Let_def gcd_commute_int mult.commute)
haftmann@24197
   464
wenzelm@28615
   465
lemma Nmul_assoc:
haftmann@36409
   466
  assumes "SORT_CONSTRAINT('a::{field_char_0, field_inverse_zero})"
wenzelm@44780
   467
  assumes nx: "isnormNum x" and ny: "isnormNum y" and nz: "isnormNum z"
haftmann@24197
   468
  shows "x *\<^sub>N y *\<^sub>N z = x *\<^sub>N (y *\<^sub>N z)"
wenzelm@44779
   469
proof -
wenzelm@44780
   470
  from nx ny nz have n: "isnormNum (x *\<^sub>N y *\<^sub>N z)" "isnormNum (x *\<^sub>N (y *\<^sub>N z))"
haftmann@24197
   471
    by simp_all
chaieb@31964
   472
  have "INum (x +\<^sub>N y +\<^sub>N z) = (INum (x +\<^sub>N (y +\<^sub>N z)) :: 'a)" by simp
haftmann@24197
   473
  with isnormNum_unique[OF n] show ?thesis by simp
haftmann@24197
   474
qed
haftmann@24197
   475
wenzelm@28615
   476
lemma Nsub0:
haftmann@36409
   477
  assumes "SORT_CONSTRAINT('a::{field_char_0, field_inverse_zero})"
wenzelm@44780
   478
  assumes x: "isnormNum x" and y: "isnormNum y"
wenzelm@44780
   479
  shows "x -\<^sub>N y = 0\<^sub>N \<longleftrightarrow> x = y"
wenzelm@44779
   480
proof -
wenzelm@44779
   481
  fix h :: 'a
wenzelm@44780
   482
  from isnormNum_unique[where 'a = 'a, OF Nsub_normN[OF y], where y="0\<^sub>N"]
wenzelm@44779
   483
  have "(x -\<^sub>N y = 0\<^sub>N) = (INum (x -\<^sub>N y) = (INum 0\<^sub>N :: 'a)) " by simp
wenzelm@44779
   484
  also have "\<dots> = (INum x = (INum y :: 'a))" by simp
wenzelm@44779
   485
  also have "\<dots> = (x = y)" using x y by simp
wenzelm@44779
   486
  finally show ?thesis .
haftmann@24197
   487
qed
haftmann@24197
   488
haftmann@24197
   489
lemma Nmul0[simp]: "c *\<^sub>N 0\<^sub>N = 0\<^sub>N" " 0\<^sub>N *\<^sub>N c = 0\<^sub>N"
haftmann@24197
   490
  by (simp_all add: Nmul_def Let_def split_def)
haftmann@24197
   491
wenzelm@28615
   492
lemma Nmul_eq0[simp]:
haftmann@36409
   493
  assumes "SORT_CONSTRAINT('a::{field_char_0, field_inverse_zero})"
wenzelm@44780
   494
  assumes nx: "isnormNum x" and ny: "isnormNum y"
wenzelm@44780
   495
  shows "x*\<^sub>N y = 0\<^sub>N \<longleftrightarrow> x = 0\<^sub>N \<or> y = 0\<^sub>N"
wenzelm@44779
   496
proof -
wenzelm@44779
   497
  fix h :: 'a
wenzelm@44780
   498
  obtain a b where x: "x = (a, b)" by (cases x)
wenzelm@44780
   499
  obtain a' b' where y: "y = (a', b')" by (cases y)
wenzelm@44779
   500
  have n0: "isnormNum 0\<^sub>N" by simp
wenzelm@44780
   501
  show ?thesis using nx ny
wenzelm@44779
   502
    apply (simp only: isnormNum_unique[where ?'a = 'a, OF  Nmul_normN[OF nx ny] n0, symmetric]
wenzelm@44779
   503
      Nmul[where ?'a = 'a])
wenzelm@44780
   504
    apply (simp add: x y INum_def split_def isnormNum_def split: split_if_asm)
wenzelm@44779
   505
    done
haftmann@24197
   506
qed
wenzelm@44779
   507
haftmann@24197
   508
lemma Nneg_Nneg[simp]: "~\<^sub>N (~\<^sub>N c) = c"
haftmann@24197
   509
  by (simp add: Nneg_def split_def)
haftmann@24197
   510
wenzelm@44780
   511
lemma Nmul1[simp]:
wenzelm@50282
   512
    "isnormNum c \<Longrightarrow> (1)\<^sub>N *\<^sub>N c = c"
wenzelm@50282
   513
    "isnormNum c \<Longrightarrow> c *\<^sub>N (1)\<^sub>N = c"
haftmann@24197
   514
  apply (simp_all add: Nmul_def Let_def split_def isnormNum_def)
wenzelm@28615
   515
  apply (cases "fst c = 0", simp_all, cases c, simp_all)+
wenzelm@28615
   516
  done
haftmann@24197
   517
wenzelm@28615
   518
end