[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 one
⊦ i ≠ 0 → rational(i, i) = rational(1, 1)
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: 4
Proof steps: 8
Used lemmas:
equal-same
,
denom-neg
,
canon-any
,
Used spec theorems:
int-gcd
/
gcd-same
Used simplifier rules:
int-gcd
/
gcd-zero
int-div
/
neg
int-abs
/
zero-gels-01
int-div
/
neg-01
int-gcd
/
gcd-zero-zero
int-gcd
/
gcd-com
int-gcd
/
gcd-neg
int-abs
/
neg
int-abs
/
lels
int-abs
/
lels-03
int-abs
/
abs-08
int-abs
/
forward-le-02
int-basic1
/
ls-01
int-basic1
/
lst-01
int-gcd
/
gcd-same
int-abs
/
abs-16
int-div
/
div-same