[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 bitsor-bi-ones
⊦ ¬ false ∈ bits ∧ bits ≠ [] ∧ bits0 ≠ [] → bits2int(bitsor(bits, bits0) + bits1) = bits2int(true ' + bits1)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bitsor-bi-sgn
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 20
Used lemmas:
bitsor-ones-samelen
,
or-rec-01
,
bitsor-app
,
bitsor-ones-true
,
bitsor-ones-false
,
Used spec theorems:
list
/bitlista/
split-rest
list
/bitlista/
a
int2bits
/
bits2int-ones-02
Used simplifier rules:
list
/bitlista/
in-10
list
/bitlista/
in-empty
list
/bitlista/
app
list-data
/bitlista/
size-01
nat-basic1
/
one
nat-basic2
/
l
list
/bitlista/
in-append
nat-basic1
/
trans
nat-basic1
/
trans-1
nat-basic2
/
succ
nat-basic2
/
l-02
nat-basic2
/
a
nat-basic2
/
c
list-data
/bitlista/
l
nat-basic1
/
f
list
/bitlista/
e
list
/bitlista/
app-02-ant
nat
/
lels-01
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
c-08
int2bits
/
bits2int-ones-02
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c
list-data
/bitlista/
elim-list-c