Theorem subccocl 18049

Description: A subcategory is closed under composition. (Contributed by Mario Carneiro, 4-Jan-2017.)

Hypotheses

Ref	Expression
subcidcl.j	⊢ (𝜑 → 𝐽 ∈ (Subcat‘𝐶))
subcidcl.2	⊢ (𝜑 → 𝐽 Fn (𝑆 × 𝑆))
subcidcl.x	⊢ (𝜑 → 𝑋 ∈ 𝑆)
subccocl.o	⊢ · = (comp‘𝐶)
subccocl.y	⊢ (𝜑 → 𝑌 ∈ 𝑆)
subccocl.z	⊢ (𝜑 → 𝑍 ∈ 𝑆)
subccocl.f	⊢ (𝜑 → 𝐹 ∈ (𝑋𝐽𝑌))
subccocl.g	⊢ (𝜑 → 𝐺 ∈ (𝑌𝐽𝑍))

Assertion

Ref	Expression
subccocl	⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ (𝑋𝐽𝑍))

Proof of Theorem subccocl

Dummy variables 𝑓 𝑔 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		subcidcl.j	. . . 4 ⊢ (𝜑 → 𝐽 ∈ (Subcat‘𝐶))
2		eqid 2763	. . . . 5 ⊢ (Homf ‘𝐶) = (Homf ‘𝐶)
3		eqid 2763	. . . . 5 ⊢ (Id‘𝐶) = (Id‘𝐶)
4		subccocl.o	. . . . 5 ⊢ · = (comp‘𝐶)
5		subcrcl 18020	. . . . . 6 ⊢ (𝐽 ∈ (Subcat‘𝐶) → 𝐶 ∈ Cat)
6	1, 5	syl 18	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ Cat)
7		subcidcl.2	. . . . 5 ⊢ (𝜑 → 𝐽 Fn (𝑆 × 𝑆))
8	2, 3, 4, 6, 7	issubc2 18040	. . . 4 ⊢ (𝜑 → (𝐽 ∈ (Subcat‘𝐶) ↔ (𝐽 ⊆cat (Homf ‘𝐶) ∧ ∀𝑥 ∈ 𝑆 (((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩ · 𝑧)𝑓) ∈ (𝑥𝐽𝑧)))))
9	1, 8	mpbid 235	. . 3 ⊢ (𝜑 → (𝐽 ⊆cat (Homf ‘𝐶) ∧ ∀𝑥 ∈ 𝑆 (((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩ · 𝑧)𝑓) ∈ (𝑥𝐽𝑧))))
10	9	simprd 501	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 (((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩ · 𝑧)𝑓) ∈ (𝑥𝐽𝑧)))
11		subcidcl.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑆)
12		subccocl.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑆)
13	12	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → 𝑌 ∈ 𝑆)
14		subccocl.z	. . . . . . 7 ⊢ (𝜑 → 𝑍 ∈ 𝑆)
15	14	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝑍 ∈ 𝑆)
16		subccocl.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐽𝑌))
17	16	ad3antrrr 743	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) → 𝐹 ∈ (𝑋𝐽𝑌))
18		simpllr 788	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) → 𝑥 = 𝑋)
19		simplr 781	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) → 𝑦 = 𝑌)
20	18, 19	oveq12d 7461	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) → (𝑥𝐽𝑦) = (𝑋𝐽𝑌))
21	17, 20	eleqtrrd 2867	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) → 𝐹 ∈ (𝑥𝐽𝑦))
22		subccocl.g	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 ∈ (𝑌𝐽𝑍))
23	22	ad4antr 745	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) → 𝐺 ∈ (𝑌𝐽𝑍))
24		simpllr 788	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) → 𝑦 = 𝑌)
25		simplr 781	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) → 𝑧 = 𝑍)
26	24, 25	oveq12d 7461	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) → (𝑦𝐽𝑧) = (𝑌𝐽𝑍))
27	23, 26	eleqtrrd 2867	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) → 𝐺 ∈ (𝑦𝐽𝑧))
28		simp-5r 798	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑥 = 𝑋)
29		simp-4r 796	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑦 = 𝑌)
30	28, 29	opeq12d 4851	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ⟨𝑥, 𝑦⟩ = ⟨𝑋, 𝑌⟩)
31		simpllr 788	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑧 = 𝑍)
32	30, 31	oveq12d 7461	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (⟨𝑥, 𝑦⟩ · 𝑧) = (⟨𝑋, 𝑌⟩ · 𝑍))
33		simpr 490	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺)
34		simplr 781	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑓 = 𝐹)
35	32, 33, 34	oveq123d 7464	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑔(⟨𝑥, 𝑦⟩ · 𝑧)𝑓) = (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))
36	28, 31	oveq12d 7461	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑥𝐽𝑧) = (𝑋𝐽𝑍))
37	35, 36	eleq12d 2858	. . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((𝑔(⟨𝑥, 𝑦⟩ · 𝑧)𝑓) ∈ (𝑥𝐽𝑧) ↔ (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ (𝑋𝐽𝑍)))
38	27, 37	rspcdv 3572	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) ∧ 𝑓 = 𝐹) → (∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩ · 𝑧)𝑓) ∈ (𝑥𝐽𝑧) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ (𝑋𝐽𝑍)))
39	21, 38	rspcimdv 3570	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) ∧ 𝑧 = 𝑍) → (∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩ · 𝑧)𝑓) ∈ (𝑥𝐽𝑧) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ (𝑋𝐽𝑍)))
40	15, 39	rspcimdv 3570	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → (∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩ · 𝑧)𝑓) ∈ (𝑥𝐽𝑧) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ (𝑋𝐽𝑍)))
41	13, 40	rspcimdv 3570	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩ · 𝑧)𝑓) ∈ (𝑥𝐽𝑧) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ (𝑋𝐽𝑍)))
42	41	adantld 496	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → ((((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩ · 𝑧)𝑓) ∈ (𝑥𝐽𝑧)) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ (𝑋𝐽𝑍)))
43	11, 42	rspcimdv 3570	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 (((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩ · 𝑧)𝑓) ∈ (𝑥𝐽𝑧)) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ (𝑋𝐽𝑍)))
44	10, 43	mpd 16	1 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ (𝑋𝐽𝑍))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ⟨cop 4838   class class class wbr 5106   × cxp 5653   Fn wfn 6553  ‘cfv 6558  (class class class)co 7443  compcco 17469  Catccat 17867  Idccid 17868  Hom_f chomf 17869   ⊆_cat cssc 18011  Subcatcsubc 18013

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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  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 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-pm 8878  df-ixp 8954  df-ssc 18014  df-subc 18016

This theorem is used by:  subccatid  18050  funcres  18100  iinfsubc  50377