Theorem disj1 3593

Description: Two ways of saying that two classes are disjoint (have no members in common). (Contributed by NM, 19-Aug-1993.)

Assertion

Ref	Expression
disj1	⊢ ((A ∩ B) = ∅ ↔ ∀x(x ∈ A → ¬ x ∈ B))

Distinct variable groups:   x,A   x,B

Proof of Theorem disj1

Step	Hyp	Ref	Expression
1		disj 3591	. 2 ⊢ ((A ∩ B) = ∅ ↔ ∀x ∈ A ¬ x ∈ B)
2		df-ral 2619	. 2 ⊢ (∀x ∈ A ¬ x ∈ B ↔ ∀x(x ∈ A → ¬ x ∈ B))
3	1, 2	bitri 240	1 ⊢ ((A ∩ B) = ∅ ↔ ∀x(x ∈ A → ¬ x ∈ B))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 176  ∀wal 1540   = wceq 1642   ∈ wcel 1710  ∀wral 2614   ∩ cin 3208  ∅c0 3550

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ne 2518  df-ral 2619  df-v 2861  df-nin 3211  df-compl 3212  df-in 3213  df-dif 3215  df-nul 3551

This theorem is referenced by:  reldisj  3594  disj3  3595  undif4  3607  disjsn  3786  funun  5146