Theorem imasubc2 50065

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 𝐸)𝐺)

Assertion

Ref	Expression
imasubc2	⊢ (𝜑 → 𝐾 ∈ (Subcat‘𝐸))

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

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

Proof of Theorem imasubc2

Step	Hyp	Ref	Expression
1		imasubc.s	. . . 4 ⊢ 𝑆 = (𝐹 “ 𝐴)
2		imasubc.h	. . . 4 ⊢ 𝐻 = (Hom ‘𝐷)
3		imasubc.k	. . . 4 ⊢ 𝐾 = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ ∪ 𝑝 ∈ ((◡𝐹 “ {𝑥}) × (◡𝐹 “ {𝑦}))((𝐺‘𝑝) “ (𝐻‘𝑝)))
4		imasubc.f	. . . 4 ⊢ (𝜑 → 𝐹(𝐷 Full 𝐸)𝐺)
5		eqid 2762	. . . 4 ⊢ (Base‘𝐸) = (Base‘𝐸)
6		eqid 2762	. . . 4 ⊢ (Homf ‘𝐸) = (Homf ‘𝐸)
7	1, 2, 3, 4, 5, 6	imasubc 50064	. . 3 ⊢ (𝜑 → (𝐾 Fn (𝑆 × 𝑆) ∧ 𝑆 ⊆ (Base‘𝐸) ∧ ((Homf ‘𝐸) ↾ (𝑆 × 𝑆)) = 𝐾))
8	7	simp3d 1162	. 2 ⊢ (𝜑 → ((Homf ‘𝐸) ↾ (𝑆 × 𝑆)) = 𝐾)
9		fullfunc 18001	. . . . . 6 ⊢ (𝐷 Full 𝐸) ⊆ (𝐷 Func 𝐸)
10	9	ssbri 5154	. . . . 5 ⊢ (𝐹(𝐷 Full 𝐸)𝐺 → 𝐹(𝐷 Func 𝐸)𝐺)
11	4, 10	syl 18	. . . 4 ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
12	11	funcrcl3 49993	. . 3 ⊢ (𝜑 → 𝐸 ∈ Cat)
13	7	simp2d 1161	. . 3 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝐸))
14	5, 6, 12, 13	fullsubc 17943	. 2 ⊢ (𝜑 → ((Homf ‘𝐸) ↾ (𝑆 × 𝑆)) ∈ (Subcat‘𝐸))
15	8, 14	eqeltrrd 2863	1 ⊢ (𝜑 → 𝐾 ∈ (Subcat‘𝐸))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145   ⊆ wss 3902  {csn 4587  ∪ ciun 4954   class class class wbr 5107   × cxp 5657  ^◡ccnv 5658   ↾ cres 5661   “ cima 5662   Fn wfn 6532  ‘cfv 6537  (class class class)co 7416   ∈ cmpo 7418  Basecbs 17305  Hom chom 17357  Hom_f chomf 17758  Subcatcsubc 17902   Func cfunc 17947   Full cful 17997

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-pow 5334  ax-pr 5402  ax-un 7739

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-rmo 3367  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-pw 4562  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-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-map 8831  df-pm 8832  df-ixp 8908  df-cat 17760  df-cid 17761  df-homf 17762  df-ssc 17903  df-subc 17905  df-func 17951  df-full 17999

This theorem is used by: (None)