[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 two-add-square
⊦ 0 ≤ i → ((i * (i - 1)) / 2 + i ≠ (i * (i + 1)) / 2 ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
two-add-square-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 1
Used lemmas:
div-mult-pos-rew
,
Used spec theorems:
Used simplifier rules:
int-mult
/
dist-rmerge
int-abs
/
sub-add-01
int-abs
/
numsub
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
zero-ge-02
int-abs
/
sub-le-01
int-abs
/
leone
int-abs
/
lels
int-abs
/
anti