[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 mod-sub-01
⊦ 0 < i ∧ 0 ≤ j ∧ i ≤ j → (i - j) % i = ~(j % 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: 3
Proof steps: 3
Used lemmas:
mod-neg-01
,
mod-add-01
,
Used spec theorems:
Used simplifier rules:
int-abs
/
sub-eq
int-abs
/
Sub-def
int-abs
/
zero-gels-04
int-abs
/
neg-12
int-abs
/
neg-15
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
negeq
int-abs
/
neg-05
int-abs
/
abs-neg
int-abs
/
abs-16
int-abs
/
lels
int-abs
/
anti
int-abs
/
forward-le
int-abs
/
forward-le-01
int-abs
/
forward-le-05
int-abs
/
sub-zero-01