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