[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 isSquare-mult
⊦ isSquare(j * i * i) ↔ isSquare(j) ∨ i = 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
pot-isSquare
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 19
Used lemmas:
isSquare-mult-aux
,
Used spec theorems:
int-mult
/
mult-pos
int-abs
/
Abs-pos
int-mult
/
abs-eqall
int-square
/
isSquare-def
Used simplifier rules:
int-abs
/
abs-06
int-abs
/
abs-07
int-abs
/
abs-01
int-mult
/
square-gez
int-abs
/
abs-08
int-abs
/
negeq
int-abs
/
zero-gels-01
int-abs
/
lels
int-mult
/
square-lez-01
int-basic1
/
lf-02
int-abs
/
forward-le-02
int-mult
/
zero-eq
int-basic2
/
ls-02
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
forward-le-05
int-basic1
/
lf-01
int-basic1
/
trans
int-basic2
/
add-zero
int-mult
/
square-zero
int-mult
/
square-lez
int-mult
/
square-eq
int-mult
/
abs-eqall
int-square
/
isSquare-zero
int-mult
/
Mult-zero
int-square
/
isSquare-square
int-mult
/
associativity
int-mult
/
commutativity