Theory real_of_rat

Parents

Contents

Type operators

(none)

Constants

Definitions

Q_SETreal_of_rat_def

Theorems

ABS_SQUAREADD_IN_QSETDIV_IN_QSETINT_BI_INDUCTIONINT_FLOOR_ADDINT_FLOOR_MULINT_FLOOR_REAL_OF_INTINV_IN_QSETIS_INT_ADDIS_INT_ADD2IS_INT_MULIS_INT_NUMIS_INT_REAL_OF_INTMUL_IN_QSETNUM_IN_QSETNUM_LT_NEGNUM_NEGNUM_OPP_SIGNS_COMPAREOPP_IN_QSETQSET_COUNTABLEQ_DENSE_IN_REALQ_DENSE_IN_REAL_LEMMARATND_ADDRATND_MULRAT_DIV_LEMMARAT_DIV_PRODRAT_OF_INT_SUBREAL_IS_INT_LT_LEREAL_LT_SUB_SWAPREAL_OF_RAT_0REAL_OF_RAT_1REAL_OF_RAT_ADDREAL_OF_RAT_DIVREAL_OF_RAT_INJREAL_OF_RAT_LEREAL_OF_RAT_LTREAL_OF_RAT_MAXREAL_OF_RAT_MINREAL_OF_RAT_MINVREAL_OF_RAT_MULREAL_OF_RAT_NEGREAL_OF_RAT_NUM_CLAUSESREAL_OF_RAT_OF_INTREAL_OF_RAT_OF_NUMREAL_OF_RAT_SUBREAL_PYTHREAL_Q_DENSEREAL_RAT_DENSESUB_IN_QSETcountable_real_rat_setq_set_defreal_rat_setreal_rat_set_def

Definitions

⊒ β„š = IMAGE real_of_rat π•Œ(:rat)
⊒ βˆ€q. real_of_rat q = real_of_int (RATN q) / &RATD q

Theorems

⊒ βˆ€i. ABS i * ABS i = i * i
⊒ βˆ€x y. x ∈ β„š ∧ y ∈ β„š β‡’ x + y ∈ β„š
⊒ βˆ€x y. x ∈ β„š ∧ y ∈ β„š ∧ y β‰  0 β‡’ x / y ∈ β„š
⊒ βˆ€P. P 0 ∧ (βˆ€x. P x ⇔ P (x + 1)) ⇔ βˆ€x. P x
⊒ is_int x ∧ is_int y β‡’ ⌊xβŒ‹ + ⌊yβŒ‹ = ⌊x + yβŒ‹
⊒ is_int x ∧ is_int y β‡’ ⌊xβŒ‹ * ⌊yβŒ‹ = ⌊x * yβŒ‹
⊒ ⌊real_of_int iβŒ‹ = i
⊒ βˆ€x. x ∈ β„š ∧ x β‰  0 β‡’ 1 / x ∈ β„š
⊒ is_int x ∧ is_int y β‡’ is_int (x + y)
⊒ is_int x ∧ is_int (x + y) β‡’ is_int y
⊒ is_int x ∧ is_int y β‡’ is_int (x * y)
⊒ is_int (&n)
⊒ is_int x ⇔ βˆƒi. x = real_of_int i
⊒ βˆ€x y. x ∈ β„š ∧ y ∈ β„š β‡’ x * y ∈ β„š
⊒ βˆ€n. &n ∈ β„š ∧ -&n ∈ β„š
⊒ βˆ€i1 i2. i1 ≀ 0 ∧ i2 ≀ 0 β‡’ (Num i1 < Num i2 ⇔ i2 < i1)
⊒ Num (-i) = Num i
⊒ βˆ€i1 i2.
    i1 ≀ 0 ∧ 0 ≀ i2 β‡’
    (Num i1 < Num i2 ⇔ 0 < i1 + i2) ∧ (Num i2 < Num i1 ⇔ i1 + i2 < 0) ∧
    (Num i1 = Num i2 ⇔ i1 + i2 = 0)
