[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 emptystream-cancel
⊦ # σ ≠ ∞ → (σ + σ⊥ = σ⊥ ↔ σ = σ⊥ to (# σ).n)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 20
Used lemmas:
from-emptystream
,
split-prefix-append-to
,
emptystream
,
at-emptystream
,
Used spec theorems:
stream
/buffer-inf/
extensionality
stream
/buffer-inf/
get-append-ls
Used simplifier rules:
nat-inf
/
elim
nat-inf
/
disj
nat-inf
/
add-cancel-02
stream
/buffer-inf/
size-append
nat-basic
/
ref
nat
/
ler
stream
/buffer-inf/
size-empty-equiv
nat-inf
/
add-less-fin-01
nat-basic
/
f
stream
/buffer-inf/
get-infto
stream
/buffer-inf/
sel-fin
nat-inf
/
less-inf2
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
add-inf2
stream
/buffer-inf/
get-append-notls
stream
/buffer-inf/
sel-inf
nat-inf
/
less-fin
nat
/
lels
nat
/
ls-le-simp
nat-inf
/
less-inf1
stream
/buffer-inf/
size-to
stream
/buffer-inf/
append-assoc
stream
/buffer-inf/
append-cancel-r-02
stream
/buffer-inf/
notfin-sizeinf
stream
/buffer-inf/
to-inf
stream
/buffer-inf/
inf-size-to
nat-inf
/
inj
stream
/buffer-inf/
fin-empty
stream
/buffer-inf/
to-empty-inf
stream
/buffer-inf/
size-inf