[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_BSRA-def

⊦ BSP_BSRA ↔ (∀ tr, tr0, ev, ev0. view(ev) = C ∧ view(ev0) = C ∧ eqrel(ev, ev0) ∧ (tr0 + (ev + tr)) ∈TR → (∃ tr1. (tr0 + (ev0 + tr1)) ∈TR ∧ proj(tr, VCview(view)) = proj(tr1, VCview(view))))

Type: An axiom
Validity: The proof is valid.
Features:
Comment: backward strict replace with all (with future ajustments) one C event.
Used by: unwind-BSRA-theorem,
Used by units in proved state:
Proof exists?: No