[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-empty
⊦ bits ≠ [] ∧ bits0 ≠ [] → bitsxor(bits, bits0) ≠ []
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bitsxor-is-orand
,
bxor-flip-one-bit
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
bitsxor-rec-04
,
bitsxor-rec-03
,
bitsxor-rec-02
,
bitsxor-rec-01-01
,
bitsxor-rec-01
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
c-04
list
/bitlista/
len-02
bitlista
/
one-01
bitlista
/
one-02
bitopsaux
/
inv-empty
list-data
/bitlista/
l
nat-basic1
/
one
list
/bitlista/
Last
list
/bitlista/
app-02-ant
list
/bitlista/
e
list
/bitlista/
a