src/HOL/Rational.thy
author huffman
Wed, 25 Feb 2009 09:09:50 -0800
changeset 30095 c6e184561159
parent 29940 83b373f61d41
child 30097 57df8626c23b
permissions -rw-r--r--
add lemmas about comparisons of Fract a b with 0 and 1
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
28952
15a4b2cf8c34 made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents: 28562
diff changeset
     1
(*  Title:  HOL/Rational.thy
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
     2
    Author: Markus Wenzel, TU Muenchen
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
     3
*)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
     4
14691
e1eedc8cad37 tuned instance statements;
wenzelm
parents: 14430
diff changeset
     5
header {* Rational numbers *}
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
     6
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15013
diff changeset
     7
theory Rational
29880
3dee8ff45d3d move countability proof from Rational to Countable; add instance rat :: countable
huffman
parents: 29667
diff changeset
     8
imports GCD
28952
15a4b2cf8c34 made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents: 28562
diff changeset
     9
uses ("Tools/rat_arith.ML")
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15013
diff changeset
    10
begin
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
    11
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    12
subsection {* Rational numbers as quotient *}
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
    13
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    14
subsubsection {* Construction of the type of rational numbers *}
18913
57f19fad8c2a reimplemented using Equiv_Relations.thy
huffman
parents: 18372
diff changeset
    15
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 20522
diff changeset
    16
definition
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 20522
diff changeset
    17
  ratrel :: "((int \<times> int) \<times> (int \<times> int)) set" where
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    18
  "ratrel = {(x, y). snd x \<noteq> 0 \<and> snd y \<noteq> 0 \<and> fst x * snd y = fst y * snd x}"
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
    19
18913
57f19fad8c2a reimplemented using Equiv_Relations.thy
huffman
parents: 18372
diff changeset
    20
lemma ratrel_iff [simp]:
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    21
  "(x, y) \<in> ratrel \<longleftrightarrow> snd x \<noteq> 0 \<and> snd y \<noteq> 0 \<and> fst x * snd y = fst y * snd x"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    22
  by (simp add: ratrel_def)
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
    23
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    24
lemma refl_ratrel: "refl {x. snd x \<noteq> 0} ratrel"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    25
  by (auto simp add: refl_def ratrel_def)
18913
57f19fad8c2a reimplemented using Equiv_Relations.thy
huffman
parents: 18372
diff changeset
    26
57f19fad8c2a reimplemented using Equiv_Relations.thy
huffman
parents: 18372
diff changeset
    27
lemma sym_ratrel: "sym ratrel"
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    28
  by (simp add: ratrel_def sym_def)
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
    29
18913
57f19fad8c2a reimplemented using Equiv_Relations.thy
huffman
parents: 18372
diff changeset
    30
lemma trans_ratrel: "trans ratrel"
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    31
proof (rule transI, unfold split_paired_all)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    32
  fix a b a' b' a'' b'' :: int
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    33
  assume A: "((a, b), (a', b')) \<in> ratrel"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    34
  assume B: "((a', b'), (a'', b'')) \<in> ratrel"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    35
  have "b' * (a * b'') = b'' * (a * b')" by simp
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    36
  also from A have "a * b' = a' * b" by auto
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    37
  also have "b'' * (a' * b) = b * (a' * b'')" by simp
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    38
  also from B have "a' * b'' = a'' * b'" by auto
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    39
  also have "b * (a'' * b') = b' * (a'' * b)" by simp
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    40
  finally have "b' * (a * b'') = b' * (a'' * b)" .
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    41
  moreover from B have "b' \<noteq> 0" by auto
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    42
  ultimately have "a * b'' = a'' * b" by simp
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    43
  with A B show "((a, b), (a'', b'')) \<in> ratrel" by auto
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
    44
qed
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    45
  
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    46
lemma equiv_ratrel: "equiv {x. snd x \<noteq> 0} ratrel"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    47
  by (rule equiv.intro [OF refl_ratrel sym_ratrel trans_ratrel])
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
    48
18913
57f19fad8c2a reimplemented using Equiv_Relations.thy
huffman
parents: 18372
diff changeset
    49
lemmas UN_ratrel = UN_equiv_class [OF equiv_ratrel]
57f19fad8c2a reimplemented using Equiv_Relations.thy
huffman
parents: 18372
diff changeset
    50
lemmas UN_ratrel2 = UN_equiv_class2 [OF equiv_ratrel equiv_ratrel]
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
    51
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    52
lemma equiv_ratrel_iff [iff]: 
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    53
  assumes "snd x \<noteq> 0" and "snd y \<noteq> 0"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    54
  shows "ratrel `` {x} = ratrel `` {y} \<longleftrightarrow> (x, y) \<in> ratrel"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    55
  by (rule eq_equiv_class_iff, rule equiv_ratrel) (auto simp add: assms)
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
    56
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    57
typedef (Rat) rat = "{x. snd x \<noteq> 0} // ratrel"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    58
proof
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    59
  have "(0::int, 1::int) \<in> {x. snd x \<noteq> 0}" by simp
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    60
  then show "ratrel `` {(0, 1)} \<in> {x. snd x \<noteq> 0} // ratrel" by (rule quotientI)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    61
qed
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    62
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    63
lemma ratrel_in_Rat [simp]: "snd x \<noteq> 0 \<Longrightarrow> ratrel `` {x} \<in> Rat"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    64
  by (simp add: Rat_def quotientI)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    65
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    66
declare Abs_Rat_inject [simp] Abs_Rat_inverse [simp]
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    67
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    68
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    69
subsubsection {* Representation and basic operations *}
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    70
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    71
definition
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    72
  Fract :: "int \<Rightarrow> int \<Rightarrow> rat" where
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
    73
  [code del]: "Fract a b = Abs_Rat (ratrel `` {if b = 0 then (0, 1) else (a, b)})"
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
    74
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    75
code_datatype Fract
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    76
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    77
lemma Rat_cases [case_names Fract, cases type: rat]:
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    78
  assumes "\<And>a b. q = Fract a b \<Longrightarrow> b \<noteq> 0 \<Longrightarrow> C"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    79
  shows C
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    80
  using assms by (cases q) (clarsimp simp add: Fract_def Rat_def quotient_def)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    81
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    82
lemma Rat_induct [case_names Fract, induct type: rat]:
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    83
  assumes "\<And>a b. b \<noteq> 0 \<Longrightarrow> P (Fract a b)"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    84
  shows "P q"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    85
  using assms by (cases q) simp
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    86
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    87
lemma eq_rat:
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    88
  shows "\<And>a b c d. b \<noteq> 0 \<Longrightarrow> d \<noteq> 0 \<Longrightarrow> Fract a b = Fract c d \<longleftrightarrow> a * d = c * b"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
    89
  and "\<And>a. Fract a 0 = Fract 0 1"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
    90
  and "\<And>a c. Fract 0 a = Fract 0 c"
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    91
  by (simp_all add: Fract_def)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    92
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    93
instantiation rat :: "{comm_ring_1, recpower}"
25571
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
    94
begin
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
    95
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
    96
definition
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
    97
  Zero_rat_def [code, code unfold]: "0 = Fract 0 1"
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
    98
25571
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
    99
definition
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   100
  One_rat_def [code, code unfold]: "1 = Fract 1 1"
18913
57f19fad8c2a reimplemented using Equiv_Relations.thy
huffman
parents: 18372
diff changeset
   101
25571
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   102
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   103
  add_rat_def [code del]:
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   104
  "q + r = Abs_Rat (\<Union>x \<in> Rep_Rat q. \<Union>y \<in> Rep_Rat r.
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   105
    ratrel `` {(fst x * snd y + fst y * snd x, snd x * snd y)})"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   106
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   107
lemma add_rat [simp]:
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   108
  assumes "b \<noteq> 0" and "d \<noteq> 0"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   109
  shows "Fract a b + Fract c d = Fract (a * d + c * b) (b * d)"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   110
