[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 max-rem-notsame
⊦ bag -- n ≠ ∅ → (bag.max = (bag -- n).max ↔ ¬(n = bag.max ∧ count(n, bag) = 1))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 44
Used lemmas:
max-one
,
bag-rem-notmax
,
bag-rem-empty
,
max-rec
,
Used spec theorems:
bag-basic
/nat-bag/
count-insert
Used simplifier rules:
nat-basic
/
ref
nat
/
le-ls-simp
bag-union
/nat-bag/
del-notin
nat
/
ler
nat-basic
/
one-06
bag-basic
/nat-bag/
count-1
bag-union
/nat-bag/
del-empty
bag-union
/nat-bag/
del-rec
bag-basic
/nat-bag/
count-other
nat-basic
/
neq-01
nat-basic
/
one-03
bag-basic
/nat-bag/
count-same
nat
/
gr-def
bag-basic
/nat-bag/
insert-nonempty
bag-basic
/nat-bag/
count-empty
nat-basic
/
add-base
nat-basic
/
succ
nat-basic
/
trans
nat-basic
/
lf
nat-basic
/
f
nat-basic
/
z-01
nat-basic
/
a
nat-basic
/
c
nat-basic
/
lf-02
nat-basic
/
lf-01
nat-basic
/
ls-02
nat
/
fle-01
nat
/
lels