[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 17 from proof refine-truncate (previous step)

as = ri[datakeys(key, n, ri)], gstore0 = gstore4, remove-refsize0(gstore3) = gstore3, elems nx ∩ jro0 = ∅, dom gstore3 ∪ elems nx = dom gstore4 ∪ jro0, jmaxino ≠ 0, pmaxino ≠ 0, p_os.keys.inodes?, jro1.keys.inodes?, ri.inos < jmaxino, jro1 < jmaxino, p_os < pmaxino, fi1.inos < pmaxino, inv(gstore3), inv(gstore4 \ jro0), log-cons(abs-log(nx, gstore4 ↓), nodes(gstore4 ↓, jro0)), refsize-cons(gstore4, range ri), refsize-cons(gstore3, range fi1), ri-inj(ri), ri-inj(fi1), pmaxino ≤ jmaxino, ri.lebs ⊆ dom gstore4, fi1.lebs ⊆ dom gstore3, ¬ dups(nx), jvalid3 → jvalid2, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore4, jro0) ⊦ [gjournal_remove_addresses#(jvalid1, ri \ datakeys(key, n, ri), fi1, jro0, gstore3, nx, pmaxino, p_os, jvalid2; as, gstore4)] ( (jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore4, jro0)) ∧ (ri \ datakeys(key, n, ri)).lebs ⊆ dom gstore4 ∧ refsize-cons(gstore4, range(ri \ datakeys(key, n, ri))) ∧ inv(gstore4 \ jro0) ∧ dom gstore3 ∪ elems nx = dom gstore4 ∪ jro0 ∧ ri-inj(ri \ datakeys(key, n, ri)) ∧ gstore4 =○refsize gstore0 → ⟨ri0 := ri; aubifs_core_index_truncate#(key, n, fi1, jro1.keys, p_os.keys, nodes(gstore0 ↓, jro0), abs-log(nx, gstore0 ↓), jvalid3; ri)⟩ (ri0 \ datakeys(key, n, ri0) = ri ∧ (jvalid3 → jvalid2)))

User applied rule skip call

And obtained the following new goals

Rule argument

pos: right 1

Additional information