Theory intReduce

Parents

Contents

Type operators

(none)

Constants

(none)

Definitions

(none)

Theorems

INT_ADD_CONV_pth0INT_ADD_CONV_pth1INT_EQ_CONV_pthINT_GE_CONV_pthINT_GT_CONV_pthINT_LE_CONV_nthINT_LE_CONV_pthINT_LE_CONV_tthINT_LT_CONV_pthINT_MUL_CONV_pth0INT_MUL_CONV_pth1INT_NEG_CONV_pthINT_POW_CONV_pthINT_POW_CONV_tth

Theorems

⊢ -&m + &m = 0 ∧ &m + -&m = 0
⊢ -&m + -&n = -&(m + n) ∧ -&m + &(m + n) = &n ∧ -&(m + n) + &m = -&n ∧
  &(m + n) + -&m = &n ∧ &m + -&(m + n) = -&n ∧ &m + &n = &(m + n)
⊢ (&m = &n ⇔ m = n) ∧ (-&m = -&n ⇔ m = n) ∧ (-&m = &n ⇔ m = 0 ∧ n = 0) ∧
  (&m = -&n ⇔ m = 0 ∧ n = 0)
⊢ (&m ≥ -&n ⇔ T) ∧ (&m ≥ &n ⇔ n ≤ m) ∧ (-&m ≥ -&n ⇔ m ≤ n) ∧
  (-&m ≥ &n ⇔ m = 0 ∧ n = 0)
⊢ (-&m > &n ⇔ F) ∧ (&m > &n ⇔ n < m) ∧ (-&m > -&n ⇔ m < n) ∧
  (&m > -&n ⇔ ¬(m = 0 ∧ n = 0))
⊢ (¬T ⇔ F) ∧ (¬F ⇔ T)
⊢ (-&m ≤ &n ⇔ T) ∧ (&m ≤ &n ⇔ m ≤ n) ∧ (-&m ≤ -&n ⇔ n ≤ m) ∧
  (&m ≤ -&n ⇔ m = 0 ∧ n = 0)
⊢ (F ∧ F ⇔ F) ∧ (F ∧ T ⇔ F) ∧ (T ∧ F ⇔ F) ∧ (T ∧ T ⇔ T)
⊢ (&m < -&n ⇔ F) ∧ (&m < &n ⇔ m < n) ∧ (-&m < -&n ⇔ n < m) ∧
  (-&m < &n ⇔ ¬(m = 0 ∧ n = 0))
⊢ 0 * &x = 0 ∧ 0 * -&x = 0 ∧ &x * 0 = 0 ∧ -&x * 0 = 0
⊢ (&m * &n = &(m * n) ∧ -&m * -&n = &(m * n)) ∧ -&m * &n = -&(m * n) ∧
  &m * -&n = -&(m * n)
⊢ -0 = 0 ∧ --&x = &x
⊢ &x ** n = &(x ** n) ∧ -&x ** n = if EVEN n then &(x ** n) else -&(x ** n)
⊢ (if T then x else y) = x ∧ (if F then x else y) = y