[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 pis-inf-simp
⊦ πrs(lstep, rstep, lren, rren, ⌜ps '⌝ + ⌜psf⌝ , ⌜paf⌝ ) = lim(⌜λ n. ⌜πrs(lstep, rstep, lren, rren, ps ' + psf.take(n), paf.take(n))⌝ ⌝ )
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
projstate-infrec-addR
,
projstate-infrec-addboth
,
projstate-infrec-skipL
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 8
Used lemmas:
projstate-inf-def
,
Used spec theorems:
stream
/
one-inf
stream
/
to-succ-nf
Used simplifier rules:
nat
/
pred-03
stream-basic
/
inj-rqui
stream-basic
/
inj-rqui0
nat-basic
/
oz
nat
/
add-01
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c
list
/
c
list
/
len-01
list
/
a