[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-ls-04
⊦ 0 < i → ¬ i * (i + 1) < 2
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: 3
Proof steps: 4
Used lemmas:
square-lez-01
,
commutativity
,
associativity
,
one
,
dist-lsplit
,
Used spec theorems:
int-basic2
/
add-c
int-basic2
/
lst-03
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
numls-03
int-abs
/
lsone
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
numlelsdel
int-abs
/
lels-02
int-basic1
/
ls-01