The probability by which Bloom filters preserves the order relation given a similarity measure on sets
This is not a direct answer to your question,  but it's related. The probability you want is precisely what is provided by min-wise hashing schemes. In particular, a min-wise hash takes a set and produces a single element, with the property that the probability of the two elements being identical is precisely the Jaccard similarity between the sets (intersection/union).