[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 fits-law-bxor
⊦ bxor(b2i(by1), b2i(by2)) = b2i(i2b(bxor(b2i(by1), b2i(by2))))
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: 10
Proof steps: 14
Used lemmas:
inbyte
,
bcompl-bib
,
byte2int-in
,
band-bib
,
inbyte-bib
,
bor-bib
,
Used spec theorems:
intops
/
bxor-def-logic
Used simplifier rules:
int-abs
/
forward-lele
intops
/
band-commutativity