[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-add
⊦ 0 < i ∧ 0 ≤ j → (i + j) % i = j % i
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
mod-sub
,
mod-succ
,
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:
mod-rec
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
forward-le-01
int-abs
/
sub-add
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lep
int-abs
/
zero-gels-04