proof -
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   111
  have "(\<lambda>x y. ratrel``{(fst x * snd y + fst y * snd x, snd x * snd y)})
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   112
    respects2 ratrel"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   113
  by (rule equiv_ratrel [THEN congruent2_commuteI]) (simp_all add: left_distrib)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   114
  with assms show ?thesis by (simp add: Fract_def add_rat_def UN_ratrel2)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   115
qed
18913
57f19fad8c2a reimplemented using Equiv_Relations.thy
huffman
parents: 18372
diff changeset
   116
25571
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   117
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   118
  minus_rat_def [code del]:
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   119
  "- q = Abs_Rat (\<Union>x \<in> Rep_Rat q. ratrel `` {(- fst x, snd x)})"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   120
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   121
lemma minus_rat [simp, code]: "- Fract a b = Fract (- a) b"
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   122
proof -
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   123
  have "(\<lambda>x. ratrel `` {(- fst x, snd x)}) respects ratrel"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   124
    by (simp add: congruent_def)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   125
  then show ?thesis by (simp add: Fract_def minus_rat_def UN_ratrel)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   126
qed
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   127
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   128
lemma minus_rat_cancel [simp]: "Fract (- a) (- b) = Fract a b"
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   129
  by (cases "b = 0") (simp_all add: eq_rat)
25571
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   130
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   131
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   132
  diff_rat_def [code del]: "q - r = q + - (r::rat)"
18913
57f19fad8c2a reimplemented using Equiv_Relations.thy
huffman
parents: 18372
diff changeset
   133
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   134
lemma diff_rat [simp]:
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   135
  assumes "b \<noteq> 0" and "d \<noteq> 0"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   136
  shows "Fract a b - Fract c d = Fract (a * d - c * b) (b * d)"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   137
  using assms by (simp add: diff_rat_def)
25571
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   138
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   139
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   140
  mult_rat_def [code del]:
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   141
  "q * r = Abs_Rat (\<Union>x \<in> Rep_Rat q. \<Union>y \<in> Rep_Rat r.
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   142
    ratrel``{(fst x * fst y, snd x * snd y)})"
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   143
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   144
lemma mult_rat [simp]: "Fract a b * Fract c d = Fract (a * c) (b * d)"
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   145
proof -
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   146
  have "(\<lambda>x y. ratrel `` {(fst x * fst y, snd x * snd y)}) respects2 ratrel"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   147
    by (rule equiv_ratrel [THEN congruent2_commuteI]) simp_all
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   148
  then show ?thesis by (simp add: Fract_def mult_rat_def UN_ratrel2)
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   149
qed
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   150
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   151
lemma mult_rat_cancel:
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   152
  assumes "c \<noteq> 0"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   153
  shows "Fract (c * a) (c * b) = Fract a b"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   154
proof -
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   155
  from assms have "Fract c c = Fract 1 1" by (simp add: Fract_def)
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   156
  then show ?thesis by (simp add: mult_rat [symmetric])
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   157
qed
27509
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   158
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   159
primrec power_rat
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   160
where
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   161
  rat_power_0:     "q ^ 0 = (1\<Colon>rat)"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   162
  | rat_power_Suc: "q ^ Suc n = (q\<Colon>rat) * (q ^ n)"
27509
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   163
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   164
instance proof
27668
6eb20b2cecf8 Tuned and simplified proofs
chaieb
parents: 27652
diff changeset
   165
  fix q r s :: rat show "(q * r) * s = q * (r * s)" 
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   166
    by (cases q, cases r, cases s) (simp add: eq_rat)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   167
next
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   168
  fix q r :: rat show "q * r = r * q"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   169
    by (cases q, cases r) (simp add: eq_rat)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   170
next
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   171
  fix q :: rat show "1 * q = q"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   172
    by (cases q) (simp add: One_rat_def eq_rat)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   173
next
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   174
  fix q r s :: rat show "(q + r) + s = q + (r + s)"
29667
53103fc8ffa3 Replaced group_ and ring_simps by algebra_simps;
nipkow
parents: 29332
diff changeset
   175
    by (cases q, cases r, cases s) (simp add: eq_rat algebra_simps)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   176
next
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   177
  fix q r :: rat show "q + r = r + q"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   178
    by (cases q, cases r) (simp add: eq_rat)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   179
next
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   180
  fix q :: rat show "0 + q = q"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   181
    by (cases q) (simp add: Zero_rat_def eq_rat)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   182
next
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   183
  fix q :: rat show "- q + q = 0"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   184
    by (cases q) (simp add: Zero_rat_def eq_rat)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   185
next
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   186
  fix q r :: rat show "q - r = q + - r"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   187
    by (cases q, cases r) (simp add: eq_rat)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   188
next
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   189
  fix q r s :: rat show "(q + r) * s = q * s + r * s"
29667
53103fc8ffa3 Replaced group_ and ring_simps by algebra_simps;
nipkow
parents: 29332
diff changeset
   190
    by (cases q, cases r, cases s) (simp add: eq_rat algebra_simps)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   191
next
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   192
  show "(0::rat) \<noteq> 1" by (simp add: Zero_rat_def One_rat_def eq_rat)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   193
next
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   194
  fix q :: rat show "q * 1 = q"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   195
    by (cases q) (simp add: One_rat_def eq_rat)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   196
next
27509
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   197
  fix q :: rat
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   198
  fix n :: nat
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   199
  show "q ^ 0 = 1" by simp
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   200
  show "q ^ (Suc n) = q * (q ^ n)" by simp
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   201
qed
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   202
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   203
end
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   204
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   205
lemma of_nat_rat: "of_nat k = Fract (of_nat k) 1"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   206
  by (induct k) (simp_all add: Zero_rat_def One_rat_def)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   207
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   208
lemma of_int_rat: "of_int k = Fract k 1"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   209
  by (cases k rule: int_diff_cases) (simp add: of_nat_rat)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   210
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   211
lemma Fract_of_nat_eq: "Fract (of_nat k) 1 = of_nat k"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   212
  by (rule of_nat_rat [symmetric])
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   213
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   214
lemma Fract_of_int_eq: "Fract k 1 = of_int k"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   215
  by (rule of_int_rat [symmetric])
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   216
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   217
instantiation rat :: number_ring
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   218
begin
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   219
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   220
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   221
  rat_number_of_def [code del]: "number_of w = Fract w 1"
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   222
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   223
instance by intro_classes (simp add: rat_number_of_def of_int_rat)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   224
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   225
end
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   226
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   227
lemma rat_number_collapse [code post]:
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   228
  "Fract 0 k = 0"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   229
  "Fract 1 1 = 1"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   230
  "Fract (number_of k) 1 = number_of k"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   231
  "Fract k 0 = 0"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   232
  by (cases "k = 0")
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   233
    (simp_all add: Zero_rat_def One_rat_def number_of_is_id number_of_eq of_int_rat eq_rat Fract_def)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   234
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   235
lemma rat_number_expand [code unfold]:
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   236
  "0 = Fract 0 1"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   237
  "1 = Fract 1 1"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   238
  "number_of k = Fract (number_of k) 1"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   239
  by (simp_all add: rat_number_collapse)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   240
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   241
lemma iszero_rat [simp]:
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   242
  "iszero (number_of k :: rat) \<longleftrightarrow> iszero (number_of k :: int)"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   243
  by (simp add: iszero_def rat_number_expand number_of_is_id eq_rat)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   244
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   245
lemma Rat_cases_nonzero [case_names Fract 0]:
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   246
  assumes Fract: "\<And>a b. q = Fract a b \<Longrightarrow> b \<noteq> 0 \<Longrightarrow> a \<noteq> 0 \<Longrightarrow> C"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   247
  assumes 0: "q = 0 \<Longrightarrow> C"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   248
  shows C
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   249
proof (cases "q = 0")
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   250
  case True then show C using 0 by auto
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   251
next
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   252
  case False
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   253
  then obtain a b where "q = Fract a b" and "b \<noteq> 0" by (cases q) auto
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   254
  moreover with False have "0 \<noteq> Fract a b" by simp
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   255
  with `b \<noteq> 0` have "a \<noteq> 0" by (simp add: Zero_rat_def eq_rat)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   256
  with Fract `q = Fract a b` `b \<noteq> 0` show C by auto
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   257
qed
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   258
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   259
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   260
subsubsection {* The field of rational numbers *}
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   261
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   262
instantiation rat :: "{field, division_by_zero}"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   263
begin
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   264
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   265
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   266
  inverse_rat_def [code del]:
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   267
  "inverse q = Abs_Rat (\<Union>x \<in> Rep_Rat q.
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   268
     ratrel `` {if fst x = 0 then (0, 1) else (snd x, fst x)})"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   269
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   270
lemma inverse_rat [simp]: "inverse (Fract a b) = Fract b a"
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   271
proof -
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   272
  have "(\<lambda>x. ratrel `` {if fst x = 0 then (0, 1) else (snd x, fst x)}) respects ratrel"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   273
    by (auto simp add: congruent_def mult_commute)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   274
  then show ?thesis by (simp add: Fract_def inverse_rat_def UN_ratrel)
