[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 108 from proof inv-format (previous step)

# apebs0 = n0 + vtblpnum0, # wlar = n0 + vtblpnum0, apebs0[vtblpnum2] = mkpeb(aehdr0, avhdr, buf, m, false), apebs0[vtblpnum0] = mkpeb(aechdr(m1), avhdr1, buf1, m2, false), vtblpnum2 < n0 + vtblpnum0, ∀ n. n < n0 + vtblpnum0 → ubi-io-peb-initial(apebs0[n]), ∀ n3. n3 < vtblpnum0 → (apebs0[n3].bad → wlar[n3] = wl-entry(0, erroneous)) ∧ (¬ apebs0[n3].bad → apebs0[n3].echdr.valid? ∧ wlar[n3] = wl-entry(apebs0[n3].echdr.ec, free) ∧ apebs0[n3].vidhdr = empty) ⊦ avhdr1 = empty, n0 = 0, vtblpnum2 = n0 + vtblpnum0

User applied rule all left

And obtained the following new goals

Proof step 109:
# wlar = n0 + vtblpnum0, # apebs0 = n0 + vtblpnum0, apebs0[vtblpnum0] = mkpeb(aechdr(m1), avhdr1, buf1, m2, false), apebs0[vtblpnum2] = mkpeb(aehdr0, avhdr, buf, m, false), vtblpnum2 < n0 + vtblpnum0, vtblpnum0 < n0 + vtblpnum0 → ubi-io-peb-initial(apebs0[vtblpnum0]), ∀ n3. n3 < vtblpnum0 → (apebs0[n3].bad → wlar[n3] = wl-entry(0, erroneous)) ∧ (¬ apebs0[n3].bad → apebs0[n3].echdr.valid? ∧ wlar[n3] = wl-entry(apebs0[n3].echdr.ec, free) ∧ apebs0[n3].vidhdr = empty) ⊦ avhdr1 = empty, n0 = 0, vtblpnum2 = n0 + vtblpnum0

Rule argument

pos: left 6 terms: vtblpnum0 abort: F discard: T computed: F

Additional information

Used terms: vtblpnum0