[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
⊦ 0 ≤ i ∧ 0 ≤ j → ((i * (i + 1)) / 2 < (j * (j + 1)) / 2 ↔ i < j)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
square-ls-01
,
square-ls-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
square-even
,
ls-even
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-01
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
square-ls-02
int-mult
/
zero-ge-02
int-abs
/
numle-02
int-abs
/
numleledel-01