Package list-interval-thm: list-interval-thm

Information

Files

• Package tarball list-interval-thm-1.0.tgz
• Theory file list-interval-thm.thy (included in the package tarball)

Theorems

⊦ ∀m n. Data.List.length (Data.List.interval m n) = n

⊦ ∀m n i.
    Number.Natural.< i n ⇒
    Data.List.nth i (Data.List.interval m n) = Number.Natural.+ m i

Input Type Operators

• →
• bool
• Data
  • List
    • Data.List.list
• Number
  • Natural
    • Number.Natural.natural

Input Constants

• =
• Data
  • Bool
    • ∀
    • ∧
    • ⇒
    • ∃
    • ∨
    • ¬
    • F
    • T
  • List
    • Data.List.::
    • Data.List.[]
    • Data.List.interval
    • Data.List.length
    • Data.List.nth
• Number
  • Natural
    • Number.Natural.+
    • Number.Natural.<
    • Number.Natural.suc
  • Numeral
    • Number.Numeral.zero

Assumptions

⊦ T

⊦ ∀t. (∀x. t) ⇔ t

⊦ (∀) = λP. P = λx. T

⊦ ∀x. x = x ⇔ T

⊦ ∀m. Number.Natural.+ m Number.Numeral.zero = m

⊦ (⇒) = λp q. p ∧ q ⇔ p

⊦ ∀m. m = Number.Numeral.zero ∨ ∃n. m = Number.Natural.suc n

⊦ (∧) = λp q. (λf. f p q) = λf. f T T

⊦ (∃) = λP. ∀q. (∀x. P x ⇒ q) ⇒ q

⊦ ∀m n.
    Number.Natural.+ m (Number.Natural.suc n) =
    Number.Natural.suc (Number.Natural.+ m n)

⊦ ∀m n. Number.Natural.suc m = Number.Natural.suc n ⇔ m = n

⊦ ∀m n.
    Number.Natural.< (Number.Natural.suc m) (Number.Natural.suc n) ⇔
    Number.Natural.< m n

⊦ (∨) = λp q. ∀r. (p ⇒ r) ⇒ (q ⇒ r) ⇒ r

⊦ ∀P. (∀x y. P x y) ⇔ ∀y x. P x y

⊦ Data.List.length Data.List.[] = Number.Numeral.zero ∧
  ∀h t.
    Data.List.length (Data.List.:: h t) =
    Number.Natural.suc (Data.List.length t)

⊦ ∀P.
    P Number.Numeral.zero ∧ (∀n. P n ⇒ P (Number.Natural.suc n)) ⇒ ∀n. P n

⊦ (∀n. Number.Natural.+ Number.Numeral.zero n = n) ∧
  ∀m n.
    Number.Natural.+ (Number.Natural.suc m) n =
    Number.Natural.suc (Number.Natural.+ m n)

⊦ (∀m. Data.List.interval m Number.Numeral.zero = Data.List.[]) ∧
  ∀m n.
    Data.List.interval m (Number.Natural.suc n) =
    Data.List.:: m (Data.List.interval (Number.Natural.suc m) n)

⊦ (∀m. Number.Natural.< m Number.Numeral.zero ⇔ F) ∧
  ∀m n.
    Number.Natural.< m (Number.Natural.suc n) ⇔
    m = n ∨ Number.Natural.< m n

⊦ (∀h t. Data.List.nth Number.Numeral.zero (Data.List.:: h t) = h) ∧
  ∀h t n.
    Data.List.nth (Number.Natural.suc n) (Data.List.:: h t) =
    Data.List.nth n t

⊦ ∀t. (T ∧ t ⇔ t) ∧ (t ∧ T ⇔ t) ∧ (F ∧ t ⇔ F) ∧ (t ∧ F ⇔ F) ∧ (t ∧ t ⇔ t)

⊦ ∀t. (T ⇒ t ⇔ t) ∧ (t ⇒ T ⇔ T) ∧ (F ⇒ t ⇔ T) ∧ (t ⇒ t ⇔ T) ∧ (t ⇒ F ⇔ ¬t)