Theorem idfullsubc 50422

Description: The source category of an inclusion functor is a full subcategory of the target category if the inclusion functor is full. Remark 4.4(2) in [Adamek] p. 49. See also ressffth 18130. (Contributed by Zhi Wang, 11-Nov-2025.)

Hypotheses

Ref	Expression
idfth.i	⊢ 𝐼 = (idfunc‘𝐶)
idsubc.h	⊢ 𝐻 = (Homf ‘𝐷)
idfullsubc.j	⊢ 𝐽 = (Homf ‘𝐸)
idfullsubc.b	⊢ 𝐵 = (Base‘𝐷)
idfullsubc.c	⊢ 𝐶 = (Base‘𝐸)

Assertion

Ref	Expression
idfullsubc	⊢ (𝐼 ∈ (𝐷 Full 𝐸) → (𝐵 ⊆ 𝐶 ∧ (𝐽 ↾ (𝐵 × 𝐵)) = 𝐻))

Proof of Theorem idfullsubc

Dummy variables 𝑝 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		idfullsubc.b	. . . 4 ⊢ 𝐵 = (Base‘𝐷)
2		idfth.i	. . . . 5 ⊢ 𝐼 = (idfunc‘𝐶)
3		fullfunc 18098	. . . . . 6 ⊢ (𝐷 Full 𝐸) ⊆ (𝐷 Func 𝐸)
4	3	sseli 3909	. . . . 5 ⊢ (𝐼 ∈ (𝐷 Full 𝐸) → 𝐼 ∈ (𝐷 Func 𝐸))
5	2, 4	imaidfu2lem 50370	. . . 4 ⊢ (𝐼 ∈ (𝐷 Full 𝐸) → ((1st ‘𝐼) “ (Base‘𝐷)) = (Base‘𝐷))
6	1, 5	eqtr4id 2817	. . 3 ⊢ (𝐼 ∈ (𝐷 Full 𝐸) → 𝐵 = ((1st ‘𝐼) “ (Base‘𝐷)))
7		eqid 2763	. . . . 5 ⊢ ((1st ‘𝐼) “ (Base‘𝐷)) = ((1st ‘𝐼) “ (Base‘𝐷))
8		eqid 2763	. . . . 5 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
9		eqid 2763	. . . . 5 ⊢ (𝑥 ∈ ((1st ‘𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st ‘𝐼) “ (Base‘𝐷)) ↦ ∪ 𝑝 ∈ ((◡(1st ‘𝐼) “ {𝑥}) × (◡(1st ‘𝐼) “ {𝑦}))(((2nd ‘𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝))) = (𝑥 ∈ ((1st ‘𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st ‘𝐼) “ (Base‘𝐷)) ↦ ∪ 𝑝 ∈ ((◡(1st ‘𝐼) “ {𝑥}) × (◡(1st ‘𝐼) “ {𝑦}))(((2nd ‘𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝)))
10		relfull 18100	. . . . . 6 ⊢ Rel (𝐷 Full 𝐸)
11		1st2ndbr 8063	. . . . . 6 ⊢ ((Rel (𝐷 Full 𝐸) ∧ 𝐼 ∈ (𝐷 Full 𝐸)) → (1st ‘𝐼)(𝐷 Full 𝐸)(2nd ‘𝐼))
12	10, 11	mpan 703	. . . . 5 ⊢ (𝐼 ∈ (𝐷 Full 𝐸) → (1st ‘𝐼)(𝐷 Full 𝐸)(2nd ‘𝐼))
13		idfullsubc.c	. . . . 5 ⊢ 𝐶 = (Base‘𝐸)
14		idfullsubc.j	. . . . 5 ⊢ 𝐽 = (Homf ‘𝐸)
15	7, 8, 9, 12, 13, 14	imasubc 50412	. . . 4 ⊢ (𝐼 ∈ (𝐷 Full 𝐸) → ((𝑥 ∈ ((1st ‘𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st ‘𝐼) “ (Base‘𝐷)) ↦ ∪ 𝑝 ∈ ((◡(1st ‘𝐼) “ {𝑥}) × (◡(1st ‘𝐼) “ {𝑦}))(((2nd ‘𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝))) Fn (((1st ‘𝐼) “ (Base‘𝐷)) × ((1st ‘𝐼) “ (Base‘𝐷))) ∧ ((1st ‘𝐼) “ (Base‘𝐷)) ⊆ 𝐶 ∧ (𝐽 ↾ (((1st ‘𝐼) “ (Base‘𝐷)) × ((1st ‘𝐼) “ (Base‘𝐷)))) = (𝑥 ∈ ((1st ‘𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st ‘𝐼) “ (Base‘𝐷)) ↦ ∪ 𝑝 ∈ ((◡(1st ‘𝐼) “ {𝑥}) × (◡(1st ‘𝐼) “ {𝑦}))(((2nd ‘𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝)))))
16	15	simp2d 1161	. . 3 ⊢ (𝐼 ∈ (𝐷 Full 𝐸) → ((1st ‘𝐼) “ (Base‘𝐷)) ⊆ 𝐶)
17	6, 16	eqsstrd 3947	. 2 ⊢ (𝐼 ∈ (𝐷 Full 𝐸) → 𝐵 ⊆ 𝐶)
18	15	simp3d 1162	. . 3 ⊢ (𝐼 ∈ (𝐷 Full 𝐸) → (𝐽 ↾ (((1st ‘𝐼) “ (Base‘𝐷)) × ((1st ‘𝐼) “ (Base‘𝐷)))) = (𝑥 ∈ ((1st ‘𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st ‘𝐼) “ (Base‘𝐷)) ↦ ∪ 𝑝 ∈ ((◡(1st ‘𝐼) “ {𝑥}) × (◡(1st ‘𝐼) “ {𝑦}))(((2nd ‘𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝))))
19	6	sqxpeqd 5687	. . . 4 ⊢ (𝐼 ∈ (𝐷 Full 𝐸) → (𝐵 × 𝐵) = (((1st ‘𝐼) “ (Base‘𝐷)) × ((1st ‘𝐼) “ (Base‘𝐷))))
20	19	reseq2d 5975	. . 3 ⊢ (𝐼 ∈ (𝐷 Full 𝐸) → (𝐽 ↾ (𝐵 × 𝐵)) = (𝐽 ↾ (((1st ‘𝐼) “ (Base‘𝐷)) × ((1st ‘𝐼) “ (Base‘𝐷)))))
21		idsubc.h	. . . 4 ⊢ 𝐻 = (Homf ‘𝐷)
22	2, 4, 8, 21, 9, 5	imaidfu2 50372	. . 3 ⊢ (𝐼 ∈ (𝐷 Full 𝐸) → 𝐻 = (𝑥 ∈ ((1st ‘𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st ‘𝐼) “ (Base‘𝐷)) ↦ ∪ 𝑝 ∈ ((◡(1st ‘𝐼) “ {𝑥}) × (◡(1st ‘𝐼) “ {𝑦}))(((2nd ‘𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝))))
23	18, 20, 22	3eqtr4d 2808	. 2 ⊢ (𝐼 ∈ (𝐷 Full 𝐸) → (𝐽 ↾ (𝐵 × 𝐵)) = 𝐻)
24	17, 23	jca 521	1 ⊢ (𝐼 ∈ (𝐷 Full 𝐸) → (𝐵 ⊆ 𝐶 ∧ (𝐽 ↾ (𝐵 × 𝐵)) = 𝐻))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146   ⊆ wss 3900  {csn 4588  ∪ ciun 4954   class class class wbr 5106   × cxp 5653  ^◡ccnv 5654   ↾ cres 5657   “ cima 5658  Rel wrel 5660   Fn wfn 6542  ‘cfv 6547  (class class class)co 7430   ∈ cmpo 7432  1^st c1st 8009  2^nd c2nd 8010  Basecbs 17402  Hom chom 17454  Hom_f chomf 17855   Func cfunc 18044  id_funccidfu 18045   Full cful 18094

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  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 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-riota 7387  df-ov 7433  df-oprab 7434  df-mpo 7435  df-1st 8011  df-2nd 8012  df-map 8863  df-ixp 8940  df-cat 17857  df-cid 17858  df-homf 17859  df-func 18048  df-idfu 18049  df-full 18096

This theorem is used by: (None)