import re
s   = 'fooBar3'
rgx = re.compile(r'\d.*?[A-Z].*?[a-z]')
if rgx.match(''.join(sorted(s))) and len(s) >= 7:
    print 'ok'
Even more fun is this regex, which will report the type of character that is missing:
s = 'fooBar'
rules = [
    r'(?P\d)?',
    r'(?P[A-Z])?',
    r'(?P[a-z])?',
]
rgx      = re.compile(r'.*?'.join(rules))
checks   = rgx.match(''.join(sorted(s))).groupdict()
problems = [k for k,v in checks.iteritems() if v is None]
print checks   # {'upper': 'B', 'digit': None, 'lower': 'a'}
print problems # ['digit']
Finally, here's a variant of the excellent rules-based approach suggested by gnibbler.
s = 'fooBar'
rules = [
    lambda s: any(x.isupper() for x in s) or 'upper',
    lambda s: any(x.islower() for x in s) or 'lower',
    lambda s: any(x.isdigit() for x in s) or 'digit',
    lambda s: len(s) >= 7                 or 'length',
]
problems = [p for p in [r(s) for r in rules] if p != True]
print problems  # ['digit', 'length']