Theorem infsubc2d 49991

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

Hypotheses

Ref	Expression
infsubc2d.1	⊢ (𝜑 → 𝐻 Fn (𝑆 × 𝑆))
infsubc2d.2	⊢ (𝜑 → 𝐽 Fn (𝑇 × 𝑇))
infsubc2d.3	⊢ (𝜑 → 𝐻 ∈ (Subcat‘𝐶))
infsubc2d.4	⊢ (𝜑 → 𝐽 ∈ (Subcat‘𝐶))

Assertion

Ref	Expression
infsubc2d	⊢ (𝜑 → (𝑥 ∈ (𝑆 ∩ 𝑇), 𝑦 ∈ (𝑆 ∩ 𝑇) ↦ ((𝑥𝐻𝑦) ∩ (𝑥𝐽𝑦))) ∈ (Subcat‘𝐶))

Distinct variable groups:   𝑥,𝐶,𝑦   𝑥,𝐻,𝑦   𝑥,𝐽,𝑦   𝑥,𝑆,𝑦   𝑥,𝑇,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem infsubc2d

Step	Hyp	Ref	Expression
1		infsubc2d.1	. . . . . . 7 ⊢ (𝜑 → 𝐻 Fn (𝑆 × 𝑆))
2	1	fndmd 6638	. . . . . 6 ⊢ (𝜑 → dom 𝐻 = (𝑆 × 𝑆))
3	2	dmeqd 5889	. . . . 5 ⊢ (𝜑 → dom dom 𝐻 = dom (𝑆 × 𝑆))
4		dmxpid 5914	. . . . 5 ⊢ dom (𝑆 × 𝑆) = 𝑆
5	3, 4	eqtrdi 2811	. . . 4 ⊢ (𝜑 → dom dom 𝐻 = 𝑆)
6		infsubc2d.2	. . . . . . 7 ⊢ (𝜑 → 𝐽 Fn (𝑇 × 𝑇))
7	6	fndmd 6638	. . . . . 6 ⊢ (𝜑 → dom 𝐽 = (𝑇 × 𝑇))
8	7	dmeqd 5889	. . . . 5 ⊢ (𝜑 → dom dom 𝐽 = dom (𝑇 × 𝑇))
9		dmxpid 5914	. . . . 5 ⊢ dom (𝑇 × 𝑇) = 𝑇
10	8, 9	eqtrdi 2811	. . . 4 ⊢ (𝜑 → dom dom 𝐽 = 𝑇)
11	5, 10	ineq12d 4167	. . 3 ⊢ (𝜑 → (dom dom 𝐻 ∩ dom dom 𝐽) = (𝑆 ∩ 𝑇))
12		mpoeq12 7487	. . 3 ⊢ (((dom dom 𝐻 ∩ dom dom 𝐽) = (𝑆 ∩ 𝑇) ∧ (dom dom 𝐻 ∩ dom dom 𝐽) = (𝑆 ∩ 𝑇)) → (𝑥 ∈ (dom dom 𝐻 ∩ dom dom 𝐽), 𝑦 ∈ (dom dom 𝐻 ∩ dom dom 𝐽) ↦ ((𝑥𝐻𝑦) ∩ (𝑥𝐽𝑦))) = (𝑥 ∈ (𝑆 ∩ 𝑇), 𝑦 ∈ (𝑆 ∩ 𝑇) ↦ ((𝑥𝐻𝑦) ∩ (𝑥𝐽𝑦))))
13	11, 11, 12	syl2anc 596	. 2 ⊢ (𝜑 → (𝑥 ∈ (dom dom 𝐻 ∩ dom dom 𝐽), 𝑦 ∈ (dom dom 𝐻 ∩ dom dom 𝐽) ↦ ((𝑥𝐻𝑦) ∩ (𝑥𝐽𝑦))) = (𝑥 ∈ (𝑆 ∩ 𝑇), 𝑦 ∈ (𝑆 ∩ 𝑇) ↦ ((𝑥𝐻𝑦) ∩ (𝑥𝐽𝑦))))
14		infsubc2d.3	. . 3 ⊢ (𝜑 → 𝐻 ∈ (Subcat‘𝐶))
15		infsubc2d.4	. . 3 ⊢ (𝜑 → 𝐽 ∈ (Subcat‘𝐶))
16		infsubc2 49990	. . 3 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ∈ (Subcat‘𝐶)) → (𝑥 ∈ (dom dom 𝐻 ∩ dom dom 𝐽), 𝑦 ∈ (dom dom 𝐻 ∩ dom dom 𝐽) ↦ ((𝑥𝐻𝑦) ∩ (𝑥𝐽𝑦))) ∈ (Subcat‘𝐶))
17	14, 15, 16	syl2anc 596	. 2 ⊢ (𝜑 → (𝑥 ∈ (dom dom 𝐻 ∩ dom dom 𝐽), 𝑦 ∈ (dom dom 𝐻 ∩ dom dom 𝐽) ↦ ((𝑥𝐻𝑦) ∩ (𝑥𝐽𝑦))) ∈ (Subcat‘𝐶))
18	13, 17	eqeltrrd 2861	1 ⊢ (𝜑 → (𝑥 ∈ (𝑆 ∩ 𝑇), 𝑦 ∈ (𝑆 ∩ 𝑇) ↦ ((𝑥𝐻𝑦) ∩ (𝑥𝐽𝑦))) ∈ (Subcat‘𝐶))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145   ∩ cin 3898   × cxp 5653  dom cdm 5655   Fn wfn 6528  ‘cfv 6533  (class class class)co 7414   ∈ cmpo 7416  Subcatcsubc 17901

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 7737

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 7417  df-oprab 7418  df-mpo 7419  df-1st 7987  df-2nd 7988  df-pm 8832  df-ixp 8908  df-ssc 17902  df-subc 17904

This theorem is used by: (None)