[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 bitsxor-append-same-size
⊦ # bits0 = # bits2 ∧ bits ≠ [] ∧ bits0 ≠ [] ∧ bits1 ≠ [] → bitsxor(bits + bits0, bits1 + bits2) = bitsxor(bits, bits1) + bitsxor(bits0, bits2)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bitsxor-first
,
bxor-flip-one-bit
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 17
Used lemmas:
bitsxor-bit
,
bitsxor-rec-01
,
Used spec theorems:
Used simplifier rules:
list-last
/bitlista/
b-01
list-last
/bitlista/
lb
nat-basic1
/
one-01
nat
/
lels-01
nat
/
ls-01
nat-basic2
/
s
nat-basic1
/
ref-1
list
/bitlista/
app-03
list
/bitlista/
app-01
list
/bitlista/
Nil
list
/bitlista/
app
list
/bitlista/
e-02
nat-basic2
/
one-03
list
/bitlista/
len-02
list-last
/bitlista/
last-elim
nat-basic2
/
oz
list
/bitlista/
Last
list-last
/bitlista/
lapp
list-last
/bitlista/
bapp
list
/bitlista/
len
list
/bitlista/
a
nat-basic1
/
one
nat-basic2
/
z-01
list-data
/bitlista/
l
nat-basic2
/
a
nat-basic2
/
c
list-data
/bitlista/
eq-one
nat-basic2
/
one
list-data
/bitlista/
size-01
nat-basic2
/
z