Theorem fcnvgreu 33354

Description: If the converse of a relation 𝐴 is a function, exactly one point of its graph has a given second element (that is, function value). (Contributed by Thierry Arnoux, 1-Apr-2018.)

Assertion

Ref	Expression
fcnvgreu	⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑌 ∈ ran 𝐴) → ∃!𝑝 ∈ 𝐴 𝑌 = (2nd ‘𝑝))

Distinct variable groups:   𝐴,𝑝   𝑌,𝑝

Proof of Theorem fcnvgreu

Dummy variables 𝑞 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-rn 5667	. . . 4 ⊢ ran 𝐴 = dom ◡𝐴
2	1	eleq2i 2856	. . 3 ⊢ (𝑌 ∈ ran 𝐴 ↔ 𝑌 ∈ dom ◡𝐴)
3		fgreu 33353	. . . 4 ⊢ ((Fun ◡𝐴 ∧ 𝑌 ∈ dom ◡𝐴) → ∃!𝑞 ∈ ◡ 𝐴𝑌 = (1st ‘𝑞))
4	3	adantll 727	. . 3 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑌 ∈ dom ◡𝐴) → ∃!𝑞 ∈ ◡ 𝐴𝑌 = (1st ‘𝑞))
5	2, 4	sylan2b 606	. 2 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑌 ∈ ran 𝐴) → ∃!𝑞 ∈ ◡ 𝐴𝑌 = (1st ‘𝑞))
6		cnvcnvss 6202	. . . . . 6 ⊢ ◡◡𝐴 ⊆ 𝐴
7		cnvssrndm 6295	. . . . . . . . . . 11 ⊢ ◡𝐴 ⊆ (ran 𝐴 × dom 𝐴)
8	7	sseli 3909	. . . . . . . . . 10 ⊢ (𝑞 ∈ ◡𝐴 → 𝑞 ∈ (ran 𝐴 × dom 𝐴))
9		dfdm4 5887	. . . . . . . . . . 11 ⊢ dom 𝐴 = ran ◡𝐴
10	1, 9	xpeq12i 5684	. . . . . . . . . 10 ⊢ (ran 𝐴 × dom 𝐴) = (dom ◡𝐴 × ran ◡𝐴)
11	8, 10	eleqtrdi 2874	. . . . . . . . 9 ⊢ (𝑞 ∈ ◡𝐴 → 𝑞 ∈ (dom ◡𝐴 × ran ◡𝐴))
12		2nd1st 8081	. . . . . . . . 9 ⊢ (𝑞 ∈ (dom ◡𝐴 × ran ◡𝐴) → ∪ ◡{𝑞} = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩)
13	11, 12	syl 18	. . . . . . . 8 ⊢ (𝑞 ∈ ◡𝐴 → ∪ ◡{𝑞} = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩)
14	13	eqcomd 2769	. . . . . . 7 ⊢ (𝑞 ∈ ◡𝐴 → ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ = ∪ ◡{𝑞})
15		relcnv 6116	. . . . . . . 8 ⊢ Rel ◡𝐴
16		cnvf1olem 8156	. . . . . . . . 9 ⊢ ((Rel ◡𝐴 ∧ (𝑞 ∈ ◡𝐴 ∧ ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ = ∪ ◡{𝑞})) → (⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ∈ ◡◡𝐴 ∧ 𝑞 = ∪ ◡{⟨(2nd ‘𝑞), (1st ‘𝑞)⟩}))
17	16	simpld 500	. . . . . . . 8 ⊢ ((Rel ◡𝐴 ∧ (𝑞 ∈ ◡𝐴 ∧ ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ = ∪ ◡{𝑞})) → ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ∈ ◡◡𝐴)
18	15, 17	mpan 703	. . . . . . 7 ⊢ ((𝑞 ∈ ◡𝐴 ∧ ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ = ∪ ◡{𝑞}) → ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ∈ ◡◡𝐴)
19	14, 18	mpdan 700	. . . . . 6 ⊢ (𝑞 ∈ ◡𝐴 → ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ∈ ◡◡𝐴)
20	6, 19	sselid 3911	. . . . 5 ⊢ (𝑞 ∈ ◡𝐴 → ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ∈ 𝐴)
21	20	adantl 487	. . . 4 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑞 ∈ ◡𝐴) → ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ∈ 𝐴)
22		simpll 779	. . . . . . 7 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) → Rel 𝐴)
23		simpr 490	. . . . . . 7 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) → 𝑝 ∈ 𝐴)
24		relssdmrn 6293	. . . . . . . . . . 11 ⊢ (Rel 𝐴 → 𝐴 ⊆ (dom 𝐴 × ran 𝐴))
25	24	adantr 486	. . . . . . . . . 10 ⊢ ((Rel 𝐴 ∧ Fun ◡𝐴) → 𝐴 ⊆ (dom 𝐴 × ran 𝐴))
26	25	sselda 3913	. . . . . . . . 9 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) → 𝑝 ∈ (dom 𝐴 × ran 𝐴))
27		2nd1st 8081	. . . . . . . . 9 ⊢ (𝑝 ∈ (dom 𝐴 × ran 𝐴) → ∪ ◡{𝑝} = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩)
28	26, 27	syl 18	. . . . . . . 8 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) → ∪ ◡{𝑝} = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩)
29	28	eqcomd 2769	. . . . . . 7 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) → ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩ = ∪ ◡{𝑝})
30		cnvf1olem 8156	. . . . . . . 8 ⊢ ((Rel 𝐴 ∧ (𝑝 ∈ 𝐴 ∧ ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩ = ∪ ◡{𝑝})) → (⟨(2nd ‘𝑝), (1st ‘𝑝)⟩ ∈ ◡𝐴 ∧ 𝑝 = ∪ ◡{⟨(2nd ‘𝑝), (1st ‘𝑝)⟩}))
31	30	simpld 500	. . . . . . 7 ⊢ ((Rel 𝐴 ∧ (𝑝 ∈ 𝐴 ∧ ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩ = ∪ ◡{𝑝})) → ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩ ∈ ◡𝐴)
32	22, 23, 29, 31	syl12anc 850	. . . . . 6 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) → ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩ ∈ ◡𝐴)
33	15	a1i 11	. . . . . . . . . 10 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩) → Rel ◡𝐴)
34		simplr 781	. . . . . . . . . 10 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩) → 𝑞 ∈ ◡𝐴)
35	14	ad2antlr 740	. . . . . . . . . 10 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩) → ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ = ∪ ◡{𝑞})
36	16	simprd 501	. . . . . . . . . 10 ⊢ ((Rel ◡𝐴 ∧ (𝑞 ∈ ◡𝐴 ∧ ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ = ∪ ◡{𝑞})) → 𝑞 = ∪ ◡{⟨(2nd ‘𝑞), (1st ‘𝑞)⟩})
37	33, 34, 35, 36	syl12anc 850	. . . . . . . . 9 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩) → 𝑞 = ∪ ◡{⟨(2nd ‘𝑞), (1st ‘𝑞)⟩})
38		simpr 490	. . . . . . . . . . . 12 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩) → 𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩)
39	38	sneqd 4596	. . . . . . . . . . 11 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩) → {𝑝} = {⟨(2nd ‘𝑞), (1st ‘𝑞)⟩})
40	39	cnveqd 5863	. . . . . . . . . 10 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩) → ◡{𝑝} = ◡{⟨(2nd ‘𝑞), (1st ‘𝑞)⟩})
41	40	unieqd 4883	. . . . . . . . 9 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩) → ∪ ◡{𝑝} = ∪ ◡{⟨(2nd ‘𝑞), (1st ‘𝑞)⟩})
42	28	ad2antrr 739	. . . . . . . . 9 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩) → ∪ ◡{𝑝} = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩)
43	37, 41, 42	3eqtr2d 2804	. . . . . . . 8 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩) → 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩)
44	30	simprd 501	. . . . . . . . . . 11 ⊢ ((Rel 𝐴 ∧ (𝑝 ∈ 𝐴 ∧ ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩ = ∪ ◡{𝑝})) → 𝑝 = ∪ ◡{⟨(2nd ‘𝑝), (1st ‘𝑝)⟩})
45	22, 23, 29, 44	syl12anc 850	. . . . . . . . . 10 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) → 𝑝 = ∪ ◡{⟨(2nd ‘𝑝), (1st ‘𝑝)⟩})
46	45	ad2antrr 739	. . . . . . . . 9 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩) → 𝑝 = ∪ ◡{⟨(2nd ‘𝑝), (1st ‘𝑝)⟩})
47		simpr 490	. . . . . . . . . . . 12 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩) → 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩)
48	47	sneqd 4596	. . . . . . . . . . 11 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩) → {𝑞} = {⟨(2nd ‘𝑝), (1st ‘𝑝)⟩})
49	48	cnveqd 5863	. . . . . . . . . 10 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩) → ◡{𝑞} = ◡{⟨(2nd ‘𝑝), (1st ‘𝑝)⟩})
50	49	unieqd 4883	. . . . . . . . 9 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩) → ∪ ◡{𝑞} = ∪ ◡{⟨(2nd ‘𝑝), (1st ‘𝑝)⟩})
51	13	ad2antlr 740	. . . . . . . . 9 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩) → ∪ ◡{𝑞} = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩)
52	46, 50, 51	3eqtr2d 2804	. . . . . . . 8 ⊢ (((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) ∧ 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩) → 𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩)
53	43, 52	impbida 813	. . . . . . 7 ⊢ ((((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ ◡𝐴) → (𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ↔ 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩))
54	53	ralrimiva 3158	. . . . . 6 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) → ∀𝑞 ∈ ◡ 𝐴(𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ↔ 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩))
55		eqeq2 2775	. . . . . . . . 9 ⊢ (𝑟 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩ → (𝑞 = 𝑟 ↔ 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩))
56	55	bibi2d 345	. . . . . . . 8 ⊢ (𝑟 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩ → ((𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ↔ 𝑞 = 𝑟) ↔ (𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ↔ 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩)))
57	56	ralbidv 3189	. . . . . . 7 ⊢ (𝑟 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩ → (∀𝑞 ∈ ◡ 𝐴(𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ↔ 𝑞 = 𝑟) ↔ ∀𝑞 ∈ ◡ 𝐴(𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ↔ 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩)))
58	57	rspcev 3580	. . . . . 6 ⊢ ((⟨(2nd ‘𝑝), (1st ‘𝑝)⟩ ∈ ◡𝐴 ∧ ∀𝑞 ∈ ◡ 𝐴(𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ↔ 𝑞 = ⟨(2nd ‘𝑝), (1st ‘𝑝)⟩)) → ∃𝑟 ∈ ◡ 𝐴∀𝑞 ∈ ◡ 𝐴(𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ↔ 𝑞 = 𝑟))
59	32, 54, 58	syl2anc 596	. . . . 5 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) → ∃𝑟 ∈ ◡ 𝐴∀𝑞 ∈ ◡ 𝐴(𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ↔ 𝑞 = 𝑟))
60		reu6 3687	. . . . 5 ⊢ (∃!𝑞 ∈ ◡ 𝐴𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ↔ ∃𝑟 ∈ ◡ 𝐴∀𝑞 ∈ ◡ 𝐴(𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ ↔ 𝑞 = 𝑟))
61	59, 60	sylibr 237	. . . 4 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 ∈ 𝐴) → ∃!𝑞 ∈ ◡ 𝐴𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩)
62		fvex 6927	. . . . . . 7 ⊢ (2nd ‘𝑞) ∈ V
63		fvex 6927	. . . . . . 7 ⊢ (1st ‘𝑞) ∈ V
64	62, 63	op2ndd 8044	. . . . . 6 ⊢ (𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ → (2nd ‘𝑝) = (1st ‘𝑞))
65	64	eqeq2d 2774	. . . . 5 ⊢ (𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩ → (𝑌 = (2nd ‘𝑝) ↔ 𝑌 = (1st ‘𝑞)))
66	65	adantl 487	. . . 4 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑝 = ⟨(2nd ‘𝑞), (1st ‘𝑞)⟩) → (𝑌 = (2nd ‘𝑝) ↔ 𝑌 = (1st ‘𝑞)))
67	21, 61, 66	reuxfr1d 3711	. . 3 ⊢ ((Rel 𝐴 ∧ Fun ◡𝐴) → (∃!𝑝 ∈ 𝐴 𝑌 = (2nd ‘𝑝) ↔ ∃!𝑞 ∈ ◡ 𝐴𝑌 = (1st ‘𝑞)))
68	67	adantr 486	. 2 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑌 ∈ ran 𝐴) → (∃!𝑝 ∈ 𝐴 𝑌 = (2nd ‘𝑝) ↔ ∃!𝑞 ∈ ◡ 𝐴𝑌 = (1st ‘𝑞)))
69	5, 68	mpbird 260	1 ⊢ (((Rel 𝐴 ∧ Fun ◡𝐴) ∧ 𝑌 ∈ ran 𝐴) → ∃!𝑝 ∈ 𝐴 𝑌 = (2nd ‘𝑝))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  ∃!wreu 3367   ⊆ wss 3900  {csn 4588  ⟨cop 4838  ∪ cuni 4870   × cxp 5654  ^◡ccnv 5655  dom cdm 5656  ran crn 5657  Rel wrel 5661  Fun wfun 6558  ‘cfv 6564  1^st c1st 8031  2^nd c2nd 8032

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pr 5396  ax-un 7781

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-iota 6518  df-fun 6566  df-fn 6567  df-fv 6572  df-1st 8033  df-2nd 8034

This theorem is used by:  gsummpt2co  33698