[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 bitflip-cons-set-used (previous step)

wlar[n0] = wl-entry(m0, stat), n0 ∈ bflipset, ∀ n. n ∈ bflipset → n < # wlar ∧ wlar[n].status = used ⊦ # bflipset = 0, bflipset = ∅, n0 = m, n0 < # wlar ∧ stat = used

Heuristic pl case distinction applied rule case distinction

And obtained the following new goals

Proof step 11:
wlar[n0] = wl-entry(m0, stat), n0 ∈ bflipset, ∀ n. n ∈ bflipset → n < # wlar ∧ wlar[n].status = used ⊦ # bflipset = 0, bflipset = ∅, n0 = m, n0 < # wlar
Proof step 13:
wlar[n0] = wl-entry(m0, stat), n0 ∈ bflipset, ∀ n. n ∈ bflipset → n < # wlar ∧ wlar[n].status = used ⊦ # bflipset = 0, bflipset = ∅, n0 = m, stat = used

Rule argument

pos: right 4

Proof step 10 from proof bitflip-cons-set-used (previous step)

Heuristic pl case distinction applied rule case distinction

And obtained the following new goals

Rule argument

Additional information