[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 projaction-rec-skipL
⊦ # psl = # pal ∧ lstep(ls, la, ls0) ∧ ¬ cod(rren)(lren(la)) → πra(lstep, rstep, lren, rren, (ls, rs) ' + (ls0, rs) ' + psl, lren(la) ' + pal) = πra(lstep, rstep, lren, rren, (ls0, rs) ' + psl, pal)
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
finfrag-pi-step
,
inffrag-size-pis-pia
,
pia-mon
,
pmon-pia
,
proj-exec-fin
,
projaction-infrec-skipL
,
projaction-rec-skipL-one
,
Used by units in proved state:
product-refine
,
Proof exists?: No