[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-01
⊦ 0 < j ∧ 0 ≤ i0 ∧ i0 ≤ i → (j | i - i0 ↔ i % j = i0 % j)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
div-mod
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 9
Used lemmas:
divides
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
sub-eq
int-abs
/
lep
int-mult
/
zero-ge
int-div
/
mod-mult-pos-01
int-div
/
div-elim-pospos
int-div
/
mod-less-01
int-div
/
mod-zero
int-abs
/
forward-le-01
int-mult
/
eq-pos
int-basic2
/
add-in
int-mult
/
dist-rmerge
int-abs
/
zero-gels-04
int-mult
/
zero-ge-add
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
le-pos
int-abs
/
le-add
int-abs
/
Sub-def
int-basic2
/
add-a
int-basic2
/
add-c