[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-inject
i * (i + 1) + 2 * i0 = j * (j + 1) + 2 * j0, i0 ≤ i, j0 ≤ j, 0 ≤ i0, 0 ≤ j, 0 ≤ j0 ⊦ i = j ∧ i0 = j0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
int-div
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 5
Used lemmas:
eq-pos
,
le-pos
,
zero-ls
,
numls-04
,
numsucc
,
commutativity
,
associativity
,
one
,
dist-lsplit
,
square-interval
,
Used spec theorems:
Used simplifier rules:
int-basic2
/
add-in
int-abs
/
lels
int-basic2
/
ls
int-abs
/
forward-lele
int-abs
/
forward-le-01
int-basic2
/
ls-01
int-abs
/
lep-02
int-abs
/
lels-01
int-abs
/
succ-01
int-abs
/
lels-04
int-basic2
/
add-a
int-basic2
/
add-c