[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 lemon2pot-02
⊦ j ≤ 2 ^ n→i(m * n - 1) + j0 ∧ n ≤ n0 ∧ m ≠ 0 ∧ n ≠ 0 → j ≤ 2 ^ n→i(m * n0 - 1) + j0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 6
Used lemmas:
ls-pos
,
Used spec theorems:
intnat
/
nat2int-04
nat
/
num-02
Used simplifier rules:
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
ls-01
int-abs
/
forward-lsle
int-abs
/
le-def
intnat
/
nat2int
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-mult
/
zero-01
nat-basic
/
f
nat
/
ls
nat-basic
/
one-01
nat
/
le-def
nat-mult
/
ls
nat
/
fle
nat
/
fle-01
nat-basic
/
refl-nat
nat-mult
/
mult-base
nat
/
lez-01