[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-tofin-strong
¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
remtau-inf
,
split-finite-remtau
,
Used by units in proved state:
can-refines-traceprop
,
IO-equiv-IO+
,
IOtrace
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 13
Used lemmas:
listsize-notinf
,
remtau-append
,
remtau-empty-equiv
,
remtau-empty
,
Used spec theorems:
Used simplifier rules:
nat
/
lez
nat-inf
/
not-less-zero
stream
/actionstream/
to-zero
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
succ
nat-inf
/
add-comm
nat-inf
/
add-assoc
stream
/actionstream/
size-succ
nat-inf
/
add-fin
stream
/actionstream/
size-empty
nat-inf
/
less-fin
nat-basic
/
less-1
stream
/actionstream/
elim-hd-tl
stream
/actionstream/
cons-append
nat-inf
/
less-succ-leq
stream
/actionstream/
append-assoc
list
/actionstream/
len-02
stream
/actionstream/
size-fin
stream
/actionstream/
size-append
stream
/actionstream/
cons-empty
stream
/actionstream/
append-cut1
stream
/actionstream/
to-succ-cons
nat-basic
/
s-04
nat
/
le-ls-simp
stream
/actionstream/
get-cons-succ