[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 byte2bits-val
⊦ bits2uint(byte2bits(by)) = band(b2i(by), 255)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bytes2int-rec
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 22
Used lemmas:
byte2bits-value
,
byte2bits
,
byte2bits-empty
,
byte2bits-first
,
Used spec theorems:
int2bits
/
bits2int-pos-02
bitopsaux
/
fill-fill
int2bits
/
bits2uint-split
int2bits
/
bits2uint-ones
int2bits
/
int2uint-neg
int-pot
/
pot-dist-pos
intnat
/
n2i-add
nat-basic2
/
c
Used simplifier rules:
byte
/
byte-equal
byte
/
byte-011x-pos
int-abs
/
lels
intnat
/
nat2int
int-mult
/
succ-rmerge
int-abs
/
elim-sub
list-last
/bitlista/
mk-len
int-basic2
/
add-in
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-zero
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
Mult-zero
int2bits
/
bits2uint-base
list-last
/bitlista/
mk-zero
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
z
list-last
/bitlista/
mk-empty
bitlista
/
inmklist-01
list-data
/bitlista/
l
nat
/
elim-sub
int2bits
/
int2bits-first-01
int2bits
/
int2bits-not-empty
byte
/
byte-len
nat
/
lels-01
intops
/
band-commutativity
intops
/
band-associativity
byte
/
byte-011x-neg