[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 crash-neutral-erase (previous step)

pebs[m] = mkpeb(buf, m0, false), m < # pebs, mtd-cons(pebs) ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; pebs0 := pebs; if err = ESUCCESS then pebs[m] := mkpeb(emptypeb, 0, pebs[m].bad)⟩ (pebs0 = pebs)

User applied rule exists right

And obtained the following new goals

Proof step 12:
pebs[m] = mkpeb(buf, m0, false), m < # pebs, mtd-cons(pebs) ⊦ (⌊EIO⌋ ∨ EIO = ESUCCESS) ∧ ⟨err := EIO; pebs0 := pebs; if err = ESUCCESS then pebs[m] := mkpeb(emptypeb, 0, pebs[m].bad)⟩ (pebs0 = pebs)

Rule argument

pos: right 1 terms: EIO abort: F discard: T computed: T

Additional information

Used terms: EIO