27509
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   275
qed
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   276
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   277
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   278
  divide_rat_def [code del]: "q / r = q * inverse (r::rat)"
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   279
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   280
lemma divide_rat [simp]: "Fract a b / Fract c d = Fract (a * d) (b * c)"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   281
  by (simp add: divide_rat_def)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   282
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   283
instance proof
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   284
  show "inverse 0 = (0::rat)" by (simp add: rat_number_expand)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   285
    (simp add: rat_number_collapse)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   286
next
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   287
  fix q :: rat
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   288
  assume "q \<noteq> 0"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   289
  then show "inverse q * q = 1" by (cases q rule: Rat_cases_nonzero)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   290
   (simp_all add: mult_rat  inverse_rat rat_number_expand eq_rat)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   291
next
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   292
  fix q r :: rat
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   293
  show "q / r = q * inverse r" by (simp add: divide_rat_def)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   294
qed
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   295
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   296
end
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   297
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   298
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   299
subsubsection {* Various *}
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   300
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   301
lemma Fract_add_one: "n \<noteq> 0 ==> Fract (m + n) n = Fract m n + 1"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   302
  by (simp add: rat_number_expand)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   303
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   304
lemma Fract_of_int_quotient: "Fract k l = of_int k / of_int l"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   305
  by (simp add: Fract_of_int_eq [symmetric])
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   306
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   307
lemma Fract_number_of_quotient [code post]:
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   308
  "Fract (number_of k) (number_of l) = number_of k / number_of l"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   309
  unfolding Fract_of_int_quotient number_of_is_id number_of_eq ..
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   310
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   311
lemma Fract_1_number_of [code post]:
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   312
  "Fract 1 (number_of k) = 1 / number_of k"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   313
  unfolding Fract_of_int_quotient number_of_eq by simp
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   314
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   315
subsubsection {* The ordered field of rational numbers *}
27509
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   316
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   317
instantiation rat :: linorder
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   318
begin
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   319
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   320
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   321
  le_rat_def [code del]:
27509
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   322
   "q \<le> r \<longleftrightarrow> contents (\<Union>x \<in> Rep_Rat q. \<Union>y \<in> Rep_Rat r.
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   323
      {(fst x * snd y) * (snd x * snd y) \<le> (fst y * snd x) * (snd x * snd y)})"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   324
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   325
lemma le_rat [simp]:
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   326
  assumes "b \<noteq> 0" and "d \<noteq> 0"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   327
  shows "Fract a b \<le> Fract c d \<longleftrightarrow> (a * d) * (b * d) \<le> (c * b) * (b * d)"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   328
proof -
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   329
  have "(\<lambda>x y. {(fst x * snd y) * (snd x * snd y) \<le> (fst y * snd x) * (snd x * snd y)})
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   330
    respects2 ratrel"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   331
  proof (clarsimp simp add: congruent2_def)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   332
    fix a b a' b' c d c' d'::int
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   333
    assume neq: "b \<noteq> 0"  "b' \<noteq> 0"  "d \<noteq> 0"  "d' \<noteq> 0"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   334
    assume eq1: "a * b' = a' * b"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   335
    assume eq2: "c * d' = c' * d"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   336
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   337
    let ?le = "\<lambda>a b c d. ((a * d) * (b * d) \<le> (c * b) * (b * d))"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   338
    {
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   339
      fix a b c d x :: int assume x: "x \<noteq> 0"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   340
      have "?le a b c d = ?le (a * x) (b * x) c d"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   341
      proof -
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   342
        from x have "0 < x * x" by (auto simp add: zero_less_mult_iff)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   343
        hence "?le a b c d =
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   344
            ((a * d) * (b * d) * (x * x) \<le> (c * b) * (b * d) * (x * x))"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   345
          by (simp add: mult_le_cancel_right)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   346
        also have "... = ?le (a * x) (b * x) c d"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   347
          by (simp add: mult_ac)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   348
        finally show ?thesis .
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   349
      qed
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   350
    } note le_factor = this
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   351
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   352
    let ?D = "b * d" and ?D' = "b' * d'"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   353
    from neq have D: "?D \<noteq> 0" by simp
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   354
    from neq have "?D' \<noteq> 0" by simp
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   355
    hence "?le a b c d = ?le (a * ?D') (b * ?D') c d"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   356
      by (rule le_factor)
27668
6eb20b2cecf8 Tuned and simplified proofs
chaieb
parents: 27652
diff changeset
   357
    also have "... = ((a * b') * ?D * ?D' * d * d' \<le> (c * d') * ?D * ?D' * b * b')" 
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   358
      by (simp add: mult_ac)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   359
    also have "... = ((a' * b) * ?D * ?D' * d * d' \<le> (c' * d) * ?D * ?D' * b * b')"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   360
      by (simp only: eq1 eq2)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   361
    also have "... = ?le (a' * ?D) (b' * ?D) c' d'"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   362
      by (simp add: mult_ac)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   363
    also from D have "... = ?le a' b' c' d'"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   364
      by (rule le_factor [symmetric])
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   365
    finally show "?le a b c d = ?le a' b' c' d'" .
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   366
  qed
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   367
  with assms show ?thesis by (simp add: Fract_def le_rat_def UN_ratrel2)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   368
qed
27509
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   369
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   370
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   371
  less_rat_def [code del]: "z < (w::rat) \<longleftrightarrow> z \<le> w \<and> z \<noteq> w"
27509
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   372
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   373
lemma less_rat [simp]:
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   374
  assumes "b \<noteq> 0" and "d \<noteq> 0"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   375
  shows "Fract a b < Fract c d \<longleftrightarrow> (a * d) * (b * d) < (c * b) * (b * d)"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   376
  using assms by (simp add: less_rat_def eq_rat order_less_le)
