[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-le
n ≠ 0 ⊦ align↑(m0, n) < align↑(m1, n) → m0 < m1
Type: A user defined theorem
Validity: The proof is valid.
Features: lss,
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: 15
Used lemmas:
alignup-def
,
Used spec theorems:
nat-div
/
mod-rew
nat-div
/
Divdef
Used simplifier rules:
nat
/
ls-le-simp
nat
/
elim-sub
nat-basic
/
l-01
nat
/
anti
nat
/
ler
nat
/
let
nat
/
fle-01
nat-div
/
le-div-to-mult
nat
/
lels
nat-basic
/
s-04
nat-mult
/
coef-21
nat-basic
/
lf-02
nat-basic
/
add-base
nat
/
zero
nat-basic
/
l
nat-mult
/
ls-02
nat-div
/
ls-02
nat
/
le-ls-simp
nat
/
fle
nat-basic
/
f
nat-div
/
cond
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic
/
succ
nat-mult
/
rsucc-02
nat-basic
/
a
nat-basic
/
c
nat-basic
/
ls-02