[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
,
Proof step 1 from proof lrf-intro (
previous step
)
⊦ lrf(view, trans, eqstate) ↔ (∀ s, s0. ∀ ev. view(ev) = C → (reachable(trans, s) ∧ trans(s, ev, s0) → eqstate(s0, s)))
Lemma
lrf-def