Theorem imasubc2 50473

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 2763	. . . 4 ⊢ (Base‘𝐸) = (Base‘𝐸)
6		eqid 2763	. . . 4 ⊢ (Homf ‘𝐸) = (Homf ‘𝐸)
7	1, 2, 3, 4, 5, 6	imasubc 50472	. . 3 ⊢ (𝜑 → (𝐾 Fn (𝑆 × 𝑆) ∧ 𝑆 ⊆ (Base‘𝐸) ∧ ((Homf ‘𝐸) ↾ (𝑆 × 𝑆)) = 𝐾))
8	7	simp3d 1162	. 2 ⊢ (𝜑 → ((Homf ‘𝐸) ↾ (𝑆 × 𝑆)) = 𝐾)
9		fullfunc 18112	. . . . . 6 ⊢ (𝐷 Full 𝐸) ⊆ (𝐷 Func 𝐸)
10	9	ssbri 5153	. . . . 5 ⊢ (𝐹(𝐷 Full 𝐸)𝐺 → 𝐹(𝐷 Func 𝐸)𝐺)
11	4, 10	syl 18	. . . 4 ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
12	11	funcrcl3 50399	. . 3 ⊢ (𝜑 → 𝐸 ∈ Cat)
13	7	simp2d 1161	. . 3 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝐸))
14	5, 6, 12, 13	fullsubc 18054	. 2 ⊢ (𝜑 → ((Homf ‘𝐸) ↾ (𝑆 × 𝑆)) ∈ (Subcat‘𝐸))
15	8, 14	eqeltrrd 2865	1 ⊢ (𝜑 → 𝐾 ∈ (Subcat‘𝐸))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  {csn 4588  ∪ ciun 4954   class class class wbr 5106   × cxp 5653  ^◡ccnv 5654   ↾ cres 5657   “ cima 5658   Fn wfn 6553  ‘cfv 6558  (class class class)co 7443   ∈ cmpo 7445  Basecbs 17416  Hom chom 17468  Hom_f chomf 17869  Subcatcsubc 18013   Func cfunc 18058   Full cful 18108

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-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

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-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026  df-map 8877  df-pm 8878  df-ixp 8954  df-cat 17871  df-cid 17872  df-homf 17873  df-ssc 18014  df-subc 18016  df-func 18062  df-full 18110

This theorem is used by: (None)