[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 16 from proof BFS-returns-fail-implies-not-reachable (previous step)

〈ADD(succ(v); S1, S)〉 (S1 = s ∧ S = s0), ⟪ADD(succ(v); S1, S)⟫ INV(S0 -- v, S, S1, n0, source), S2 = S0 -- v, S0 ≠ ∅, # S0 ≠ 0, v ≠ dest, INV(S0, S, S1, n0, source), v ∈ S0, INV(S0 -- v, s0, s, n0, source), ∀ n. ¬ reach(source, dest, n) ⊦ [if S0 = ∅ ++ v then S2 := s0, s0 := ∅, n0 := n0 + 1] ((∀ n. ¬ reach(source, dest, n)) ∧ INV(S2, s0, s, n0, source))

User applied rule if right

And obtained the following new goals

Proof step 12:
〈ADD(succ(v); S1, S)〉 (S1 = s ∧ S = s0), ⟪ADD(succ(v); S1, S)⟫ INV(S0 -- v, S, S1, n0, source), S2 = S0 -- v, S0 ≠ ∅, # S0 ≠ 0, v ≠ dest, INV(S0, S, S1, n0, source), v ∈ S0, INV(S0 -- v, s0, s, n0, source), ∀ n. ¬ reach(source, dest, n), S0 = ∅ ++ v ⊦ [S2 := s0, s0 := ∅, n0 := n0 + 1] ((∀ n. ¬ reach(source, dest, n)) ∧ INV(S2, s0, s, n0, source))
Proof step 15:
〈ADD(succ(v); S1, S)〉 (S1 = s ∧ S = s0), ⟪ADD(succ(v); S1, S)⟫ INV(S0 -- v, S, S1, n0, source), S2 = S0 -- v, S0 ≠ ∅, # S0 ≠ 0, v ≠ dest, INV(S0, S, S1, n0, source), v ∈ S0, INV(S0 -- v, s0, s, n0, source), ∀ n. ¬ reach(source, dest, n), S0 ≠ ∅ ++ v ⊦ [skip] ((∀ n. ¬ reach(source, dest, n)) ∧ INV(S2, s0, s, n0, source))

Rule argument

[fmapos-arg: pos: right 1]

Additional information

[[CONCRETESIMPRULES : ()]]