[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-cons
⊦ ⌜af⌝ ^ = ⌜a '⌝ + α → (∃ n, af0. ⌜af⌝ = ⌜mklist(τ, n)⌝ + (a + ⌜af0⌝ ) ∧ ⌜af0⌝ ^ = α)
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: 8
Proof steps: 26
Used lemmas:
remtau-nontau-lem
,
remtau-from-strong
,
ex-first-nontau
,
Used spec theorems:
stream
/actionstream/
intrace-expand
stream
/actionstream/
from-nf
stream
/actionstream/
one-inf
stream
/actionstream/
extensionality
stream
/actionstream/
get-append-ls
Used simplifier rules:
stream
/actionstream/
append-assoc
stream
/actionstream/
cons-append
stream
/actionstream/
append-empty-01
stream
/actionstream/
fin-empty
list
/actionstream/
e
stream
/actionstream/
sel-inf
nat-inf
/
less-inf2
stream
/actionstream/
size-inf
nat-basic
/
f
nat-inf
/
less-inf1
stream
/actionstream/
from-inf
stream
/actionstream/
cons-eq
stream
/actionstream/
get-from-inf
stream
/actionstream/
get-from-inf-zero
nat-basic
/
c
nat-basic
/
a
nat
/
pred-03
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
add-inf2
list-last
/actionstream/
mk-len
stream
/actionstream/
size-fin
stream
/actionstream/
size-append
nat
/
zero-02
nat
/
lels
nat-inf
/
less-fin
nat-inf
/
sel
stream
/actionstream/
get-append-notls
nat
/
lels-02
nat
/
lels-03
nat
/
elim-sub
nat-basic
/
l-01
nat-basic
/
eq-02
nat
/
elim-pred-c
list-del
/actionstream/
get-mklist-01
stream
/actionstream/
sel-fin