[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-pred-02
⊦ i % j ≠ 0 ∧ 0 < i ∧ 0 < j → (i - 1) % j = i % j - 1
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: 4
Proof steps: 12
Used lemmas:
div-elim-pos
,
div-elim-pospos
,
Used spec theorems:
int-mult
/
modeqp-copied
Used simplifier rules:
int-abs
/
sub-eq
int-abs
/
elim-sub
int-abs
/
forward-le-01
int-mult
/
zero-ge-add
int-abs
/
lels-01
int-basic1
/
numlsf
int-abs
/
forward-lsle
int-basic2
/
ls
int-mult
/
zero-ls
int-abs
/
lenls
int-abs
/
forward-le-05
int-basic1
/
forward-pos
int-abs
/
lels
int-abs
/
numleledel-01
int-abs
/
numle-02
int-abs
/
lels-02
int-basic2
/
add-zero
int-abs
/
les
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
succ-rmerge
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
numls-02
int-abs
/
mone-06
int-abs
/
zero-gels-04
int-abs
/
succ-02