[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 48 from proof bxor-flip-one-bit (
previous step
)
⊦ # bits0 = # bits2 ∧ bits ≠ [] ∧ bits0 ≠ [] ∧ bits1 ≠ [] → bitsxor(bits + bits0, bits1 + bits2) = bitsxor(bits, bits1) + bitsxor(bits0, bits2)
Lemma
bitsxor-append-same-size