Two proofs of Bondy's theorem on induced subsets and two related questions (Q6121105)

In this short note, the author gives two short proofs of the following theorem by Bondy: If \(F=\{A_1, A_2, \ldots, A_n\} \subseteq \mathcal{P}(A)\) is a family of \(n\) distinct subsets of an \(n\)-set \(A\), then there is an \(\alpha \in A\) such that the sets \(A_i \setminus \alpha\), where \(1 \leq i \leq n\), are all distinct. The first proof uses the contrapositive: If \(F=\{A_1, A_2, \ldots, A_n\} \subseteq \mathcal{P}(A)\) is a family of \(n\) subsets of an \(n\)-set \(A\), such that for every \(\alpha \in A\) the sets \(A_i \setminus \alpha\), where \(1 \leq i \leq n\), are not all distinct, then not all the sets in \(F\) are distinct. For this, construct a graph on \([n]\) and for every \(\alpha\), add an edge \((i,j)\) for a pair for which \(A_i \setminus \alpha= A_j \setminus \alpha.\) Then this graph has a cycle (possible a digon), implying that the sets corresponding to the vertices of the cycle are all equal. The second proof uses linear algebra to prove the theorem.