[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-fromempty-to
¬ # α < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # α → ext(α[m]) = None ⊦ ext !(α) = ⌜ext !(α.take(n))⌝
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: 4
Proof steps: 8
Used lemmas:
remtau-empty-equiv
,
remtau-append
,
Used spec theorems:
stream
/
get-append-notls
Used simplifier rules:
stream
/
elim-fromto
stream
/
append-assoc
stream
/
size-fin
stream
/
size-append
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
add-not-less
nat-inf
/
disj-rqui-infty
stream
/
appendend-equal
nat-inf
/
add-ls-cancel-01
nat-basic
/
c
nat-basic
/
a
nat-inf
/
add-fin
nat
/
lep
nat-inf
/
sel-rqui-dotn
nat
/
eq-01
stream
/
get-append-ls
stream
/
sel-fin
nat-inf
/
ls-natinf-to-nat-2-1
nat-basic
/
l-02