[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 factor-rat-02
⊦ 0 < j ∧ i1 ≠ 0 → rational(i1 * i, i1 * j) = rational(i, j)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp, simp,
Comment:
Used by:
add-def-02
,
factor-rat-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 8
Used lemmas:
denom-neg
,
factor-rat-03
,
Used spec theorems:
int-mult
/
minus-left
Used simplifier rules:
int-abs
/
neg
int-abs
/
zero-gels-01
int-mult
/
minus-left
int-abs
/
abs-16
int-abs
/
abs-08
int-mult
/
abs-eqall
int-mult
/
zero-ls
int-basic1
/
ls-01
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
forward-le-02
int-abs
/
lels-02
int-abs
/
lels-03
int-abs
/
lels
int-abs
/
forward-le-05