Theorem disji2 3917

Description: Property of a disjoint collection: if 𝐵(𝑋) = 𝐶 and 𝐵(𝑌) = 𝐷, and 𝑋 ≠ 𝑌, then 𝐶 and 𝐷 are disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.)

Hypotheses

Ref	Expression
disji.1	⊢ (𝑥 = 𝑋 → 𝐵 = 𝐶)
disji.2	⊢ (𝑥 = 𝑌 → 𝐵 = 𝐷)

Assertion

Ref	Expression
disji2	⊢ ((Disj 𝑥 ∈ 𝐴 𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) ∧ 𝑋 ≠ 𝑌) → (𝐶 ∩ 𝐷) = ∅)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐶   𝑥,𝐷   𝑥,𝑋   𝑥,𝑌

Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem disji2

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		disjnims 3916	. . 3 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 → ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑦 ≠ 𝑧 → (⦋𝑦 / 𝑥⦌𝐵 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅))
2		neeq1 2319	. . . . 5 ⊢ (𝑦 = 𝑋 → (𝑦 ≠ 𝑧 ↔ 𝑋 ≠ 𝑧))
3		nfcv 2279	. . . . . . . 8 ⊢ Ⅎ𝑥𝑋
4		nfcv 2279	. . . . . . . 8 ⊢ Ⅎ𝑥𝐶
5		disji.1	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → 𝐵 = 𝐶)
6	3, 4, 5	csbhypf 3033	. . . . . . 7 ⊢ (𝑦 = 𝑋 → ⦋𝑦 / 𝑥⦌𝐵 = 𝐶)
7	6	ineq1d 3271	. . . . . 6 ⊢ (𝑦 = 𝑋 → (⦋𝑦 / 𝑥⦌𝐵 ∩ ⦋𝑧 / 𝑥⦌𝐵) = (𝐶 ∩ ⦋𝑧 / 𝑥⦌𝐵))
8	7	eqeq1d 2146	. . . . 5 ⊢ (𝑦 = 𝑋 → ((⦋𝑦 / 𝑥⦌𝐵 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅ ↔ (𝐶 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅))
9	2, 8	imbi12d 233	. . . 4 ⊢ (𝑦 = 𝑋 → ((𝑦 ≠ 𝑧 → (⦋𝑦 / 𝑥⦌𝐵 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅) ↔ (𝑋 ≠ 𝑧 → (𝐶 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅)))
10		neeq2 2320	. . . . 5 ⊢ (𝑧 = 𝑌 → (𝑋 ≠ 𝑧 ↔ 𝑋 ≠ 𝑌))
11		nfcv 2279	. . . . . . . 8 ⊢ Ⅎ𝑥𝑌
12		nfcv 2279	. . . . . . . 8 ⊢ Ⅎ𝑥𝐷
13		disji.2	. . . . . . . 8 ⊢ (𝑥 = 𝑌 → 𝐵 = 𝐷)
14	11, 12, 13	csbhypf 3033	. . . . . . 7 ⊢ (𝑧 = 𝑌 → ⦋𝑧 / 𝑥⦌𝐵 = 𝐷)
15	14	ineq2d 3272	. . . . . 6 ⊢ (𝑧 = 𝑌 → (𝐶 ∩ ⦋𝑧 / 𝑥⦌𝐵) = (𝐶 ∩ 𝐷))
16	15	eqeq1d 2146	. . . . 5 ⊢ (𝑧 = 𝑌 → ((𝐶 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅ ↔ (𝐶 ∩ 𝐷) = ∅))
17	10, 16	imbi12d 233	. . . 4 ⊢ (𝑧 = 𝑌 → ((𝑋 ≠ 𝑧 → (𝐶 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅) ↔ (𝑋 ≠ 𝑌 → (𝐶 ∩ 𝐷) = ∅)))
18	9, 17	rspc2v 2797	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑦 ≠ 𝑧 → (⦋𝑦 / 𝑥⦌𝐵 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅) → (𝑋 ≠ 𝑌 → (𝐶 ∩ 𝐷) = ∅)))
19	1, 18	mpan9 279	. 2 ⊢ ((Disj 𝑥 ∈ 𝐴 𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (𝑋 ≠ 𝑌 → (𝐶 ∩ 𝐷) = ∅))
20	19	3impia 1178	1 ⊢ ((Disj 𝑥 ∈ 𝐴 𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) ∧ 𝑋 ≠ 𝑌) → (𝐶 ∩ 𝐷) = ∅)

Syntax hints:   → wi 4   ∧ wa 103   ∧ w3a 962   = wceq 1331   ∈ wcel 1480   ≠ wne 2306  ∀wral 2414  ⦋csb 2998   ∩ cin 3065  ∅c0 3358  Disj wdisj 3901

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rmo 2422  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-in 3072  df-nul 3359  df-disj 3902

This theorem is referenced by: (None)