[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 lim-unique
mon(σσ), σσ ≠ [], ∀ n. ⌜n⌝ < # σσ → σσ[n] ⊑ σ, ∀ n. ⌜n⌝ < # σσ → σσ[n] ⊑ σ0, ∀ m. ¬ # σ < ⌜m⌝ → (∃ n. ⌜n⌝ < # σσ ∧ σ to m ⊑ σσ[n]), ∀ m. ¬ # σ0 < ⌜m⌝ → (∃ n. ⌜n⌝ < # σσ ∧ σ0 to m ⊑ σσ[n]) ⊦ σ = σ0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 36
Proof steps: 66
Used lemmas:
mon-def
,
mon-lem
,
prefix-def
,
Used spec theorems:
stream
/
extensionality-to
stream
/
append-to-ls
nat-inf
/
notinf-fin
stream
/
size-append
Used simplifier rules:
nat-basic
/
f
nat
/
le-def
nat-basic
/
ls-02
stream
/
append-assoc
stream
/
size-append
stream
/
size-to
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
add-cancel-01
nat-inf
/
add-not-less
nat-inf
/
less-fin
nat-basic
/
refl-nat
nat
/
ler
nat
/
lels
stream
/
to-to-eq
nat-inf
/
less-inf1
nat-inf
/
add-fin
nat-basic
/
a
nat-basic
/
c
nat-inf
/
add-cancel-03
nat-inf
/
sum-zero
nat-inf
/
inj-rqui
stream
/
size-succ
nat-inf
/
disj-rqui-infty
nat-inf
/
less-inf2
nat-basic
/
neq-01
stream
/
finlen-tolen
nat-inf
/
add-inf1
nat-inf
/
add-all-inf
nat-inf
/
eq-natinf-to-nat-3-1
nat-basic
/
eq-02
nat-basic
/
l-02