[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 modeqp-copied
i * j + j0 = i0 * j + j1, 0 ≤ j0, j0 < j, 0 ≤ j1, j1 < j ⊦ i = i0 ∧ j0 = j1
Type: A user defined theorem
Validity: The proof is valid.
Features: copied,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 13
Used lemmas:
commutativity
,
modlep-03
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-01
int-abs
/
forward-le-05
int-basic2
/
add-in
int-abs
/
lels-03
int-abs
/
absle
int-basic1
/
ls-01
int-basic1
/
lst-01
int-basic1
/
lf-02
int-basic2
/
ls-01
int-basic1
/
irref
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels
int-abs
/
gr-def