[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 subset-size
⊦ # st0 .refs < # st .refs → ¬ st ⊆ st0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 36
Used lemmas:
instore-inrefs-02
,
refs-notin
,
refs-del
,
instore-inrefs-01
,
lookup-xtra
,
refs-empty-01
,
refs-put
,
refs-empty
,
Used spec theorems:
set-basic
/references/
Size-insert
store
/javastore/
subset-put-01
store
/javastore/
Del-at
store
/javastore/
subset-put-02
set-union
/references/
del-size
storefuns
/
subset-delete
store
/javastore/
Subset
Used simplifier rules:
store
/javastore/
Del-at
nat
/
le-ls-simp
nat
/
ls-01
nat-basic1
/
one-01
set-basic
/references/
size-zero-02
set-union
/references/
del-in
nat
/
lels-03
nat
/
lels-01
set-union
/references/
size-del-leq
nat
/
let
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
s
store
/javastore/
notmemlookup
store
/javastore/
lookupisempty
store
/javastore/
Del-in
store
/javastore/
del-notin
store
/javastore/
in-pair
nat
/
ls-le-simp
refkey
/
sel-01
storefuns
/
instore-01
store
/javastore/
In-store
set-basic
/references/
ne-01
set-basic
/references/
eq
refkey
/
elim
nat
/
lels
set-basic
/references/
Size-empty
nat-basic1
/
less-1
nat-basic1
/
f