Theorem imasubc 49130

Description: An image of a full functor is a full subcategory. Remark 4.2(3) of [Adamek] p. 48. (Contributed by Zhi Wang, 7-Nov-2025.)

Hypotheses

Ref	Expression
imasubc.s	⊢ 𝑆 = (𝐹 “ 𝐴)
imasubc.h	⊢ 𝐻 = (Hom ‘𝐷)
imasubc.k	⊢ 𝐾 = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ ∪ 𝑝 ∈ ((◡𝐹 “ {𝑥}) × (◡𝐹 “ {𝑦}))((𝐺‘𝑝) “ (𝐻‘𝑝)))
imasubc.f	⊢ (𝜑 → 𝐹(𝐷 Full 𝐸)𝐺)
imasubc.c	⊢ 𝐶 = (Base‘𝐸)
imasubc.j	⊢ 𝐽 = (Homf ‘𝐸)

Assertion

Ref	Expression
imasubc	⊢ (𝜑 → (𝐾 Fn (𝑆 × 𝑆) ∧ 𝑆 ⊆ 𝐶 ∧ (𝐽 ↾ (𝑆 × 𝑆)) = 𝐾))

Distinct variable groups:   𝐹,𝑝,𝑥,𝑦   𝐺,𝑝,𝑥,𝑦   𝐻,𝑝,𝑥,𝑦   𝑥,𝑆,𝑦   𝐸,𝑝   𝜑,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑝)   𝐴(𝑥,𝑦,𝑝)   𝐶(𝑥,𝑦,𝑝)   𝐷(𝑥,𝑦,𝑝)   𝑆(𝑝)   𝐸(𝑥,𝑦)   𝐽(𝑥,𝑦,𝑝)   𝐾(𝑥,𝑦,𝑝)

Proof of Theorem imasubc

