 A quick and simple proof goes as follows: Suppose for reductio that we have a BRM \(M = \langle \cK, *\rangle\) with a belief set \(K\in \cK\) that is logically compatible with three pairwise inconsistent sentences \(A\), \(B\) and \(C\). First notice that