[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 align-down-add-eq-add-ls
m ≠ 0 ⊦ align↓(n0 + n1, m) = n2 + n1 → ¬ n0 < n2
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
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: 4
Used lemmas:
aligndown-def
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
lf-01
nat-basic
/
ls-02
nat-basic
/
f
nat-basic
/
eq-01
nat-basic
/
a
nat-basic
/
c
nat-basic
/
lf-02
nat-basic
/
l-05
nat-div
/
div-elim