Theorem infsubc2 49987

Description: The intersection of two subcategories is a subcategory. (Contributed by Zhi Wang, 31-Oct-2025.)

Assertion

Ref	Expression
infsubc2	⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → (𝑥 ∈ (dom dom 𝐴 ∩ dom dom 𝐵), 𝑦 ∈ (dom dom 𝐴 ∩ dom dom 𝐵) ↦ ((𝑥𝐴𝑦) ∩ (𝑥𝐵𝑦))) ∈ (Subcat‘𝐶))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦

Proof of Theorem infsubc2

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

Step	Hyp	Ref	Expression
1		prnzg 4739	. . . . 5 ⊢ (𝐴 ∈ (Subcat‘𝐶) → {𝐴, 𝐵} ≠ ∅)
2	1	adantr 486	. . . 4 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → {𝐴, 𝐵} ≠ ∅)
3		simpll 779	. . . . . . 7 ⊢ (((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) ∧ 𝑤 ∈ {𝐴, 𝐵}) → 𝐴 ∈ (Subcat‘𝐶))
4		eqid 2760	. . . . . . 7 ⊢ (Homf ‘𝐶) = (Homf ‘𝐶)
5	3, 4	subcssc 17929	. . . . . 6 ⊢ (((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) ∧ 𝑤 ∈ {𝐴, 𝐵}) → 𝐴 ⊆cat (Homf ‘𝐶))
6		breq1 5106	. . . . . 6 ⊢ (𝑤 = 𝐴 → (𝑤 ⊆cat (Homf ‘𝐶) ↔ 𝐴 ⊆cat (Homf ‘𝐶)))
7	5, 6	syl5ibrcom 250	. . . . 5 ⊢ (((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) ∧ 𝑤 ∈ {𝐴, 𝐵}) → (𝑤 = 𝐴 → 𝑤 ⊆cat (Homf ‘𝐶)))
8		simplr 781	. . . . . . 7 ⊢ (((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) ∧ 𝑤 ∈ {𝐴, 𝐵}) → 𝐵 ∈ (Subcat‘𝐶))
9	8, 4	subcssc 17929	. . . . . 6 ⊢ (((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) ∧ 𝑤 ∈ {𝐴, 𝐵}) → 𝐵 ⊆cat (Homf ‘𝐶))
10		breq1 5106	. . . . . 6 ⊢ (𝑤 = 𝐵 → (𝑤 ⊆cat (Homf ‘𝐶) ↔ 𝐵 ⊆cat (Homf ‘𝐶)))
11	9, 10	syl5ibrcom 250	. . . . 5 ⊢ (((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) ∧ 𝑤 ∈ {𝐴, 𝐵}) → (𝑤 = 𝐵 → 𝑤 ⊆cat (Homf ‘𝐶)))
12		elpri 4608	. . . . . 6 ⊢ (𝑤 ∈ {𝐴, 𝐵} → (𝑤 = 𝐴 ∨ 𝑤 = 𝐵))
13	12	adantl 487	. . . . 5 ⊢ (((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) ∧ 𝑤 ∈ {𝐴, 𝐵}) → (𝑤 = 𝐴 ∨ 𝑤 = 𝐵))
14	7, 11, 13	mpjaod 874	. . . 4 ⊢ (((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) ∧ 𝑤 ∈ {𝐴, 𝐵}) → 𝑤 ⊆cat (Homf ‘𝐶))
15		iinfprg 49985	. . . 4 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → (𝑧 ∈ (dom 𝐴 ∩ dom 𝐵) ↦ ((𝐴‘𝑧) ∩ (𝐵‘𝑧))) = (𝑧 ∈ ∩ 𝑤 ∈ {𝐴, 𝐵}dom 𝑤 ↦ ∩ 𝑤 ∈ {𝐴, 𝐵} (𝑤‘𝑧)))
16		eqidd 2761	. . . 4 ⊢ (((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) ∧ 𝑤 ∈ {𝐴, 𝐵}) → dom dom 𝑤 = dom dom 𝑤)
17		nfv 1947	. . . 4 ⊢ Ⅎ𝑤(𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶))
18	2, 14, 15, 16, 17	iinfssclem1 49980	. . 3 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → (𝑧 ∈ (dom 𝐴 ∩ dom 𝐵) ↦ ((𝐴‘𝑧) ∩ (𝐵‘𝑧))) = (𝑥 ∈ ∩ 𝑤 ∈ {𝐴, 𝐵}dom dom 𝑤, 𝑦 ∈ ∩ 𝑤 ∈ {𝐴, 𝐵}dom dom 𝑤 ↦ ∩ 𝑤 ∈ {𝐴, 𝐵} (𝑥𝑤𝑦)))
19		dmeq 5887	. . . . . 6 ⊢ (𝑤 = 𝐴 → dom 𝑤 = dom 𝐴)
20	19	dmeqd 5889	. . . . 5 ⊢ (𝑤 = 𝐴 → dom dom 𝑤 = dom dom 𝐴)
21		dmeq 5887	. . . . . 6 ⊢ (𝑤 = 𝐵 → dom 𝑤 = dom 𝐵)
22	21	dmeqd 5889	. . . . 5 ⊢ (𝑤 = 𝐵 → dom dom 𝑤 = dom dom 𝐵)
23	20, 22	iinxprg 5049	. . . 4 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → ∩ 𝑤 ∈ {𝐴, 𝐵}dom dom 𝑤 = (dom dom 𝐴 ∩ dom dom 𝐵))
24		oveq 7419	. . . . 5 ⊢ (𝑤 = 𝐴 → (𝑥𝑤𝑦) = (𝑥𝐴𝑦))
25		oveq 7419	. . . . 5 ⊢ (𝑤 = 𝐵 → (𝑥𝑤𝑦) = (𝑥𝐵𝑦))
26	24, 25	iinxprg 5049	. . . 4 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → ∩ 𝑤 ∈ {𝐴, 𝐵} (𝑥𝑤𝑦) = ((𝑥𝐴𝑦) ∩ (𝑥𝐵𝑦)))
27	23, 23, 26	mpoeq123dv 7488	. . 3 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → (𝑥 ∈ ∩ 𝑤 ∈ {𝐴, 𝐵}dom dom 𝑤, 𝑦 ∈ ∩ 𝑤 ∈ {𝐴, 𝐵}dom dom 𝑤 ↦ ∩ 𝑤 ∈ {𝐴, 𝐵} (𝑥𝑤𝑦)) = (𝑥 ∈ (dom dom 𝐴 ∩ dom dom 𝐵), 𝑦 ∈ (dom dom 𝐴 ∩ dom dom 𝐵) ↦ ((𝑥𝐴𝑦) ∩ (𝑥𝐵𝑦))))
28	18, 27	eqtrd 2795	. 2 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → (𝑧 ∈ (dom 𝐴 ∩ dom 𝐵) ↦ ((𝐴‘𝑧) ∩ (𝐵‘𝑧))) = (𝑥 ∈ (dom dom 𝐴 ∩ dom dom 𝐵), 𝑦 ∈ (dom dom 𝐴 ∩ dom dom 𝐵) ↦ ((𝑥𝐴𝑦) ∩ (𝑥𝐵𝑦))))
29		infsubc 49986	. 2 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → (𝑧 ∈ (dom 𝐴 ∩ dom 𝐵) ↦ ((𝐴‘𝑧) ∩ (𝐵‘𝑧))) ∈ (Subcat‘𝐶))
30	28, 29	eqeltrrd 2861	1 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → (𝑥 ∈ (dom dom 𝐴 ∩ dom dom 𝐵), 𝑦 ∈ (dom dom 𝐴 ∩ dom dom 𝐵) ↦ ((𝑥𝐴𝑦) ∩ (𝑥𝐵𝑦))) ∈ (Subcat‘𝐶))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145   ≠ wne 2955   ∩ cin 3898  ∅c0 4279  {cpr 4586  ∩ ciin 4952   class class class wbr 5103   ↦ cmpt 5186  dom cdm 5655  ‘cfv 6533  (class class class)co 7413   ∈ cmpo 7415  Hom_f chomf 17754   ⊆_cat cssc 17896  Subcatcsubc 17898

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 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  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 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-pm 8829  df-ixp 8905  df-ssc 17899  df-subc 17901

This theorem is used by:  infsubc2d  49988