Let a and b be two nonempty sets. If there is a unique element B corresponding to any element A in set A according to a certain correspondence F, then such correspondence (including sets A and B, and the correspondence F from set A to set B) is called the mapping from set A to set B, which is denoted as F: A → B.

So according to the definition: ① Under the mapping F, A corresponds to 0, and B and C correspond to 1.

② Under the mapping F: a, b corresponds to 0 and c corresponds to 1.

③ Under the mapping F: a, c corresponds to 0, and b corresponds to 1.

④ Under the mapping F, A corresponds to 1, and B and C correspond to 0.

⑤ Under the mapping F: a, b corresponds to 1 and c corresponds to 0.

⑥ Under the mapping F: a, c corresponds to 1 and b corresponds to 0.

So * * * six mappings that meet the conditions.