[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-false
⊦ bits.first ∧ bits0.first ∧ bits ≠ [] ∧ bits0 ≠ [] → bitsand(bits, bits0) ≠ false ' + bits1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
band-neg
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 21
Used lemmas:
and-notempty-05
,
and-oner
,
and-onel-02
,
and-rec
,
Used spec theorems:
list-last
/bitlista/
splitlasteq
Used simplifier rules:
nat-basic2
/
s
nat-basic1
/
ref-1
list-last
/bitlista/
b
list
/bitlista/
app-02-ant
list
/bitlista/
e
list
/bitlista/
e-02
list-last
/bitlista/
last-elim
list
/bitlista/
in-15
list-last
/bitlista/
l-02
list-last
/bitlista/
bapp
nat-basic2
/
one
list
/bitlista/
Last
list
/bitlista/
c-06
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/
len-02
list
/bitlista/
len
list
/bitlista/
in-17
list
/bitlista/
in-append
list
/bitlista/
e-01
list
/bitlista/
c
list
/bitlista/
a
list
/bitlista/
in-14
list-data
/bitlista/
elim-list-c