[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 band-bitlength
# int2bits(i) < n, # int2bits(j) < n ⊦ # int2bits(band(i, j)) < n
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bor-bitlength
,
bxor-bitlength
,
Used by units in proved state:
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 15
Used lemmas:
bitsand-len-true
,
bitsand-len-false
,
and-com
,
and-notempty-09
,
band-def
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
ls-02
nat
/
lels-03
nat-basic2
/
succ
nat-basic1
/
trans-1
nat-basic1
/
trans
int2bits
/
int2bits-first-01
int-abs
/
forward-le-02
nat
/
le-ls-simp
int2bits
/
int2bits-first-02
nat-basic1
/
ref-1
nat
/
fle-01
nat
/
lels-01
bitopsaux
/
sgn-length
bitopsaux
/
sgn-empty-01
int2bits
/
bits2bits-def
int2bits
/
int2bits-not-empty
list-data
/bitlista/
l
nat-basic1
/
f
nat
/
fle
nat
/
lels