[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 square-zero-02
⊦ 0 ≤ j ∧ 0 ≤ i → ¬ (i + j) * (i + j + 1) < 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
int-div
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 2
Used lemmas:
commutativity
,
associativity
,
zero-ls-03
,
square-zero-01
,
Used spec theorems:
Used simplifier rules:
int-abs
/
Sub-def
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-add-01
int-abs
/
numsub
int-abs
/
zero-gels-03
int-abs
/
sub-le-01
int-abs
/
leone
int-abs
/
lels
int-abs
/
numls-02
int-abs
/
mone-06
int-abs
/
lels-02
int-abs
/
lenls