[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 getInt-theorem
⊦ bor(bor(bor(b2i(by3) i<< 24, band(b2i(by2), 255) i<< 16), band(b2i(by1), 255) i<< 8), band(b2i(by0), 255)) = bytes2int(by3 ' + by2 ' + by1 ' + by0 ')
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 16
Proof steps: 24
Used lemmas:
bytes2int-one
,
bytes2int-rec
,
bytes2int-rec-bor
,
Used spec theorems:
intops
/
bor-assoc
intops
/
bor-com
intops
/
bor-2pot-plus-02
int-basic2
/
ls-01
intops
/
intshiftleft-is-mult
Used simplifier rules:
int-mult
/
eq-pos
int-mult
/
eq-dist
int-abs
/
numlelsdel
int-mult
/
succ-rmerge
int-basic1
/
forward-pos
int-abs
/
forward-lels
int-mult
/
zero-gr
int-abs
/
numls-02
int-abs
/
mone-06
int-abs
/
zero-gels-04
int-div
/
nummult-ls-02
intops
/
band-max-02
int-div
/
nummult-ls
int-mult
/
zero-ge
int-abs
/
forward-le
int-basic2
/
add-a
int-mult
/
zero-ge-add
int-basic2
/
add-c
int-abs
/
forward-le-01
int-abs
/
forward-le-05
intops
/
bor-65536-plus
int-div
/
nummult-le-02
intops
/
band-max-04
intops
/
band-associativity
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
zero-ls
intops
/
band-notneg
int-abs
/
lels-01
int-abs
/
lels
intops
/
bor-com
intops
/
bor-assoc
intops
/
bor-neq
list
/bytelist/
e-01
intops
/
band-commutativity
list
/bytelist/
app-02-ant
list
/bytelist/
e
list
/bytelist/
a