27509
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   377
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   378
instance proof
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   379
  fix q r s :: rat
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   380
  {
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   381
    assume "q \<le> r" and "r \<le> s"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   382
    show "q \<le> s"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   383
    proof (insert prems, induct q, induct r, induct s)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   384
      fix a b c d e f :: int
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   385
      assume neq: "b \<noteq> 0"  "d \<noteq> 0"  "f \<noteq> 0"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   386
      assume 1: "Fract a b \<le> Fract c d" and 2: "Fract c d \<le> Fract e f"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   387
      show "Fract a b \<le> Fract e f"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   388
      proof -
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   389
        from neq obtain bb: "0 < b * b" and dd: "0 < d * d" and ff: "0 < f * f"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   390
          by (auto simp add: zero_less_mult_iff linorder_neq_iff)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   391
        have "(a * d) * (b * d) * (f * f) \<le> (c * b) * (b * d) * (f * f)"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   392
        proof -
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   393
          from neq 1 have "(a * d) * (b * d) \<le> (c * b) * (b * d)"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   394
            by simp
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   395
          with ff show ?thesis by (simp add: mult_le_cancel_right)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   396
        qed
27668
6eb20b2cecf8 Tuned and simplified proofs
chaieb
parents: 27652
diff changeset
   397
        also have "... = (c * f) * (d * f) * (b * b)" by algebra
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   398
        also have "... \<le> (e * d) * (d * f) * (b * b)"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   399
        proof -
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   400
          from neq 2 have "(c * f) * (d * f) \<le> (e * d) * (d * f)"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   401
            by simp
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   402
          with bb show ?thesis by (simp add: mult_le_cancel_right)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   403
        qed
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   404
        finally have "(a * f) * (b * f) * (d * d) \<le> e * b * (b * f) * (d * d)"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   405
          by (simp only: mult_ac)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   406
        with dd have "(a * f) * (b * f) \<le> (e * b) * (b * f)"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   407
          by (simp add: mult_le_cancel_right)
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   408
        with neq show ?thesis by simp
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   409
      qed
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   410
    qed
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   411
  next
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   412
    assume "q \<le> r" and "r \<le> q"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   413
    show "q = r"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   414
    proof (insert prems, induct q, induct r)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   415
      fix a b c d :: int
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   416
      assume neq: "b \<noteq> 0"  "d \<noteq> 0"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   417
      assume 1: "Fract a b \<le> Fract c d" and 2: "Fract c d \<le> Fract a b"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   418
      show "Fract a b = Fract c d"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   419
      proof -
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   420
        from neq 1 have "(a * d) * (b * d) \<le> (c * b) * (b * d)"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   421
          by simp
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   422
        also have "... \<le> (a * d) * (b * d)"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   423
        proof -
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   424
          from neq 2 have "(c * b) * (d * b) \<le> (a * d) * (d * b)"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   425
            by simp
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   426
          thus ?thesis by (simp only: mult_ac)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   427
        qed
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   428
        finally have "(a * d) * (b * d) = (c * b) * (b * d)" .
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   429
        moreover from neq have "b * d \<noteq> 0" by simp
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   430
        ultimately have "a * d = c * b" by simp
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   431
        with neq show ?thesis by (simp add: eq_rat)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   432
      qed
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   433
    qed
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   434
  next
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   435
    show "q \<le> q"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   436
      by (induct q) simp
27682
25aceefd4786 added class preorder
haftmann
parents: 27668
diff changeset
   437
    show "(q < r) = (q \<le> r \<and> \<not> r \<le> q)"
25aceefd4786 added class preorder
haftmann
parents: 27668
diff changeset
   438
      by (induct q, induct r) (auto simp add: le_less mult_commute)
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   439
    show "q \<le> r \<or> r \<le> q"
18913
57f19fad8c2a reimplemented using Equiv_Relations.thy
huffman
parents: 18372
diff changeset
   440
      by (induct q, induct r)
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   441
         (simp add: mult_commute, rule linorder_linear)
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   442
  }
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   443
qed
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   444
27509
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   445
end
63161d5f8f29 rearrange instantiations
huffman
parents: 26732
diff changeset
   446
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   447
instantiation rat :: "{distrib_lattice, abs_if, sgn_if}"
25571
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   448
begin
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   449
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   450
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   451
  abs_rat_def [code del]: "\<bar>q\<bar> = (if q < 0 then -q else (q::rat))"
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   452
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   453
lemma abs_rat [simp, code]: "\<bar>Fract a b\<bar> = Fract \<bar>a\<bar> \<bar>b\<bar>"
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   454
  by (auto simp add: abs_rat_def zabs_def Zero_rat_def less_rat not_less le_less minus_rat eq_rat zero_compare_simps)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   455
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   456
definition
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   457
  sgn_rat_def [code del]: "sgn (q::rat) = (if q = 0 then 0 else if 0 < q then 1 else - 1)"
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   458
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   459
lemma sgn_rat [simp, code]: "sgn (Fract a b) = of_int (sgn a * sgn b)"
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   460
  unfolding Fract_of_int_eq
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   461
  by (auto simp: zsgn_def sgn_rat_def Zero_rat_def eq_rat)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   462
    (auto simp: rat_number_collapse not_less le_less zero_less_mult_iff)
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   463
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   464
definition
25571
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   465
  "(inf \<Colon> rat \<Rightarrow> rat \<Rightarrow> rat) = min"
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   466
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   467
definition
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   468
  "(sup \<Colon> rat \<Rightarrow> rat \<Rightarrow> rat) = max"
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   469
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   470
instance by intro_classes
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   471
  (auto simp add: abs_rat_def sgn_rat_def min_max.sup_inf_distrib1 inf_rat_def sup_rat_def)
22456
6070e48ecb78 added lattice definitions
haftmann
parents: 21404
diff changeset
   472
