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