[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 div-mod
⊦ 0 < j ∧ 0 ≤ i ∧ 0 ≤ i0 → (j | i - i0 ↔ i % j = i0 % j)
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: 5
Proof steps: 5
Used lemmas:
div-neg
,
div-mod-01
,
Used spec theorems:
Used simplifier rules:
int-abs
/
minus-sub
int-abs
/
sub-eq
int-abs
/
Sub-def
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
zero-gels-04
int-abs
/
lels-01
int-basic1
/
ls-01