Theorem xpcomco 9089

Description: Composition with the bijection of xpcomf1o 9088 swaps the arguments to a mapping. (Contributed by Mario Carneiro, 30-May-2015.)

Hypotheses

Ref	Expression
xpcomf1o.1	⊢ 𝐹 = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ◡{𝑥})
xpcomco.1	⊢ 𝐺 = (𝑦 ∈ 𝐵, 𝑧 ∈ 𝐴 ↦ 𝐶)

Assertion

Ref	Expression
xpcomco	⊢ (𝐺 ∘ 𝐹) = (𝑧 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)

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

Allowed substitution hints:   𝐶(𝑥, 𝑦, 𝑧)   𝐹(𝑥)   𝐺(𝑥, 𝑦, 𝑧)

Proof of Theorem xpcomco

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

Step	Hyp	Ref	Expression
1		xpcomf1o.1	. . . . . . . . . 10 ⊢ 𝐹 = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ◡{𝑥})
2	1	xpcomf1o 9088	. . . . . . . . 9 ⊢ 𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴)
3		f1ofun 6826	. . . . . . . . 9 ⊢ (𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴) → Fun 𝐹)
4		funbrfv2b 6942	. . . . . . . . 9 ⊢ (Fun 𝐹 → (𝑢𝐹𝑤 ↔ (𝑢 ∈ dom 𝐹 ∧ (𝐹‘𝑢) = 𝑤)))
5	2, 3, 4	mp2b 10	. . . . . . . 8 ⊢ (𝑢𝐹𝑤 ↔ (𝑢 ∈ dom 𝐹 ∧ (𝐹‘𝑢) = 𝑤))
6		ancom 466	. . . . . . . 8 ⊢ ((𝑢 ∈ dom 𝐹 ∧ (𝐹‘𝑢) = 𝑤) ↔ ((𝐹‘𝑢) = 𝑤 ∧ 𝑢 ∈ dom 𝐹))
7		eqcom 2767	. . . . . . . . 9 ⊢ ((𝐹‘𝑢) = 𝑤 ↔ 𝑤 = (𝐹‘𝑢))
8		f1odm 6828	. . . . . . . . . . 11 ⊢ (𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴) → dom 𝐹 = (𝐴 × 𝐵))
9	2, 8	ax-mp 5	. . . . . . . . . 10 ⊢ dom 𝐹 = (𝐴 × 𝐵)
10	9	eleq2i 2852	. . . . . . . . 9 ⊢ (𝑢 ∈ dom 𝐹 ↔ 𝑢 ∈ (𝐴 × 𝐵))
11	7, 10	anbi12i 640	. . . . . . . 8 ⊢ (((𝐹‘𝑢) = 𝑤 ∧ 𝑢 ∈ dom 𝐹) ↔ (𝑤 = (𝐹‘𝑢) ∧ 𝑢 ∈ (𝐴 × 𝐵)))
12	5, 6, 11	3bitri 300	. . . . . . 7 ⊢ (𝑢𝐹𝑤 ↔ (𝑤 = (𝐹‘𝑢) ∧ 𝑢 ∈ (𝐴 × 𝐵)))
13	12	anbi1i 636	. . . . . 6 ⊢ ((𝑢𝐹𝑤 ∧ 𝑤𝐺𝑣) ↔ ((𝑤 = (𝐹‘𝑢) ∧ 𝑢 ∈ (𝐴 × 𝐵)) ∧ 𝑤𝐺𝑣))
14		anass 474	. . . . . 6 ⊢ (((𝑤 = (𝐹‘𝑢) ∧ 𝑢 ∈ (𝐴 × 𝐵)) ∧ 𝑤𝐺𝑣) ↔ (𝑤 = (𝐹‘𝑢) ∧ (𝑢 ∈ (𝐴 × 𝐵) ∧ 𝑤𝐺𝑣)))
15	13, 14	bitri 278	. . . . 5 ⊢ ((𝑢𝐹𝑤 ∧ 𝑤𝐺𝑣) ↔ (𝑤 = (𝐹‘𝑢) ∧ (𝑢 ∈ (𝐴 × 𝐵) ∧ 𝑤𝐺𝑣)))
16	15	exbii 1880	. . . 4 ⊢ (∃𝑤(𝑢𝐹𝑤 ∧ 𝑤𝐺𝑣) ↔ ∃𝑤(𝑤 = (𝐹‘𝑢) ∧ (𝑢 ∈ (𝐴 × 𝐵) ∧ 𝑤𝐺𝑣)))
17		fvex 6898	. . . . 5 ⊢ (𝐹‘𝑢) ∈ V
18		breq1 5105	. . . . . 6 ⊢ (𝑤 = (𝐹‘𝑢) → (𝑤𝐺𝑣 ↔ (𝐹‘𝑢)𝐺𝑣))
19	18	anbi2d 642	. . . . 5 ⊢ (𝑤 = (𝐹‘𝑢) → ((𝑢 ∈ (𝐴 × 𝐵) ∧ 𝑤𝐺𝑣) ↔ (𝑢 ∈ (𝐴 × 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣)))
20	17, 19	ceqsexv 3498	. . . 4 ⊢ (∃𝑤(𝑤 = (𝐹‘𝑢) ∧ (𝑢 ∈ (𝐴 × 𝐵) ∧ 𝑤𝐺𝑣)) ↔ (𝑢 ∈ (𝐴 × 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣))
21		elxp 5673	. . . . . 6 ⊢ (𝑢 ∈ (𝐴 × 𝐵) ↔ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
22	21	anbi1i 636	. . . . 5 ⊢ ((𝑢 ∈ (𝐴 × 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ (∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣))
23		nfcv 2922	. . . . . . 7 ⊢ Ⅎ𝑧(𝐹‘𝑢)
24		xpcomco.1	. . . . . . . 8 ⊢ 𝐺 = (𝑦 ∈ 𝐵, 𝑧 ∈ 𝐴 ↦ 𝐶)
25		nfmpo2 7501	. . . . . . . 8 ⊢ Ⅎ𝑧(𝑦 ∈ 𝐵, 𝑧 ∈ 𝐴 ↦ 𝐶)
26	24, 25	nfcxfr 2920	. . . . . . 7 ⊢ Ⅎ𝑧𝐺
27		nfcv 2922	. . . . . . 7 ⊢ Ⅎ𝑧𝑣
28	23, 26, 27	nfbr 5151	. . . . . 6 ⊢ Ⅎ𝑧(𝐹‘𝑢)𝐺𝑣
29	28	19.41 2271	. . . . 5 ⊢ (∃𝑧(∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ (∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣))
30		nfcv 2922	. . . . . . . . 9 ⊢ Ⅎ𝑦(𝐹‘𝑢)
31		nfmpo1 7500	. . . . . . . . . 10 ⊢ Ⅎ𝑦(𝑦 ∈ 𝐵, 𝑧 ∈ 𝐴 ↦ 𝐶)
32	24, 31	nfcxfr 2920	. . . . . . . . 9 ⊢ Ⅎ𝑦𝐺
33		nfcv 2922	. . . . . . . . 9 ⊢ Ⅎ𝑦𝑣
34	30, 32, 33	nfbr 5151	. . . . . . . 8 ⊢ Ⅎ𝑦(𝐹‘𝑢)𝐺𝑣
35	34	19.41 2271	. . . . . . 7 ⊢ (∃𝑦((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ (∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣))
36		anass 474	. . . . . . . . 9 ⊢ (((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ (𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣)))
37		fveq2 6885	. . . . . . . . . . . . . 14 ⊢ (𝑢 = ⟨𝑧, 𝑦⟩ → (𝐹‘𝑢) = (𝐹‘⟨𝑧, 𝑦⟩))
38		opelxpi 5687	. . . . . . . . . . . . . . 15 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ⟨𝑧, 𝑦⟩ ∈ (𝐴 × 𝐵))
39		sneq 4590	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = ⟨𝑧, 𝑦⟩ → {𝑥} = {⟨𝑧, 𝑦⟩})
40	39	cnveqd 5852	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = ⟨𝑧, 𝑦⟩ → ◡{𝑥} = ◡{⟨𝑧, 𝑦⟩})
41	40	unieqd 4879	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = ⟨𝑧, 𝑦⟩ → ∪ ◡{𝑥} = ∪ ◡{⟨𝑧, 𝑦⟩})
42		opswap 6230	. . . . . . . . . . . . . . . . 17 ⊢ ∪ ◡{⟨𝑧, 𝑦⟩} = ⟨𝑦, 𝑧⟩
43	41, 42	eqtrdi 2811	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = ⟨𝑧, 𝑦⟩ → ∪ ◡{𝑥} = ⟨𝑦, 𝑧⟩)
44		opex 5431	. . . . . . . . . . . . . . . 16 ⊢ ⟨𝑦, 𝑧⟩ ∈ V
45	43, 1, 44	fvmpt 6993	. . . . . . . . . . . . . . 15 ⊢ (⟨𝑧, 𝑦⟩ ∈ (𝐴 × 𝐵) → (𝐹‘⟨𝑧, 𝑦⟩) = ⟨𝑦, 𝑧⟩)
46	38, 45	syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐹‘⟨𝑧, 𝑦⟩) = ⟨𝑦, 𝑧⟩)
47	37, 46	sylan9eq 2815	. . . . . . . . . . . . 13 ⊢ ((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝐹‘𝑢) = ⟨𝑦, 𝑧⟩)
48	47	breq1d 5112	. . . . . . . . . . . 12 ⊢ ((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ((𝐹‘𝑢)𝐺𝑣 ↔ ⟨𝑦, 𝑧⟩𝐺𝑣))
49		df-br 5103	. . . . . . . . . . . . . . . 16 ⊢ (⟨𝑦, 𝑧⟩𝐺𝑣 ↔ ⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∈ 𝐺)
50		df-mpo 7425	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ 𝐵, 𝑧 ∈ 𝐴 ↦ 𝐶) = {⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∣ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 = 𝐶)}
51	24, 50	eqtri 2783	. . . . . . . . . . . . . . . . 17 ⊢ 𝐺 = {⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∣ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 = 𝐶)}
52	51	eleq2i 2852	. . . . . . . . . . . . . . . 16 ⊢ (⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∈ 𝐺 ↔ ⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∈ {⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∣ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 = 𝐶)})
53		oprabidw 7451	. . . . . . . . . . . . . . . 16 ⊢ (⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∈ {⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∣ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 = 𝐶)} ↔ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 = 𝐶))
54	49, 52, 53	3bitri 300	. . . . . . . . . . . . . . 15 ⊢ (⟨𝑦, 𝑧⟩𝐺𝑣 ↔ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 = 𝐶))
55	54	baib 545	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) → (⟨𝑦, 𝑧⟩𝐺𝑣 ↔ 𝑣 = 𝐶))
56	55	ancoms 464	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (⟨𝑦, 𝑧⟩𝐺𝑣 ↔ 𝑣 = 𝐶))
57	56	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (⟨𝑦, 𝑧⟩𝐺𝑣 ↔ 𝑣 = 𝐶))
58	48, 57	bitrd 282	. . . . . . . . . . 11 ⊢ ((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ((𝐹‘𝑢)𝐺𝑣 ↔ 𝑣 = 𝐶))
59	58	pm5.32da 590	. . . . . . . . . 10 ⊢ (𝑢 = ⟨𝑧, 𝑦⟩ → (((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
60	59	pm5.32i 585	. . . . . . . . 9 ⊢ ((𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣)) ↔ (𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
61	36, 60	bitri 278	. . . . . . . 8 ⊢ (((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ (𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
62	61	exbii 1880	. . . . . . 7 ⊢ (∃𝑦((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ ∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
63	35, 62	bitr3i 280	. . . . . 6 ⊢ ((∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ ∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
64	63	exbii 1880	. . . . 5 ⊢ (∃𝑧(∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
65	22, 29, 64	3bitr2i 302	. . . 4 ⊢ ((𝑢 ∈ (𝐴 × 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
66	16, 20, 65	3bitri 300	. . 3 ⊢ (∃𝑤(𝑢𝐹𝑤 ∧ 𝑤𝐺𝑣) ↔ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
67	66	opabbii 5171	. 2 ⊢ {⟨𝑢, 𝑣⟩ ∣ ∃𝑤(𝑢𝐹𝑤 ∧ 𝑤𝐺𝑣)} = {⟨𝑢, 𝑣⟩ ∣ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶))}
68		df-co 5659	. 2 ⊢ (𝐺 ∘ 𝐹) = {⟨𝑢, 𝑣⟩ ∣ ∃𝑤(𝑢𝐹𝑤 ∧ 𝑤𝐺𝑣)}
69		df-mpo 7425	. . 3 ⊢ (𝑧 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {⟨⟨𝑧, 𝑦⟩, 𝑣⟩ ∣ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)}
70		dfoprab2 7478	. . 3 ⊢ {⟨⟨𝑧, 𝑦⟩, 𝑣⟩ ∣ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)} = {⟨𝑢, 𝑣⟩ ∣ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶))}
71	69, 70	eqtri 2783	. 2 ⊢ (𝑧 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {⟨𝑢, 𝑣⟩ ∣ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶))}
72	67, 68, 71	3eqtr4i 2793	1 ⊢ (𝐺 ∘ 𝐹) = (𝑧 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {csn 4584  ⟨cop 4834  ∪ cuni 4866   class class class wbr 5102  {copab 5166   ↦ cmpt 5185   × cxp 5648  ^◡ccnv 5649  dom cdm 5650   ∘ ccom 5654  Fun wfun 6532  –1-1-onto→wf1o 6537  ‘cfv 6538  {coprab 7421   ∈ cmpo 7422

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002

This theorem is used by:  omf1o  9102