[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 add-def-03
⊦ j1 ≠ 0 ∧ j2 ≠ 0 → rational(i1, j1) + rational(i2, j2) = rational(i1 * j2 + j1 * i2, j1 * j2)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
add-asso
,
add-eq
,
distributivity
,
ls-def
,
rational-add-same
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 19
Used lemmas:
neg-neg
,
denom-neg
,
add-def-02
,
Used spec theorems:
Used simplifier rules:
int-mult
/
Mult-zero
int-basic2
/
add-zero
int-abs
/
lels-03
int-basic1
/
lst-01
int-mult
/
zero-eq
int-abs
/
forward-le-05
int-basic2
/
add-a
int-abs
/
neg-11
int-mult
/
minus-left
int-mult
/
associativity
int-abs
/
neg-02
int-basic1
/
ls-01
int-abs
/
neg
int-abs
/
abs-08
int-abs
/
forward-le-02
int-abs
/
zero-gels-01
int-abs
/
lels-02
int-abs
/
lels
int-mult
/
commutativity
int-basic2
/
add-c