[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem prime-odd-01
⊦ prime(j) ∧ j ≠ 2 → (j - 1) % 2 = 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
prime-two
,
Used spec theorems:
int-div
/
modex
Used simplifier rules:
int-abs
/
elim-sub
int-mult
/
one-01
int-abs
/
lels-02
int-basic1
/
two-ls
int-basic1
/
lf-02
int-abs
/
forward-le-05
int-abs
/
forward-le-01
int-abs
/
numadd-01
int-mult
/
zero-neq-01
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-div
/
mod-mult-pos-02
int-abs
/
lels-01
int-div
/
modeven-neg-01
int-div
/
modeven-neg
int-div
/
div-elim-pospos