Theorem subsubc 16513

Description: A subcategory of a subcategory is a subcategory. (Contributed by Mario Carneiro, 6-Jan-2017.)

Hypothesis

Ref	Expression
subsubc.d	⊢ 𝐷 = (𝐶 ↾cat 𝐻)

Assertion

Ref	Expression
subsubc	⊢ (𝐻 ∈ (Subcat‘𝐶) → (𝐽 ∈ (Subcat‘𝐷) ↔ (𝐽 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻)))

Proof of Theorem subsubc

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 22	. . . . . 6 ⊢ (𝐽 ∈ (Subcat‘𝐷) → 𝐽 ∈ (Subcat‘𝐷))
2		eqid 2622	. . . . . 6 ⊢ (Homf ‘𝐷) = (Homf ‘𝐷)
3	1, 2	subcssc 16500	. . . . 5 ⊢ (𝐽 ∈ (Subcat‘𝐷) → 𝐽 ⊆cat (Homf ‘𝐷))
4		subsubc.d	. . . . . . 7 ⊢ 𝐷 = (𝐶 ↾cat 𝐻)
5		eqid 2622	. . . . . . 7 ⊢ (Base‘𝐶) = (Base‘𝐶)
6		subcrcl 16476	. . . . . . 7 ⊢ (𝐻 ∈ (Subcat‘𝐶) → 𝐶 ∈ Cat)
7		id 22	. . . . . . . 8 ⊢ (𝐻 ∈ (Subcat‘𝐶) → 𝐻 ∈ (Subcat‘𝐶))
8		eqidd 2623	. . . . . . . 8 ⊢ (𝐻 ∈ (Subcat‘𝐶) → dom dom 𝐻 = dom dom 𝐻)
9	7, 8	subcfn 16501	. . . . . . 7 ⊢ (𝐻 ∈ (Subcat‘𝐶) → 𝐻 Fn (dom dom 𝐻 × dom dom 𝐻))
10	7, 9, 5	subcss1 16502	. . . . . . 7 ⊢ (𝐻 ∈ (Subcat‘𝐶) → dom dom 𝐻 ⊆ (Base‘𝐶))
11	4, 5, 6, 9, 10	reschomf 16491	. . . . . 6 ⊢ (𝐻 ∈ (Subcat‘𝐶) → 𝐻 = (Homf ‘𝐷))
12	11	breq2d 4665	. . . . 5 ⊢ (𝐻 ∈ (Subcat‘𝐶) → (𝐽 ⊆cat 𝐻 ↔ 𝐽 ⊆cat (Homf ‘𝐷)))
13	3, 12	syl5ibr 236	. . . 4 ⊢ (𝐻 ∈ (Subcat‘𝐶) → (𝐽 ∈ (Subcat‘𝐷) → 𝐽 ⊆cat 𝐻))
14	13	pm4.71rd 667	. . 3 ⊢ (𝐻 ∈ (Subcat‘𝐶) → (𝐽 ∈ (Subcat‘𝐷) ↔ (𝐽 ⊆cat 𝐻 ∧ 𝐽 ∈ (Subcat‘𝐷))))
15		simpr 477	. . . . . . . 8 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → 𝐽 ⊆cat 𝐻)
16		simpl 473	. . . . . . . . 9 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → 𝐻 ∈ (Subcat‘𝐶))
17		eqid 2622	. . . . . . . . 9 ⊢ (Homf ‘𝐶) = (Homf ‘𝐶)
18	16, 17	subcssc 16500	. . . . . . . 8 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → 𝐻 ⊆cat (Homf ‘𝐶))
19		ssctr 16485	. . . . . . . 8 ⊢ ((𝐽 ⊆cat 𝐻 ∧ 𝐻 ⊆cat (Homf ‘𝐶)) → 𝐽 ⊆cat (Homf ‘𝐶))
20	15, 18, 19	syl2anc 693	. . . . . . 7 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → 𝐽 ⊆cat (Homf ‘𝐶))
21	12	biimpa 501	. . . . . . 7 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → 𝐽 ⊆cat (Homf ‘𝐷))
22	20, 21	2thd 255	. . . . . 6 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → (𝐽 ⊆cat (Homf ‘𝐶) ↔ 𝐽 ⊆cat (Homf ‘𝐷)))
23	16	adantr 481	. . . . . . . . 9 ⊢ (((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) ∧ 𝑥 ∈ dom dom 𝐽) → 𝐻 ∈ (Subcat‘𝐶))
24	9	adantr 481	. . . . . . . . . 10 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → 𝐻 Fn (dom dom 𝐻 × dom dom 𝐻))
25	24	adantr 481	. . . . . . . . 9 ⊢ (((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) ∧ 𝑥 ∈ dom dom 𝐽) → 𝐻 Fn (dom dom 𝐻 × dom dom 𝐻))
26		eqid 2622	. . . . . . . . 9 ⊢ (Id‘𝐶) = (Id‘𝐶)
27		eqidd 2623	. . . . . . . . . . . 12 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → dom dom 𝐽 = dom dom 𝐽)
28	15, 27	sscfn1 16477	. . . . . . . . . . 11 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → 𝐽 Fn (dom dom 𝐽 × dom dom 𝐽))
29	28, 24, 15	ssc1 16481	. . . . . . . . . 10 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → dom dom 𝐽 ⊆ dom dom 𝐻)
30	29	sselda 3603	. . . . . . . . 9 ⊢ (((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) ∧ 𝑥 ∈ dom dom 𝐽) → 𝑥 ∈ dom dom 𝐻)
31	4, 23, 25, 26, 30	subcid 16507	. . . . . . . 8 ⊢ (((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) ∧ 𝑥 ∈ dom dom 𝐽) → ((Id‘𝐶)‘𝑥) = ((Id‘𝐷)‘𝑥))
32	31	eleq1d 2686	. . . . . . 7 ⊢ (((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) ∧ 𝑥 ∈ dom dom 𝐽) → (((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ↔ ((Id‘𝐷)‘𝑥) ∈ (𝑥𝐽𝑥)))
33	32	ralbidva 2985	. . . . . 6 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → (∀𝑥 ∈ dom dom 𝐽((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ↔ ∀𝑥 ∈ dom dom 𝐽((Id‘𝐷)‘𝑥) ∈ (𝑥𝐽𝑥)))
34	4	oveq1i 6660	. . . . . . . 8 ⊢ (𝐷 ↾cat 𝐽) = ((𝐶 ↾cat 𝐻) ↾cat 𝐽)
35	6	adantr 481	. . . . . . . . 9 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → 𝐶 ∈ Cat)
36		dmexg 7097	. . . . . . . . . . 11 ⊢ (𝐻 ∈ (Subcat‘𝐶) → dom 𝐻 ∈ V)
37		dmexg 7097	. . . . . . . . . . 11 ⊢ (dom 𝐻 ∈ V → dom dom 𝐻 ∈ V)
38	36, 37	syl 17	. . . . . . . . . 10 ⊢ (𝐻 ∈ (Subcat‘𝐶) → dom dom 𝐻 ∈ V)
39	38	adantr 481	. . . . . . . . 9 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → dom dom 𝐻 ∈ V)
40	35, 24, 28, 39, 29	rescabs 16493	. . . . . . . 8 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → ((𝐶 ↾cat 𝐻) ↾cat 𝐽) = (𝐶 ↾cat 𝐽))
41	34, 40	syl5req 2669	. . . . . . 7 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → (𝐶 ↾cat 𝐽) = (𝐷 ↾cat 𝐽))
42	41	eleq1d 2686	. . . . . 6 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → ((𝐶 ↾cat 𝐽) ∈ Cat ↔ (𝐷 ↾cat 𝐽) ∈ Cat))
43	22, 33, 42	3anbi123d 1399	. . . . 5 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → ((𝐽 ⊆cat (Homf ‘𝐶) ∧ ∀𝑥 ∈ dom dom 𝐽((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ (𝐶 ↾cat 𝐽) ∈ Cat) ↔ (𝐽 ⊆cat (Homf ‘𝐷) ∧ ∀𝑥 ∈ dom dom 𝐽((Id‘𝐷)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ (𝐷 ↾cat 𝐽) ∈ Cat)))
44		eqid 2622	. . . . . 6 ⊢ (𝐶 ↾cat 𝐽) = (𝐶 ↾cat 𝐽)
45	17, 26, 44, 35, 28	issubc3 16509	. . . . 5 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → (𝐽 ∈ (Subcat‘𝐶) ↔ (𝐽 ⊆cat (Homf ‘𝐶) ∧ ∀𝑥 ∈ dom dom 𝐽((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ (𝐶 ↾cat 𝐽) ∈ Cat)))
46		eqid 2622	. . . . . 6 ⊢ (Id‘𝐷) = (Id‘𝐷)
47		eqid 2622	. . . . . 6 ⊢ (𝐷 ↾cat 𝐽) = (𝐷 ↾cat 𝐽)
48	4, 7	subccat 16508	. . . . . . 7 ⊢ (𝐻 ∈ (Subcat‘𝐶) → 𝐷 ∈ Cat)
49	48	adantr 481	. . . . . 6 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → 𝐷 ∈ Cat)
50	2, 46, 47, 49, 28	issubc3 16509	. . . . 5 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → (𝐽 ∈ (Subcat‘𝐷) ↔ (𝐽 ⊆cat (Homf ‘𝐷) ∧ ∀𝑥 ∈ dom dom 𝐽((Id‘𝐷)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ (𝐷 ↾cat 𝐽) ∈ Cat)))
51	43, 45, 50	3bitr4rd 301	. . . 4 ⊢ ((𝐻 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻) → (𝐽 ∈ (Subcat‘𝐷) ↔ 𝐽 ∈ (Subcat‘𝐶)))
52	51	pm5.32da 673	. . 3 ⊢ (𝐻 ∈ (Subcat‘𝐶) → ((𝐽 ⊆cat 𝐻 ∧ 𝐽 ∈ (Subcat‘𝐷)) ↔ (𝐽 ⊆cat 𝐻 ∧ 𝐽 ∈ (Subcat‘𝐶))))
53	14, 52	bitrd 268	. 2 ⊢ (𝐻 ∈ (Subcat‘𝐶) → (𝐽 ∈ (Subcat‘𝐷) ↔ (𝐽 ⊆cat 𝐻 ∧ 𝐽 ∈ (Subcat‘𝐶))))
54		ancom 466	. 2 ⊢ ((𝐽 ⊆cat 𝐻 ∧ 𝐽 ∈ (Subcat‘𝐶)) ↔ (𝐽 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻))
55	53, 54	syl6bb 276	1 ⊢ (𝐻 ∈ (Subcat‘𝐶) → (𝐽 ∈ (Subcat‘𝐷) ↔ (𝐽 ∈ (Subcat‘𝐶) ∧ 𝐽 ⊆cat 𝐻)))

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1037   = wceq 1483   ∈ wcel 1990  ∀wral 2912  Vcvv 3200   class class class wbr 4653   × cxp 5112  dom cdm 5114   Fn wfn 5883  ‘cfv 5888  (class class class)co 6650  Basecbs 15857  Catccat 16325  Idccid 16326  Hom_f chomf 16327   ⊆_cat cssc 16467   ↾_cat cresc 16468  Subcatcsubc 16469

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-fal 1489  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-er 7742  df-pm 7860  df-ixp 7909  df-en 7956  df-dom 7957  df-sdom 7958  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-nn 11021  df-2 11079  df-3 11080  df-4 11081  df-5 11082  df-6 11083  df-7 11084  df-8 11085  df-9 11086  df-n0 11293  df-z 11378  df-dec 11494  df-ndx 15860  df-slot 15861  df-base 15863  df-sets 15864  df-ress 15865  df-hom 15966  df-cco 15967  df-cat 16329  df-cid 16330  df-homf 16331  df-ssc 16470  df-resc 16471  df-subc 16472

This theorem is referenced by:  fldhmsubc  42084  fldhmsubcALTV  42102