25571
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   473
end
c9e39eafc7a0 instantiation target rather than legacy instance
haftmann
parents: 25502
diff changeset
   474
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   475
instance rat :: ordered_field
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   476
proof
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   477
  fix q r s :: rat
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   478
  show "q \<le> r ==> s + q \<le> s + r"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   479
  proof (induct q, induct r, induct s)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   480
    fix a b c d e f :: int
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   481
    assume neq: "b \<noteq> 0"  "d \<noteq> 0"  "f \<noteq> 0"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   482
    assume le: "Fract a b \<le> Fract c d"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   483
    show "Fract e f + Fract a b \<le> Fract e f + Fract c d"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   484
    proof -
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   485
      let ?F = "f * f" from neq have F: "0 < ?F"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   486
        by (auto simp add: zero_less_mult_iff)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   487
      from neq le have "(a * d) * (b * d) \<le> (c * b) * (b * d)"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   488
        by simp
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   489
      with F have "(a * d) * (b * d) * ?F * ?F \<le> (c * b) * (b * d) * ?F * ?F"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   490
        by (simp add: mult_le_cancel_right)
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   491
      with neq show ?thesis by (simp add: mult_ac int_distrib)
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   492
    qed
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   493
  qed
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   494
  show "q < r ==> 0 < s ==> s * q < s * r"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   495
  proof (induct q, induct r, induct s)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   496
    fix a b c d e f :: int
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   497
    assume neq: "b \<noteq> 0"  "d \<noteq> 0"  "f \<noteq> 0"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   498
    assume le: "Fract a b < Fract c d"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   499
    assume gt: "0 < Fract e f"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   500
    show "Fract e f * Fract a b < Fract e f * Fract c d"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   501
    proof -
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   502
      let ?E = "e * f" and ?F = "f * f"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   503
      from neq gt have "0 < ?E"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   504
        by (auto simp add: Zero_rat_def order_less_le eq_rat)
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   505
      moreover from neq have "0 < ?F"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   506
        by (auto simp add: zero_less_mult_iff)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   507
      moreover from neq le have "(a * d) * (b * d) < (c * b) * (b * d)"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   508
        by simp
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   509
      ultimately have "(a * d) * (b * d) * ?E * ?F < (c * b) * (b * d) * ?E * ?F"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   510
        by (simp add: mult_less_cancel_right)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   511
      with neq show ?thesis
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   512
        by (simp add: mult_ac)
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   513
    qed
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   514
  qed
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   515
qed auto
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   516
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   517
lemma Rat_induct_pos [case_names Fract, induct type: rat]:
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   518
  assumes step: "\<And>a b. 0 < b \<Longrightarrow> P (Fract a b)"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   519
  shows "P q"
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   520
proof (cases q)
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   521
  have step': "\<And>a b. b < 0 \<Longrightarrow> P (Fract a b)"
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   522
  proof -
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   523
    fix a::int and b::int
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   524
    assume b: "b < 0"
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   525
    hence "0 < -b" by simp
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   526
    hence "P (Fract (-a) (-b))" by (rule step)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   527
    thus "P (Fract a b)" by (simp add: order_less_imp_not_eq [OF b])
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   528
  qed
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   529
  case (Fract a b)
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   530
  thus "P q" by (force simp add: linorder_neq_iff step step')
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   531
qed
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   532
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   533
lemma zero_less_Fract_iff:
30095
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   534
  "0 < b \<Longrightarrow> 0 < Fract a b \<longleftrightarrow> 0 < a"
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   535
  by (simp add: Zero_rat_def zero_less_mult_iff)
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   536
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   537
lemma Fract_less_zero_iff:
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   538
  "0 < b \<Longrightarrow> Fract a b < 0 \<longleftrightarrow> a < 0"
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   539
  by (simp add: Zero_rat_def mult_less_0_iff)
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   540
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   541
lemma zero_le_Fract_iff:
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   542
  "0 < b \<Longrightarrow> 0 \<le> Fract a b \<longleftrightarrow> 0 \<le> a"
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   543
  by (simp add: Zero_rat_def zero_le_mult_iff)
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   544
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   545
lemma Fract_le_zero_iff:
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   546
  "0 < b \<Longrightarrow> Fract a b \<le> 0 \<longleftrightarrow> a \<le> 0"
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   547
  by (simp add: Zero_rat_def mult_le_0_iff)
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   548
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   549
lemma one_less_Fract_iff:
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   550
  "0 < b \<Longrightarrow> 1 < Fract a b \<longleftrightarrow> b < a"
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   551
  by (simp add: One_rat_def mult_less_cancel_right_disj)
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   552
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   553
lemma Fract_less_one_iff:
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   554
  "0 < b \<Longrightarrow> Fract a b < 1 \<longleftrightarrow> a < b"
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   555
  by (simp add: One_rat_def mult_less_cancel_right_disj)
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   556
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   557
lemma one_le_Fract_iff:
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   558
  "0 < b \<Longrightarrow> 1 \<le> Fract a b \<longleftrightarrow> b \<le> a"
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   559
  by (simp add: One_rat_def mult_le_cancel_right)
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   560
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   561
lemma Fract_le_one_iff:
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   562
  "0 < b \<Longrightarrow> Fract a b \<le> 1 \<longleftrightarrow> a \<le> b"
c6e184561159 add lemmas about comparisons of Fract a b with 0 and 1
huffman
parents: 29940
diff changeset
   563
  by (simp add: One_rat_def mult_le_cancel_right)
14365
3d4df8c166ae replacing HOL/Real/PRat, PNat by the rational number development
paulson
parents:
diff changeset
   564
14378
69c4d5997669 generic of_nat and of_int functions, and generalization of iszero
paulson
parents: 14365
diff changeset
   565
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   566
subsection {* Arithmetic setup *}
14387
e96d5c42c4b0 Polymorphic treatment of binary arithmetic using axclasses
paulson
parents: 14378
diff changeset
   567
28952
15a4b2cf8c34 made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents: 28562
diff changeset
   568
use "Tools/rat_arith.ML"
24075
366d4d234814 arith method setup: proper context;
wenzelm
parents: 23879
diff changeset
   569
declaration {* K rat_arith_setup *}
14387
e96d5c42c4b0 Polymorphic treatment of binary arithmetic using axclasses
paulson
parents: 14378
diff changeset
   570
23342
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   571
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   572
subsection {* Embedding from Rationals to other Fields *}
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   573
24198
4031da6d8ba3 adaptions for code generation
haftmann
parents: 24075
diff changeset
   574
class field_char_0 = field + ring_char_0
23342
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   575
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   576
subclass (in ordered_field) field_char_0 ..
23342
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   577
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   578
context field_char_0
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   579
begin
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   580
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   581
definition of_rat :: "rat \<Rightarrow> 'a" where
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   582
  [code del]: "of_rat q = contents (\<Union>(a,b) \<in> Rep_Rat q. {of_int a / of_int b})"
23342
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   583
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   584
end
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   585
23342
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   586
lemma of_rat_congruent:
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   587
  "(\<lambda>(a, b). {of_int a / of_int b :: 'a::field_char_0}) respects ratrel"
23342
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   588
apply (rule congruent.intro)
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   589
apply (clarsimp simp add: nonzero_divide_eq_eq nonzero_eq_divide_eq)
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   590
apply (simp only: of_int_mult [symmetric])
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   591
done
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   592
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   593
lemma of_rat_rat: "b \<noteq> 0 \<Longrightarrow> of_rat (Fract a b) = of_int a / of_int b"
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
   594
  unfolding Fract_def of_rat_def by (simp add: UN_ratrel of_rat_congruent)
23342
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   595
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   596
lemma of_rat_0 [simp]: "of_rat 0 = 0"
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   597
by (simp add: Zero_rat_def of_rat_rat)
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   598
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   599
lemma of_rat_1 [simp]: "of_rat 1 = 1"
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   600
by (simp add: One_rat_def of_rat_rat)
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   601
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   602
lemma of_rat_add: "of_rat (a + b) = of_rat a + of_rat b"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   603
by (induct a, induct b, simp add: of_rat_rat add_frac_eq)
23342
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   604
23343
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   605
lemma of_rat_minus: "of_rat (- a) = - of_rat a"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   606
by (induct a, simp add: of_rat_rat)
23343
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   607
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   608
lemma of_rat_diff: "of_rat (a - b) = of_rat a - of_rat b"
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   609
by (simp only: diff_minus of_rat_add of_rat_minus)
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   610
23342
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   611
lemma of_rat_mult: "of_rat (a * b) = of_rat a * of_rat b"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   612
apply (induct a, induct b, simp add: of_rat_rat)
23342
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   613
apply (simp add: divide_inverse nonzero_inverse_mult_distrib mult_ac)
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   614
done
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   615
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   616
lemma nonzero_of_rat_inverse:
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   617
  "a \<noteq> 0 \<Longrightarrow> of_rat (inverse a) = inverse (of_rat a)"
23343
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   618
apply (rule inverse_unique [symmetric])
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   619
apply (simp add: of_rat_mult [symmetric])
23342
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   620
done
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   621
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   622
lemma of_rat_inverse:
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   623
  "(of_rat (inverse a)::'a::{field_char_0,division_by_zero}) =
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   624
   inverse (of_rat a)"
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   625
by (cases "a = 0", simp_all add: nonzero_of_rat_inverse)
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   626
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   627
lemma nonzero_of_rat_divide:
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   628
  "b \<noteq> 0 \<Longrightarrow> of_rat (a / b) = of_rat a / of_rat b"
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   629
by (simp add: divide_inverse of_rat_mult nonzero_of_rat_inverse)
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   630
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   631
lemma of_rat_divide:
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   632
  "(of_rat (a / b)::'a::{field_char_0,division_by_zero})
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   633
   = of_rat a / of_rat b"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   634
by (cases "b = 0") (simp_all add: nonzero_of_rat_divide)
23342
0261d2da0b1c add function of_rat and related lemmas
huffman
parents: 22456
diff changeset
   635
23343
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   636
lemma of_rat_power:
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   637
  "(of_rat (a ^ n)::'a::{field_char_0,recpower}) = of_rat a ^ n"
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   638
by (induct n) (simp_all add: of_rat_mult power_Suc)
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   639
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   640
lemma of_rat_eq_iff [simp]: "(of_rat a = of_rat b) = (a = b)"
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   641
apply (induct a, induct b)
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   642
apply (simp add: of_rat_rat eq_rat)
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   643
apply (simp add: nonzero_divide_eq_eq nonzero_eq_divide_eq)
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   644
apply (simp only: of_int_mult [symmetric] of_int_eq_iff)
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   645
done
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   646
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   647
lemma of_rat_less:
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   648
  "(of_rat r :: 'a::ordered_field) < of_rat s \<longleftrightarrow> r < s"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   649
proof (induct r, induct s)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   650
  fix a b c d :: int
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   651
  assume not_zero: "b > 0" "d > 0"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   652
  then have "b * d > 0" by (rule mult_pos_pos)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   653
  have of_int_divide_less_eq:
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   654
    "(of_int a :: 'a) / of_int b < of_int c / of_int d
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   655
      \<longleftrightarrow> (of_int a :: 'a) * of_int d < of_int c * of_int b"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   656
    using not_zero by (simp add: pos_less_divide_eq pos_divide_less_eq)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   657
  show "(of_rat (Fract a b) :: 'a::ordered_field) < of_rat (Fract c d)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   658
    \<longleftrightarrow> Fract a b < Fract c d"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   659
    using not_zero `b * d > 0`
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   660
    by (simp add: of_rat_rat of_int_divide_less_eq of_int_mult [symmetric] del: of_int_mult)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   661
      (auto intro: mult_strict_right_mono mult_right_less_imp_less)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   662
qed
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   663
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   664
lemma of_rat_less_eq:
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   665
  "(of_rat r :: 'a::ordered_field) \<le> of_rat s \<longleftrightarrow> r \<le> s"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   666
  unfolding le_less by (auto simp add: of_rat_less)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   667
23343
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   668
lemmas of_rat_eq_0_iff [simp] = of_rat_eq_iff [of _ 0, simplified]
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   669
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   670
lemma of_rat_eq_id [simp]: "of_rat = id"
23343
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   671
proof
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   672
  fix a
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   673
  show "of_rat a = id a"
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   674
  by (induct a)
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   675
     (simp add: of_rat_rat Fract_of_int_eq [symmetric])
23343
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   676
qed
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   677
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   678
text{*Collapse nested embeddings*}
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   679
lemma of_rat_of_nat_eq [simp]: "of_rat (of_nat n) = of_nat n"
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   680
by (induct n) (simp_all add: of_rat_add)
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   681
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   682
lemma of_rat_of_int_eq [simp]: "of_rat (of_int z) = of_int z"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   683
by (cases z rule: int_diff_cases) (simp add: of_rat_diff)
23343
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   684
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   685
lemma of_rat_number_of_eq [simp]:
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   686
  "of_rat (number_of w) = (number_of w :: 'a::{number_ring,field_char_0})"
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   687
by (simp add: number_of_eq)
6a83ca5fe282 more of_rat lemmas
huffman
parents: 23342
diff changeset
   688
23879
4776af8be741 split class abs from class minus
haftmann
parents: 23429
diff changeset
   689
lemmas zero_rat = Zero_rat_def
4776af8be741 split class abs from class minus
haftmann
parents: 23429
diff changeset
   690
lemmas one_rat = One_rat_def
4776af8be741 split class abs from class minus
haftmann
parents: 23429
diff changeset
   691
24198
4031da6d8ba3 adaptions for code generation
haftmann
parents: 24075
diff changeset
   692
abbreviation
4031da6d8ba3 adaptions for code generation
haftmann
parents: 24075
diff changeset
   693
  rat_of_nat :: "nat \<Rightarrow> rat"
4031da6d8ba3 adaptions for code generation
haftmann
parents: 24075
diff changeset
   694
where
4031da6d8ba3 adaptions for code generation
haftmann
parents: 24075
diff changeset
   695
  "rat_of_nat \<equiv> of_nat"
4031da6d8ba3 adaptions for code generation
haftmann
parents: 24075
diff changeset
   696
4031da6d8ba3 adaptions for code generation
haftmann
parents: 24075
diff changeset
   697
abbreviation
4031da6d8ba3 adaptions for code generation
haftmann
parents: 24075
diff changeset
   698
  rat_of_int :: "int \<Rightarrow> rat"
4031da6d8ba3 adaptions for code generation
haftmann
parents: 24075
diff changeset
   699
where
4031da6d8ba3 adaptions for code generation
haftmann
parents: 24075
diff changeset
   700
  "rat_of_int \<equiv> of_int"
4031da6d8ba3 adaptions for code generation
haftmann
parents: 24075
diff changeset
   701
28010
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   702
subsection {* The Set of Rational Numbers *}
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   703
28001
4642317e0deb Defined rationals (Rats) globally in Rational.
nipkow
parents: 27682
diff changeset
   704
context field_char_0
4642317e0deb Defined rationals (Rats) globally in Rational.
nipkow
parents: 27682
diff changeset
   705
begin
4642317e0deb Defined rationals (Rats) globally in Rational.
nipkow
parents: 27682
diff changeset
   706
4642317e0deb Defined rationals (Rats) globally in Rational.
nipkow
parents: 27682
diff changeset
   707
definition
4642317e0deb Defined rationals (Rats) globally in Rational.
nipkow
parents: 27682
diff changeset
   708
  Rats  :: "'a set" where
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   709
  [code del]: "Rats = range of_rat"
28001
4642317e0deb Defined rationals (Rats) globally in Rational.
nipkow
parents: 27682
diff changeset
   710
4642317e0deb Defined rationals (Rats) globally in Rational.
nipkow
parents: 27682
diff changeset
   711
notation (xsymbols)
4642317e0deb Defined rationals (Rats) globally in Rational.
nipkow
parents: 27682
diff changeset
   712
  Rats  ("\<rat>")
4642317e0deb Defined rationals (Rats) globally in Rational.
nipkow
parents: 27682
diff changeset
   713
4642317e0deb Defined rationals (Rats) globally in Rational.
nipkow
parents: 27682
diff changeset
   714
end
4642317e0deb Defined rationals (Rats) globally in Rational.
nipkow
parents: 27682
diff changeset
   715
28010
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   716
lemma Rats_of_rat [simp]: "of_rat r \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   717
by (simp add: Rats_def)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   718
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   719
lemma Rats_of_int [simp]: "of_int z \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   720
by (subst of_rat_of_int_eq [symmetric], rule Rats_of_rat)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   721
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   722
lemma Rats_of_nat [simp]: "of_nat n \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   723
by (subst of_rat_of_nat_eq [symmetric], rule Rats_of_rat)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   724
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   725
lemma Rats_number_of [simp]:
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   726
  "(number_of w::'a::{number_ring,field_char_0}) \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   727
by (subst of_rat_number_of_eq [symmetric], rule Rats_of_rat)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   728
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   729
lemma Rats_0 [simp]: "0 \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   730
apply (unfold Rats_def)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   731
apply (rule range_eqI)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   732
apply (rule of_rat_0 [symmetric])
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   733
done
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   734
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   735
lemma Rats_1 [simp]: "1 \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   736
apply (unfold Rats_def)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   737
apply (rule range_eqI)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   738
apply (rule of_rat_1 [symmetric])
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   739
done
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   740
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   741
lemma Rats_add [simp]: "\<lbrakk>a \<in> Rats; b \<in> Rats\<rbrakk> \<Longrightarrow> a + b \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   742
apply (auto simp add: Rats_def)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   743
apply (rule range_eqI)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   744
apply (rule of_rat_add [symmetric])
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   745
done
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   746
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   747
lemma Rats_minus [simp]: "a \<in> Rats \<Longrightarrow> - a \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   748
apply (auto simp add: Rats_def)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   749
apply (rule range_eqI)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   750
apply (rule of_rat_minus [symmetric])
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   751
done
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   752
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   753
lemma Rats_diff [simp]: "\<lbrakk>a \<in> Rats; b \<in> Rats\<rbrakk> \<Longrightarrow> a - b \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   754
apply (auto simp add: Rats_def)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   755
apply (rule range_eqI)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   756
apply (rule of_rat_diff [symmetric])
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   757
done
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   758
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   759
lemma Rats_mult [simp]: "\<lbrakk>a \<in> Rats; b \<in> Rats\<rbrakk> \<Longrightarrow> a * b \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   760
apply (auto simp add: Rats_def)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   761
apply (rule range_eqI)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   762
apply (rule of_rat_mult [symmetric])
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   763
done
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   764
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   765
lemma nonzero_Rats_inverse:
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   766
  fixes a :: "'a::field_char_0"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   767
  shows "\<lbrakk>a \<in> Rats; a \<noteq> 0\<rbrakk> \<Longrightarrow> inverse a \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   768
apply (auto simp add: Rats_def)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   769
apply (rule range_eqI)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   770
apply (erule nonzero_of_rat_inverse [symmetric])
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   771
done
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   772
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   773
lemma Rats_inverse [simp]:
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   774
  fixes a :: "'a::{field_char_0,division_by_zero}"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   775
  shows "a \<in> Rats \<Longrightarrow> inverse a \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   776
apply (auto simp add: Rats_def)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   777
apply (rule range_eqI)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   778
apply (rule of_rat_inverse [symmetric])
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   779
done
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   780
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   781
lemma nonzero_Rats_divide:
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   782
  fixes a b :: "'a::field_char_0"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   783
  shows "\<lbrakk>a \<in> Rats; b \<in> Rats; b \<noteq> 0\<rbrakk> \<Longrightarrow> a / b \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   784
apply (auto simp add: Rats_def)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   785
apply (rule range_eqI)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   786
apply (erule nonzero_of_rat_divide [symmetric])
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   787
done
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   788
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   789
lemma Rats_divide [simp]:
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   790
  fixes a b :: "'a::{field_char_0,division_by_zero}"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   791
  shows "\<lbrakk>a \<in> Rats; b \<in> Rats\<rbrakk> \<Longrightarrow> a / b \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   792
apply (auto simp add: Rats_def)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   793
apply (rule range_eqI)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   794
apply (rule of_rat_divide [symmetric])
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   795
done
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   796
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   797
lemma Rats_power [simp]:
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   798
  fixes a :: "'a::{field_char_0,recpower}"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   799
  shows "a \<in> Rats \<Longrightarrow> a ^ n \<in> Rats"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   800
apply (auto simp add: Rats_def)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   801
apply (rule range_eqI)
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   802
apply (rule of_rat_power [symmetric])
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   803
done
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   804
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   805
lemma Rats_cases [cases set: Rats]:
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   806
  assumes "q \<in> \<rat>"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   807
  obtains (of_rat) r where "q = of_rat r"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   808
  unfolding Rats_def
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   809
proof -
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   810
  from `q \<in> \<rat>` have "q \<in> range of_rat" unfolding Rats_def .
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   811
  then obtain r where "q = of_rat r" ..
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   812
  then show thesis ..
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   813
qed
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   814
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   815
lemma Rats_induct [case_names of_rat, induct set: Rats]:
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   816
  "q \<in> \<rat> \<Longrightarrow> (\<And>r. P (of_rat r)) \<Longrightarrow> P q"
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   817
  by (rule Rats_cases) auto
8312edc51969 add lemmas about Rats similar to those about Reals
huffman
parents: 28001
diff changeset
   818
28001
4642317e0deb Defined rationals (Rats) globally in Rational.
nipkow
parents: 27682
diff changeset
   819
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   820
subsection {* Implementation of rational numbers as pairs of integers *}
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   821
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   822
lemma Fract_norm: "Fract (a div zgcd a b) (b div zgcd a b) = Fract a b"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   823
proof (cases "a = 0 \<or> b = 0")
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   824
  case True then show ?thesis by (auto simp add: eq_rat)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   825
next
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   826
  let ?c = "zgcd a b"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   827
  case False then have "a \<noteq> 0" and "b \<noteq> 0" by auto
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   828
  then have "?c \<noteq> 0" by simp
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   829
  then have "Fract ?c ?c = Fract 1 1" by (simp add: eq_rat)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   830
  moreover have "Fract (a div ?c * ?c + a mod ?c) (b div ?c * ?c + b mod ?c) = Fract a b"
29925
17d1e32ef867 dvd and setprod lemmas
nipkow
parents: 29880
diff changeset
   831
    by (simp add: semiring_div_class.mod_div_equality)
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   832
  moreover have "a mod ?c = 0" by (simp add: dvd_eq_mod_eq_0 [symmetric])
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   833
  moreover have "b mod ?c = 0" by (simp add: dvd_eq_mod_eq_0 [symmetric])
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   834
  ultimately show ?thesis
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   835
    by (simp add: mult_rat [symmetric])
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   836
qed
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   837
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   838
definition Fract_norm :: "int \<Rightarrow> int \<Rightarrow> rat" where
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   839
  [simp, code del]: "Fract_norm a b = Fract a b"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   840
29332
edc1e2a56398 named code theorem for Fract_norm
haftmann
parents: 28952
diff changeset
   841
lemma Fract_norm_code [code]: "Fract_norm a b = (if a = 0 \<or> b = 0 then 0 else let c = zgcd a b in
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   842
  if b > 0 then Fract (a div c) (b div c) else Fract (- (a div c)) (- (b div c)))"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   843
  by (simp add: eq_rat Zero_rat_def Let_def Fract_norm)
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   844
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   845
lemma [code]:
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   846
  "of_rat (Fract a b) = (if b \<noteq> 0 then of_int a / of_int b else 0)"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   847
  by (cases "b = 0") (simp_all add: rat_number_collapse of_rat_rat)
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   848
26513
6f306c8c2c54 explicit class "eq" for operational equality
haftmann
parents: 25965
diff changeset
   849
instantiation rat :: eq
6f306c8c2c54 explicit class "eq" for operational equality
haftmann
parents: 25965
diff changeset
   850
begin
6f306c8c2c54 explicit class "eq" for operational equality
haftmann
parents: 25965
diff changeset
   851
28562
4e74209f113e `code func` now just `code`
haftmann
parents: 28351
diff changeset
   852
definition [code del]: "eq_class.eq (a\<Colon>rat) b \<longleftrightarrow> a - b = 0"
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   853
26513
6f306c8c2c54 explicit class "eq" for operational equality
haftmann
parents: 25965
diff changeset
   854
instance by default (simp add: eq_rat_def)
6f306c8c2c54 explicit class "eq" for operational equality
haftmann
parents: 25965
diff changeset
   855
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   856
lemma rat_eq_code [code]:
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   857
  "eq_class.eq (Fract a b) (Fract c d) \<longleftrightarrow> (if b = 0
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   858
       then c = 0 \<or> d = 0
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   859
     else if d = 0
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   860
       then a = 0 \<or> b = 0
29332
edc1e2a56398 named code theorem for Fract_norm
haftmann
parents: 28952
diff changeset
   861
     else a * d = b * c)"
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   862
  by (auto simp add: eq eq_rat)
