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

remove-refsize0(gstore0) = gstore0, elems nx ∩ jro0 = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ jro0, jro.keys.inodes?, p_os.keys.inodes?, jro < jmaxino, ri.inos < jmaxino, fi1.inos < pmaxino, inv(gstore \ jro0), inv(gstore0), log-cons(abs-log(nx, gstore ↓), nodes(gstore ↓, jro0)), refsize-cons(gstore, range ri), refsize-cons(gstore0, range fi1), ri-inj(ri), ri-inj(fi1), jmaxino ∈ p_os, pmaxino ≤ jmaxino, ri.lebs ⊆ dom gstore, fi1.lebs ⊆ dom gstore0, jvalid → jvalid0, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro0), ∀ n0. n0 ∈ p_os → n0 < pmaxino ⊦ # p_os = 0, jmaxino = 0, p_os = ∅, pmaxino = 0, dups(nx)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 22 terms: jmaxino

Additional information

Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s) Used terms: jmaxino