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