[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-zeros-01
⊦ ¬ true ∈ bits ∧ (# bits0 < # bits ∧ ¬ bits0.first) ∧ bits ≠ [] ∧ bits0 ≠ [] → bitsand(bits, bits0) = mklist(false, # bits0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bitsand-app-zeros
,
bitsand-cast
,
bitsand-fillsgn
,
bitsand-zeros-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 12
Used lemmas:
and-zero-03
,
and-rec
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
app-01
list
/bitlista/
in-14
nat-basic2
/
s
nat-basic1
/
ref-1
list
/bitlista/
in-17
list
/bitlista/
in-append
nat
/
l-num-02
list-last
/bitlista/
mk-last
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
/
one
nat-basic2
/
oz
nat-basic2
/
one-03
nat-basic1
/
lf-01
nat-basic2
/
l-02
list-data
/bitlista/
size-01
list
/bitlista/
c-04
nat-basic2
/
c
nat-basic2
/
a
list
/bitlista/
app
list-last
/bitlista/
mk-zero
bitlista
/
mklist-num
list-last
/bitlista/
mk-plus
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c
list-data
/bitlista/
l
nat-basic1
/
f
list-data
/bitlista/
elim-list-c