⊒ βˆ€x. x ∈ β„š β‡’ -x ∈ β„š
⊒ countable β„š
⊒ βˆ€x y. x < y β‡’ βˆƒr. r ∈ β„š ∧ x < r ∧ r < y
⊒ βˆ€x y. 0 ≀ x ∧ x < y β‡’ βˆƒr. r ∈ β„š ∧ x < r ∧ r < y
⊒ rat_of_int (RATN r1 * &RATD r2 + &RATD r1 * RATN r2) /
  &(RATD r1 * RATD r2) =
  r1 + r2
⊒ rat_of_int (RATN r1 * RATN r2) / &(RATD r1 * RATD r2) = r1 * r2
⊒ q1 β‰  0 ∧ q2 β‰  0 β‡’ (p1 / q1 = p2 / q2 ⇔ p1 * q2 = p2 * q1)
⊒ b β‰  0 ∧ d β‰  0 β‡’ a / b * (c / d) = a * c / (b * d)
⊒ rat_of_int a βˆ’ rat_of_int b = rat_of_int (a βˆ’ b)
⊒ is_int a ∧ is_int b β‡’ (a < b ⇔ a + 1 ≀ b)
⊒ a < b βˆ’ c ⇔ c < b βˆ’ a
⊒ real_of_rat 0 = 0
⊒ real_of_rat 1 = 1
⊒ real_of_rat r1 + real_of_rat r2 = real_of_rat (r1 + r2)
⊒ r2 β‰  0 β‡’ real_of_rat r1 / real_of_rat r2 = real_of_rat (r1 / r2)
⊒ real_of_rat r1 = real_of_rat r2 ⇔ r1 = r2
⊒ real_of_rat r1 ≀ real_of_rat r2 ⇔ r1 ≀ r2
⊒ real_of_rat r1 < real_of_rat r2 ⇔ r1 < r2
⊒ max (real_of_rat r) (real_of_rat q) = real_of_rat (rat_max r q)
⊒ min (real_of_rat r) (real_of_rat q) = real_of_rat (rat_min r q)
⊒ r β‰  0 β‡’ (real_of_rat r)⁻¹ = real_of_rat (rat_minv r)
⊒ real_of_rat r1 * real_of_rat r2 = real_of_rat (r1 * r2)
⊒ -real_of_rat r = real_of_rat (-r)
⊒ (real_of_rat q = &n ⇔ q = &n) ∧ (real_of_rat q = -&n ⇔ q = -&n) ∧
  (real_of_rat q < &n ⇔ q < &n) ∧ (real_of_rat q < -&n ⇔ q < -&n) ∧
  (real_of_rat q ≀ &n ⇔ q ≀ &n) ∧ (real_of_rat q ≀ -&n ⇔ q ≀ -&n) ∧
  (&n < real_of_rat q ⇔ &n < q) ∧ (-&n < real_of_rat q ⇔ -&n < q) ∧
  (&n ≀ real_of_rat q ⇔ &n ≀ q) ∧ (-&n ≀ real_of_rat q ⇔ -&n ≀ q)
⊒ real_of_rat (rat_of_int i) = real_of_int i
⊒ real_of_rat (&n) = &n
⊒ real_of_rat r1 βˆ’ real_of_rat r2 = real_of_rat (r1 βˆ’ r2)
⊒ βˆ€r1. βˆƒx. is_int x ∧ r1 < x
⊒ βˆ€r1 r2. r1 < r2 β‡’ βˆƒq. r1 < real_of_rat q ∧ real_of_rat q < r2
⊒ βˆ€x y. x < y β‡’ βˆƒr. r ∈ β„š ∧ x < r ∧ r < y
⊒ βˆ€x y. x ∈ β„š ∧ y ∈ β„š β‡’ x βˆ’ y ∈ β„š
⊒ countable β„š
⊒ β„š =
  {x | βˆƒa b. x = &a / &b ∧ 0 < &b} βˆͺ {x | βˆƒa b. x = -(&a / &b) ∧ 0 < &b}
⊒ β„š = {r | βˆƒq. r = real_of_rat q}
⊒ β„š =
  {x | βˆƒa b. x = &a / &b ∧ 0 < &b} βˆͺ {x | βˆƒa b. x = -(&a / &b) ∧ 0 < &b}