Metamath Proof Explorer


Theorem disjr

Description: Two ways of saying that two classes are disjoint. (Contributed by Jeff Madsen, 19-Jun-2011)

Ref Expression
Assertion disjr ⊢ A ∩ B = ∅ ↔ ∀ x ∈ B ¬ x ∈ A

Proof

Step Hyp Ref Expression
1 ineqcom ⊢ A ∩ B = ∅ ↔ B ∩ A = ∅
2 disj ⊢ B ∩ A = ∅ ↔ ∀ x ∈ B ¬ x ∈ A
3 1 2 bitri ⊢ A ∩ B = ∅ ↔ ∀ x ∈ B ¬ x ∈ A