I'm not pretty sure about how good I understood the explanation our teacher provide when we delve in fundamentals of set theory:
(1) A uniquely identifies B, which subsequently means that any unique tuple A has could be used in searching for an associated member/tuple/item of B.
Moreover, the "mathematical" expression could be laid down as follows:
$ A \rightarrow B $
s.t. for every tuple t1, t2 which belong to the relational schema r we could say: t1[A] != t2[A] => t1[B] = t2[B]
The question: What does $A \rightarrow B$ in set theory and database represent? (1)
Thank you in advance and for any incoherence or inaccuracy in text don't retain yourself from rising/flagging the inconveniences.