[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
⊦ 0 ≤ i ∧ 0 ≤ j ∧ 0 ≤ i0 ∧ 0 ≤ j0 → (((i + j) * (i + j + 1)) / 2 + j = ((i0 + j0) * (i0 + j0 + 1)) / 2 + j0 ↔ i = i0 ∧ j = j0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 17
Used lemmas:
div-elim-pospos
,
Used spec theorems:
int-abs
/
numadd
int-mult
/
dist-sub-split
int-mult
/
dist-lsplit
int-mult
/
square-inject
Used simplifier rules:
int-mult
/
square-zero-02
int-abs
/
forward-le-05
int-mult
/
zero-ge-add-01
int-abs
/
forward-le-01
int-abs
/
sub-le-01
int-abs
/
sub-add-01
int-mult
/
square-even
int-abs
/
lstwo
int-abs
/
sub-eq
int-basic2
/
add-in
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
numeq
int-mult
/
zero-left
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-zero-rev
int-abs
/
lep
int-abs
/
zero-gels-04
int-abs
/
lels-01
int-abs
/
zero-gs