[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-n
n ≠ 0 ⊦ n ≤ n0 + n1 ∧ n0 + n1 < 2 * n → align↓(n0 + n1, n) = 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: 3
Proof steps: 13
Used lemmas:
aligndown-def
,
Used spec theorems:
nat-div
/
mod-rew
nat-div
/
rec
Used simplifier rules:
nat-mult
/
zero-06
nat
/
fle-01
nat-basic
/
succ
nat-basic
/
lf
nat-basic
/
f
nat
/
lels-02
nat-basic
/
add-base
nat-basic
/
lf-01
nat-mult
/
ls-02
nat-mult
/
ls-04
nat-basic
/
one
nat-div
/
mult-ls
nat-basic
/
twols-02
nat-mult
/
zero-03
nat
/
elim-sub
nat-div
/
cond
nat-mult
/
rsucc-02
nat-basic
/
a
nat-basic
/
c
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic
/
one-03
nat-basic
/
lf-02
nat-mult
/
numeral-36
nat-mult
/
one
nat-mult
/
ls-08