[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
,
Theorem prepost-wl-get-free-min
⊦ ⟪ubi_wl_get_free_min#(wlar; n; boolvar)⟫ ((boolvar → n = free-ecs(wlar).min) ∧ (¬ boolvar ↔ free-ecs(wlar) = ∅))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
prepost-get-peb
,
prepost-get-pebs-for-wl
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 27
Used lemmas:
get-free-min
,
Used spec theorems:
wlarray
/
free-ecs-rec
oset
/nat-set/
min-ins-01
wlarray
/
free-ecs
Used simplifier rules:
nat
/
lez
wlarray
/
free-ecs-base
oelem
/nat-set/
irreflexivity
nat-basic
/
s-04
nat
/
prop-07
nat
/
ls-01
nat
/
ls-le-simp
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
wlentry
/
elim-02
nat-basic
/
lf-01
nat-basic
/
f
oset
/nat-set/
min-insert
oset
/nat-set/
min-one
wlentry
/
sel-05
wlentry
/
sel-04
set-basic
/nat-set/
ne
set-basic
/nat-set/
size-zero
set-basic
/nat-set/
size-zero-01
nat
/
le-ls-simp
oset
/nat-set/
min-inn
nat
/
lels-03
nat
/
ler
nat
/
anti
nat
/
lels