26513
6f306c8c2c54 explicit class "eq" for operational equality
haftmann
parents: 25965
diff changeset
   863
28351
abfc66969d1f non left-linear equations for nbe
haftmann
parents: 28313
diff changeset
   864
lemma rat_eq_refl [code nbe]:
abfc66969d1f non left-linear equations for nbe
haftmann
parents: 28313
diff changeset
   865
  "eq_class.eq (r::rat) r \<longleftrightarrow> True"
abfc66969d1f non left-linear equations for nbe
haftmann
parents: 28313
diff changeset
   866
  by (rule HOL.eq_refl)
abfc66969d1f non left-linear equations for nbe
haftmann
parents: 28313
diff changeset
   867
26513
6f306c8c2c54 explicit class "eq" for operational equality
haftmann
parents: 25965
diff changeset
   868
end
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   869
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   870
lemma le_rat':
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   871
  assumes "b \<noteq> 0"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   872
    and "d \<noteq> 0"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   873
  shows "Fract a b \<le> Fract c d \<longleftrightarrow> a * \<bar>d\<bar> * sgn b \<le> c * \<bar>b\<bar> * sgn d"
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   874
proof -
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   875
  have abs_sgn: "\<And>k::int. \<bar>k\<bar> = k * sgn k" unfolding abs_if sgn_if by simp
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   876
  have "a * d * (b * d) \<le> c * b * (b * d) \<longleftrightarrow> a * d * (sgn b * sgn d) \<le> c * b * (sgn b * sgn d)"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   877
  proof (cases "b * d > 0")
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   878
    case True
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   879
    moreover from True have "sgn b * sgn d = 1"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   880
      by (simp add: sgn_times [symmetric] sgn_1_pos)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   881
    ultimately show ?thesis by (simp add: mult_le_cancel_right)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   882
  next
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   883
    case False with assms have "b * d < 0" by (simp add: less_le)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   884
    moreover from this have "sgn b * sgn d = - 1"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   885
      by (simp only: sgn_times [symmetric] sgn_1_neg)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   886
    ultimately show ?thesis by (simp add: mult_le_cancel_right)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   887
  qed
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   888
  also have "\<dots> \<longleftrightarrow> a * \<bar>d\<bar> * sgn b \<le> c * \<bar>b\<bar> * sgn d"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   889
    by (simp add: abs_sgn mult_ac)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   890
  finally show ?thesis using assms by simp
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   891
qed
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   892
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   893
lemma less_rat': 
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   894
  assumes "b \<noteq> 0"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   895
    and "d \<noteq> 0"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   896
  shows "Fract a b < Fract c d \<longleftrightarrow> a * \<bar>d\<bar> * sgn b < c * \<bar>b\<bar> * sgn d"
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   897
proof -
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   898
  have abs_sgn: "\<And>k::int. \<bar>k\<bar> = k * sgn k" unfolding abs_if sgn_if by simp
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   899
  have "a * d * (b * d) < c * b * (b * d) \<longleftrightarrow> a * d * (sgn b * sgn d) < c * b * (sgn b * sgn d)"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   900
  proof (cases "b * d > 0")
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   901
    case True
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   902
    moreover from True have "sgn b * sgn d = 1"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   903
      by (simp add: sgn_times [symmetric] sgn_1_pos)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   904
    ultimately show ?thesis by (simp add: mult_less_cancel_right)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   905
  next
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   906
    case False with assms have "b * d < 0" by (simp add: less_le)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   907
    moreover from this have "sgn b * sgn d = - 1"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   908
      by (simp only: sgn_times [symmetric] sgn_1_neg)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   909
    ultimately show ?thesis by (simp add: mult_less_cancel_right)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   910
  qed
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   911
  also have "\<dots> \<longleftrightarrow> a * \<bar>d\<bar> * sgn b < c * \<bar>b\<bar> * sgn d"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   912
    by (simp add: abs_sgn mult_ac)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   913
  finally show ?thesis using assms by simp
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   914
qed
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   915
29940
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   916
lemma (in ordered_idom) sgn_greater [simp]:
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   917
  "0 < sgn a \<longleftrightarrow> 0 < a"
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   918
  unfolding sgn_if by auto
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   919
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   920
lemma (in ordered_idom) sgn_less [simp]:
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   921
  "sgn a < 0 \<longleftrightarrow> a < 0"
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   922
  unfolding sgn_if by auto
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   923
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   924
lemma rat_le_eq_code [code]:
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   925
  "Fract a b < Fract c d \<longleftrightarrow> (if b = 0
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   926
       then sgn c * sgn d > 0
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   927
     else if d = 0
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   928
       then sgn a * sgn b < 0
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   929
     else a * \<bar>d\<bar> * sgn b < c * \<bar>b\<bar> * sgn d)"
