[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 pia-mon
⊦ fragω(Π(IOAut(lstart, lstep, lext), IOAut(rstart, rstep, rext), lren, rren))(psf, paf) → ⌜πra(lstep, rstep, lren, rren, psf.take(n + 1), paf.take(n))⌝ ⊑ ⌜πra(lstep, rstep, lren, rren, psf.take(2 + n), paf.take(n + 1))⌝
Type: A user defined theorem
Validity: The proof is valid.
Features: lss,
Comment:
Used by:
mon-pia
,
projaction-infrec-addR
,
projaction-infrec-addboth
,
projaction-infrec-skipL
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 26
Proof steps: 47
Used lemmas:
projaction-rec-addboth
,
projaction-rec-addR
,
projaction-rec-skipL
,
projaction-base
,
Used spec theorems:
product
/
product-def
IOtrace
/
frag
stream
/
to-succ2-nf
stream
/
to-succ3-nf
IOtrace
/
frag-step-zero
stream
/
to-succ-nf
product
/
lrstep-def
Used simplifier rules:
stream
/
to-inf-one
nat-basic
/
c
nat-basic
/
a
stream
/
to-zero-nf
stream
/
empty
stream
/
leq-empty
nat-basic
/
succ
stream
/
sel-inf
nat-inf
/
less-inf2
stream
/
size-inf
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
add-inf2
list
/
c
list
/
a
stream
/
fun-nonempty
stream
/
size-inf-to
nat-basic
/
eq-01
stream
/
append-finfin
stream
/
leq-append-both
stream
/
append-assoc