[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 39 from proof BFS-returns-fail-implies-not-reachable (conclusion)

∀ n. ¬ reach(source, dest, n) ⊦ [BFS(source, dest; norfail)] norfail = fail

User applied rule call right

And obtained the following new goals

Proof step 1:
⊦
Proof step 38:
∀ n. ¬ reach(source, dest, n) ⊦ [let V = {source} , C = {source} , N = ∅, n = 0, done = false in { while C ≠ ∅ ∧ ¬ done do { choose v with v ∈ C in if v = dest then done := true else { C := C -- v ; ADD(succ(v); V, N) } ; if C = ∅ then C := N, N := ∅, n := n + 1 } ; norfail0 := (done ⊃ some(n); fail) }] norfail0 = fail

Rule argument

[fmapos-arg: pos: right 1]

Additional information

[[CONCRETESIMPRULES : ()]]