[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 canon-any
⊦ 0 < j → rational(i, j) = rational(i / gcd(i, j), j / gcd(i, j))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
one
,
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:
numerator-pos
,
denominator-pos
,
Equality
,
canon-pos
,
Used spec theorems:
Used simplifier rules:
int-gcd
/
div-gcd-not-neg
int-div
/
one
int-gcd
/
gcd-div-gcd
int-gcd
/
gcd-abs
int-div
/
abs
int-gcd
/
gcd-zero-zero
int-gcd
/
div-gcd-zero
int-gcd
/
gcd-com
int-abs
/
abs-16
int-abs
/
forward-le-05
int-abs
/
forward-le-02
int-abs
/
lels-03
int-abs
/
lels
int-abs
/
lels-01