[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-ones
⊦ ¬ false ∈ bits → bitsand(bits + true ' + bits0, false ' + bits1) = bitsand(true ' + bits0, false ' + bits1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bitsand-cast-04
,
bitsand-cast-05
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 22
Used lemmas:
add-ones-lelen
,
add-ones-grlen-02
,
and-onel-02
,
and-rec-02
,
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/
lapp-01
list-last
/bitlista/
butlast-def
list-last
/bitlista/
bin
nat-basic2
/
z-01
nat
/
add-num-03
list
/bitlista/
e-02
list-last
/bitlista/
last-elim
list-last
/bitlista/
l-02
list-last
/bitlista/
bapp
nat-basic2
/
one
list
/bitlista/
Last
nat-basic1
/
ls-02
nat-basic1
/
f
list
/bitlista/
c-08
nat
/
lels-01
nat
/
lep-02
list
/bitlista/
in-17
list
/bitlista/
in-append
list
/bitlista/
e-01
list
/bitlista/
app-02-ant
list
/bitlista/
e
list
/bitlista/
app
list-data
/bitlista/
l
nat-basic2
/
one-03
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
nat-basic1
/
one
list
/bitlista/
a
list
/bitlista/
len-02
list
/bitlista/
len