[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-first-01
⊦ bits ≠ [] ∧ bits0 ≠ [] → (bitsor(bits, bits0).first ↔ bits.first ∨ bits0.first)
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: 7
Proof steps: 18
Used lemmas:
bitsor-com
,
bitsor-first
,
bitsor-first-02
,
bitsor-empty
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
c-08
list
/bitlista/
in-17
list
/bitlista/
in-append
list
/bitlista/
in-14
list
/bitlista/
app-02-ant
list
/bitlista/
e
list-data
/bitlista/
elim-list
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c
list-data
/bitlista/
elim-list-c