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