Theorem discsubc 49043

Description: A discrete category, whose only morphisms are the identity morphisms, is a subcategory. (Contributed by Zhi Wang, 1-Nov-2025.)

Hypotheses

Ref	Expression
discsubc.j	⊢ 𝐽 = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅))
discsubc.b	⊢ 𝐵 = (Base‘𝐶)
discsubc.i	⊢ 𝐼 = (Id‘𝐶)
discsubc.s	⊢ (𝜑 → 𝑆 ⊆ 𝐵)
discsubc.c	⊢ (𝜑 → 𝐶 ∈ Cat)

Assertion

Ref	Expression
discsubc	⊢ (𝜑 → 𝐽 ∈ (Subcat‘𝐶))

Distinct variable groups:   𝑥,𝑆,𝑦   𝑥,𝐼,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)   𝐽(𝑥,𝑦)

Proof of Theorem discsubc

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

Step	Hyp	Ref	Expression
1		discsubc.s	. . 3 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
2		eqeq12 2747	. . . . . . . 8 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → (𝑥 = 𝑦 ↔ 𝑎 = 𝑏))
3		simpl 482	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → 𝑥 = 𝑎)
4	3	fveq2d 6864	. . . . . . . . 9 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → (𝐼‘𝑥) = (𝐼‘𝑎))
5	4	sneqd 4603	. . . . . . . 8 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → {(𝐼‘𝑥)} = {(𝐼‘𝑎)})
6	2, 5	ifbieq1d 4515	. . . . . . 7 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅) = if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅))
7		discsubc.j	. . . . . . 7 ⊢ 𝐽 = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅))
8		snex 5393	. . . . . . . 8 ⊢ {(𝐼‘𝑎)} ∈ V
9		0ex 5264	. . . . . . . 8 ⊢ ∅ ∈ V
10	8, 9	ifex 4541	. . . . . . 7 ⊢ if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅) ∈ V
11	6, 7, 10	ovmpoa 7546	. . . . . 6 ⊢ ((𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆) → (𝑎𝐽𝑏) = if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅))
12	11	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) → (𝑎𝐽𝑏) = if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅))
13		sseq1 3974	. . . . . 6 ⊢ ({(𝐼‘𝑎)} = if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅) → ({(𝐼‘𝑎)} ⊆ (𝑎(Homf ‘𝐶)𝑏) ↔ if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅) ⊆ (𝑎(Homf ‘𝐶)𝑏)))
14		sseq1 3974	. . . . . 6 ⊢ (∅ = if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅) → (∅ ⊆ (𝑎(Homf ‘𝐶)𝑏) ↔ if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅) ⊆ (𝑎(Homf ‘𝐶)𝑏)))
15		discsubc.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝐶)
16		eqid 2730	. . . . . . . . 9 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
17		discsubc.i	. . . . . . . . 9 ⊢ 𝐼 = (Id‘𝐶)
18		discsubc.c	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ Cat)
19	18	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) ∧ 𝑎 = 𝑏) → 𝐶 ∈ Cat)
20	1	ad2antrr 726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) ∧ 𝑎 = 𝑏) → 𝑆 ⊆ 𝐵)
21		simplrl 776	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) ∧ 𝑎 = 𝑏) → 𝑎 ∈ 𝑆)
22	20, 21	sseldd 3949	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) ∧ 𝑎 = 𝑏) → 𝑎 ∈ 𝐵)
23	15, 16, 17, 19, 22	catidcl 17649	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) ∧ 𝑎 = 𝑏) → (𝐼‘𝑎) ∈ (𝑎(Hom ‘𝐶)𝑎))
24		eqid 2730	. . . . . . . . . 10 ⊢ (Homf ‘𝐶) = (Homf ‘𝐶)
25	24, 15, 16, 22, 22	homfval 17659	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) ∧ 𝑎 = 𝑏) → (𝑎(Homf ‘𝐶)𝑎) = (𝑎(Hom ‘𝐶)𝑎))
26		simpr 484	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) ∧ 𝑎 = 𝑏) → 𝑎 = 𝑏)
27	26	oveq2d 7405	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) ∧ 𝑎 = 𝑏) → (𝑎(Homf ‘𝐶)𝑎) = (𝑎(Homf ‘𝐶)𝑏))
28	25, 27	eqtr3d 2767	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) ∧ 𝑎 = 𝑏) → (𝑎(Hom ‘𝐶)𝑎) = (𝑎(Homf ‘𝐶)𝑏))
29	23, 28	eleqtrd 2831	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) ∧ 𝑎 = 𝑏) → (𝐼‘𝑎) ∈ (𝑎(Homf ‘𝐶)𝑏))
30	29	snssd 4775	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) ∧ 𝑎 = 𝑏) → {(𝐼‘𝑎)} ⊆ (𝑎(Homf ‘𝐶)𝑏))
31		0ss 4365	. . . . . . 7 ⊢ ∅ ⊆ (𝑎(Homf ‘𝐶)𝑏)
32	31	a1i 11	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) ∧ ¬ 𝑎 = 𝑏) → ∅ ⊆ (𝑎(Homf ‘𝐶)𝑏))
33	13, 14, 30, 32	ifbothda 4529	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) → if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅) ⊆ (𝑎(Homf ‘𝐶)𝑏))
34	12, 33	eqsstrd 3983	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) → (𝑎𝐽𝑏) ⊆ (𝑎(Homf ‘𝐶)𝑏))
35	34	ralrimivva 3181	. . 3 ⊢ (𝜑 → ∀𝑎 ∈ 𝑆 ∀𝑏 ∈ 𝑆 (𝑎𝐽𝑏) ⊆ (𝑎(Homf ‘𝐶)𝑏))
36	7	discsubclem 49042	. . . . 5 ⊢ 𝐽 Fn (𝑆 × 𝑆)
37	36	a1i 11	. . . 4 ⊢ (𝜑 → 𝐽 Fn (𝑆 × 𝑆))
38	24, 15	homffn 17660	. . . . 5 ⊢ (Homf ‘𝐶) Fn (𝐵 × 𝐵)
39	38	a1i 11	. . . 4 ⊢ (𝜑 → (Homf ‘𝐶) Fn (𝐵 × 𝐵))
40	15	fvexi 6874	. . . . 5 ⊢ 𝐵 ∈ V
41	40	a1i 11	. . . 4 ⊢ (𝜑 → 𝐵 ∈ V)
42	37, 39, 41	isssc 17788	. . 3 ⊢ (𝜑 → (𝐽 ⊆cat (Homf ‘𝐶) ↔ (𝑆 ⊆ 𝐵 ∧ ∀𝑎 ∈ 𝑆 ∀𝑏 ∈ 𝑆 (𝑎𝐽𝑏) ⊆ (𝑎(Homf ‘𝐶)𝑏))))
43	1, 35, 42	mpbir2and 713	. 2 ⊢ (𝜑 → 𝐽 ⊆cat (Homf ‘𝐶))
44		fvex 6873	. . . . . 6 ⊢ (𝐼‘𝑎) ∈ V
45	44	snid 4628	. . . . 5 ⊢ (𝐼‘𝑎) ∈ {(𝐼‘𝑎)}
46		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑎 ∈ 𝑆)
47		equtr2 2027	. . . . . . . . 9 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑎) → 𝑥 = 𝑦)
48	47	iftrued 4498	. . . . . . . 8 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑎) → if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅) = {(𝐼‘𝑥)})
49		simpl 482	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑎) → 𝑥 = 𝑎)
50	49	fveq2d 6864	. . . . . . . . 9 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑎) → (𝐼‘𝑥) = (𝐼‘𝑎))
51	50	sneqd 4603	. . . . . . . 8 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑎) → {(𝐼‘𝑥)} = {(𝐼‘𝑎)})
52	48, 51	eqtrd 2765	. . . . . . 7 ⊢ ((𝑥 = 𝑎 ∧ 𝑦 = 𝑎) → if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅) = {(𝐼‘𝑎)})
53	52, 7, 8	ovmpoa 7546	. . . . . 6 ⊢ ((𝑎 ∈ 𝑆 ∧ 𝑎 ∈ 𝑆) → (𝑎𝐽𝑎) = {(𝐼‘𝑎)})
54	46, 46, 53	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (𝑎𝐽𝑎) = {(𝐼‘𝑎)})
55	45, 54	eleqtrrid 2836	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (𝐼‘𝑎) ∈ (𝑎𝐽𝑎))
56	45	a1i 11	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → (𝐼‘𝑎) ∈ {(𝐼‘𝑎)})
57		simprl 770	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑓 ∈ (𝑎𝐽𝑏))
58	46	ad2antrr 726	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑎 ∈ 𝑆)
59		simplrl 776	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑏 ∈ 𝑆)
60	58, 59, 11	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → (𝑎𝐽𝑏) = if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅))
61	57, 60	eleqtrd 2831	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑓 ∈ if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅))
62	61	ne0d 4307	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅) ≠ ∅)
63		iffalse 4499	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑎 = 𝑏 → if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅) = ∅)
64	63	necon1ai 2953	. . . . . . . . . . . . 13 ⊢ (if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅) ≠ ∅ → 𝑎 = 𝑏)
65	62, 64	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑎 = 𝑏)
66	65	opeq2d 4846	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → ⟨𝑎, 𝑎⟩ = ⟨𝑎, 𝑏⟩)
67		simprr 772	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑔 ∈ (𝑏𝐽𝑐))
68		eqeq12 2747	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 = 𝑏 ∧ 𝑦 = 𝑐) → (𝑥 = 𝑦 ↔ 𝑏 = 𝑐))
69		simpl 482	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑥 = 𝑏 ∧ 𝑦 = 𝑐) → 𝑥 = 𝑏)
70	69	fveq2d 6864	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 = 𝑏 ∧ 𝑦 = 𝑐) → (𝐼‘𝑥) = (𝐼‘𝑏))
71	70	sneqd 4603	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 = 𝑏 ∧ 𝑦 = 𝑐) → {(𝐼‘𝑥)} = {(𝐼‘𝑏)})
72	68, 71	ifbieq1d 4515	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 = 𝑏 ∧ 𝑦 = 𝑐) → if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅) = if(𝑏 = 𝑐, {(𝐼‘𝑏)}, ∅))
73		snex 5393	. . . . . . . . . . . . . . . . . 18 ⊢ {(𝐼‘𝑏)} ∈ V
74	73, 9	ifex 4541	. . . . . . . . . . . . . . . . 17 ⊢ if(𝑏 = 𝑐, {(𝐼‘𝑏)}, ∅) ∈ V
75	72, 7, 74	ovmpoa 7546	. . . . . . . . . . . . . . . 16 ⊢ ((𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆) → (𝑏𝐽𝑐) = if(𝑏 = 𝑐, {(𝐼‘𝑏)}, ∅))
76	75	ad2antlr 727	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → (𝑏𝐽𝑐) = if(𝑏 = 𝑐, {(𝐼‘𝑏)}, ∅))
77	67, 76	eleqtrd 2831	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑔 ∈ if(𝑏 = 𝑐, {(𝐼‘𝑏)}, ∅))
78	77	ne0d 4307	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → if(𝑏 = 𝑐, {(𝐼‘𝑏)}, ∅) ≠ ∅)
79		iffalse 4499	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑏 = 𝑐 → if(𝑏 = 𝑐, {(𝐼‘𝑏)}, ∅) = ∅)
80	79	necon1ai 2953	. . . . . . . . . . . . 13 ⊢ (if(𝑏 = 𝑐, {(𝐼‘𝑏)}, ∅) ≠ ∅ → 𝑏 = 𝑐)
81	78, 80	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑏 = 𝑐)
82	65, 81	eqtrd 2765	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑎 = 𝑐)
83	66, 82	oveq12d 7407	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → (⟨𝑎, 𝑎⟩(comp‘𝐶)𝑎) = (⟨𝑎, 𝑏⟩(comp‘𝐶)𝑐))
84	83	eqcomd 2736	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → (⟨𝑎, 𝑏⟩(comp‘𝐶)𝑐) = (⟨𝑎, 𝑎⟩(comp‘𝐶)𝑎))
85	81	iftrued 4498	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → if(𝑏 = 𝑐, {(𝐼‘𝑏)}, ∅) = {(𝐼‘𝑏)})
86	77, 85	eleqtrd 2831	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑔 ∈ {(𝐼‘𝑏)})
87	86	elsnd 4609	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑔 = (𝐼‘𝑏))
88	65	fveq2d 6864	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → (𝐼‘𝑎) = (𝐼‘𝑏))
89	87, 88	eqtr4d 2768	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑔 = (𝐼‘𝑎))
90	65	iftrued 4498	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → if(𝑎 = 𝑏, {(𝐼‘𝑎)}, ∅) = {(𝐼‘𝑎)})
91	61, 90	eleqtrd 2831	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑓 ∈ {(𝐼‘𝑎)})
92	91	elsnd 4609	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑓 = (𝐼‘𝑎))
93	84, 89, 92	oveq123d 7410	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → (𝑔(⟨𝑎, 𝑏⟩(comp‘𝐶)𝑐)𝑓) = ((𝐼‘𝑎)(⟨𝑎, 𝑎⟩(comp‘𝐶)𝑎)(𝐼‘𝑎)))
94	18	ad3antrrr 730	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝐶 ∈ Cat)
95	1	ad3antrrr 730	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑆 ⊆ 𝐵)
96	95, 58	sseldd 3949	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → 𝑎 ∈ 𝐵)
97		eqid 2730	. . . . . . . . 9 ⊢ (comp‘𝐶) = (comp‘𝐶)
98	15, 16, 17, 94, 96	catidcl 17649	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → (𝐼‘𝑎) ∈ (𝑎(Hom ‘𝐶)𝑎))
99	15, 16, 17, 94, 96, 97, 96, 98	catlid 17650	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → ((𝐼‘𝑎)(⟨𝑎, 𝑎⟩(comp‘𝐶)𝑎)(𝐼‘𝑎)) = (𝐼‘𝑎))
100	93, 99	eqtrd 2765	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → (𝑔(⟨𝑎, 𝑏⟩(comp‘𝐶)𝑐)𝑓) = (𝐼‘𝑎))
101	82	oveq2d 7405	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → (𝑎𝐽𝑎) = (𝑎𝐽𝑐))
102	58, 58, 53	syl2anc 584	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → (𝑎𝐽𝑎) = {(𝐼‘𝑎)})
103	101, 102	eqtr3d 2767	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → (𝑎𝐽𝑐) = {(𝐼‘𝑎)})
104	56, 100, 103	3eltr4d 2844	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) ∧ (𝑓 ∈ (𝑎𝐽𝑏) ∧ 𝑔 ∈ (𝑏𝐽𝑐))) → (𝑔(⟨𝑎, 𝑏⟩(comp‘𝐶)𝑐)𝑓) ∈ (𝑎𝐽𝑐))
105	104	ralrimivva 3181	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑆)) → ∀𝑓 ∈ (𝑎𝐽𝑏)∀𝑔 ∈ (𝑏𝐽𝑐)(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐶)𝑐)𝑓) ∈ (𝑎𝐽𝑐))
106	105	ralrimivva 3181	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ∀𝑏 ∈ 𝑆 ∀𝑐 ∈ 𝑆 ∀𝑓 ∈ (𝑎𝐽𝑏)∀𝑔 ∈ (𝑏𝐽𝑐)(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐶)𝑐)𝑓) ∈ (𝑎𝐽𝑐))
107	55, 106	jca 511	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((𝐼‘𝑎) ∈ (𝑎𝐽𝑎) ∧ ∀𝑏 ∈ 𝑆 ∀𝑐 ∈ 𝑆 ∀𝑓 ∈ (𝑎𝐽𝑏)∀𝑔 ∈ (𝑏𝐽𝑐)(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐶)𝑐)𝑓) ∈ (𝑎𝐽𝑐)))
108	107	ralrimiva 3126	. 2 ⊢ (𝜑 → ∀𝑎 ∈ 𝑆 ((𝐼‘𝑎) ∈ (𝑎𝐽𝑎) ∧ ∀𝑏 ∈ 𝑆 ∀𝑐 ∈ 𝑆 ∀𝑓 ∈ (𝑎𝐽𝑏)∀𝑔 ∈ (𝑏𝐽𝑐)(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐶)𝑐)𝑓) ∈ (𝑎𝐽𝑐)))
109	24, 17, 97, 18, 37	issubc2 17804	. 2 ⊢ (𝜑 → (𝐽 ∈ (Subcat‘𝐶) ↔ (𝐽 ⊆cat (Homf ‘𝐶) ∧ ∀𝑎 ∈ 𝑆 ((𝐼‘𝑎) ∈ (𝑎𝐽𝑎) ∧ ∀𝑏 ∈ 𝑆 ∀𝑐 ∈ 𝑆 ∀𝑓 ∈ (𝑎𝐽𝑏)∀𝑔 ∈ (𝑏𝐽𝑐)(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐶)𝑐)𝑓) ∈ (𝑎𝐽𝑐)))))
110	43, 108, 109	mpbir2and 713	1 ⊢ (𝜑 → 𝐽 ∈ (Subcat‘𝐶))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109   ≠ wne 2926  ∀wral 3045  Vcvv 3450   ⊆ wss 3916  ∅c0 4298  ifcif 4490  {csn 4591  ⟨cop 4597   class class class wbr 5109   × cxp 5638   Fn wfn 6508  ‘cfv 6513  (class class class)co 7389   ∈ cmpo 7391  Basecbs 17185  Hom chom 17237  compcco 17238  Catccat 17631  Idccid 17632  Hom_f chomf 17633   ⊆_cat cssc 17775  Subcatcsubc 17777

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5236  ax-sep 5253  ax-nul 5263  ax-pow 5322  ax-pr 5389  ax-un 7713

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3756  df-csb 3865  df-dif 3919  df-un 3921  df-in 3923  df-ss 3933  df-nul 4299  df-if 4491  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5110  df-opab 5172  df-mpt 5191  df-id 5535  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-iota 6466  df-fun 6515  df-fn 6516  df-f 6517  df-f1 6518  df-fo 6519  df-f1o 6520  df-fv 6521  df-riota 7346  df-ov 7392  df-oprab 7393  df-mpo 7394  df-1st 7970  df-2nd 7971  df-pm 8804  df-ixp 8873  df-cat 17635  df-cid 17636  df-homf 17637  df-ssc 17778  df-subc 17780

This theorem is referenced by:  iinfconstbaslem  49044