[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-02
⊦ ¬ true ∈ bits ∧ bits ≠ [] ∧ bits0 ≠ [] → sgn(bitsand(bits, bits0)) = false '
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bitsand-app-zeros-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
bitsand-zeros-01
,
bitsand-zeros
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
e
list
/bitlista/
app-02-ant
list
/bitlista/
c-08
nat
/
ls-le-simp
nat
/
lels
list-last
/bitlista/
mk-plus
bitlista
/
mklist-num
list-last
/bitlista/
mk-zero
list
/bitlista/
app
nat-basic2
/
a
nat-basic2
/
c
bitopsaux
/
sgn-mklist-01
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c
list-data
/bitlista/
elim-list-c
list-data
/bitlista/
l
nat-basic1
/
f
nat
/
lels-01
bitopsaux
/
sgn-zero
list
/bitlista/
c-04