[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 uint2bits-2pot-02
0 < i ⊦ uint2bits(2 ^ i - 1) = false ' + mklist(true, i→n(i))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
int2bits-2pot-02
,
int2bits-2pot-03
,
int2bits-add-high
,
uint2bits-2pot-04
,
uint2bits-2pot-05
,
uint2bits-add-high
,
uint2bits-add-low
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 14
Used lemmas:
uint2bits-one
,
uint2bits-rec-01
,
Used spec theorems:
int-div
/
two-odd
int-pot
/
two-mod
int-pot
/
two-mod-01
int-pot
/
div2
Used simplifier rules:
list
/bitlista/
in-14
intnat
/
abs-succ-03
nat-basic2
/
s
intnat
/
labs
int-abs
/
abs-16
int-basic1
/
irref
int-abs
/
numle-02
int-basic2
/
zero-02
int-abs
/
numls-02
nat-basic2
/
c
nat-basic2
/
a
list-last
/bitlista/
mk-last
list-last
/bitlista/
mk-plus
intnat
/
rax
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
numadd-01
int-abs
/
elim-sub
int-pot
/
two-mod
int-basic1
/
lf-03
int-basic1
/
lst-01
int-basic1
/
ls-01
int-abs
/
lels-01
int-pot
/
grz
int-abs
/
numlsf-01
list
/bitlista/
Last
list
/bitlista/
a
list
/bitlista/
app-01
list-last
/bitlista/
mklist-one
list
/bitlista/
Two
int-basic1
/
lf-02
int-pot
/
eq2
int-abs
/
sub-eq
int-abs
/
lels-03
int-abs
/
lsone
int-pot
/
two-leone
int-abs
/
lels
int-abs
/
sub-ls-01