Theorem disjss3 5095

Description: Expand a disjoint collection with any number of empty sets. (Contributed by Mario Carneiro, 15-Nov-2016.)

Assertion

Ref	Expression
disjss3	⊢ ((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ (𝐵 ∖ 𝐴)𝐶 = ∅) → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐶))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem disjss3

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ral 3050	. . . . . . 7 ⊢ (∀𝑥 ∈ (𝐵 ∖ 𝐴)𝐶 = ∅ ↔ ∀𝑥(𝑥 ∈ (𝐵 ∖ 𝐴) → 𝐶 = ∅))
2		simprr 772	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (𝐵 ∖ 𝐴) → 𝐶 = ∅) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) → 𝑦 ∈ 𝐶)
3		n0i 4290	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝐶 → ¬ 𝐶 = ∅)
4	2, 3	syl 17	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (𝐵 ∖ 𝐴) → 𝐶 = ∅) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) → ¬ 𝐶 = ∅)
5		simpl 482	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → 𝑥 ∈ 𝐵)
6	5	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (𝐵 ∖ 𝐴) → 𝐶 = ∅) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) → 𝑥 ∈ 𝐵)
7		eldif 3909	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (𝐵 ∖ 𝐴) ↔ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴))
8		simpl 482	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ (𝐵 ∖ 𝐴) → 𝐶 = ∅) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) → (𝑥 ∈ (𝐵 ∖ 𝐴) → 𝐶 = ∅))
9	7, 8	biimtrrid 243	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (𝐵 ∖ 𝐴) → 𝐶 = ∅) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) → ((𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴) → 𝐶 = ∅))
10	6, 9	mpand 695	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (𝐵 ∖ 𝐴) → 𝐶 = ∅) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) → (¬ 𝑥 ∈ 𝐴 → 𝐶 = ∅))
11	4, 10	mt3d 148	. . . . . . . . . 10 ⊢ (((𝑥 ∈ (𝐵 ∖ 𝐴) → 𝐶 = ∅) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) → 𝑥 ∈ 𝐴)
12	11, 2	jca 511	. . . . . . . . 9 ⊢ (((𝑥 ∈ (𝐵 ∖ 𝐴) → 𝐶 = ∅) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶))
13	12	ex 412	. . . . . . . 8 ⊢ ((𝑥 ∈ (𝐵 ∖ 𝐴) → 𝐶 = ∅) → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)))
14	13	alimi 1812	. . . . . . 7 ⊢ (∀𝑥(𝑥 ∈ (𝐵 ∖ 𝐴) → 𝐶 = ∅) → ∀𝑥((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)))
15	1, 14	sylbi 217	. . . . . 6 ⊢ (∀𝑥 ∈ (𝐵 ∖ 𝐴)𝐶 = ∅ → ∀𝑥((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)))
16		moim 2542	. . . . . 6 ⊢ (∀𝑥((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)) → (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) → ∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))
17	15, 16	syl 17	. . . . 5 ⊢ (∀𝑥 ∈ (𝐵 ∖ 𝐴)𝐶 = ∅ → (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) → ∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))
18	17	alimdv 1917	. . . 4 ⊢ (∀𝑥 ∈ (𝐵 ∖ 𝐴)𝐶 = ∅ → (∀𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) → ∀𝑦∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))
19		dfdisj2 5065	. . . 4 ⊢ (Disj 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶))
20		dfdisj2 5065	. . . 4 ⊢ (Disj 𝑥 ∈ 𝐵 𝐶 ↔ ∀𝑦∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))
21	18, 19, 20	3imtr4g 296	. . 3 ⊢ (∀𝑥 ∈ (𝐵 ∖ 𝐴)𝐶 = ∅ → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐵 𝐶))
22	21	adantl 481	. 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ (𝐵 ∖ 𝐴)𝐶 = ∅) → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐵 𝐶))
23		disjss1 5069	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (Disj 𝑥 ∈ 𝐵 𝐶 → Disj 𝑥 ∈ 𝐴 𝐶))
24	23	adantr 480	. 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ (𝐵 ∖ 𝐴)𝐶 = ∅) → (Disj 𝑥 ∈ 𝐵 𝐶 → Disj 𝑥 ∈ 𝐴 𝐶))
25	22, 24	impbid 212	1 ⊢ ((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ (𝐵 ∖ 𝐴)𝐶 = ∅) → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐶))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1539   = wceq 1541   ∈ wcel 2113  ∃*wmo 2535  ∀wral 3049   ∖ cdif 3896   ⊆ wss 3899  ∅c0 4283  Disj wdisj 5063

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-mo 2537  df-clab 2713  df-cleq 2726  df-clel 2809  df-ral 3050  df-rmo 3348  df-v 3440  df-dif 3902  df-ss 3916  df-nul 4284  df-disj 5064

This theorem is referenced by:  carsggect  34424