[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 37 from proof bor-2pot-plus-01 (
previous step
)
⊦ bits.first ∧ # bits = # bits1 + 1 ∧ bits1 ≠ [] ∧ bits0 ≠ [] → bitsand(bits, bits0 + bits1) = bits0 + bitsand(bits.rest, bits1)
Lemma
and-size-one-01