[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 13 from proof inv-sync-erase (previous step)

apebs[n] = mkpeb(aehdr, avhdr, buf, m, false), n < # apebs, ubi-io-inv(apebs), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪choose apeb with ubi-io-peb-inv(apeb) ∧ ¬ apeb.bad ∧ ¬ apeb.vidhdr.valid? in apebs[n] := apeb or skip⟫ ubi-io-inv(apebs), err0 = ESUCCESS

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Proof step 14:
apebs[n] = mkpeb(aehdr, avhdr, buf, m, false), n < # apebs, ubi-io-inv(apebs), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪choose apeb with ubi-io-peb-inv(apeb) ∧ ¬ apeb.bad ∧ ¬ apeb.vidhdr.valid? in apebs[n] := apeb⟫ ubi-io-inv(apebs), err0 = ESUCCESS
Proof step 21:
apebs[n] = mkpeb(aehdr, avhdr, buf, m, false), n < # apebs, ubi-io-inv(apebs), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪skip⟫ ubi-io-inv(apebs), err0 = ESUCCESS

Proof step 13 from proof inv-sync-erase (previous step)

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Rule argument

Additional information