[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-square-10
⊦ (i * i) % 10 = 0 ↔ i % 10 = 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: 12
Proof steps: 20
Used lemmas:
div-not-ls
,
prime-5
,
divides
,
prime-divides
,
prime-two-01
,
prime-mult-eq
,
Used spec theorems:
int-div
/
modex
Used simplifier rules:
int-div
/
mod-zero-num
int-mult
/
associativity
int-mult
/
commutativity
int-div
/
nummult-eq-01