Dummy variables 𝑚 𝑛 𝑞 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		imasubc.f	. . . 4 ⊢ (𝜑 → 𝐹(𝐷 Full 𝐸)𝐺)
2		relfull 17878	. . . . 5 ⊢ Rel (𝐷 Full 𝐸)
3	2	brrelex1i 5696	. . . 4 ⊢ (𝐹(𝐷 Full 𝐸)𝐺 → 𝐹 ∈ V)
4	1, 3	syl 17	. . 3 ⊢ (𝜑 → 𝐹 ∈ V)
5		imasubc.k	. . 3 ⊢ 𝐾 = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ ∪ 𝑝 ∈ ((◡𝐹 “ {𝑥}) × (◡𝐹 “ {𝑦}))((𝐺‘𝑝) “ (𝐻‘𝑝)))
6	4, 4, 5	imasubclem2 49084	. 2 ⊢ (𝜑 → 𝐾 Fn (𝑆 × 𝑆))
7		imasubc.s	. . 3 ⊢ 𝑆 = (𝐹 “ 𝐴)
8		eqid 2730	. . . . 5 ⊢ (Base‘𝐷) = (Base‘𝐷)
9		imasubc.c	. . . . 5 ⊢ 𝐶 = (Base‘𝐸)
10		fullfunc 17876	. . . . . . 7 ⊢ (𝐷 Full 𝐸) ⊆ (𝐷 Func 𝐸)
11	10	ssbri 5154	. . . . . 6 ⊢ (𝐹(𝐷 Full 𝐸)𝐺 → 𝐹(𝐷 Func 𝐸)𝐺)
12	1, 11	syl 17	. . . . 5 ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
13	8, 9, 12	funcf1 17834	. . . 4 ⊢ (𝜑 → 𝐹:(Base‘𝐷)⟶𝐶)
14	13	fimassd 6711	. . 3 ⊢ (𝜑 → (𝐹 “ 𝐴) ⊆ 𝐶)
15	7, 14	eqsstrid 3987	. 2 ⊢ (𝜑 → 𝑆 ⊆ 𝐶)
16		simprl 770	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → 𝑧 ∈ 𝑆)
17	16, 7	eleqtrdi 2839	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → 𝑧 ∈ (𝐹 “ 𝐴))
18		inisegn0a 48814	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝐹 “ 𝐴) → (◡𝐹 “ {𝑧}) ≠ ∅)
19	17, 18	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → (◡𝐹 “ {𝑧}) ≠ ∅)
20		simprr 772	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → 𝑤 ∈ 𝑆)
21	20, 7	eleqtrdi 2839	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → 𝑤 ∈ (𝐹 “ 𝐴))
22		inisegn0a 48814	. . . . . . . . . 10 ⊢ (𝑤 ∈ (𝐹 “ 𝐴) → (◡𝐹 “ {𝑤}) ≠ ∅)
23	21, 22	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → (◡𝐹 “ {𝑤}) ≠ ∅)
24	19, 23	jca 511	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → ((◡𝐹 “ {𝑧}) ≠ ∅ ∧ (◡𝐹 “ {𝑤}) ≠ ∅))
25		xpnz 6134	. . . . . . . 8 ⊢ (((◡𝐹 “ {𝑧}) ≠ ∅ ∧ (◡𝐹 “ {𝑤}) ≠ ∅) ↔ ((◡𝐹 “ {𝑧}) × (◡𝐹 “ {𝑤})) ≠ ∅)
26	24, 25	sylib 218	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → ((◡𝐹 “ {𝑧}) × (◡𝐹 “ {𝑤})) ≠ ∅)
27	13	ffnd 6691	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹 Fn (Base‘𝐷))
28	27	ad2antrr 726	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → 𝐹 Fn (Base‘𝐷))
29		simprl 770	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → 𝑚 ∈ (◡𝐹 “ {𝑧}))
30		fniniseg 7034	. . . . . . . . . . . . . . 15 ⊢ (𝐹 Fn (Base‘𝐷) → (𝑚 ∈ (◡𝐹 “ {𝑧}) ↔ (𝑚 ∈ (Base‘𝐷) ∧ (𝐹‘𝑚) = 𝑧)))
31	30	biimpa 476	. . . . . . . . . . . . . 14 ⊢ ((𝐹 Fn (Base‘𝐷) ∧ 𝑚 ∈ (◡𝐹 “ {𝑧})) → (𝑚 ∈ (Base‘𝐷) ∧ (𝐹‘𝑚) = 𝑧))
32	28, 29, 31	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → (𝑚 ∈ (Base‘𝐷) ∧ (𝐹‘𝑚) = 𝑧))
33	32	simprd 495	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → (𝐹‘𝑚) = 𝑧)
34		simprr 772	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → 𝑛 ∈ (◡𝐹 “ {𝑤}))
35		fniniseg 7034	. . . . . . . . . . . . . . 15 ⊢ (𝐹 Fn (Base‘𝐷) → (𝑛 ∈ (◡𝐹 “ {𝑤}) ↔ (𝑛 ∈ (Base‘𝐷) ∧ (𝐹‘𝑛) = 𝑤)))
36	35	biimpa 476	. . . . . . . . . . . . . 14 ⊢ ((𝐹 Fn (Base‘𝐷) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤})) → (𝑛 ∈ (Base‘𝐷) ∧ (𝐹‘𝑛) = 𝑤))
37	28, 34, 36	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → (𝑛 ∈ (Base‘𝐷) ∧ (𝐹‘𝑛) = 𝑤))
38	37	simprd 495	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → (𝐹‘𝑛) = 𝑤)
39	33, 38	oveq12d 7407	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → ((𝐹‘𝑚)(Hom ‘𝐸)(𝐹‘𝑛)) = (𝑧(Hom ‘𝐸)𝑤))
40		eqid 2730	. . . . . . . . . . . 12 ⊢ (Hom ‘𝐸) = (Hom ‘𝐸)
41		imasubc.h	. . . . . . . . . . . 12 ⊢ 𝐻 = (Hom ‘𝐷)
42	1	ad2antrr 726	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → 𝐹(𝐷 Full 𝐸)𝐺)
43	32	simpld 494	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → 𝑚 ∈ (Base‘𝐷))
44	37	simpld 494	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → 𝑛 ∈ (Base‘𝐷))
45	8, 40, 41, 42, 43, 44	fullfo 17882	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → (𝑚𝐺𝑛):(𝑚𝐻𝑛)–onto→((𝐹‘𝑚)(Hom ‘𝐸)(𝐹‘𝑛)))
46		foeq3 6772	. . . . . . . . . . . 12 ⊢ (((𝐹‘𝑚)(Hom ‘𝐸)(𝐹‘𝑛)) = (𝑧(Hom ‘𝐸)𝑤) → ((𝑚𝐺𝑛):(𝑚𝐻𝑛)–onto→((𝐹‘𝑚)(Hom ‘𝐸)(𝐹‘𝑛)) ↔ (𝑚𝐺𝑛):(𝑚𝐻𝑛)–onto→(𝑧(Hom ‘𝐸)𝑤)))
47	46	biimpa 476	. . . . . . . . . . 11 ⊢ ((((𝐹‘𝑚)(Hom ‘𝐸)(𝐹‘𝑛)) = (𝑧(Hom ‘𝐸)𝑤) ∧ (𝑚𝐺𝑛):(𝑚𝐻𝑛)–onto→((𝐹‘𝑚)(Hom ‘𝐸)(𝐹‘𝑛))) → (𝑚𝐺𝑛):(𝑚𝐻𝑛)–onto→(𝑧(Hom ‘𝐸)𝑤))
48	39, 45, 47	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → (𝑚𝐺𝑛):(𝑚𝐻𝑛)–onto→(𝑧(Hom ‘𝐸)𝑤))
49		foima 6779	. . . . . . . . . 10 ⊢ ((𝑚𝐺𝑛):(𝑚𝐻𝑛)–onto→(𝑧(Hom ‘𝐸)𝑤) → ((𝑚𝐺𝑛) “ (𝑚𝐻𝑛)) = (𝑧(Hom ‘𝐸)𝑤))
50	48, 49	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ (𝑚 ∈ (◡𝐹 “ {𝑧}) ∧ 𝑛 ∈ (◡𝐹 “ {𝑤}))) → ((𝑚𝐺𝑛) “ (𝑚𝐻𝑛)) = (𝑧(Hom ‘𝐸)𝑤))
51	50	ralrimivva 3181	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → ∀𝑚 ∈ (◡𝐹 “ {𝑧})∀𝑛 ∈ (◡𝐹 “ {𝑤})((𝑚𝐺𝑛) “ (𝑚𝐻𝑛)) = (𝑧(Hom ‘𝐸)𝑤))
52		fveq2 6860	. . . . . . . . . . . 12 ⊢ (𝑝 = ⟨𝑚, 𝑛⟩ → (𝐺‘𝑝) = (𝐺‘⟨𝑚, 𝑛⟩))
53		df-ov 7392	. . . . . . . . . . . 12 ⊢ (𝑚𝐺𝑛) = (𝐺‘⟨𝑚, 𝑛⟩)
54	52, 53	eqtr4di 2783	. . . . . . . . . . 11 ⊢ (𝑝 = ⟨𝑚, 𝑛⟩ → (𝐺‘𝑝) = (𝑚𝐺𝑛))
55		fveq2 6860	. . . . . . . . . . . 12 ⊢ (𝑝 = ⟨𝑚, 𝑛⟩ → (𝐻‘𝑝) = (𝐻‘⟨𝑚, 𝑛⟩))
56		df-ov 7392	. . . . . . . . . . . 12 ⊢ (𝑚𝐻𝑛) = (𝐻‘⟨𝑚, 𝑛⟩)
57	55, 56	eqtr4di 2783	. . . . . . . . . . 11 ⊢ (𝑝 = ⟨𝑚, 𝑛⟩ → (𝐻‘𝑝) = (𝑚𝐻𝑛))
58	54, 57	imaeq12d 6034	. . . . . . . . . 10 ⊢ (𝑝 = ⟨𝑚, 𝑛⟩ → ((𝐺‘𝑝) “ (𝐻‘𝑝)) = ((𝑚𝐺𝑛) “ (𝑚𝐻𝑛)))
59	58	eqeq1d 2732	. . . . . . . . 9 ⊢ (𝑝 = ⟨𝑚, 𝑛⟩ → (((𝐺‘𝑝) “ (𝐻‘𝑝)) = (𝑧(Hom ‘𝐸)𝑤) ↔ ((𝑚𝐺𝑛) “ (𝑚𝐻𝑛)) = (𝑧(Hom ‘𝐸)𝑤)))
60	59	ralxp 5807	. . . . . . . 8 ⊢ (∀𝑝 ∈ ((◡𝐹 “ {𝑧}) × (◡𝐹 “ {𝑤}))((𝐺‘𝑝) “ (𝐻‘𝑝)) = (𝑧(Hom ‘𝐸)𝑤) ↔ ∀𝑚 ∈ (◡𝐹 “ {𝑧})∀𝑛 ∈ (◡𝐹 “ {𝑤})((𝑚𝐺𝑛) “ (𝑚𝐻𝑛)) = (𝑧(Hom ‘𝐸)𝑤))
61	51, 60	sylibr 234	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → ∀𝑝 ∈ ((◡𝐹 “ {𝑧}) × (◡𝐹 “ {𝑤}))((𝐺‘𝑝) “ (𝐻‘𝑝)) = (𝑧(Hom ‘𝐸)𝑤))
62		iuneqconst2 48801	. . . . . . 7 ⊢ ((((◡𝐹 “ {𝑧}) × (◡𝐹 “ {𝑤})) ≠ ∅ ∧ ∀𝑝 ∈ ((◡𝐹 “ {𝑧}) × (◡𝐹 “ {𝑤}))((𝐺‘𝑝) “ (𝐻‘𝑝)) = (𝑧(Hom ‘𝐸)𝑤)) → ∪ 𝑝 ∈ ((◡𝐹 “ {𝑧}) × (◡𝐹 “ {𝑤}))((𝐺‘𝑝) “ (𝐻‘𝑝)) = (𝑧(Hom ‘𝐸)𝑤))
63	26, 61, 62	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → ∪ 𝑝 ∈ ((◡𝐹 “ {𝑧}) × (◡𝐹 “ {𝑤}))((𝐺‘𝑝) “ (𝐻‘𝑝)) = (𝑧(Hom ‘𝐸)𝑤))
64	4	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → 𝐹 ∈ V)
65	64, 64, 16, 20, 5	imasubclem3 49085	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → (𝑧𝐾𝑤) = ∪ 𝑝 ∈ ((◡𝐹 “ {𝑧}) × (◡𝐹 “ {𝑤}))((𝐺‘𝑝) “ (𝐻‘𝑝)))
66		imasubc.j	. . . . . . 7 ⊢ 𝐽 = (Homf ‘𝐸)
67	15	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → 𝑆 ⊆ 𝐶)
68	67, 16	sseldd 3949	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → 𝑧 ∈ 𝐶)
69	67, 20	sseldd 3949	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → 𝑤 ∈ 𝐶)
70	66, 9, 40, 68, 69	homfval 17659	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → (𝑧𝐽𝑤) = (𝑧(Hom ‘𝐸)𝑤))
71	63, 65, 70	3eqtr4rd 2776	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → (𝑧𝐽𝑤) = (𝑧𝐾𝑤))
72	71	ralrimivva 3181	. . . 4 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 ∀𝑤 ∈ 𝑆 (𝑧𝐽𝑤) = (𝑧𝐾𝑤))
73		fveq2 6860	. . . . . . 7 ⊢ (𝑞 = ⟨𝑧, 𝑤⟩ → (𝐽‘𝑞) = (𝐽‘⟨𝑧, 𝑤⟩))
74		df-ov 7392	. . . . . . 7 ⊢ (𝑧𝐽𝑤) = (𝐽‘⟨𝑧, 𝑤⟩)
75	73, 74	eqtr4di 2783	. . . . . 6 ⊢ (𝑞 = ⟨𝑧, 𝑤⟩ → (𝐽‘𝑞) = (𝑧𝐽𝑤))
76		fveq2 6860	. . . . . . 7 ⊢ (𝑞 = ⟨𝑧, 𝑤⟩ → (𝐾‘𝑞) = (𝐾‘⟨𝑧, 𝑤⟩))
77		df-ov 7392	. . . . . . 7 ⊢ (𝑧𝐾𝑤) = (𝐾‘⟨𝑧, 𝑤⟩)
78	76, 77	eqtr4di 2783	. . . . . 6 ⊢ (𝑞 = ⟨𝑧, 𝑤⟩ → (𝐾‘𝑞) = (𝑧𝐾𝑤))
79	75, 78	eqeq12d 2746	. . . . 5 ⊢ (𝑞 = ⟨𝑧, 𝑤⟩ → ((𝐽‘𝑞) = (𝐾‘𝑞) ↔ (𝑧𝐽𝑤) = (𝑧𝐾𝑤)))
80	79	ralxp 5807	. . . 4 ⊢ (∀𝑞 ∈ (𝑆 × 𝑆)(𝐽‘𝑞) = (𝐾‘𝑞) ↔ ∀𝑧 ∈ 𝑆 ∀𝑤 ∈ 𝑆 (𝑧𝐽𝑤) = (𝑧𝐾𝑤))
81	72, 80	sylibr 234	. . 3 ⊢ (𝜑 → ∀𝑞 ∈ (𝑆 × 𝑆)(𝐽‘𝑞) = (𝐾‘𝑞))
82	66, 9	homffn 17660	. . . . 5 ⊢ 𝐽 Fn (𝐶 × 𝐶)
83	82	a1i 11	. . . 4 ⊢ (𝜑 → 𝐽 Fn (𝐶 × 𝐶))
84		xpss12 5655	. . . . 5 ⊢ ((𝑆 ⊆ 𝐶 ∧ 𝑆 ⊆ 𝐶) → (𝑆 × 𝑆) ⊆ (𝐶 × 𝐶))
85	15, 15, 84	syl2anc 584	. . . 4 ⊢ (𝜑 → (𝑆 × 𝑆) ⊆ (𝐶 × 𝐶))
86		fvreseq1 7013	. . . 4 ⊢ (((𝐽 Fn (𝐶 × 𝐶) ∧ 𝐾 Fn (𝑆 × 𝑆)) ∧ (𝑆 × 𝑆) ⊆ (𝐶 × 𝐶)) → ((𝐽 ↾ (𝑆 × 𝑆)) = 𝐾 ↔ ∀𝑞 ∈ (𝑆 × 𝑆)(𝐽‘𝑞) = (𝐾‘𝑞)))
87	83, 6, 85, 86	syl21anc 837	. . 3 ⊢ (𝜑 → ((𝐽 ↾ (𝑆 × 𝑆)) = 𝐾 ↔ ∀𝑞 ∈ (𝑆 × 𝑆)(𝐽‘𝑞) = (𝐾‘𝑞)))
88	81, 87	mpbird 257	. 2 ⊢ (𝜑 → (𝐽 ↾ (𝑆 × 𝑆)) = 𝐾)
89	6, 15, 88	3jca 1128	1 ⊢ (𝜑 → (𝐾 Fn (𝑆 × 𝑆) ∧ 𝑆 ⊆ 𝐶 ∧ (𝐽 ↾ (𝑆 × 𝑆)) = 𝐾))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2926  ∀wral 3045  Vcvv 3450   ⊆ wss 3916  ∅c0 4298  {csn 4591  ⟨cop 4597  ∪ ciun 4957   class class class wbr 5109   × cxp 5638  ^◡ccnv 5639   ↾ cres 5642   “ cima 5643   Fn wfn 6508  –onto→wfo 6511  ‘cfv 6513  (class class class)co 7389   ∈ cmpo 7391  Basecbs 17185  Hom chom 17237  Hom_f chomf 17633   Func cfunc 17822   Full cful 17872

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5236  ax-sep 5253  ax-nul 5263  ax-pow 5322  ax-pr 5389  ax-un 7713

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3756  df-csb 3865  df-dif 3919  df-un 3921  df-in 3923  df-ss 3933  df-nul 4299  df-if 4491  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5110  df-opab 5172  df-mpt 5191  df-id 5535  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-iota 6466  df-fun 6515  df-fn 6516  df-f 6517  df-f1 6518  df-fo 6519  df-f1o 6520  df-fv 6521  df-ov 7392  df-oprab 7393  df-mpo 7394  df-1st 7970  df-2nd 7971  df-map 8803  df-ixp 8873  df-homf 17637  df-func 17826  df-full 17874

This theorem is referenced by:  imasubc2  49131  idfullsubc  49140