[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-plusminus
⊦ count(a, bag1) ≠ 0 → (bag0 ⊆ bag1 -- a ↔ bag0 ++ a ⊆ bag1)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 17
Used lemmas:
count-del
,
count-subset
,
Used spec theorems:
bag-basic
/
count-other
Used simplifier rules:
nat-basic
/
f
nat
/
le-def
nat
/
lels
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
bag-basic
/
count-same
nat-basic
/
one-01
nat
/
ls-02
nat
/
succ-01
nat
/
le-ls-simp
nat
/
sub-base
nat
/
ls-le-simp
bag-basic
/
count-other