[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 64 from proof reach-n-path-n (previous step)

# x2 = n + 1, (H[r].nxt ' + x1).last = x2.last, # x1 = n + 1, path(H[r].nxt ' + x2, H), r ∈ H, reachable-1(H, H[r].nxt, r0), reachable-n(H, n, r0, x2.last), path(H[r].nxt ' + x1, H) ⊦ r = null, x2 = [], ∃ r0. reachable-1(H, r, r0) ∧ (∃ r1. reachable-1(H, r0, r1) ∧ reachable-n(H, n, r1, x2.last))

User applied rule exists right

And obtained the following new goals

Proof step 65:
# x2 = n + 1, (H[r].nxt ' + x1).last = x2.last, # x1 = n + 1, path(H[r].nxt ' + x2, H), r ∈ H, reachable-1(H, H[r].nxt, r0), reachable-n(H, n, r0, x2.last), path(H[r].nxt ' + x1, H) ⊦ r = null, x2 = [], reachable-1(H, r, H[r].nxt) ∧ (∃ r1. reachable-1(H, H[r].nxt, r1) ∧ reachable-n(H, n, r1, x2.last))

Rule argument

pos: right 3 terms: H[r].nxt abort: F discard: T computed: F

Additional information

Used terms: H[r].nxt