[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-empty-equiv
⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
ex-first-nontau
,
remtau-tofin-strong
,
Used by units in proved state:
equiv-F-nF-bF
,
restricted-refine-implies-backward
,
IOtrace
,
IOrefine-def
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 13
Used lemmas:
remtau-tofin
,
one-eq-empty
,
remtau-append
,
remtau-empty
,
remtau-nontau-lem
,
Used spec theorems:
stream
/actionstream/
intrace-expand
Used simplifier rules:
stream
/actionstream/
zero-len
list-del
/actionstream/
get-zero
stream
/actionstream/
fin-empty
stream
/actionstream/
sel-fin
list
/actionstream/
c
stream
/actionstream/
append-finfin
list
/actionstream/
a
stream
/actionstream/
append-empty-01
list
/actionstream/
e
stream
/actionstream/
append-assoc
list-data
/actionstream/
elim-1
stream
/actionstream/
fun-nonempty
stream
/actionstream/
sel-inf
stream
/actionstream/
cons-append
nat-basic
/
c
nat-basic
/
a
nat-inf
/
add-fin
nat-basic
/
succ
stream
/actionstream/
get-cons-succ
stream
/actionstream/
cons-empty
stream
/actionstream/
size-append
stream
/actionstream/
size-fin
list
/actionstream/
len-02
nat-inf
/
add-ls-cancel-num-04
nat-inf
/
add-all-zero
nat-inf
/
add-assoc
nat-inf
/
add-comm
stream
/actionstream/
size-empty
nat-inf
/
less-notgeqinf
stream
/actionstream/
elim-hd-tl