[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-pos
i * i0 + j0 = i1 * j + j1, 0 ≤ j0, j0 < j, 0 ≤ j1, j1 < j, 0 ≤ i0, 0 ≤ i ⊦ j < i0 ∨ i1 ≤ i
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: 1
Proof steps: 2
Used lemmas:
modneqp
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-01
int-abs
/
forward-le-05
int-abs
/
lels-01
int-abs
/
lels