Theorem disj4 4412

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 4407	. 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 = (𝐴 ∖ 𝐵))
2		eqcom 2768	. 2 ⊢ (𝐴 = (𝐴 ∖ 𝐵) ↔ (𝐴 ∖ 𝐵) = 𝐴)
3		difss 4083	. . . 4 ⊢ (𝐴 ∖ 𝐵) ⊆ 𝐴
4		dfpss2 4036	. . . 4 ⊢ ((𝐴 ∖ 𝐵) ⊊ 𝐴 ↔ ((𝐴 ∖ 𝐵) ⊆ 𝐴 ∧ ¬ (𝐴 ∖ 𝐵) = 𝐴))
5	3, 4	mpbiran 722	. . 3 ⊢ ((𝐴 ∖ 𝐵) ⊊ 𝐴 ↔ ¬ (𝐴 ∖ 𝐵) = 𝐴)
6	5	con2bii 360	. 2 ⊢ ((𝐴 ∖ 𝐵) = 𝐴 ↔ ¬ (𝐴 ∖ 𝐵) ⊊ 𝐴)
7	1, 2, 6	3bitri 300	1 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ¬ (𝐴 ∖ 𝐵) ⊊ 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   = wceq 1570   ∖ cdif 3896   ∩ cin 3898   ⊆ wss 3899   ⊊ wpss 3900  ∅c0 4279

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-v 3453  df-dif 3902  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280

This theorem is used by:  marypha1lem  9409  infeq5i  9621  wilthlem2  27378  topdifinffinlem  38238