[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 succ-first-01
⊦ true ∈ bits +1.rest ∧ bits ≠ [] → (bits +1.first ↔ bits.first)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 9
Used lemmas:
inv-in-02
,
succ-one
,
succ-one-01
,
inv-in-01
,
inv-in
,
inv-empty
,
succ-empty-01
,
succ-zeros-01
,
succ-first
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
app-02-ant
list-data
/bitlista/
elim-list-c
list
/bitlista/
e-01
list
/bitlista/
c
list
/bitlista/
in-17
list
/bitlista/
in-append
list
/bitlista/
in-14
list
/bitlista/
Two
list
/bitlista/
c-06
list
/bitlista/
a