[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-add-same
m ≠ 0 ⊦ align↓(n0 + n1, m) = align↓(n0, m) ↔ n0 % m + n1 < m
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: 3
Proof steps: 7
Used lemmas:
aligndown-def
,
Used spec theorems:
Used simplifier rules:
nat-mult
/
zero
nat-basic
/
zero-01
nat-div
/
div-elim
nat-basic
/
add-base
nat-mult
/
modeq
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic
/
a
nat-basic
/
c
nat
/
lels
nat
/
fle
nat-basic
/
eq-01
nat-basic
/
l-01
nat-basic
/
lf-02
nat-basic
/
lf-01
nat-basic
/
f
nat
/
le-ls-simp