Package gfp-thm: Properties of GF(p) finite fields
Information
| name | gfp-thm |
| version | 1.12 |
| description | Properties of GF(p) finite fields |
| author | Joe Hurd <joe@gilith.com> |
| license | MIT |
| provenance | HOL Light theory extracted on 2012-01-29 |
| requires | bool natural natural-divides natural-prime gfp-witness gfp-def |
| show | Data.Bool Number.GF(p) Number.Natural |
Files
- Package tarball gfp-thm-1.12.tgz
- Theory file gfp-thm.thy (included in the package tarball)
Theorems
⊦ 1 < oddprime
⊦ ¬(oddprime = 1)
⊦ ¬divides oddprime 1
⊦ 2 < oddprime
⊦ ¬(oddprime = 2)
⊦ ¬divides oddprime 2
⊦ ¬divides 2 oddprime
⊦ ¬(1 = 0)
⊦ 1 mod oddprime = 1
⊦ ¬(2 = 0)
⊦ 2 mod oddprime = 2
⊦ ∀m n. divides oddprime (m * n) ⇔ divides oddprime m ∨ divides oddprime n
⊦ ∀x y. x * y = 0 ⇔ x = 0 ∨ y = 0
Input Type Operators
- →
- bool
- Number
- GF(p)
- gfp
- Natural
- natural
- GF(p)
Input Constants
- =
- Data
- Bool
- ∀
- ∧
- ⇒
- ∨
- ¬
- F
- T
- Bool
- Number
- GF(p)
- *
- fromNatural
- oddprime
- toNatural
- Natural
- *
- <
- ≤
- bit0
- bit1
- divides
- even
- mod
- odd
- prime
- suc
- zero
- GF(p)
Assumptions
⊦ T
⊦ odd oddprime
⊦ prime oddprime
⊦ ¬prime 1
⊦ ¬(oddprime = 0)
⊦ ¬F ⇔ T
⊦ ¬T ⇔ F
⊦ odd 0 ⇔ F
⊦ bit0 0 = 0
⊦ ∀t. t ⇒ t
⊦ F ⇔ ∀p. p
⊦ (¬) = λp. p ⇒ F
⊦ (∀) = λp. p = λx. T
⊦ ∀t. t ∧ T ⇔ t
⊦ ∀t. F ∨ t ⇔ t
⊦ ∀x. fromNatural (toNatural x) = x
⊦ ∀n. bit1 n = suc (bit0 n)
⊦ ∀n. ¬even n ⇔ odd n
⊦ (⇒) = λp q. p ∧ q ⇔ p
⊦ ∀x. x * 0 = 0
⊦ ∀x. 0 * x = 0
⊦ ∀n. odd (suc n) ⇔ ¬odd n
⊦ ∀n. 0 < n ⇔ ¬(n = 0)
⊦ ∀n. bit0 (suc n) = suc (suc (bit0 n))
⊦ ∀a. divides 2 a ⇔ even a
⊦ ∀n. n < oddprime ⇒ n mod oddprime = n
⊦ ∀a. divides a 1 ⇔ a = 1
⊦ ∀x. fromNatural x = 0 ⇔ divides oddprime x
⊦ ∀m n. suc m ≤ n ⇔ m < n
⊦ (∧) = λp q. (λf. f p q) = λf. f T T
⊦ ∀x1 y1. fromNatural (x1 * y1) = fromNatural x1 * fromNatural y1
⊦ (∨) = λp q. ∀r. (p ⇒ r) ⇒ (q ⇒ r) ⇒ r
⊦ ∀m n. m < n ⇔ m ≤ n ∧ ¬(m = n)
⊦ ∀a. divides a 2 ⇔ a = 1 ∨ a = 2
⊦ ∀p m n. prime p ⇒ (divides p (m * n) ⇔ divides p m ∨ divides p n)