[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 and-ones
⊦ bits ≠ [] ∧ ¬ false ∈ bits ∧ ¬ false ∈ bits0 → bitsand(bits, false ' + bits0) = false ' + bits0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 14
Used lemmas:
and-onel-02
,
and-zero-03
,
and-rec
,
Used spec theorems:
list-last
/bitlista/
splitlasteq
Used simplifier rules:
list
/bitlista/
e-02
list-last
/bitlista/
last-elim
list
/bitlista/
in-10
list
/bitlista/
in-14
list-last
/bitlista/
bin-01
list
/bitlista/
in-17
list
/bitlista/
in-append
list-last
/bitlista/
b-01
list-last
/bitlista/
lb
nat-basic2
/
l
nat-basic1
/
one-01
nat
/
lels-01
nat
/
ls-01
nat-basic2
/
s
nat-basic1
/
ref-1
list
/bitlista/
app-02-ant
list
/bitlista/
e
list
/bitlista/
app-04
list-last
/bitlista/
l-02
list-last
/bitlista/
bapp
nat-basic2
/
one
list
/bitlista/
Last
list
/bitlista/
c-03
list
/bitlista/
e-01
list
/bitlista/
in-06
list
/bitlista/
app-01
list-data
/bitlista/
elim-list-c
list
/bitlista/
c-04
nat-basic2
/
one-03
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
a
list
/bitlista/
app
list
/bitlista/
c
list-data
/bitlista/
lf-01
list-data
/bitlista/
l
nat-basic1
/
one