[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 aligndown-remainder
n ≠ 0 ⊦ m = m0 + align↓(m, n) ↔ m0 = m % n
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 12
Used lemmas:
aligndown-def
,
Used spec theorems:
nat-div
/
mod-rew
Used simplifier rules:
nat-basic
/
eq-02
nat-basic
/
eqs
nat
/
elim-sub
nat-div
/
cond
nat-mult
/
mult-a
nat-mult
/
mult-c
nat
/
eq-02
nat-basic
/
c
nat-basic
/
a