[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 BSP_BSD-def
⊦ BSP_BSD(view, trans) ↔ (∀ tr, tr0, ev. view(ev) = C ∧ tr0 + (ev + tr) ∈TR trans ∧ proj(tr, Cview(view)) = [] → (∃ tr1. tr0 + tr1 ∈TR trans ∧ proj(tr1, Vview(view)) = proj(tr, Vview(view)) ∧ proj(tr1, Cview(view)) = []))
Type: An axiom
Validity: The proof is valid.
Features:
Comment: backward strict delete (with future, but not past adjustments) last C event.
Used by:
BSD-implies-D
,
SD-equiv-BSD-N2V
,
SD-implies-BSD
,
Used by units in proved state:
unwinding
,
Proof exists?: No