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

# kx = # ax, as ∩ range ri0[kx, ax] = ∅, ax.toSet ∩ log0.toSet = ∅, as ∩ log0.toSet = ∅, as ∩ ax.toSet = ∅, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), log-cons(ax, fs0[ax, fs0[ri0[kx]]] \ as), log-cons(log0, fs0[ax, fs0[ri0[kx]]] \ as), new(ax, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-cons(ri0, fs0), ri-cons(ri0[kx, ax], fs0[ax, fs0[ri0[kx]]] \ as), ri-inj(fi), ri-inj(ri0), ri-inj(ri0[kx, ax]), ubifs-cons(fs0, ri0, ro, fi, fo, log0), kx.toSet ⊆ dom ri0 ⊦ dups(kx), dups(ax), ¬ inodekey(0) ∈ ri0[kx, ax] ∧ ¬ dups(log0 + ax) ∧ ri-closed(ri0[kx, ax], fs0[ax, fs0[ri0[kx]]] \ as, ro) ∧ ro ⊆ dom ri0 ∪ kx.toSet ∧ replay-cons-strong(fs0[ax, fs0[ri0[kx]]] \ as, ri0[kx, ax], ro, fi, fo, log0 + ax) ∧ file-node-cons(fs0[ax, fs0[ri0[kx]]] \ as, ri0[kx, ax]) ∧ orphans-cons(fs0[ax, fs0[ri0[kx]]] \ as, ri0[kx, ax], ro)

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 25:
⊦ ubifs-cons(fs, ri, ro, fi, fo, log) ↔ ¬ inodekey(0) ∈ ri ∧ ri-cons(ri, fs) ∧ log-cons(log, fs) ∧ ¬ dups(log) ∧ ri-closed(ri, fs, ro) ∧ ro.inodes? ∧ fo.inodes? ∧ ro ⊆ dom ri ∧ fo ⊆ dom fi
Proof step 26:
# kx = # ax, as ∩ ax.toSet = ∅, as ∩ log0.toSet = ∅, ax.toSet ∩ log0.toSet = ∅, as ∩ range ri0[kx, ax] = ∅, ro.inodes?, fo.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0[ax, fs0[ri0[kx]]] \ as), log-cons(ax, fs0[ax, fs0[ri0[kx]]] \ as), log-cons(log0, fs0), new(ax, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-closed(ri0, fs0, ro), ri-cons(ri0[kx, ax], fs0[ax, fs0[ri0[kx]]] \ as), ri-cons(ri0, fs0), ri-inj(ri0[kx, ax]), ri-inj(ri0), ri-inj(fi), kx.toSet ⊆ dom ri0, ro ⊆ dom ri0, fo ⊆ dom fi ⊦ dups(ax), dups(kx), dups(log0), inodekey(0) ∈ ri0, ¬ inodekey(0) ∈ ri0[kx, ax] ∧ ¬ dups(log0 + ax) ∧ ri-closed(ri0[kx, ax], fs0[ax, fs0[ri0[kx]]] \ as, ro) ∧ ro ⊆ dom ri0 ∪ kx.toSet ∧ replay-cons-strong(fs0[ax, fs0[ri0[kx]]] \ as, ri0[kx, ax], ro, fi, fo, log0 + ax) ∧ file-node-cons(fs0[ax, fs0[ri0[kx]]] \ as, ri0[kx, ax]) ∧ orphans-cons(fs0[ax, fs0[ri0[kx]]] \ as, ri0[kx, ax], ro)

Rule argument

spec: aubifs-inv name: ubifs-cons seq: ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) ↔ ¬ inodekey(0) ∈ ri ∧ ri-cons(ri, fs) ∧ log-cons(log, fs) ∧ ¬ dups(log) ∧ ri-closed(ri, fs, ro) ∧ ro.inodes? ∧ fo.inodes? ∧ ro ⊆ dom ri ∧ fo ⊆ dom fi subst: [log, fo, fi, ro, ri, fs] → [log0, fo, fi, ro, ri0, fs0] flags: <all paths>

Additional information

Used terms: log0, fo, fi, ro, ri0, fs0