29940
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   930
  by (auto simp add: sgn_times mult_less_0_iff zero_less_mult_iff less_rat' eq_rat simp del: less_rat)
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   931
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   932
lemma rat_less_eq_code [code]:
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   933
  "Fract a b \<le> Fract c d \<longleftrightarrow> (if b = 0
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   934
       then sgn c * sgn d \<ge> 0
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   935
     else if d = 0
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   936
       then sgn a * sgn b \<le> 0
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   937
     else a * \<bar>d\<bar> * sgn b \<le> c * \<bar>b\<bar> * sgn d)"
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   938
  by (auto simp add: sgn_times mult_le_0_iff zero_le_mult_iff le_rat' eq_rat simp del: le_rat)
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   939
    (auto simp add: le_less not_less sgn_0_0)
83b373f61d41 more default simp rules for sgn
haftmann
parents: 29925
diff changeset
   940
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   941
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   942
lemma rat_plus_code [code]:
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   943
  "Fract a b + Fract c d = (if b = 0
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   944
     then Fract c d
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   945
   else if d = 0
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   946
     then Fract a b
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   947
   else Fract_norm (a * d + c * b) (b * d))"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   948
  by (simp add: eq_rat, simp add: Zero_rat_def)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   949
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   950
lemma rat_times_code [code]:
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   951
  "Fract a b * Fract c d = Fract_norm (a * c) (b * d)"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   952
  by simp
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   953
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   954
lemma rat_minus_code [code]:
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   955
  "Fract a b - Fract c d = (if b = 0
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   956
     then Fract (- c) d
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   957
   else if d = 0
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   958
     then Fract a b
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   959
   else Fract_norm (a * d - c * b) (b * d))"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   960
  by (simp add: eq_rat, simp add: Zero_rat_def)
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   961
27652
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   962
lemma rat_inverse_code [code]:
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   963
  "inverse (Fract a b) = (if b = 0 then Fract 1 0
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   964
    else if a < 0 then Fract (- b) (- a)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   965
    else Fract b a)"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   966
  by (simp add: eq_rat)
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   967
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   968
lemma rat_divide_code [code]:
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   969
  "Fract a b / Fract c d = Fract_norm (a * d) (b * c)"
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   970
  by simp
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   971
818666de6c24 refined code generator setup for rational numbers; more simplification rules for rational numbers
haftmann
parents: 27551
diff changeset
   972
