[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 pmon-pia
⊦ pmon(frag*(IOAut(Π(lstart, rstart), Π(lstep, rstep, lren, rren, lext, rext), Π(lext, rext, lren, rren)))) (λ psl, pal. πra(lstep, rstep, lren, rren, psl, pal))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
pcont-pia
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 20
Proof steps: 40
Used lemmas:
projaction-rec-addboth
,
projaction-rec-addR
,
projaction-rec-skipL
,
projaction-base
,
Used spec theorems:
contfun-lim
/
montrl-relative-def
list-last
/
prefix
IOtrace
/
finfrag-rec
product
/
lrstep-def
Used simplifier rules:
nat-basic
/
a
list
/
a
list
/
len
list
/
Nil
IOtrace
/
finfrag-onlyone
list
/
app
list
/
c
list-data
/
lf-01
nat-basic
/
c
list-data
/
size-nil
list
/
e
list-data
/
elim-list-c
nat-basic
/
add-base
list
/
app-02
nat-basic
/
eq-01
nat-basic
/
succ
list
/
len-05
list
/
c-03
list-last
/
prefix-nil
nat-basic
/
z-01
nat
/
add-num-01
list-data
/
l
list
/
c-08
nat-basic
/
l
nat-basic
/
s-04
nat-basic
/
refl-Nat
list-last
/
prefix-rec-03