[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-eq-01
⊦ m0 < n ∧ n ≠ 0 → ((m + m0) % n = m0 ↔ m % n = 0)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
mod-eq-02
,
mod-succ-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
mod-mult
,
div-elim
,
mod-ls
,
mod-eq
,
mod-add
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
f
nat-basic2
/
eq-01
nat-basic2
/
a
nat-basic2
/
c
nat-basic1
/
lf-02
nat-mult
/
zero-06
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-mult
/
ls-01