[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 remtau-split
⊦ el ≠ [] → (ext !(α) = ⌜el⌝ + β ↔ (∃ al, α0. α = ⌜al⌝ + α0 ∧ al ≠ [] ∧ ext !(⌜al⌝ ) = ⌜el⌝ ∧ Some(el.last) = ext(al.last) ∧ ext !(α0) = β))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
remtau-split-fin
,
remtau-split-inf
,
remtau-split-list
,
remtau-split-weak
,
remtau_of_to-to_of_rmtau
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 13
Used lemmas:
remtau-one-02
,
finremtau-cons
,
finremtau-append
,
remtau-append
,
remtau-split-one
,
finremtau-def
,
Used spec theorems:
Used simplifier rules:
stream-basic
/
inj-rqui
stream
/
append-assoc
list
/
c
stream
/
eq-stream-to-list-2-1
list
/
a
stream
/
append-finfin
list
/
e
list
/
app-02
stream
/
fin-empty
stream
/
append-split-fin
list-last
/
l-02
list
/
len-06
list-last
/
lapp
option
/
disj-Some-None
option
/
sel-Some-dotget
list
/
Nil
list
/
c-04
list-last
/
last-one
list
/
app
stream
/
empty-append
stream
/
empty
list
/
c-05
list-last
/
last-def