Theorem. Building up HOL › Conjunction Elimination [isa-000C]

lemma conjE : ‹⟦ A ∧ B ; ⟦ A ; B ⟧ ⟹ C ⟧ ⟹ C›