[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-01
⊦ j ≤ 2 ^ n→i(m * n - 1) ∧ n ≤ n0 ∧ m ≠ 0 ∧ n ≠ 0 → j ≤ 2 ^ n→i(m * n0 - 1)
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: 1
Proof steps: 1
Used lemmas:
ls-pos-2pot-01
,
lemon2pot
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-01
intnat
/
le
nat
/
lels-01
nat-basic1
/
one-01
nat-mult
/
zero-06
nat-mult
/
mult-a
nat-mult
/
mult-c
nat
/
ls-03
intnat
/
nat2int
nat-basic1
/
f
int-abs
/
forward-lsle
intnat
/
nat2int-04
nat-mult
/
zero
nat
/
lez-01
nat
/
ls-01
nat-basic2
/
s
nat-mult
/
ls-02
nat
/
le-ls-simp
nat-basic2
/
a
nat-basic2
/
c