[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 17 from proof prepost-get-pebs-for-wl (
previous step
)
∃ m. m < # wlar ∧ wlar[m].ec < n ∧ wlar[m].status = free ⊦ ⟪ubi_wl_find_free_max_below#(n, wlar; m)⟫ (m < # wlar ∧ wlar[m].status = free ∧ wlar[m].ec = below(free-ecs(wlar), n).max)
Lemma
prepost-wl-free-max-below