[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
∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = []
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
remtau-empty-equiv
,
remtau-split
,
split-finite-remtau
,
Used by units in proved state:
IOtrace
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 15
Used lemmas:
remtau-inftau
,
remtau-onetau
,
remtau-fin-append
,
remtau-empty
,
Used spec theorems:
Used simplifier rules:
stream
/actionstream/
empty
stream
/actionstream/
append-assoc
stream
/actionstream/
empty-append
stream
/actionstream/
sel-fin
nat-inf
/
less-fin
stream
/actionstream/
size-fin
stream
/actionstream/
get-cons-zero
list
/actionstream/
a
stream
/actionstream/
append-finfin
list
/actionstream/
c
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
add-cancel-num-02
nat-inf
/
zerols-neqzero
list
/actionstream/
len-02
stream
/actionstream/
size-append
stream
/actionstream/
get-append2-fin
nat-inf
/
less-succ-leq
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat-basic
/
succ
list
/actionstream/
len-05
list-data
/actionstream/
l
nat-basic
/
f
nat-basic
/
ref
list-del
/actionstream/
get-succ
stream
/actionstream/
sel-inf
nat-inf
/
less-inf2
stream
/actionstream/
size-inf