[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 10 from proof lpt-leb-size-write (previous step)

n < # lpt, ∀ n. n < # lpt → lpt[n].size ≤ LEB_SIZE ⊦ (∀ n0. n0 < # lpt → lpt[n, mklp(m, m0, lpf, m1)][n0].size ≤ LEB_SIZE) ↔ m0 ≤ LEB_SIZE

Heuristic cut applied rule cut formula

And obtained the following new goals

Proof step 11:
n < # lpt, m0 ≤ LEB_SIZE, ∀ n. n < # lpt → lpt[n].size ≤ LEB_SIZE ⊦ (∀ n0. n0 < # lpt → lpt[n, mklp(m, m0, lpf, m1)][n0].size ≤ LEB_SIZE) ↔ m0 ≤ LEB_SIZE
Proof step 18:
n < # lpt, ∀ n. n < # lpt → lpt[n].size ≤ LEB_SIZE ⊦ (∀ n0. n0 < # lpt → lpt[n, mklp(m, m0, lpf, m1)][n0].size ≤ LEB_SIZE) ↔ m0 ≤ LEB_SIZE, m0 ≤ LEB_SIZE

Rule argument

fma: m0 ≤ LEB_SIZE

Additional information

Used formulas: m0 ≤ LEB_SIZE