Theorem disj4 4416

Description: Two ways of saying that two classes are disjoint. (Contributed by NM, 21-Mar-2004.)

Assertion

Ref	Expression
disj4	⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ¬ (𝐴 ∖ 𝐵) ⊊ 𝐴)

Proof of Theorem disj4

Step	Hyp	Ref	Expression
1		disj3 4411	. 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 = (𝐴 ∖ 𝐵))
2		eqcom 2772	. 2 ⊢ (𝐴 = (𝐴 ∖ 𝐵) ↔ (𝐴 ∖ 𝐵) = 𝐴)
3		difss 4092	. . . 4 ⊢ (𝐴 ∖ 𝐵) ⊆ 𝐴
4		dfpss2 4044	. . . 4 ⊢ ((𝐴 ∖ 𝐵) ⊊ 𝐴 ↔ ((𝐴 ∖ 𝐵) ⊆ 𝐴 ∧ ¬ (𝐴 ∖ 𝐵) = 𝐴))
5	3, 4	mpbiran 721	. . 3 ⊢ ((𝐴 ∖ 𝐵) ⊊ 𝐴 ↔ ¬ (𝐴 ∖ 𝐵) = 𝐴)
6	5	con2bii 360	. 2 ⊢ ((𝐴 ∖ 𝐵) = 𝐴 ↔ ¬ (𝐴 ∖ 𝐵) ⊊ 𝐴)
7	1, 2, 6	3bitri 300	1 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ¬ (𝐴 ∖ 𝐵) ⊊ 𝐴)

Syntax hints:  ¬ wn 3   ↔ wb 209   = wceq 1563   ∖ cdif 3904   ∩ cin 3906   ⊆ wss 3907   ⊊ wpss 3908  ∅c0 4288

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3080  df-v 3459  df-dif 3910  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289

This theorem is referenced by:  marypha1lem  9381  infeq5i  9593  wilthlem2  27187  topdifinffinlem  37848