[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-65535-pos
⊦ 0 ≤ bytes2int(bytes) ∧ # bytes ≤ 2 ∧ bytes ≠ [] → band(bytes2int(bytes), 65535) = bytes2int(bytes)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 19
Used lemmas:
bytes2int-range
,
Used spec theorems:
int-div
/
mod-zero-05
int-pot
/
ls-pos
intnat
/
num-n2i-ls-02
nat
/
l-num-05
nat-mult
/
mult-c
nat-mult
/
ls-02
Used simplifier rules:
nat
/
le-ls-simp
nat
/
lels
nat
/
fle
list-data
/bytelist/
l
nat-mult
/
zero-01
nat-basic1
/
one
nat-mult
/
one-01
nat-mult
/
mult-a
nat-basic1
/
f
nat-mult
/
mult-c
nat-basic1
/
z
intnat
/
num-n2i-ls-02
int-pot
/
pot2-pos-01
intnat
/
nat2int
int-pot
/
pot2-pos
int-basic1
/
forward-pos
int-abs
/
forward-lels
int-abs
/
negle-13
int-abs
/
forward-le
int-div
/
mod-neq-02
int-abs
/
lels
int-abs
/
absle
int-abs
/
forward-le-01
intops
/
band-commutativity
intops
/
band-associativity
intops
/
band-65535-pos