[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 modmod-add-01
0 ≠ j ⊦ 0 ≤ i ∧ 0 ≤ i0 → (i % j + i0) % j = (i + i0) % j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
modmod-add-02
,
modmod-ma-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
mod-neg
,
modmod-add
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-01
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-basic1
/
ls-01
int-basic1
/
lst-01
int-abs
/
zero-gels-04
int-abs
/
neg
int-abs
/
zero-gels-01