[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 numerator-pos
⊦ i ≠ 0 ∧ 0 < j → rational(i, j).num = i / gcd(i, j)
Type: An axiom
Validity: The proof is valid.
Features: localsimp,
Comment: gcd is always positive.
Used by:
Extsimple
,
abs-num
,
abs-pos
,
canon-any
,
canon-pos
,
div-def-01
,
equal-same
,
equality-01
,
factor-rat-03
,
gcd-num-one
,
int-add
,
int-mult
,
make
,
num-div-denom
,
num-div-denom-01
,
num-id
,
num-neg
,
num-neg-01
,
num-neg-02
,
num-pos
,
num-zero
,
num-zero-denum-one
,
zero-denom
,
Used by units in proved state:
Proof exists?: No