Theorem disjr 4391

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

Assertion

Ref	Expression
disjr	⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ∀𝑥 ∈ 𝐵 ¬ 𝑥 ∈ 𝐴)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem disjr

Step	Hyp	Ref	Expression
1		ineqcom 4150	. 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐵 ∩ 𝐴) = ∅)
2		disj 4390	. 2 ⊢ ((𝐵 ∩ 𝐴) = ∅ ↔ ∀𝑥 ∈ 𝐵 ¬ 𝑥 ∈ 𝐴)
3	1, 2	bitri 275	1 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ∀𝑥 ∈ 𝐵 ¬ 𝑥 ∈ 𝐴)

Syntax hints:  ¬ wn 3   ↔ wb 206   = wceq 1542   ∈ wcel 2114  ∀wral 3051   ∩ cin 3888  ∅c0 4273

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rab 3390  df-dif 3892  df-in 3896  df-nul 4274

This theorem is referenced by:  kqdisj  23697  iccntr  24787  numedglnl  29213  fmlasucdisj  35581  ntrneicls11  44517  iooinlbub  45931  stoweidlem57  46485