[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 374 from proof afs-cons-rename-dir-dentry (previous step)

dirs0[entries0[str0]] = mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅), dirs0[m] = mkdir(m1, md1, # links(m, dirs0), m4, entries0), afs-cons(dirs0, files), m ∈ dirs0, str0 ∈ entries0, entries0[str0] ∈ dirs0, ROOT_INO ∈ dirs0, ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ links(ino, dirs0) = ∅ → dirs0[ino].entries = ∅, ino ∈ dirs0 → dirs0[ino].nlink = # links(ino, dirs0) ∧ dirs0[ino].nlink ≤ 1 ∧ dirs0[ino].size = # dirs0[ino].entries ∧ dirs0[ino].nsubdirs = # subdirs(ino, dirs0), ino ∈ files → ¬ ino ∈ dirs0 ∧ files[ino].nlink = # links(ino, dirs0), ino ∈ dirs0 ∧ name ∈ dirs0[ino].entries → dirs0[ino].entries[name] ∈ dirs0 ∨ dirs0[ino].entries[name] ∈ files, ino ∈ files ∧ n ∈ files[ino].content → # files[ino].content[n] = VFS_PAGE_SIZE, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ entries0[str0] = ROOT_INO, ( ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ links (ino, dirs0[m, mkdir(m1, md2, # links(m, dirs0), m4, entries0)] [entries0[str0], (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ]) = ∅ → (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .entries = ∅) ∧ ( ino ∈ dirs0 → (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .nlink = # links (ino, dirs0[m, mkdir(m1, md2, # links(m, dirs0), m4, entries0)] [entries0[str0], (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ]) ∧ (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .nlink ≤ 1 ∧ (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .size = # (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .entries ∧ (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .nsubdirs = # subdirs (ino, dirs0[m, mkdir(m1, md2, # links(m, dirs0), m4, entries0)] [entries0[str0], (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ])) ∧ ( ino ∈ files → ¬ ino ∈ dirs0 ∧ files[ino].nlink = # links (ino, dirs0[m, mkdir(m1, md2, # links(m, dirs0), m4, entries0)] [entries0[str0], (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ])) ∧ ( ino ∈ dirs0 ∧ name ∈ (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .entries → (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .entries [name ] ∈ dirs0 ∨ (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .entries [name ] ∈ files)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 375:
dirs0[m] = mkdir(m1, md1, # links(m, dirs0), m4, entries0), dirs0[entries0[str0]] = mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅), files[ino] = mkfile(m0, md0, m2, content), afs-cons(dirs0, files), ROOT_INO ∈ dirs0, entries0[str0] ∈ dirs0, str0 ∈ entries0, m ∈ dirs0, ino ∈ files ∧ n ∈ content → # content[n] = VFS_PAGE_SIZE, ino ∈ dirs0 ∧ name ∈ dirs0[ino].entries → dirs0[ino].entries[name] ∈ dirs0 ∨ dirs0[ino].entries[name] ∈ files, ino ∈ files → ¬ ino ∈ dirs0 ∧ m2 = # links(ino, dirs0), ino ∈ dirs0 → dirs0[ino].nlink = # links(ino, dirs0) ∧ dirs0[ino].nlink ≤ 1 ∧ dirs0[ino].size = # dirs0[ino].entries ∧ dirs0[ino].nsubdirs = # subdirs(ino, dirs0), ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ links(ino, dirs0) = ∅ → dirs0[ino].entries = ∅, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ entries0[str0] = ROOT_INO, ( ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ links (ino, dirs0[m, mkdir(m1, md2, # links(m, dirs0), m4, entries0)] [entries0[str0], (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ]) = ∅ → (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .entries = ∅) ∧ ( ino ∈ dirs0 → (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .nlink = # links (ino, dirs0[m, mkdir(m1, md2, # links(m, dirs0), m4, entries0)] [entries0[str0], (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ]) ∧ (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .nlink ≤ 1 ∧ (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .size = # (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .entries ∧ (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .nsubdirs = # subdirs (ino, dirs0[m, mkdir(m1, md2, # links(m, dirs0), m4, entries0)] [entries0[str0], (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ])) ∧ ( ino ∈ files → ¬ ino ∈ dirs0 ∧ m2 = # links (ino, dirs0[m, mkdir(m1, md2, # links(m, dirs0), m4, entries0)] [entries0[str0], (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ])) ∧ ( ino ∈ dirs0 ∧ name ∈ (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .entries → (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .entries [name ] ∈ dirs0 ∨ (ino = entries0[str0] ⊃ (entries0[str0] = m ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md ;(ino = m ⊃ mkdir(m1, md2, # links(m, dirs0), m4, entries0);dirs0[ino]) ) .entries [name ] ∈ files)

Rule argument

spec: abstract-file name: elim seq: ⊦ ((m = af.size ∧ md = af.meta) ∧ m0 = af.nlink) ∧ content = af.content ↔ af = mkfile(m, md, m0, content) subst: [af, m, md, m0, content] → [files[ino], m0, md0, m2, content]

Additional information

Used simplifier rules: ⊦ ((m = af.size ∧ md = af.meta) ∧ m0 = af.nlink) ∧ content = af.content ↔ af = mkfile(m, md, m0, content); (elim) Used terms: files[ino], m0, md0, m2, content