[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 90 from proof truncate-same-iso (previous step)

files1[ino0] = mkfile(m2, md0, # links(ino0, dirs), content0), afs-cons(dirs, files1), ino0 ∈ files1 ⊦ ∀ ino. (ino ∈ files1 ↔ ino ∈ files1[ino0, mkfile(m2, md0, # links(ino0, dirs), content0 upto m2)]) ∧ ( ino ∈ files1 → files1[ino].size = files1[ino0, mkfile(m2, md0, # links(ino0, dirs), content0 upto m2)][ino].size ∧ files1[ino].meta = files1[ino0, mkfile(m2, md0, # links(ino0, dirs), content0 upto m2)][ino].meta ∧ files1[ino].nlink = files1[ino0, mkfile(m2, md0, # links(ino0, dirs), content0 upto m2)][ino].nlink ∧ files1[ino].content.stream to files1[ino].size = files1[ino0, mkfile(m2, md0, # links(ino0, dirs), content0 upto m2)][ino].content.stream to files1[ino0, mkfile(m2, md0, # links(ino0, dirs), content0 upto m2)][ino].size), m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 91:
files1[ino0] = mkfile(m2, md0, # links(ino0, dirs), content0), afs-cons(dirs, files1), ino0 ∈ files1, ino ∈ files1 ⊦ m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content0, files1[ino].size = (ino = ino0 ⊃ mkfile(m2, md0, # links(ino0, dirs), content0 upto m2);files1[ino]).size ∧ files1[ino].meta = (ino = ino0 ⊃ mkfile(m2, md0, # links(ino0, dirs), content0 upto m2);files1[ino]).meta ∧ files1[ino].nlink = (ino = ino0 ⊃ mkfile(m2, md0, # links(ino0, dirs), content0 upto m2);files1[ino]).nlink ∧ files1[ino].content.stream to files1[ino].size = (ino = ino0 ⊃ mkfile(m2, md0, # links(ino0, dirs), content0 upto m2);files1[ino]).content.stream to (ino = ino0 ⊃ mkfile(m2, md0, # links(ino0, dirs), content0 upto m2);files1[ino]).size

Rule argument

Additional information

Used simplifier rules: ⊦ files[ino, af][ino0] = (ino0 = ino ∧ ino ∈ files ⊃ af;files[ino0]); (s)% ⊦ ino ∈ files[ino0, af] ↔ ino ∈ files; (s)