[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-one-fin
⊦ ⌜ext !(al)⌝ = ⌜e '⌝ + β ↔ (∃ al0, a, al1, el. al = al0 + a ' + al1 ∧ ext(a) = Some(e) ∧ ⌜ext !(al0)⌝ = [] ∧ ext !(al1) = el ∧ β = ⌜el⌝ )
Type: A user defined theorem
Validity: The proof is valid.
Features:
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: 6
Used lemmas:
finremtau-cons
,
finremtau-append
,
finremtau-def
,
remtau-split-one
,
Used spec theorems:
Used simplifier rules:
stream
/
neq-fin-inf-01
stream
/
append-assoc
stream
/
fin-empty
stream-basic
/
disj-rqui-rqui0
stream-basic
/
inj-rqui
stream
/
eq-stream-to-list-2-1
list
/
len-06
stream
/
append-finfin
option
/
disj-Some-None
option
/
sel-Some-dotget
list
/
Nil
list
/
a
list
/
c-04
list
/
in-17
list
/
in-empty
list
/
in-rec
list
/
len-01
list
/
in-14
stream
/
appfin-sel
list
/
in-append
stream-basic
/
sel-rqui-dotl
stream-basic
/
elim-finp-ant
stream-basic
/
test-finp-rqui
stream
/
append-two-is-fin