[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-nottau-3
n < # al ⊦ α ^ = ⌜al⌝ → (al[n] = τ ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
can-refines-traceprop
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 5
Used lemmas:
remtau-nottau-1
,
Used spec theorems:
stream
/actionstream/
extensionality
Used simplifier rules:
list-data
/actionstream/
l
nat-basic
/
f
nat-inf
/
less-fin
stream
/actionstream/
sel-fin
stream
/actionstream/
size-fin
nat
/
lels
nat
/
ls-le-simp