[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 16 from proof synced-add-log-leb (previous step)

⟨fail_or_success#(; ; err)⟩ (err = ESUCCESS), # lpt = # avol, nx + m3 ' = nx1, avol[m3] = mapped(buf), m3 < # avol, awbuf-inv(avol, bleb), synced(avol), avol0 ↓ avol ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then nx := nx + m3 ', bleb := buffered(m3)⟩ (nx1 = nx)

Heuristic unfold applied rule call left

And obtained the following new goals

Proof step 17:
⟨choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0⟩ (err = ESUCCESS), # lpt = # avol, nx + m3 ' = nx1, avol[m3] = mapped(buf), m3 < # avol, awbuf-inv(avol, bleb), synced(avol), avol0 ↓ avol ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then nx := nx + m3 ', bleb := buffered(m3)⟩ (nx1 = nx)

Rule argument

pos: left 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};