[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 or-rec
⊦ 1 < # bits ∧ 1 < # bits0 → bitsor(bits, bits0) = bitsor(bits.butlast, bits0.butlast) + (bits.last ∨ bits0.last)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bitsor-app
,
bitsor-bi-sgn
,
bitsor-com
,
bitsor-empty
,
bitsor-first
,
bitsor-first-02
,
bitsor-mklist-in
,
bitsor-ones-false
,
bitsor-ones-true
,
bitsor-zeroes-false
,
bitsor-zeroes-true
,
bitsxor-is-orand
,
or-invandinv
,
or-last
,
or-two-01
,
or-two-02
,
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:
bitsor-rec
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
c-04
list
/bitlista/
first
list
/bitlista/
Nil
list-last
/bitlista/
butlast-last
list
/bitlista/
e-02
list
/bitlista/
a
list
/bitlista/
app
list
/bitlista/
c
list-data
/bitlista/
lf-01
list-data
/bitlista/
l
nat-basic1
/
one
list
/bitlista/
Last
list-last
/bitlista/
last-elim