[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 four-square-le-zero
⊦ i ^2 + i0 ^2 + i1 ^2 + i2 ^2 ≤ 0 ↔ i = 0 ∧ i0 = 0 ∧ i1 = 0 ∧ i2 = 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: 6
Proof steps: 10
Used lemmas:
zero-i
,
zero
,
Square-def
,
two-not-neg
,
Used spec theorems:
int-abs
/
notle-pos
Used simplifier rules:
int-basic2
/
ls-01
int-abs
/
forward-le-01
int-basic2
/
ls
int-abs
/
forward-lels
int-mult
/
square-lez-01
int-abs
/
forward-le-04
int-abs
/
forward-lele
int-basic2
/
add-zero-rev
int-abs
/
anti
int-abs
/
ler
int-abs
/
lep-01
int-abs
/
zero-gels-04
int-abs
/
forward-le-05
int-abs
/
lels-01
int-mult
/
zero-le
int-mult
/
commutativity
int-mult
/
associativity
int-basic2
/
add-c
int-basic2
/
add-a
int-mult
/
numsucc
int-mult
/
add-mult-two