[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-inf
⊦ finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
split-finite-remtau
,
Used by units in proved state:
can-refines-traceprop
,
beh
,
IOtrace
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 42
Used lemmas:
trace-fin
,
remtau-tofin-strong
,
remtau-nottau-2
,
remtau-fin
,
remtau-nontau-lem
,
remtau-from
,
Used spec theorems:
stream-basic
/actionstream/
ex
stream
/actionstream/
intrace-expand
Used simplifier rules:
nat
/
lez
nat-basic
/
f
stream
/actionstream/
from-inf
stream
/actionstream/
append-assoc
stream
/actionstream/
cons-append
stream
/actionstream/
get-from-inf
stream
/actionstream/
get-from-inf-zero
stream
/actionstream/
empty
stream
/actionstream/
append-empty-01
stream
/actionstream/
fin-empty
list
/actionstream/
e
list-data
/actionstream/
elim-list-c
list
/actionstream/
a
list
/actionstream/
e-01
list
/actionstream/
c
stream
/actionstream/
cons-eq
stream
/actionstream/
append-finfin
nat-basic
/
a
nat-basic
/
c
list
/actionstream/
len-05
nat-basic
/
succ
nat-basic
/
s-04
nat-basic
/
ref
nat
/
succ-01
nat
/
ls-01
nat-basic
/
one-01
nat
/
le-def
nat-basic
/
l-02
nat
/
fle
nat
/
lels
nat
/
ls-02
nat-basic
/
less-1
nat
/
elim-pred-c
nat-basic
/
oz
nat
/
fle-01
nat
/
elim-sub
nat-basic
/
l
nat
/
lep-02
nat
/
lep
stream-basic
/actionstream/
inj-01
stream-basic
/actionstream/
test-01
stream-basic
/actionstream/
stream-inf-forward
stream
/actionstream/
to-inf
stream
/actionstream/
sel-inf
nat-inf
/
less-inf2
stream
/actionstream/
size-inf
nat-inf
/
less-inf1