[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-zero-one
0 ≤ i, 0 ≤ i0, 0 < j ⊦ (i % j + i0 % j) / j = 1 ∨ (i % j + i0 % j) / j = 0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
add-div-mult
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 17
Used lemmas:
mod-zero-01
,
div-zero-ngr
,
num-ls
,
div-mult-03
,
mod-less-01
,
Used spec theorems:
int-mult
/
add-mult-two
int-basic2
/
pls
int-basic2
/
pls-01
Used simplifier rules:
int-abs
/
forward-le-01
int-abs
/
forward-le-05
int-basic1
/
ls-01
int-basic1
/
lst-01
int-abs
/
bet
int-basic1
/
forward-pos
int-abs
/
gr-def
int-abs
/
lels-03
int-basic1
/
two-ls
int-mult
/
add-mult-two
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels
int-abs
/
ge-def
int-mult
/
zero-left
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
lenls
int-abs
/
zero-gels-01
int-basic2
/
succ-01
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
lels-01