[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-rec-01
⊦ 1 < # bits ∧ 1 < # bits0 → bitsxor(bits, bits0) = bitsxor(bits.butlast, bits0.butlast) + (¬(bits.last ↔ bits0.last))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bitsxor-append-same-size
,
bitsxor-empty
,
bitsxor-is-orand
,
bitsxor-zeros
,
bxor-flip-one-bit
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
bitsxor-rec
,
Used spec theorems:
Used simplifier rules:
list-last
/bitlista/
butlast-last
list
/bitlista/
e-02
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
one
list
/bitlista/
a
list
/bitlista/
len-02
list
/bitlista/
len
list-data
/bitlista/
l
nat-basic1
/
one
list
/bitlista/
Last
list-last
/bitlista/
last-elim