[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 151 from proof inv-format (
previous step
)
# pebs = n0 + m1, # pebs0 = n0 + m1, err = err0, err = ESUCCESS, m = m1, m1 < # pebs, mtd-cons(pebs), mtd-cons(pebs0), ubi-io-initial(subarray(pebs, 0, m1)), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ n0 = 0, m1 < # pebs
Heuristic simplifier applied rule simplifier
And closed the goal!
Rule argument
Additional information