[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-02
⊦ 0 ≤ i ∧ j < i ∧ 0 < j ∧ 0 ≤ i0 ∧ i0 * j ≤ i ∧ i < (i0 + 1) * j → i % j = i - 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: 2
Proof steps: 3
Used lemmas:
is-div
,
divmod-rew
,
Used spec theorems:
Used simplifier rules:
int-basic1
/
numlslsdel-01
int-basic2
/
zero-02
int-mult
/
ls-same-01
int-basic2
/
succ-01
int-abs
/
ler
int-abs
/
succ-02
int-mult
/
ls-pos
int-abs
/
mone-06
int-abs
/
numls-02
int-mult
/
zero-gr
int-basic1
/
forward-pos
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
forward-le-01
int-abs
/
forward-lels
int-abs
/
forward-le-05
int-abs
/
sub-eq
int-mult
/
zero-left
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
zero-gels-04