[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 14 from proof subset-plusminus (
previous step
)
count(a0, bag1) < count(a0, bag0), ∀ a0. count(a0, bag0) ≤ count(a0, bag1) - (a0 = a ⊃ 1;0) ⊦ a0 = a, count(a, bag1) = 0
User applied rule all left
And closed the goal!
Rule argument
pos: left 2 terms: a0 abort: F discard: F computed: F
Additional information
Used simplifier rules: ⊦ m - 0 = m; (s)% ⊦ m < n → (n ≤ m ↔ false); (s) Used terms: a0