[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 57 from proof bor-2pot-plus (
previous step
)
⊦ ¬ false ∈ bits ∧ # bits0 ≤ # bits ∧ bits0.first ∧ bits0 ≠ [] → bitsand(bits0, bits) = fillsgn(# bits, bits0)
Lemma
add-ones-grlen-01