hide (open) const Fract_norm
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   973
24622
8116eb022282 renamed constructor RatC to Rational
haftmann
parents: 24533
diff changeset
   974
text {* Setup for SML code generator *}
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   975
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   976
types_code
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   977
  rat ("(int */ int)")
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   978
attach (term_of) {*
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   979
fun term_of_rat (p, q) =
24622
8116eb022282 renamed constructor RatC to Rational
haftmann
parents: 24533
diff changeset
   980
  let
24661
a705b9834590 fixed cg setup
haftmann
parents: 24630
diff changeset
   981
    val rT = Type ("Rational.rat", [])
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   982
  in
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   983
    if q = 1 orelse p = 0 then HOLogic.mk_number rT p
25885
6fbc3f54f819 New interface for test data generators.
berghofe
parents: 25762
diff changeset
   984
    else @{term "op / \<Colon> rat \<Rightarrow> rat \<Rightarrow> rat"} $
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   985
      HOLogic.mk_number rT p $ HOLogic.mk_number rT q
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   986
  end;
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   987
*}
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   988
attach (test) {*
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   989
fun gen_rat i =
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   990
  let
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   991
    val p = random_range 0 i;
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   992
    val q = random_range 1 (i + 1);
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   993
    val g = Integer.gcd p q;
24630
351a308ab58d simplified type int (eliminated IntInf.int, integer);
wenzelm
parents: 24622
diff changeset
   994
    val p' = p div g;
351a308ab58d simplified type int (eliminated IntInf.int, integer);
wenzelm
parents: 24622
diff changeset
   995
    val q' = q div g;
25885
6fbc3f54f819 New interface for test data generators.
berghofe
parents: 25762
diff changeset
   996
    val r = (if one_of [true, false] then p' else ~ p',
6fbc3f54f819 New interface for test data generators.
berghofe
parents: 25762
diff changeset
   997
      if p' = 0 then 0 else q')
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
   998
  in
25885
6fbc3f54f819 New interface for test data generators.
berghofe
parents: 25762
diff changeset
   999
    (r, fn () => term_of_rat r)
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
  1000
  end;
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
  1001
*}
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
  1002
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
  1003
consts_code
27551
9a5543d4cc24 Fract now total; improved code generator setup
haftmann
parents: 27509
diff changeset
  1004
  Fract ("(_,/ _)")
24533
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
  1005
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
  1006
consts_code
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
  1007
  "of_int :: int \<Rightarrow> rat" ("\<module>rat'_of'_int")
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
  1008
attach {*
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
  1009
fun rat_of_int 0 = (0, 0)
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
  1010
  | rat_of_int i = (i, 1);
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
  1011
*}
fe1f93f6a15a Added code generator setup (taken from Library/Executable_Rat.thy,
berghofe
parents: 24506
diff changeset
  1012
29880
3dee8ff45d3d move countability proof from Rational to Countable; add instance rat :: countable
huffman
parents: 29667
diff changeset
  1013
end