[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 denom-neg-01
⊦ rational(~ i, j).denom = rational(i, j).denom
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
denom-neg-02
,
negate
,
sub-def-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 3
Used lemmas:
denom-one
,
zero-denom
,
denominator-zero-den
,
denominator-zero
,
denominator-pos
,
Used spec theorems:
Used simplifier rules:
int-gcd
/
gcd-neg
int-abs
/
neg-10