[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-inf
⊦ finp(ext !(⌜af⌝ )) ↔ (∃ n. ∀ m. n ≤ m → ext(af(m)) = None)
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: 18
Proof steps: 41
Used lemmas:
finremtau-def
,
remtau-split-one
,
remtau-empty-equiv
,
Used spec theorems:
stream
/
extensionality
stream
/
add-list-fun-def
stream
/
intrace-expand
Used simplifier rules:
stream-basic
/
elim-finp-ant
stream
/
empty
stream
/
sel-inf
nat-inf
/
less-inf2
stream
/
size-inf
nat
/
lez
list
/
a
stream
/
append-finfin
list
/
c
stream
/
append-assoc
stream
/
appinf-sel
stream-basic
/
elim-finp-suc
stream
/
append-fin-is-inf
stream
/
fin-empty
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-inf
/
less-fin
stream
/
sel-fin
stream
/
size-fin
list
/
len-02
list-del
/
one-03
nat-basic
/
one-01
nat-basic
/
l-05
nat-basic
/
succ
list-data
/
l
nat-basic
/
trans-Nat
nat-basic
/
lf
nat
/
le-def
nat
/
elim-sub
nat-basic
/
l
nat
/
lep
nat-basic
/
less-zero
nat
/
elim-pred-c
nat
/
lels
nat-basic
/
s-04
nat-basic
/
oz
stream
/
cons-append
nat-basic
/
ls-02
nat
/
fle-01
nat
/
fle
option
/
disj-Some-None
stream
/
infappone-zero
nat
/
zero
nat-basic
/
refl-Nat
nat
/
ls-02
nat
/
ls-le-simp
nat
/
lels-03
nat
/
ls-01
nat-basic
/
l-02
nat
/
ls-03
nat
/
eq-01
nat
/
add-01
nat-basic
/
add-base