[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-ones-samelen
⊦ ¬ false ∈ bits ∧ # bits = # bits0 ∧ bits ≠ [] ∧ bits0 ≠ [] → bitsor(bits, bits0) = bits
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bitsor-bi-ones
,
bitsor-sgn-in
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
bitsor-ones-true
,
bitsor-ones-false
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
c-08
nat
/
lels-01
nat-basic2
/
a
nat-basic2
/
c
list
/bitlista/
app-02-ant
list
/bitlista/
e
nat-basic1
/
lf-02
nat-basic1
/
lf-01
nat-basic1
/
f
list-data
/bitlista/
l
nat-basic1
/
ls-02
list
/bitlista/
e-01
list
/bitlista/
a
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
c
list-data
/bitlista/
elim-list-c