[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
,
Proof step 1 from proof and-rec-04 (conclusion)
⊦ bits0 ≠ [] ∧ bits = false ' → bitsand(bits, bits0) = false '
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
⊦ bitsand(false ', bits0) = false ', bits0 = []
Rule argument
Additional information