Dilworth's theorem/Definition

In an ordered set the maximal size of an antichain is equal to the minimal number of chains which together cover the set.