[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 posint-factor
⊦ i < 0 → (* i).r * r = ~((~ i).r * r)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment: prefer positive integers as factors
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
mult-com
,
mult-ass
,
mult-zero
,
num-distr
,
Used spec theorems:
Used simplifier rules:
int-abs
/
zero-gels-01
int-abs
/
forward-le-02
real-basic
/
negeq
int-abs
/
neg-03
int-basic2
/
add-a
int-basic2
/
add-c
real-basic
/
eqint-num