[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 4 from proof inv-lookup (previous step)

afs-cons(dirs, files), p_ino ∈ dirs, links(p_ino, dirs) ≠ ∅ ∨ p_ino = ROOT_INO ⊦ ⟪ if dent.name ∈ dirs[p_ino].entries then {dent := mkdentry(dent.name, dirs[p_ino].entries[dent.name]); err := ESUCCESS} else {dent := negdentry(dent.name); err := ENOENT} or fail#(; ; err)⟫ true

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Proof step 5:
afs-cons(dirs, files), p_ino ∈ dirs, links(p_ino, dirs) ≠ ∅ ∨ p_ino = ROOT_INO ⊦ ⟪if dent.name ∈ dirs[p_ino].entries then {dent := mkdentry(dent.name, dirs[p_ino].entries[dent.name]); err := ESUCCESS} else {dent := negdentry(dent.name); err := ENOENT}⟫ true
Proof step 10:
afs-cons(dirs, files), p_ino ∈ dirs, links(p_ino, dirs) ≠ ∅ ∨ p_ino = ROOT_INO ⊦ ⟪fail#(; ; err)⟫ true

Proof step 4 from proof inv-lookup (previous step)

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Rule argument

Additional information