[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-neg
⊦ j ≠ 0 → rational(~ i, ~ j).num = rational(i, j).num
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
denom-neg
,
neg-neg
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 7
Used lemmas:
numerator-neg2
,
numerator-neg1
,
numerator-zero
,
numerator-pos
,
Used spec theorems:
Used simplifier rules:
int-abs
/
abs-08
int-abs
/
neg-03
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
forward-le-02
int-abs
/
negeq
int-abs
/
abs-neg
int-abs
/
abs-16
int-basic1
/
ls-01
int-abs
/
neg-05
int-gcd
/
gcd-com
int-gcd
/
gcd-neg
int-gcd
/
gcd-zero-zero
int-div
/
neg-01
int-abs
/
neg-02
int-abs
/
forward-le-05
int-abs
/
lels-02
int-abs
/
lels
int-abs
/
neg
int-abs
/
neg-10