[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 9 from proof BFS-returns-fail-implies-not-reachable (
previous step
)
INV(C, N, V, n, source), v ∈ C ⊦ ⟪ADD(succ(v); V, N)⟫ INV(C -- v, N, V, n, source)
Lemma
ADD-preserves-INV