Theorem imasubc3 50603

Description: An image of a functor injective on objects is a 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	⊢ 𝐾 = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ ∪ 𝑝 ∈ ((◡𝐹 “ {𝑥}) × (◡𝐹 “ {𝑦}))((𝐺‘𝑝) “ (𝐻‘𝑝)))
imassc.f	⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
imasubc3.f	⊢ (𝜑 → Fun ◡𝐹)

Assertion

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

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

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

Proof of Theorem imasubc3

Dummy variables 𝑎 𝑏 𝑐 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		imasubc.s	. . 3 ⊢ 𝑆 = (𝐹 “ 𝐴)
2		imasubc.h	. . 3 ⊢ 𝐻 = (Hom ‘𝐷)
3		imasubc.k	. . 3 ⊢ 𝐾 = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ ∪ 𝑝 ∈ ((◡𝐹 “ {𝑥}) × (◡𝐹 “ {𝑦}))((𝐺‘𝑝) “ (𝐻‘𝑝)))
4		imassc.f	. . 3 ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
5		eqid 2763	. . 3 ⊢ (Homf ‘𝐸) = (Homf ‘𝐸)
6	1, 2, 3, 4, 5	imassc 50600	. 2 ⊢ (𝜑 → 𝐾 ⊆cat (Homf ‘𝐸))
7	4	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝐹(𝐷 Func 𝐸)𝐺)
8		eqid 2763	. . . . 5 ⊢ (Id‘𝐸) = (Id‘𝐸)
9		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑎 ∈ 𝑆)
10	1, 2, 3, 7, 8, 9	imaid 50601	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((Id‘𝐸)‘𝑎) ∈ (𝑎𝐾𝑎))
11	4	ad3antrrr 743	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐾𝑏) ∧ 𝑔 ∈ (𝑏𝐾𝑐))) → 𝐹(𝐷 Func 𝐸)𝐺)
12		eqid 2763	. . . . . . 7 ⊢ (Base‘𝐷) = (Base‘𝐷)
13		eqid 2763	. . . . . . 7 ⊢ (Base‘𝐸) = (Base‘𝐸)
14		eqid 2763	. . . . . . 7 ⊢ (comp‘𝐸) = (comp‘𝐸)
15	12, 13, 4	funcf1 18091	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:(Base‘𝐷)⟶(Base‘𝐸))
16		imasubc3.f	. . . . . . . . 9 ⊢ (𝜑 → Fun ◡𝐹)
17		df-f1 6571	. . . . . . . . 9 ⊢ (𝐹:(Base‘𝐷)⟶1-1(Base‘𝐸) ↔ (𝐹:(Base‘𝐷)⟶(Base‘𝐸) ∧ Fun ◡𝐹))
18	15, 16, 17	sylanbrc 595	. . . . . . . 8 ⊢ (𝜑 → 𝐹:(Base‘𝐷)⟶1-1(Base‘𝐸))
19	18	ad3antrrr 743	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐾𝑏) ∧ 𝑔 ∈ (𝑏𝐾𝑐))) → 𝐹:(Base‘𝐷)⟶1-1(Base‘𝐸))
20		simpllr 788	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐾𝑏) ∧ 𝑔 ∈ (𝑏𝐾𝑐))) → 𝑎 ∈ 𝑆)
21		simplrl 789	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐾𝑏) ∧ 𝑔 ∈ (𝑏𝐾𝑐))) → 𝑏 ∈ 𝑆)
22		simplrr 790	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐾𝑏) ∧ 𝑔 ∈ (𝑏𝐾𝑐))) → 𝑐 ∈ 𝑆)
23		simprl 783	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐾𝑏) ∧ 𝑔 ∈ (𝑏𝐾𝑐))) → 𝑓 ∈ (𝑎𝐾𝑏))
24		simprr 785	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐾𝑏) ∧ 𝑔 ∈ (𝑏𝐾𝑐))) → 𝑔 ∈ (𝑏𝐾𝑐))
25	1, 2, 3, 11, 12, 13, 14, 19, 20, 21, 22, 23, 24	imaf1co 50602	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐾𝑏) ∧ 𝑔 ∈ (𝑏𝐾𝑐))) → (𝑔(⟨𝑎, 𝑏⟩(comp‘𝐸)𝑐)𝑓) ∈ (𝑎𝐾𝑐))
26	25	ralrimivva 3209	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) → ∀𝑓 ∈ (𝑎𝐾𝑏)∀𝑔 ∈ (𝑏𝐾𝑐)(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐸)𝑐)𝑓) ∈ (𝑎𝐾𝑐))
27	26	ralrimivva 3209	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ∀𝑏 ∈ 𝑆 ∀𝑐 ∈ 𝑆 ∀𝑓 ∈ (𝑎𝐾𝑏)∀𝑔 ∈ (𝑏𝐾𝑐)(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐸)𝑐)𝑓) ∈ (𝑎𝐾𝑐))
28	10, 27	jca 521	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((Id‘𝐸)‘𝑎) ∈ (𝑎𝐾𝑎) ∧ ∀𝑏 ∈ 𝑆 ∀𝑐 ∈ 𝑆 ∀𝑓 ∈ (𝑎𝐾𝑏)∀𝑔 ∈ (𝑏𝐾𝑐)(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐸)𝑐)𝑓) ∈ (𝑎𝐾𝑐)))
29	28	ralrimiva 3158	. 2 ⊢ (𝜑 → ∀𝑎 ∈ 𝑆 (((Id‘𝐸)‘𝑎) ∈ (𝑎𝐾𝑎) ∧ ∀𝑏 ∈ 𝑆 ∀𝑐 ∈ 𝑆 ∀𝑓 ∈ (𝑎𝐾𝑏)∀𝑔 ∈ (𝑏𝐾𝑐)(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐸)𝑐)𝑓) ∈ (𝑎𝐾𝑐)))
30	4	funcrcl3 50525	. . 3 ⊢ (𝜑 → 𝐸 ∈ Cat)
31		relfunc 18087	. . . . . 6 ⊢ Rel (𝐷 Func 𝐸)
32	31	brrelex1i 5714	. . . . 5 ⊢ (𝐹(𝐷 Func 𝐸)𝐺 → 𝐹 ∈ V)
33	4, 32	syl 18	. . . 4 ⊢ (𝜑 → 𝐹 ∈ V)
34	33, 33, 3	imasubclem2 50552	. . 3 ⊢ (𝜑 → 𝐾 Fn (𝑆 × 𝑆))
35	5, 8, 14, 30, 34	issubc2 18061	. 2 ⊢ (𝜑 → (𝐾 ∈ (Subcat‘𝐸) ↔ (𝐾 ⊆cat (Homf ‘𝐸) ∧ ∀𝑎 ∈ 𝑆 (((Id‘𝐸)‘𝑎) ∈ (𝑎𝐾𝑎) ∧ ∀𝑏 ∈ 𝑆 ∀𝑐 ∈ 𝑆 ∀𝑓 ∈ (𝑎𝐾𝑏)∀𝑔 ∈ (𝑏𝐾𝑐)(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐸)𝑐)𝑓) ∈ (𝑎𝐾𝑐)))))
36	6, 29, 35	mpbir2and 726	1 ⊢ (𝜑 → 𝐾 ∈ (Subcat‘𝐸))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454  {csn 4588  ⟨cop 4840  ∪ ciun 4956   class class class wbr 5108   × cxp 5656  ^◡ccnv 5657   “ cima 5661  Fun wfun 6560  ⟶wf 6562  ⟶1-1wf1 6563  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  Basecbs 17431  Hom chom 17483  compcco 17484  Idccid 17889  Hom_f chomf 17890   ⊆_cat cssc 18032  Subcatcsubc 18034   Func cfunc 18079

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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-map 8887  df-pm 8888  df-ixp 8964  df-cat 17892  df-cid 17893  df-homf 17894  df-ssc 18035  df-subc 18037  df-func 18083

This theorem is used by:  idsubc  50607