Theorem disj1 4404

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	⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem disj1

Step	Hyp	Ref	Expression
1		disj 4402	. 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵)
2		df-ral 3077	. 2 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵))
3	1, 2	bitri 278	1 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209  ∀wal 1567   = wceq 1569   ∈ wcel 2144  ∀wral 3076   ∩ cin 4088  ∅c0 4277

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-dif 4046  df-in 4090  df-nul 4278

This theorem is used by:  reldisj  4405  disj3  4406  undif4  4419  disjsn  4668  funun  6589  zfregs2  9739  dfac5lem4  10210  isf32lem9  10444  fzodisj  13833  fzodisjsn  13837  inpr0  33177  bnj1280  35698  axregszf  35855  ecin0  39391  zfregs2VD  45930  dfac5prim  46087  permac8prim  46111