[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 11 from proof refine-orphans-contains (previous step)

jvalid ↔ jvalid3, jvalid0 ↔ jvalid4, fi = fi1, fo = p_os.keys, fs = nodes(gstore ↓, jro0), key = inodekey(m), log = abs-log(nx, gstore ↓), remove-refsize0(gstore0) = gstore0, ro = jro.keys, elems nx ∩ jro0 = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ jro0, jro.keys.inodes?, p_os.keys.inodes?, jro < jmaxino, p_os < pmaxino, 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), pmaxino ≤ jmaxino, ri.lebs ⊆ dom gstore, fi1.lebs ⊆ dom gstore0, jvalid4 → jvalid2, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro0) ⊦ ⟨jvalid := key ∈ ro⟩ ((jvalid4 → jvalid2) ∧ (m ∈ jro ↔ jvalid)), jmaxino = 0, pmaxino = 0, dups(nx)

Heuristic symbolic execution applied rule assign right

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ inodekey(n) ∈ ns.keys ↔ n ∈ ns; (s)