From time to time, although not so commonly, I see $A \supset B$ written with seemingly the same meaning as $A \Rightarrow B$.
Ex. in Constructive Type Theory and Interactive Theorem Proving, on page 8.
A proof of $A \supset B$ is a method which transforms a proof of $A$ to a proof of $B$.
This suggest $A \supset B$ means the same as $A \Rightarrow B$, isn't it?
$A \Rightarrow B$ means: whenever $A$ holds, then $B$ holds. However, this also means $B$ may holds when $A$ do not. Which in turn means the set of the cases where $A$ holds is a subset of the set of the cases where $B$ holds. Is this OK? If that's OK, $A \Rightarrow B$ should be written as $A \subset B$ instead of $A \supset B$.
Why is this not so? Or am I wrong in some way? If I'm wrong, where am I so?
Edit: oops, duplicate of this one: Using $p\supset q$ instead of $p\implies q$ . Sorry.