[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-true
⊦ bits ≠ [] ∧ bits0 ≠ [] → (bitsand(bits, bits0) = true ' ↔ bits = true ' ∧ bits0 = true ')
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: 6
Proof steps: 20
Used lemmas:
and-notempty-05
,
and-rec-04
,
and-rec-03
,
and-rec-02
,
and-rec-01
,
and-rec
,
and-oner-01
,
and-onel-01
,
Used spec theorems:
Used simplifier rules:
list-last
/bitlista/
l-02
list-last
/bitlista/
bapp
list
/bitlista/
app-04
list
/bitlista/
first
list-last
/bitlista/
b
list
/bitlista/
Nil
list
/bitlista/
c-05
list
/bitlista/
Last
list
/bitlista/
app-02-ant
list
/bitlista/
c-03
list
/bitlista/
e-01
list-data
/bitlista/
elim-list-c
list
/bitlista/
a
list
/bitlista/
app
list
/bitlista/
c
list-data
/bitlista/
lf-01
list-data
/bitlista/
l
nat-basic1
/
one
list
/bitlista/
e
list
/bitlista/
c-04