[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 in-used-h
m0 ≤ # wlar ⊦ n ∈ used-ecs(wlar, m0) ↔ (∃ m. m < m0 ∧ wlar[m].status = used ∧ wlar[m].ec = n)
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
in-used
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 28
Used lemmas:
used-ecs-rec
,
used-ecs-base
,
Used spec theorems:
Used simplifier rules:
set-basic
/nat-set/
In-empty
nat-basic
/
zero-01
nat
/
succ-01
nat-basic
/
s-04
wlentry
/
elim-02
nat
/
lels-03
set-basic
/nat-set/
size-zero
set-basic
/nat-set/
In-insert
set-basic
/nat-set/
ne
nat-basic
/
c
nat-basic
/
a
nat-basic
/
oz
set-basic
/nat-set/
Size-insert
oelem
/nat-set/
irreflexivity
nat-basic
/
ls-02
nat-basic
/
succ
set-basic
/nat-set/
size-zero-01
set-basic
/nat-set/
ne-01
oelem
/nat-set/
transitivity
nat-basic
/
lf
nat-basic
/
f
nat
/
fle-01
set-basic
/nat-set/
add
wlentry
/
sel-04
wlentry
/
sel-05
nat
/
lels
nat
/
anti
nat-basic
/
lf-02
nat
/
ler
wlentry
/
inj-03