[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 mult-03
⊦ 0 < i0 ∧ i0 < j ∧ 0 < i ∧ 0 < j0 → (i * j - i0) / (j0 * j) = (i - 1) / j0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
mult-04
,
two-mult
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 5
Used lemmas:
mult-02
,
Used spec theorems:
int-mult
/
dist-sub-split
Used simplifier rules:
int-basic1
/
trans
int-basic1
/
lf-01
int-basic1
/
forward-pos
int-abs
/
forward-le-05
int-abs
/
sub-le-01
int-basic2
/
add-zero-rev
int-abs
/
sub-ls
int-basic2
/
add-less
int-abs
/
leone
int-abs
/
lels-01
int-basic1
/
ls-01
int-mult
/
one
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
sub-add-01
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-sub
int-abs
/
sub-add-06
int-abs
/
sub-eq
int-abs
/
Sub-def
int-mult
/
eq-pos