Theorem xpcomco 9035

Description: Composition with the bijection of xpcomf1o 9034 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 9034	. . . . . . . . 9 ⊢ 𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴)
3		f1ofun 6804	. . . . . . . . 9 ⊢ (𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴) → Fun 𝐹)
4		funbrfv2b 6920	. . . . . . . . 9 ⊢ (Fun 𝐹 → (𝑢𝐹𝑤 ↔ (𝑢 ∈ dom 𝐹 ∧ (𝐹‘𝑢) = 𝑤)))
5	2, 3, 4	mp2b 10	. . . . . . . 8 ⊢ (𝑢𝐹𝑤 ↔ (𝑢 ∈ dom 𝐹 ∧ (𝐹‘𝑢) = 𝑤))
6		ancom 464	. . . . . . . 8 ⊢ ((𝑢 ∈ dom 𝐹 ∧ (𝐹‘𝑢) = 𝑤) ↔ ((𝐹‘𝑢) = 𝑤 ∧ 𝑢 ∈ dom 𝐹))
7		eqcom 2768	. . . . . . . . 9 ⊢ ((𝐹‘𝑢) = 𝑤 ↔ 𝑤 = (𝐹‘𝑢))
8		f1odm 6806	. . . . . . . . . . 11 ⊢ (𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴) → dom 𝐹 = (𝐴 × 𝐵))
9	2, 8	ax-mp 5	. . . . . . . . . 10 ⊢ dom 𝐹 = (𝐴 × 𝐵)
10	9	eleq2i 2853	. . . . . . . . 9 ⊢ (𝑢 ∈ dom 𝐹 ↔ 𝑢 ∈ (𝐴 × 𝐵))
11	7, 10	anbi12i 637	. . . . . . . 8 ⊢ (((𝐹‘𝑢) = 𝑤 ∧ 𝑢 ∈ dom 𝐹) ↔ (𝑤 = (𝐹‘𝑢) ∧ 𝑢 ∈ (𝐴 × 𝐵)))
12	5, 6, 11	3bitri 299	. . . . . . 7 ⊢ (𝑢𝐹𝑤 ↔ (𝑤 = (𝐹‘𝑢) ∧ 𝑢 ∈ (𝐴 × 𝐵)))
13	12	anbi1i 633	. . . . . 6 ⊢ ((𝑢𝐹𝑤 ∧ 𝑤𝐺𝑣) ↔ ((𝑤 = (𝐹‘𝑢) ∧ 𝑢 ∈ (𝐴 × 𝐵)) ∧ 𝑤𝐺𝑣))
14		anass 472	. . . . . 6 ⊢ (((𝑤 = (𝐹‘𝑢) ∧ 𝑢 ∈ (𝐴 × 𝐵)) ∧ 𝑤𝐺𝑣) ↔ (𝑤 = (𝐹‘𝑢) ∧ (𝑢 ∈ (𝐴 × 𝐵) ∧ 𝑤𝐺𝑣)))
15	13, 14	bitri 277	. . . . 5 ⊢ ((𝑢𝐹𝑤 ∧ 𝑤𝐺𝑣) ↔ (𝑤 = (𝐹‘𝑢) ∧ (𝑢 ∈ (𝐴 × 𝐵) ∧ 𝑤𝐺𝑣)))
16	15	exbii 1867	. . . 4 ⊢ (∃𝑤(𝑢𝐹𝑤 ∧ 𝑤𝐺𝑣) ↔ ∃𝑤(𝑤 = (𝐹‘𝑢) ∧ (𝑢 ∈ (𝐴 × 𝐵) ∧ 𝑤𝐺𝑣)))
17		fvex 6876	. . . . 5 ⊢ (𝐹‘𝑢) ∈ V
18		breq1 5102	. . . . . 6 ⊢ (𝑤 = (𝐹‘𝑢) → (𝑤𝐺𝑣 ↔ (𝐹‘𝑢)𝐺𝑣))
19	18	anbi2d 639	. . . . 5 ⊢ (𝑤 = (𝐹‘𝑢) → ((𝑢 ∈ (𝐴 × 𝐵) ∧ 𝑤𝐺𝑣) ↔ (𝑢 ∈ (𝐴 × 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣)))
20	17, 19	ceqsexv 3501	. . . 4 ⊢ (∃𝑤(𝑤 = (𝐹‘𝑢) ∧ (𝑢 ∈ (𝐴 × 𝐵) ∧ 𝑤𝐺𝑣)) ↔ (𝑢 ∈ (𝐴 × 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣))
21		elxp 5668	. . . . . 6 ⊢ (𝑢 ∈ (𝐴 × 𝐵) ↔ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
22	21	anbi1i 633	. . . . 5 ⊢ ((𝑢 ∈ (𝐴 × 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ (∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣))
23		nfcv 2923	. . . . . . 7 ⊢ Ⅎ𝑧(𝐹‘𝑢)
24		xpcomco.1	. . . . . . . 8 ⊢ 𝐺 = (𝑦 ∈ 𝐵, 𝑧 ∈ 𝐴 ↦ 𝐶)
25		nfmpo2 7473	. . . . . . . 8 ⊢ Ⅎ𝑧(𝑦 ∈ 𝐵, 𝑧 ∈ 𝐴 ↦ 𝐶)
26	24, 25	nfcxfr 2921	. . . . . . 7 ⊢ Ⅎ𝑧𝐺
27		nfcv 2923	. . . . . . 7 ⊢ Ⅎ𝑧𝑣
28	23, 26, 27	nfbr 5146	. . . . . 6 ⊢ Ⅎ𝑧(𝐹‘𝑢)𝐺𝑣
29	28	19.41 2269	. . . . 5 ⊢ (∃𝑧(∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ (∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣))
30		nfcv 2923	. . . . . . . . 9 ⊢ Ⅎ𝑦(𝐹‘𝑢)
31		nfmpo1 7472	. . . . . . . . . 10 ⊢ Ⅎ𝑦(𝑦 ∈ 𝐵, 𝑧 ∈ 𝐴 ↦ 𝐶)
32	24, 31	nfcxfr 2921	. . . . . . . . 9 ⊢ Ⅎ𝑦𝐺
33		nfcv 2923	. . . . . . . . 9 ⊢ Ⅎ𝑦𝑣
34	30, 32, 33	nfbr 5146	. . . . . . . 8 ⊢ Ⅎ𝑦(𝐹‘𝑢)𝐺𝑣
35	34	19.41 2269	. . . . . . 7 ⊢ (∃𝑦((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ (∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣))
36		anass 472	. . . . . . . . 9 ⊢ (((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ (𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣)))
37		fveq2 6863	. . . . . . . . . . . . . 14 ⊢ (𝑢 = ⟨𝑧, 𝑦⟩ → (𝐹‘𝑢) = (𝐹‘⟨𝑧, 𝑦⟩))
38		opelxpi 5682	. . . . . . . . . . . . . . 15 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ⟨𝑧, 𝑦⟩ ∈ (𝐴 × 𝐵))
39		sneq 4591	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = ⟨𝑧, 𝑦⟩ → {𝑥} = {⟨𝑧, 𝑦⟩})
40	39	cnveqd 5845	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = ⟨𝑧, 𝑦⟩ → ◡{𝑥} = ◡{⟨𝑧, 𝑦⟩})
41	40	unieqd 4877	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = ⟨𝑧, 𝑦⟩ → ∪ ◡{𝑥} = ∪ ◡{⟨𝑧, 𝑦⟩})
42		opswap 6212	. . . . . . . . . . . . . . . . 17 ⊢ ∪ ◡{⟨𝑧, 𝑦⟩} = ⟨𝑦, 𝑧⟩
43	41, 42	eqtrdi 2812	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = ⟨𝑧, 𝑦⟩ → ∪ ◡{𝑥} = ⟨𝑦, 𝑧⟩)
44		opex 5430	. . . . . . . . . . . . . . . 16 ⊢ ⟨𝑦, 𝑧⟩ ∈ V
45	43, 1, 44	fvmpt 6971	. . . . . . . . . . . . . . 15 ⊢ (⟨𝑧, 𝑦⟩ ∈ (𝐴 × 𝐵) → (𝐹‘⟨𝑧, 𝑦⟩) = ⟨𝑦, 𝑧⟩)
46	38, 45	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐹‘⟨𝑧, 𝑦⟩) = ⟨𝑦, 𝑧⟩)
47	37, 46	sylan9eq 2816	. . . . . . . . . . . . 13 ⊢ ((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝐹‘𝑢) = ⟨𝑦, 𝑧⟩)
48	47	breq1d 5109	. . . . . . . . . . . 12 ⊢ ((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ((𝐹‘𝑢)𝐺𝑣 ↔ ⟨𝑦, 𝑧⟩𝐺𝑣))
49		df-br 5100	. . . . . . . . . . . . . . . 16 ⊢ (⟨𝑦, 𝑧⟩𝐺𝑣 ↔ ⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∈ 𝐺)
50		df-mpo 7397	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ 𝐵, 𝑧 ∈ 𝐴 ↦ 𝐶) = {⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∣ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 = 𝐶)}
51	24, 50	eqtri 2784	. . . . . . . . . . . . . . . . 17 ⊢ 𝐺 = {⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∣ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 = 𝐶)}
52	51	eleq2i 2853	. . . . . . . . . . . . . . . 16 ⊢ (⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∈ 𝐺 ↔ ⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∈ {⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∣ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 = 𝐶)})
53		oprabidw 7423	. . . . . . . . . . . . . . . 16 ⊢ (⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∈ {⟨⟨𝑦, 𝑧⟩, 𝑣⟩ ∣ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 = 𝐶)} ↔ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 = 𝐶))
54	49, 52, 53	3bitri 299	. . . . . . . . . . . . . . 15 ⊢ (⟨𝑦, 𝑧⟩𝐺𝑣 ↔ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 = 𝐶))
55	54	baib 543	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) → (⟨𝑦, 𝑧⟩𝐺𝑣 ↔ 𝑣 = 𝐶))
56	55	ancoms 462	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (⟨𝑦, 𝑧⟩𝐺𝑣 ↔ 𝑣 = 𝐶))
57	56	adantl 485	. . . . . . . . . . . 12 ⊢ ((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (⟨𝑦, 𝑧⟩𝐺𝑣 ↔ 𝑣 = 𝐶))
58	48, 57	bitrd 281	. . . . . . . . . . 11 ⊢ ((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ((𝐹‘𝑢)𝐺𝑣 ↔ 𝑣 = 𝐶))
59	58	pm5.32da 587	. . . . . . . . . 10 ⊢ (𝑢 = ⟨𝑧, 𝑦⟩ → (((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
60	59	pm5.32i 582	. . . . . . . . 9 ⊢ ((𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣)) ↔ (𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
61	36, 60	bitri 277	. . . . . . . 8 ⊢ (((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ (𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
62	61	exbii 1867	. . . . . . 7 ⊢ (∃𝑦((𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ ∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
63	35, 62	bitr3i 279	. . . . . 6 ⊢ ((∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ ∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
64	63	exbii 1867	. . . . 5 ⊢ (∃𝑧(∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
65	22, 29, 64	3bitr2i 301	. . . 4 ⊢ ((𝑢 ∈ (𝐴 × 𝐵) ∧ (𝐹‘𝑢)𝐺𝑣) ↔ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
66	16, 20, 65	3bitri 299	. . 3 ⊢ (∃𝑤(𝑢𝐹𝑤 ∧ 𝑤𝐺𝑣) ↔ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)))
67	66	opabbii 5166	. 2 ⊢ {⟨𝑢, 𝑣⟩ ∣ ∃𝑤(𝑢𝐹𝑤 ∧ 𝑤𝐺𝑣)} = {⟨𝑢, 𝑣⟩ ∣ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶))}
68		df-co 5654	. 2 ⊢ (𝐺 ∘ 𝐹) = {⟨𝑢, 𝑣⟩ ∣ ∃𝑤(𝑢𝐹𝑤 ∧ 𝑤𝐺𝑣)}
69		df-mpo 7397	. . 3 ⊢ (𝑧 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {⟨⟨𝑧, 𝑦⟩, 𝑣⟩ ∣ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)}
70		dfoprab2 7450	. . 3 ⊢ {⟨⟨𝑧, 𝑦⟩, 𝑣⟩ ∣ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶)} = {⟨𝑢, 𝑣⟩ ∣ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶))}
71	69, 70	eqtri 2784	. 2 ⊢ (𝑧 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {⟨𝑢, 𝑣⟩ ∣ ∃𝑧∃𝑦(𝑢 = ⟨𝑧, 𝑦⟩ ∧ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑣 = 𝐶))}
72	67, 68, 71	3eqtr4i 2794	1 ⊢ (𝐺 ∘ 𝐹) = (𝑧 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)

Syntax hints:   ↔ wb 208   ∧ wa 399   = wceq 1559  ∃wex 1798   ∈ wcel 2141  {csn 4581  ⟨cop 4587  ∪ cuni 4864   class class class wbr 5099  {copab 5161   ↦ cmpt 5180   × cxp 5643  ^◡ccnv 5644  dom cdm 5645   ∘ ccom 5649  Fun wfun 6511  –1-1-onto→wf1o 6516  ‘cfv 6517  {coprab 7393   ∈ cmpo 7394

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-oprab 7396  df-mpo 7397  df-1st 7966  df-2nd 7967

This theorem is referenced by:  omf1o  9048