[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-zeros
⊦ ¬ true ∈ bits0 ∧ # bits0 ≤ # bits ∧ bits ≠ [] ∧ bits0 ≠ [] → bitsxor(bits, bits0) = bits
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bitsxor-zeros-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 18
Used lemmas:
bitsxor-rec-02
,
bitsxor-rec-01
,
Used spec theorems:
list-data
/bitlista/
lf-01
Used simplifier rules:
nat-basic2
/
s
nat-basic1
/
ref-1
list
/bitlista/
app-03
list
/bitlista/
in-17
list
/bitlista/
in-append
nat
/
lep-02
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
one
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
e-02
list-last
/bitlista/
last-elim
list
/bitlista/
Last
list
/bitlista/
in-empty
list
/bitlista/
in-06
list
/bitlista/
e-01
list
/bitlista/
c-03
list-data
/bitlista/
elim-list
list
/bitlista/
a
list
/bitlista/
app
list
/bitlista/
c
nat
/
not-zero
list-data
/bitlista/
le-one
list-data
/bitlista/
l
nat-basic1
/
one