[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 alignup-upper-bound
n ≠ 0 ⊦ is-aligned(m0, n) ∧ m0 ≥ m → align↑(m, n) ≤ m0
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: 1
Proof steps: 5
Used lemmas:
alignup-def
,
is-aligned-def
,
Used spec theorems:
Used simplifier rules:
nat
/
le-def
nat-mult
/
rsucc-02
nat-basic
/
succ
nat
/
ge
nat-basic
/
ref
nat
/
fle-01
nat-basic
/
f
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c
nat-basic
/
zero
nat-mult
/
coef-21
nat-basic
/
s-04
nat-mult
/
mult-a
nat-mult
/
mult-c
nat
/
lels
nat-div
/
le-div-to-mult
nat
/
anti
nat-basic
/
lf-02
nat-div
/
mod-mult-01
nat-div
/
div-elim