[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 count-mkbag-greater-one
n < i, m < i, i ≤ # A, m ≠ n, A[m] = a, A[n] = a ⊦ count(a, mkbag(A, i)) > 1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
count-mkbag-greater-two
,
in-mkbag-del
,
in-mkbag-del-two
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 21
Used lemmas:
mkbag-rec
,
mkbag-base
,
count-mkbag-non-zero
,
Used spec theorems:
bag-basic
/
count-insert
Used simplifier rules:
nat
/
fle
nat-basic
/
one
nat
/
gr-def
nat
/
le-def
nat-basic
/
trans
nat
/
fle-01
nat
/
l-num-05
nat-basic
/
one-01
nat
/
ge
bag-basic
/
count-empty
nat-basic
/
s-04
nat
/
succ-01
nat-basic
/
one-06
nat
/
ler
nat-basic
/
succ
nat-basic
/
lf
nat-basic
/
f
nat
/
lels-02
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
nat
/
lels
nat
/
anti
nat
/
lels-03