[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-once
n ≠ 0 ⊦ (m + n) % n = m % n
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
mod-by6
,
mod-mult
,
mod-rec
,
mod-succ-03
,
mod2-succ
,
square-even-01
,
square-even-03
,
square-interval
,
square-ls-03
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
cond-01
,
add
,
rax
,
Used spec theorems:
Used simplifier rules:
nat
/
lels-01
nat
/
lep-02
nat
/
cancel-01
nat-mult
/
mult-a
nat-mult
/
rsucc-02
nat-basic2
/
c
nat-basic2
/
a
nat-mult
/
mult-c