Theorem bj-disj2r 36988

Description: Relative version of ssdifin0 4466, allowing a biconditional, and of disj2 4438. (Contributed by BJ, 11-Nov-2021.) This proof does not rely, even indirectly, on ssdifin0 4466 nor disj2 4438. (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-disj2r	⊢ ((𝐴 ∩ 𝑉) ⊆ (𝑉 ∖ 𝐵) ↔ ((𝐴 ∩ 𝐵) ∩ 𝑉) = ∅)

Proof of Theorem bj-disj2r

Step	Hyp	Ref	Expression
1		dfss2 3949	. . 3 ⊢ ((𝐴 ∩ 𝑉) ⊆ (𝑉 ∖ 𝐵) ↔ ((𝐴 ∩ 𝑉) ∩ (𝑉 ∖ 𝐵)) = (𝐴 ∩ 𝑉))
2		indif2 4261	. . . . 5 ⊢ ((𝐴 ∩ 𝑉) ∩ (𝑉 ∖ 𝐵)) = (((𝐴 ∩ 𝑉) ∩ 𝑉) ∖ 𝐵)
3		inss1 4217	. . . . . . 7 ⊢ ((𝐴 ∩ 𝑉) ∩ 𝑉) ⊆ (𝐴 ∩ 𝑉)
4		ssid 3986	. . . . . . . 8 ⊢ (𝐴 ∩ 𝑉) ⊆ (𝐴 ∩ 𝑉)
5		inss2 4218	. . . . . . . 8 ⊢ (𝐴 ∩ 𝑉) ⊆ 𝑉
6	4, 5	ssini 4220	. . . . . . 7 ⊢ (𝐴 ∩ 𝑉) ⊆ ((𝐴 ∩ 𝑉) ∩ 𝑉)
7	3, 6	eqssi 3980	. . . . . 6 ⊢ ((𝐴 ∩ 𝑉) ∩ 𝑉) = (𝐴 ∩ 𝑉)
8	7	difeq1i 4102	. . . . 5 ⊢ (((𝐴 ∩ 𝑉) ∩ 𝑉) ∖ 𝐵) = ((𝐴 ∩ 𝑉) ∖ 𝐵)
9	2, 8	eqtri 2757	. . . 4 ⊢ ((𝐴 ∩ 𝑉) ∩ (𝑉 ∖ 𝐵)) = ((𝐴 ∩ 𝑉) ∖ 𝐵)
10	9	eqeq1i 2739	. . 3 ⊢ (((𝐴 ∩ 𝑉) ∩ (𝑉 ∖ 𝐵)) = (𝐴 ∩ 𝑉) ↔ ((𝐴 ∩ 𝑉) ∖ 𝐵) = (𝐴 ∩ 𝑉))
11		eqcom 2741	. . 3 ⊢ (((𝐴 ∩ 𝑉) ∖ 𝐵) = (𝐴 ∩ 𝑉) ↔ (𝐴 ∩ 𝑉) = ((𝐴 ∩ 𝑉) ∖ 𝐵))
12	1, 10, 11	3bitri 297	. 2 ⊢ ((𝐴 ∩ 𝑉) ⊆ (𝑉 ∖ 𝐵) ↔ (𝐴 ∩ 𝑉) = ((𝐴 ∩ 𝑉) ∖ 𝐵))
13		disj3 4434	. 2 ⊢ (((𝐴 ∩ 𝑉) ∩ 𝐵) = ∅ ↔ (𝐴 ∩ 𝑉) = ((𝐴 ∩ 𝑉) ∖ 𝐵))
14		in32 4210	. . 3 ⊢ ((𝐴 ∩ 𝑉) ∩ 𝐵) = ((𝐴 ∩ 𝐵) ∩ 𝑉)
15	14	eqeq1i 2739	. 2 ⊢ (((𝐴 ∩ 𝑉) ∩ 𝐵) = ∅ ↔ ((𝐴 ∩ 𝐵) ∩ 𝑉) = ∅)
16	12, 13, 15	3bitr2i 299	1 ⊢ ((𝐴 ∩ 𝑉) ⊆ (𝑉 ∖ 𝐵) ↔ ((𝐴 ∩ 𝐵) ∩ 𝑉) = ∅)

Syntax hints:   ↔ wb 206   = wceq 1539   ∖ cdif 3928   ∩ cin 3930   ⊆ wss 3931  ∅c0 4313

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-clab 2713  df-cleq 2726  df-clel 2808  df-ral 3051  df-rab 3420  df-v 3465  df-dif 3934  df-in 3938  df-ss 3948  df-nul 4314

This theorem is referenced by:  bj-sscon  36989