[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
,
Proof step 9 from proof subset-elem (
previous step
)
∀ a. count(a, bag0) ≤ count(a, bag1) ⊦ count(a, bag0) = 0, count(a, bag1) ≠ 0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 10
:
count(a, bag1) = 0, ∀ a. count(a, bag0) ≤ count(a, bag1) ⊦ count(a, bag0) = 0
Rule argument
Additional information