[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 num-div-denom-01
⊦ i1 ≠ 0 ∧ j ≠ 0 → (rational(i, i1).num * j) / rational(i, i1).denom = (i * j) / i1
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: 5
Proof steps: 10
Used lemmas:
numerator-neg2
,
numerator-neg1
,
denominator-pos
,
denominator-zero
,
numerator-zero
,
numerator-pos
,
Used spec theorems:
int-div
/
div-div-switch
Used simplifier rules:
int-abs
/
abs-16
int-abs
/
forward-le-05
int-gcd
/
mod-gcd
int-gcd
/
gcd-com
int-gcd
/
gcd-div-mult
int-basic2
/
add-zero
int-abs
/
sub-eq
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
neg-15
int-mult
/
minus-left
int-basic1
/
ls-01
int-abs
/
forward-le-02
int-abs
/
negeq
int-div
/
neg
int-gcd
/
div-gcd-neg-not-zero
int-div
/
neg-01
int-gcd
/
gcd-zero-zero
int-abs
/
abs-08
int-div
/
zero
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
Mult-zero
int-abs
/
lels-02
int-abs
/
lels