Theorem infsubc2 50506

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 4741	. . . . 5 ⊢ (𝐴 ∈ (Subcat‘𝐶) → {𝐴, 𝐵} ≠ ∅)
2	1	adantr 486	. . . 4 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → {𝐴, 𝐵} ≠ ∅)
3		simpll 779	. . . . . . 7 ⊢ (((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) ∧ 𝑤 ∈ {𝐴, 𝐵}) → 𝐴 ∈ (Subcat‘𝐶))
4		eqid 2763	. . . . . . 7 ⊢ (Homf ‘𝐶) = (Homf ‘𝐶)
5	3, 4	subcssc 18065	. . . . . 6 ⊢ (((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) ∧ 𝑤 ∈ {𝐴, 𝐵}) → 𝐴 ⊆cat (Homf ‘𝐶))
6		breq1 5111	. . . . . 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 18065	. . . . . 6 ⊢ (((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) ∧ 𝑤 ∈ {𝐴, 𝐵}) → 𝐵 ⊆cat (Homf ‘𝐶))
10		breq1 5111	. . . . . 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 50504	. . . 4 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → (𝑧 ∈ (dom 𝐴 ∩ dom 𝐵) ↦ ((𝐴‘𝑧) ∩ (𝐵‘𝑧))) = (𝑧 ∈ ∩ 𝑤 ∈ {𝐴, 𝐵}dom 𝑤 ↦ ∩ 𝑤 ∈ {𝐴, 𝐵} (𝑤‘𝑧)))
16		eqidd 2764	. . . 4 ⊢ (((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) ∧ 𝑤 ∈ {𝐴, 𝐵}) → dom dom 𝑤 = dom dom 𝑤)
17		nfv 1949	. . . 4 ⊢ Ⅎ𝑤(𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶))
18	2, 14, 15, 16, 17	iinfssclem1 50499	. . 3 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → (𝑧 ∈ (dom 𝐴 ∩ dom 𝐵) ↦ ((𝐴‘𝑧) ∩ (𝐵‘𝑧))) = (𝑥 ∈ ∩ 𝑤 ∈ {𝐴, 𝐵}dom dom 𝑤, 𝑦 ∈ ∩ 𝑤 ∈ {𝐴, 𝐵}dom dom 𝑤 ↦ ∩ 𝑤 ∈ {𝐴, 𝐵} (𝑥𝑤𝑦)))
19		dmeq 5897	. . . . . 6 ⊢ (𝑤 = 𝐴 → dom 𝑤 = dom 𝐴)
20	19	dmeqd 5899	. . . . 5 ⊢ (𝑤 = 𝐴 → dom dom 𝑤 = dom dom 𝐴)
21		dmeq 5897	. . . . . 6 ⊢ (𝑤 = 𝐵 → dom 𝑤 = dom 𝐵)
22	21	dmeqd 5899	. . . . 5 ⊢ (𝑤 = 𝐵 → dom dom 𝑤 = dom dom 𝐵)
23	20, 22	iinxprg 5054	. . . 4 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → ∩ 𝑤 ∈ {𝐴, 𝐵}dom dom 𝑤 = (dom dom 𝐴 ∩ dom dom 𝐵))
24		oveq 7457	. . . . 5 ⊢ (𝑤 = 𝐴 → (𝑥𝑤𝑦) = (𝑥𝐴𝑦))
25		oveq 7457	. . . . 5 ⊢ (𝑤 = 𝐵 → (𝑥𝑤𝑦) = (𝑥𝐵𝑦))
26	24, 25	iinxprg 5054	. . . 4 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → ∩ 𝑤 ∈ {𝐴, 𝐵} (𝑥𝑤𝑦) = ((𝑥𝐴𝑦) ∩ (𝑥𝐵𝑦)))
27	23, 23, 26	mpoeq123dv 7526	. . 3 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → (𝑥 ∈ ∩ 𝑤 ∈ {𝐴, 𝐵}dom dom 𝑤, 𝑦 ∈ ∩ 𝑤 ∈ {𝐴, 𝐵}dom dom 𝑤 ↦ ∩ 𝑤 ∈ {𝐴, 𝐵} (𝑥𝑤𝑦)) = (𝑥 ∈ (dom dom 𝐴 ∩ dom dom 𝐵), 𝑦 ∈ (dom dom 𝐴 ∩ dom dom 𝐵) ↦ ((𝑥𝐴𝑦) ∩ (𝑥𝐵𝑦))))
28	18, 27	eqtrd 2798	. 2 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → (𝑧 ∈ (dom 𝐴 ∩ dom 𝐵) ↦ ((𝐴‘𝑧) ∩ (𝐵‘𝑧))) = (𝑥 ∈ (dom dom 𝐴 ∩ dom dom 𝐵), 𝑦 ∈ (dom dom 𝐴 ∩ dom dom 𝐵) ↦ ((𝑥𝐴𝑦) ∩ (𝑥𝐵𝑦))))
29		infsubc 50505	. 2 ⊢ ((𝐴 ∈ (Subcat‘𝐶) ∧ 𝐵 ∈ (Subcat‘𝐶)) → (𝑧 ∈ (dom 𝐴 ∩ dom 𝐵) ↦ ((𝐴‘𝑧) ∩ (𝐵‘𝑧))) ∈ (Subcat‘𝐶))
30	28, 29	eqeltrrd 2865	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 2147   ≠ wne 2959   ∩ cin 4092  ∅c0 4281  {cpr 4590  ∩ ciin 4957   class class class wbr 5108   ↦ cmpt 5192  dom cdm 5658  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  Hom_f chomf 17890   ⊆_cat cssc 18032  Subcatcsubc 18034

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-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-int 4913  df-iun 4958  df-iin 4959  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-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-pm 8888  df-ixp 8964  df-ssc 18035  df-subc 18037

This theorem is used by:  infsubc2d  50507