[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 138 from proof replayone-prog (previous step)

boolvar ↔ boolvar0, fs[adr] = truncnode(inodekey(ino), m), key = inodekey(ino), n = m, ri0 = ri, adr ∈ fs ⊦ ⟪let ks = datakeys(key, n, ri) in ri := ri \ ks⟫ (ri = replay-one(adr, fs[adr], ri0)), adr ∈ ri

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Proof step 139:
boolvar ↔ boolvar0, fs[adr] = truncnode(inodekey(ino), m), key = inodekey(ino), ks = datakeys(key, n, ri), n = m, ri0 = ri, adr ∈ fs ⊦ ⟪ri := ri \ ks⟫ (ri = replay-one(adr, fs[adr], ri0)), adr ∈ ri

Proof step 138 from proof replayone-prog (previous step)

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Rule argument

Additional information