[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 potex
n ≠ 0 ⊦ ∃ m. 2^ m ≤ n ∧ n < 2^(m + 1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
lls
,
lls-01
,
lls-02
,
lzer
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 16
Used lemmas:
Pot2-zero
,
zero
,
lemma-ax2
,
Used spec theorems:
nat-mult
/
mult-a
Used simplifier rules:
nat-basic2
/
succ
nat-mult
/
ls2-03
nat-mult
/
two-zero-01
nat-basic1
/
ref-1
nat
/
le-ls-simp
nat-basic2
/
s
nat
/
lels-03
nat-basic2
/
oz
nat
/
fle-01
nat-basic1
/
lf-01
nat
/
le-one
nat
/
eqle-one
nat
/
les
nat-basic2
/
l-02
nat
/
fle
nat-basic1
/
f
nat-mult
/
ls-07
nat
/
lels-01
nat
/
lels
nat
/
lep-02
nat-mult
/
ls-01
nat
/
succ-01
nat
/
le-num-02
nat-basic2
/
c
nat-basic2
/
a
nat-mult
/
rsucc-02
nat-mult
/
mult-c
nat-mult
/
mult-a