[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 bitsand-app
⊦ # bits = # bits1 ∧ bits0 ≠ [] ∧ bits2 ≠ [] ∧ bits ≠ [] → bitsand(bits0 + bits, bits2 + bits1) = bitsand(bits0, bits2) + bitsand(bits, bits1)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bitsand-cast
,
bitsand-cast-01
,
bitsand-fillsgn
,
Used by units in proved state:
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 14
Used lemmas:
and-one
,
and-rec
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
s
nat-basic1
/
ref-1
list
/bitlista/
app-03
list-last
/bitlista/
last-def
list-last
/bitlista/
butlast-def
list
/bitlista/
app
list
/bitlista/
Nil
list
/bitlista/
app-01
nat-basic2
/
one-03
nat-basic2
/
eq-01
list
/bitlista/
e-02
nat-basic2
/
oz
list
/bitlista/
len-02
list-last
/bitlista/
last-elim
list
/bitlista/
Last
list-last
/bitlista/
lapp
list-last
/bitlista/
bapp
list
/bitlista/
len
list
/bitlista/
a
nat-basic1
/
one
nat-basic2
/
z-01
list-data
/bitlista/
l
nat-basic2
/
a
nat-basic2
/
c
list-data
/bitlista/
eq-one
nat-basic2
/
one
list-data
/bitlista/
size-01
nat-basic2
/
z