[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 keyset-size-bound
m < # kar ⊦ # keyset(kar, m) ≤ m
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
keyset-size-bound0
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
keyset-rec
,
keyset-base
,
Used spec theorems:
set-basic
/keyindex-set/
Size-insert
Used simplifier rules:
nat
/
le-def
set-basic
/keyindex-set/
Size-empty
nat-basic
/
nls-fst
nat
/
fle-01
nat
/
lels
nat
/
ls-add-not-01
nat-basic
/
a
nat-basic
/
c
set-basic
/keyindex-set/
eq
nat-basic
/
lf
nat
/
fle
nat-basic
/
trans
set-basic
/keyindex-set/
ne-01
nat-basic
/
f
nat-basic
/
succ
nat-basic
/
l-02