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