[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-is-aligned-add
n ≠ 0 ⊦ is-aligned(n0, n) → align↓(n0 + n1, n) = n0 + align↓(n1, 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: 1
Proof steps: 5
Used lemmas:
is-aligned-def
,
aligndown-def
,
Used spec theorems:
nat-mult
/
dist
Used simplifier rules:
nat-div
/
div-add
nat-div
/
mod-add
nat-div
/
mult-div
nat-mult
/
mult-a
nat-basic
/
eq-01
nat-basic
/
a
nat-basic
/
c
nat-mult
/
mult-c