In general, the amount of time taken for the queries that you describe is based on the I/O time for reading the data and the time for returning the result set. The amount of time spent determining whether or not a record is in the result set is negligible, compared to the times for reading and returning records.
This is a general overview. If you have indexes on the where
clauses, then the two constructs are basically the same. There is probably a very, very minor amount of additional overhead for the comparison on the second key, but that will not make a difference for real world applications.
Another difference from the general situation is when comparisons do take a long time. This might be due to like
on a large text field or a complicated user-defined function. In that case, the comparison could make a difference.
More fundamentally, though, the queries do different things. You should express the query that you really need, before worrying about arcane performance characteristics. For instance, it is usually much better to do filtering in the database than to bring the data back to the application and filter there.