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