Theorem resixpfo 8947

Description: Restriction of elements of an infinite Cartesian product creates a surjection, if the original Cartesian product is nonempty. (Contributed by Mario Carneiro, 27-Aug-2015.)

Hypothesis

Ref	Expression
resixpfo.1	⊢ 𝐹 = (𝑓 ∈ X𝑥 ∈ 𝐴 𝐶 ↦ (𝑓 ↾ 𝐵))

Assertion

Ref	Expression
resixpfo	⊢ ((𝐵 ⊆ 𝐴 ∧ X𝑥 ∈ 𝐴 𝐶 ≠ ∅) → 𝐹:X𝑥 ∈ 𝐴 𝐶–onto→X𝑥 ∈ 𝐵 𝐶)

Distinct variable groups:   𝑥,𝑓,𝐴   𝐵,𝑓,𝑥   𝐶,𝑓

Allowed substitution hints:   𝐶(𝑥)   𝐹(𝑥, 𝑓)

Proof of Theorem resixpfo

Dummy variables 𝑔 ℎ 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		resixp 8944	. . . 4 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑓 ∈ X𝑥 ∈ 𝐴 𝐶) → (𝑓 ↾ 𝐵) ∈ X𝑥 ∈ 𝐵 𝐶)
2		resixpfo.1	. . . 4 ⊢ 𝐹 = (𝑓 ∈ X𝑥 ∈ 𝐴 𝐶 ↦ (𝑓 ↾ 𝐵))
3	1, 2	fmptd 7111	. . 3 ⊢ (𝐵 ⊆ 𝐴 → 𝐹:X𝑥 ∈ 𝐴 𝐶⟶X𝑥 ∈ 𝐵 𝐶)
4	3	adantr 486	. 2 ⊢ ((𝐵 ⊆ 𝐴 ∧ X𝑥 ∈ 𝐴 𝐶 ≠ ∅) → 𝐹:X𝑥 ∈ 𝐴 𝐶⟶X𝑥 ∈ 𝐵 𝐶)
5		n0 4303	. . . 4 ⊢ (X𝑥 ∈ 𝐴 𝐶 ≠ ∅ ↔ ∃𝑔 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶)
6		eleq1w 2845	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
7	6	ifbid 4509	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → if(𝑧 ∈ 𝐵, ℎ, 𝑔) = if(𝑥 ∈ 𝐵, ℎ, 𝑔))
8		id 23	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → 𝑧 = 𝑥)
9	7, 8	fveq12d 6889	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧) = (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥))
10	9	cbvmptv 5213	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)) = (𝑥 ∈ 𝐴 ↦ (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥))
11		vex 3457	. . . . . . . . . . . . . . . 16 ⊢ ℎ ∈ V
12	11	elixp 8915	. . . . . . . . . . . . . . 15 ⊢ (ℎ ∈ X𝑥 ∈ 𝐵 𝐶 ↔ (ℎ Fn 𝐵 ∧ ∀𝑥 ∈ 𝐵 (ℎ‘𝑥) ∈ 𝐶))
13	12	simprbi 503	. . . . . . . . . . . . . 14 ⊢ (ℎ ∈ X𝑥 ∈ 𝐵 𝐶 → ∀𝑥 ∈ 𝐵 (ℎ‘𝑥) ∈ 𝐶)
14		fveq1 6881	. . . . . . . . . . . . . . . . . 18 ⊢ (ℎ = if(𝑥 ∈ 𝐵, ℎ, 𝑔) → (ℎ‘𝑥) = (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥))
15	14	eleq1d 2847	. . . . . . . . . . . . . . . . 17 ⊢ (ℎ = if(𝑥 ∈ 𝐵, ℎ, 𝑔) → ((ℎ‘𝑥) ∈ 𝐶 ↔ (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥) ∈ 𝐶))
16		fveq1 6881	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑔 = if(𝑥 ∈ 𝐵, ℎ, 𝑔) → (𝑔‘𝑥) = (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥))
17	16	eleq1d 2847	. . . . . . . . . . . . . . . . 17 ⊢ (𝑔 = if(𝑥 ∈ 𝐵, ℎ, 𝑔) → ((𝑔‘𝑥) ∈ 𝐶 ↔ (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥) ∈ 𝐶))
18		simpl 488	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑥 ∈ 𝐵 → (ℎ‘𝑥) ∈ 𝐶) ∧ (𝑥 ∈ 𝐴 ∧ (𝑔‘𝑥) ∈ 𝐶)) → (𝑥 ∈ 𝐵 → (ℎ‘𝑥) ∈ 𝐶))
19	18	imp 412	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑥 ∈ 𝐵 → (ℎ‘𝑥) ∈ 𝐶) ∧ (𝑥 ∈ 𝐴 ∧ (𝑔‘𝑥) ∈ 𝐶)) ∧ 𝑥 ∈ 𝐵) → (ℎ‘𝑥) ∈ 𝐶)
20		simplrr 790	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑥 ∈ 𝐵 → (ℎ‘𝑥) ∈ 𝐶) ∧ (𝑥 ∈ 𝐴 ∧ (𝑔‘𝑥) ∈ 𝐶)) ∧ ¬ 𝑥 ∈ 𝐵) → (𝑔‘𝑥) ∈ 𝐶)
21	15, 17, 19, 20	ifbothda 4524	. . . . . . . . . . . . . . . 16 ⊢ (((𝑥 ∈ 𝐵 → (ℎ‘𝑥) ∈ 𝐶) ∧ (𝑥 ∈ 𝐴 ∧ (𝑔‘𝑥) ∈ 𝐶)) → (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥) ∈ 𝐶)
22	21	exp32 426	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ 𝐵 → (ℎ‘𝑥) ∈ 𝐶) → (𝑥 ∈ 𝐴 → ((𝑔‘𝑥) ∈ 𝐶 → (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥) ∈ 𝐶)))
23	22	ralimi2 3096	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ 𝐵 (ℎ‘𝑥) ∈ 𝐶 → ∀𝑥 ∈ 𝐴 ((𝑔‘𝑥) ∈ 𝐶 → (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥) ∈ 𝐶))
24	13, 23	syl 18	. . . . . . . . . . . . 13 ⊢ (ℎ ∈ X𝑥 ∈ 𝐵 𝐶 → ∀𝑥 ∈ 𝐴 ((𝑔‘𝑥) ∈ 𝐶 → (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥) ∈ 𝐶))
25	24	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) → ∀𝑥 ∈ 𝐴 ((𝑔‘𝑥) ∈ 𝐶 → (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥) ∈ 𝐶))
26		ralim 3104	. . . . . . . . . . . 12 ⊢ (∀𝑥 ∈ 𝐴 ((𝑔‘𝑥) ∈ 𝐶 → (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥) ∈ 𝐶) → (∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ 𝐶 → ∀𝑥 ∈ 𝐴 (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥) ∈ 𝐶))
27	25, 26	syl 18	. . . . . . . . . . 11 ⊢ ((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) → (∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ 𝐶 → ∀𝑥 ∈ 𝐴 (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥) ∈ 𝐶))
28		vex 3457	. . . . . . . . . . . . 13 ⊢ 𝑔 ∈ V
29	28	elixp 8915	. . . . . . . . . . . 12 ⊢ (𝑔 ∈ X𝑥 ∈ 𝐴 𝐶 ↔ (𝑔 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ 𝐶))
30	29	simprbi 503	. . . . . . . . . . 11 ⊢ (𝑔 ∈ X𝑥 ∈ 𝐴 𝐶 → ∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ 𝐶)
31	27, 30	impel 515	. . . . . . . . . 10 ⊢ (((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) ∧ 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶) → ∀𝑥 ∈ 𝐴 (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥) ∈ 𝐶)
32		n0i 4289	. . . . . . . . . . . . 13 ⊢ (𝑔 ∈ X𝑥 ∈ 𝐴 𝐶 → ¬ X𝑥 ∈ 𝐴 𝐶 = ∅)
33		ixpprc 8930	. . . . . . . . . . . . 13 ⊢ (¬ 𝐴 ∈ V → X𝑥 ∈ 𝐴 𝐶 = ∅)
34	32, 33	nsyl2 142	. . . . . . . . . . . 12 ⊢ (𝑔 ∈ X𝑥 ∈ 𝐴 𝐶 → 𝐴 ∈ V)
35	34	adantl 487	. . . . . . . . . . 11 ⊢ (((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) ∧ 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶) → 𝐴 ∈ V)
36		mptelixpg 8946	. . . . . . . . . . 11 ⊢ (𝐴 ∈ V → ((𝑥 ∈ 𝐴 ↦ (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥)) ∈ X𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥) ∈ 𝐶))
37	35, 36	syl 18	. . . . . . . . . 10 ⊢ (((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) ∧ 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶) → ((𝑥 ∈ 𝐴 ↦ (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥)) ∈ X𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥) ∈ 𝐶))
38	31, 37	mpbird 260	. . . . . . . . 9 ⊢ (((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) ∧ 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶) → (𝑥 ∈ 𝐴 ↦ (if(𝑥 ∈ 𝐵, ℎ, 𝑔)‘𝑥)) ∈ X𝑥 ∈ 𝐴 𝐶)
39	10, 38	eqeltrid 2866	. . . . . . . 8 ⊢ (((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) ∧ 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶) → (𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)) ∈ X𝑥 ∈ 𝐴 𝐶)
40		reseq1 5970	. . . . . . . . . 10 ⊢ (𝑓 = (𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)) → (𝑓 ↾ 𝐵) = ((𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)) ↾ 𝐵))
41		iftrue 4491	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ 𝐵 → if(𝑧 ∈ 𝐵, ℎ, 𝑔) = ℎ)
42	41	fveq1d 6884	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝐵 → (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧) = (ℎ‘𝑧))
43	42	mpteq2ia 5204	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝐵 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)) = (𝑧 ∈ 𝐵 ↦ (ℎ‘𝑧))
44		resmpt 6037	. . . . . . . . . . . . 13 ⊢ (𝐵 ⊆ 𝐴 → ((𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)) ↾ 𝐵) = (𝑧 ∈ 𝐵 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)))
45	44	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) ∧ 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶) → ((𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)) ↾ 𝐵) = (𝑧 ∈ 𝐵 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)))
46		ixpfn 8914	. . . . . . . . . . . . . 14 ⊢ (ℎ ∈ X𝑥 ∈ 𝐵 𝐶 → ℎ Fn 𝐵)
47	46	ad2antlr 740	. . . . . . . . . . . . 13 ⊢ (((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) ∧ 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶) → ℎ Fn 𝐵)
48		dffn5 6940	. . . . . . . . . . . . 13 ⊢ (ℎ Fn 𝐵 ↔ ℎ = (𝑧 ∈ 𝐵 ↦ (ℎ‘𝑧)))
49	47, 48	sylib 221	. . . . . . . . . . . 12 ⊢ (((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) ∧ 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶) → ℎ = (𝑧 ∈ 𝐵 ↦ (ℎ‘𝑧)))
50	43, 45, 49	3eqtr4a 2823	. . . . . . . . . . 11 ⊢ (((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) ∧ 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶) → ((𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)) ↾ 𝐵) = ℎ)
51	50, 11	eqeltrdi 2870	. . . . . . . . . 10 ⊢ (((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) ∧ 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶) → ((𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)) ↾ 𝐵) ∈ V)
52	2, 40, 39, 51	fvmptd3 7014	. . . . . . . . 9 ⊢ (((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) ∧ 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶) → (𝐹‘(𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧))) = ((𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)) ↾ 𝐵))
53	52, 50	eqtr2d 2798	. . . . . . . 8 ⊢ (((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) ∧ 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶) → ℎ = (𝐹‘(𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧))))
54		fveq2 6882	. . . . . . . . 9 ⊢ (𝑦 = (𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)) → (𝐹‘𝑦) = (𝐹‘(𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧))))
55	54	rspceeqv 3602	. . . . . . . 8 ⊢ (((𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)) ∈ X𝑥 ∈ 𝐴 𝐶 ∧ ℎ = (𝐹‘(𝑧 ∈ 𝐴 ↦ (if(𝑧 ∈ 𝐵, ℎ, 𝑔)‘𝑧)))) → ∃𝑦 ∈ X 𝑥 ∈ 𝐴 𝐶ℎ = (𝐹‘𝑦))
56	39, 53, 55	syl2anc 596	. . . . . . 7 ⊢ (((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) ∧ 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶) → ∃𝑦 ∈ X 𝑥 ∈ 𝐴 𝐶ℎ = (𝐹‘𝑦))
57	56	ex 418	. . . . . 6 ⊢ ((𝐵 ⊆ 𝐴 ∧ ℎ ∈ X𝑥 ∈ 𝐵 𝐶) → (𝑔 ∈ X𝑥 ∈ 𝐴 𝐶 → ∃𝑦 ∈ X 𝑥 ∈ 𝐴 𝐶ℎ = (𝐹‘𝑦)))
58	57	ralrimdva 3164	. . . . 5 ⊢ (𝐵 ⊆ 𝐴 → (𝑔 ∈ X𝑥 ∈ 𝐴 𝐶 → ∀ℎ ∈ X 𝑥 ∈ 𝐵 𝐶∃𝑦 ∈ X 𝑥 ∈ 𝐴 𝐶ℎ = (𝐹‘𝑦)))
59	58	exlimdv 1966	. . . 4 ⊢ (𝐵 ⊆ 𝐴 → (∃𝑔 𝑔 ∈ X𝑥 ∈ 𝐴 𝐶 → ∀ℎ ∈ X 𝑥 ∈ 𝐵 𝐶∃𝑦 ∈ X 𝑥 ∈ 𝐴 𝐶ℎ = (𝐹‘𝑦)))
60	5, 59	biimtrid 245	. . 3 ⊢ (𝐵 ⊆ 𝐴 → (X𝑥 ∈ 𝐴 𝐶 ≠ ∅ → ∀ℎ ∈ X 𝑥 ∈ 𝐵 𝐶∃𝑦 ∈ X 𝑥 ∈ 𝐴 𝐶ℎ = (𝐹‘𝑦)))
61	60	imp 412	. 2 ⊢ ((𝐵 ⊆ 𝐴 ∧ X𝑥 ∈ 𝐴 𝐶 ≠ ∅) → ∀ℎ ∈ X 𝑥 ∈ 𝐵 𝐶∃𝑦 ∈ X 𝑥 ∈ 𝐴 𝐶ℎ = (𝐹‘𝑦))
62		dffo3 7099	. 2 ⊢ (𝐹:X𝑥 ∈ 𝐴 𝐶–onto→X𝑥 ∈ 𝐵 𝐶 ↔ (𝐹:X𝑥 ∈ 𝐴 𝐶⟶X𝑥 ∈ 𝐵 𝐶 ∧ ∀ℎ ∈ X 𝑥 ∈ 𝐵 𝐶∃𝑦 ∈ X 𝑥 ∈ 𝐴 𝐶ℎ = (𝐹‘𝑦)))
63	4, 61, 62	sylanbrc 595	1 ⊢ ((𝐵 ⊆ 𝐴 ∧ X𝑥 ∈ 𝐴 𝐶 ≠ ∅) → 𝐹:X𝑥 ∈ 𝐴 𝐶–onto→X𝑥 ∈ 𝐵 𝐶)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  Vcvv 3453   ⊆ wss 3902  ∅c0 4282  ifcif 4485   ↦ cmpt 5190   ↾ cres 5661   Fn wfn 6532  ⟶wf 6533  –onto→wfo 6535  ‘cfv 6537  Xcixp 8908

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7740

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ixp 8909

This theorem is used by:  ptcmplem2  24285