[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 equal-same
⊦ 0 < j → (rational(i, j) = rational(i0, j) ↔ i = i0)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
add-eq
,
div-def-01
,
elim-sub
,
equality-def
,
int2rat-equal
,
one
,
root-is-irrational
,
totality
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 18
Used lemmas:
numerator-pos
,
numerator-zero
,
denominator-pos
,
Equality
,
Used spec theorems:
int-gcd
/
gcd-div-eq
int-gcd
/
gcd-div-mult-shift
int-gcd
/
div-eq
Used simplifier rules:
int-gcd
/
gcd-divides
int-mult
/
eq-nonzero
int-mult
/
associativity
int-gcd
/
divides
int-div
/
div-mult-03
int-gcd
/
gcd-zero-zero
int-mult
/
commutativity
int-gcd
/
gcd-com
int-abs
/
abs-16
int-gcd
/
div-gcd-zero
int-abs
/
forward-le-05