Theorem dmmpossx2 49176

Description: The domain of a mapping is a subset of its base classes expressed as union of Cartesian products over its second component, analogous to dmmpossx 8069. (Contributed by AV, 30-Mar-2019.)

Hypothesis

Ref	Expression
dmmpossx2.1	⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)

Assertion

Ref	Expression
dmmpossx2	⊢ dom 𝐹 ⊆ ∪ 𝑦 ∈ 𝐵 (𝐴 × {𝑦})

Distinct variable groups:   𝑥,𝐴   𝑥,𝑦,𝐵

Allowed substitution hints:   𝐴(𝑦)   𝐶(𝑥, 𝑦)   𝐹(𝑥, 𝑦)

Proof of Theorem dmmpossx2

Dummy variables 𝑢 𝑡 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfcv 2927	. . . . 5 ⊢ Ⅎ𝑢𝐴
2		nfcsb1v 3878	. . . . 5 ⊢ Ⅎ𝑦⦋𝑢 / 𝑦⦌𝐴
3		nfcv 2927	. . . . 5 ⊢ Ⅎ𝑢𝐶
4		nfcv 2927	. . . . 5 ⊢ Ⅎ𝑣𝐶
5		nfcv 2927	. . . . . 6 ⊢ Ⅎ𝑥𝑢
6		nfcsb1v 3878	. . . . . 6 ⊢ Ⅎ𝑥⦋𝑣 / 𝑥⦌𝐶
7	5, 6	nfcsbw 3880	. . . . 5 ⊢ Ⅎ𝑥⦋𝑢 / 𝑦⦌⦋𝑣 / 𝑥⦌𝐶
8		nfcsb1v 3878	. . . . 5 ⊢ Ⅎ𝑦⦋𝑢 / 𝑦⦌⦋𝑣 / 𝑥⦌𝐶
9		csbeq1a 3868	. . . . 5 ⊢ (𝑦 = 𝑢 → 𝐴 = ⦋𝑢 / 𝑦⦌𝐴)
10		csbeq1a 3868	. . . . . 6 ⊢ (𝑥 = 𝑣 → 𝐶 = ⦋𝑣 / 𝑥⦌𝐶)
11		csbeq1a 3868	. . . . . 6 ⊢ (𝑦 = 𝑢 → ⦋𝑣 / 𝑥⦌𝐶 = ⦋𝑢 / 𝑦⦌⦋𝑣 / 𝑥⦌𝐶)
12	10, 11	sylan9eqr 2822	. . . . 5 ⊢ ((𝑦 = 𝑢 ∧ 𝑥 = 𝑣) → 𝐶 = ⦋𝑢 / 𝑦⦌⦋𝑣 / 𝑥⦌𝐶)
13	1, 2, 3, 4, 7, 8, 9, 12	cbvmpox2 49175	. . . 4 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑣 ∈ ⦋𝑢 / 𝑦⦌𝐴, 𝑢 ∈ 𝐵 ↦ ⦋𝑢 / 𝑦⦌⦋𝑣 / 𝑥⦌𝐶)
14		dmmpossx2.1	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)
15		vex 3461	. . . . . . . 8 ⊢ 𝑣 ∈ V
16		vex 3461	. . . . . . . 8 ⊢ 𝑢 ∈ V
17	15, 16	op2ndd 8003	. . . . . . 7 ⊢ (𝑡 = ⟨𝑣, 𝑢⟩ → (2nd ‘𝑡) = 𝑢)
18	17	csbeq1d 3858	. . . . . 6 ⊢ (𝑡 = ⟨𝑣, 𝑢⟩ → ⦋(2nd ‘𝑡) / 𝑦⦌⦋(1st ‘𝑡) / 𝑥⦌𝐶 = ⦋𝑢 / 𝑦⦌⦋(1st ‘𝑡) / 𝑥⦌𝐶)
19	15, 16	op1std 8002	. . . . . . . 8 ⊢ (𝑡 = ⟨𝑣, 𝑢⟩ → (1st ‘𝑡) = 𝑣)
20	19	csbeq1d 3858	. . . . . . 7 ⊢ (𝑡 = ⟨𝑣, 𝑢⟩ → ⦋(1st ‘𝑡) / 𝑥⦌𝐶 = ⦋𝑣 / 𝑥⦌𝐶)
21	20	csbeq2dv 3861	. . . . . 6 ⊢ (𝑡 = ⟨𝑣, 𝑢⟩ → ⦋𝑢 / 𝑦⦌⦋(1st ‘𝑡) / 𝑥⦌𝐶 = ⦋𝑢 / 𝑦⦌⦋𝑣 / 𝑥⦌𝐶)
22	18, 21	eqtrd 2800	. . . . 5 ⊢ (𝑡 = ⟨𝑣, 𝑢⟩ → ⦋(2nd ‘𝑡) / 𝑦⦌⦋(1st ‘𝑡) / 𝑥⦌𝐶 = ⦋𝑢 / 𝑦⦌⦋𝑣 / 𝑥⦌𝐶)
23	22	mpomptx2 49174	. . . 4 ⊢ (𝑡 ∈ ∪ 𝑢 ∈ 𝐵 (⦋𝑢 / 𝑦⦌𝐴 × {𝑢}) ↦ ⦋(2nd ‘𝑡) / 𝑦⦌⦋(1st ‘𝑡) / 𝑥⦌𝐶) = (𝑣 ∈ ⦋𝑢 / 𝑦⦌𝐴, 𝑢 ∈ 𝐵 ↦ ⦋𝑢 / 𝑦⦌⦋𝑣 / 𝑥⦌𝐶)
24	13, 14, 23	3eqtr4i 2798	. . 3 ⊢ 𝐹 = (𝑡 ∈ ∪ 𝑢 ∈ 𝐵 (⦋𝑢 / 𝑦⦌𝐴 × {𝑢}) ↦ ⦋(2nd ‘𝑡) / 𝑦⦌⦋(1st ‘𝑡) / 𝑥⦌𝐶)
25	24	dmmptss 6244	. 2 ⊢ dom 𝐹 ⊆ ∪ 𝑢 ∈ 𝐵 (⦋𝑢 / 𝑦⦌𝐴 × {𝑢})
26		nfcv 2927	. . 3 ⊢ Ⅎ𝑢(𝐴 × {𝑦})
27		nfcv 2927	. . . 4 ⊢ Ⅎ𝑦{𝑢}
28	2, 27	nfxp 5696	. . 3 ⊢ Ⅎ𝑦(⦋𝑢 / 𝑦⦌𝐴 × {𝑢})
29		sneq 4601	. . . 4 ⊢ (𝑦 = 𝑢 → {𝑦} = {𝑢})
30	9, 29	xpeq12d 5694	. . 3 ⊢ (𝑦 = 𝑢 → (𝐴 × {𝑦}) = (⦋𝑢 / 𝑦⦌𝐴 × {𝑢}))
31	26, 28, 30	cbviun 5001	. 2 ⊢ ∪ 𝑦 ∈ 𝐵 (𝐴 × {𝑦}) = ∪ 𝑢 ∈ 𝐵 (⦋𝑢 / 𝑦⦌𝐴 × {𝑢})
32	25, 31	sseqtrri 3987	1 ⊢ dom 𝐹 ⊆ ∪ 𝑦 ∈ 𝐵 (𝐴 × {𝑦})

This proof depends on syntax axioms:   = wceq 1570  ⦋csb 3854   ⊆ wss 3906  {csn 4591  ⟨cop 4597  ∪ ciun 4958   ↦ cmpt 5194   × cxp 5661  dom cdm 5663  ‘cfv 6540   ∈ cmpo 7421  1^st c1st 7990  2^nd c2nd 7991

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7742

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fv 6548  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993

This theorem is used by:  mpoexxg2  49177