[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 25 from proof cyclic-put-nopathex (
previous step
)
⊦ ¬ path∃(str, r, r0, st) → ¬ validrefs(str, r ' + refs + r0 ', ty, st)
Lemma
validrefs-nopathex-01