[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 split-finite-remtau-fin
⊦ ⌜al1⌝ ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. ⌜al1⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
split-finite-remtau
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 17
Used lemmas:
remtau-nontau-lem
,
remtau-tau-lem
,
remtau-onetau
,
remtau-one
,
remtau-fin-append
,
remtau-empty
,
Used spec theorems:
Used simplifier rules:
stream
/actionstream/
empty
stream
/actionstream/
fin-empty
list
/actionstream/
a
stream
/actionstream/
append-finfin
list
/actionstream/
c
stream
/actionstream/
append-assoc
stream
/actionstream/
empty-append
stream
/actionstream/
cons-eq
list
/actionstream/
e-01
list-last
/actionstream/
l-02
stream-basic
/actionstream/
inj-02
list-last
/actionstream/
last-one
list
/actionstream/
app
stream
/actionstream/
append-empty
stream
/actionstream/
cons-empty
stream
/actionstream/
eq-stream-to-list-2-2
list
/actionstream/
e