[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 mod-next-square
⊦ ((i * i) * (i + 1) * (i + 1)) % 4 = 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
int-pot
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 13
Used lemmas:
mod-zero-num
,
modex-odd-neg-01
,
mod-two-01
,
modex-odd
,
mod-two
,
mod-mult-04
,
modex
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
lels-01
int-abs
/
forward-le-04
int-abs
/
forward-le-02
int-abs
/
numadd-01
int-abs
/
lels
int-abs
/
anti
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
succ-rmerge
int-mult
/
associativity
int-mult
/
commutativity