[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 int2bits-2pot-02
0 ≤ i ⊦ int2bits(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-add-high
,
int2bits-add-low
,
int2bits-lslen-08
,
uint2bits-add-high
,
Used by units in proved state:
intops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 3
Used lemmas:
uint2bits-zero
,
uint2bits-2pot-02
,
int2bits-pos
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels
int-abs
/
anti
int-basic1
/
lf-03
list-last
/bitlista/
mk-zero
list
/bitlista/
app
list
/bitlista/
a
list
/bitlista/
c-04
int-abs
/
sub-le-01
int-abs
/
leone
int-pot
/
grz
int-abs
/
lels-01
int-abs
/
lels-04