[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-false
⊦ ¬ false ∈ bits ∧ ¬ bits0.first ∧ 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-ones-samelen
,
bitsor-sgn-in
,
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:
or-rec-03
,
or-rec-02
,
or-rec-04
,
or-rec
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
s
nat-basic1
/
ref-1
list
/bitlista/
app-03
list
/bitlista/
in-append
list
/bitlista/
e-02
list-last
/bitlista/
last-elim
list-last
/bitlista/
l-02
list-last
/bitlista/
bapp
nat-basic2
/
one
list
/bitlista/
Last
list
/bitlista/
c-04
bitlista
/
one-02
list
/bitlista/
app
list
/bitlista/
app-02-ant
list
/bitlista/
app-04
list
/bitlista/
e
list
/bitlista/
in-17
nat-basic2
/
one-03
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
list
/bitlista/
len-02
list
/bitlista/
len
list-data
/bitlista/
l
nat-basic1
/
one
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c
list-data
/bitlista/
elim-list-c