MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ressffth Structured version   Visualization version   GIF version

Theorem ressffth 17200
Description: The inclusion functor from a full subcategory is a full and faithful functor, see also remark 4.4(2) in [Adamek] p. 49. (Contributed by Mario Carneiro, 27-Jan-2017.)
Hypotheses
Ref Expression
ressffth.d 𝐷 = (𝐶s 𝑆)
ressffth.i 𝐼 = (idfunc𝐷)
Assertion
Ref Expression
ressffth ((𝐶 ∈ Cat ∧ 𝑆𝑉) → 𝐼 ∈ ((𝐷 Full 𝐶) ∩ (𝐷 Faith 𝐶)))

Proof of Theorem ressffth
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relfunc 17124 . . 3 Rel (𝐷 Func 𝐷)
2 ressffth.d . . . . 5 𝐷 = (𝐶s 𝑆)
3 resscat 17114 . . . . 5 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (𝐶s 𝑆) ∈ Cat)
42, 3eqeltrid 2894 . . . 4 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → 𝐷 ∈ Cat)
5 ressffth.i . . . . 5 𝐼 = (idfunc𝐷)
65idfucl 17143 . . . 4 (𝐷 ∈ Cat → 𝐼 ∈ (𝐷 Func 𝐷))
74, 6syl 17 . . 3 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → 𝐼 ∈ (𝐷 Func 𝐷))
8 1st2nd 7720 . . 3 ((Rel (𝐷 Func 𝐷) ∧ 𝐼 ∈ (𝐷 Func 𝐷)) → 𝐼 = ⟨(1st𝐼), (2nd𝐼)⟩)
91, 7, 8sylancr 590 . 2 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → 𝐼 = ⟨(1st𝐼), (2nd𝐼)⟩)
10 eqidd 2799 . . . . . . . . 9 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (Homf𝐷) = (Homf𝐷))
11 eqidd 2799 . . . . . . . . 9 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (compf𝐷) = (compf𝐷))
12 eqid 2798 . . . . . . . . . . . . . 14 (Base‘𝐶) = (Base‘𝐶)
1312ressinbas 16552 . . . . . . . . . . . . 13 (𝑆𝑉 → (𝐶s 𝑆) = (𝐶s (𝑆 ∩ (Base‘𝐶))))
1413adantl 485 . . . . . . . . . . . 12 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (𝐶s 𝑆) = (𝐶s (𝑆 ∩ (Base‘𝐶))))
152, 14syl5eq 2845 . . . . . . . . . . 11 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → 𝐷 = (𝐶s (𝑆 ∩ (Base‘𝐶))))
1615fveq2d 6649 . . . . . . . . . 10 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (Homf𝐷) = (Homf ‘(𝐶s (𝑆 ∩ (Base‘𝐶)))))
17 eqid 2798 . . . . . . . . . . . 12 (Homf𝐶) = (Homf𝐶)
18 simpl 486 . . . . . . . . . . . 12 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → 𝐶 ∈ Cat)
19 inss2 4156 . . . . . . . . . . . . 13 (𝑆 ∩ (Base‘𝐶)) ⊆ (Base‘𝐶)
2019a1i 11 . . . . . . . . . . . 12 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (𝑆 ∩ (Base‘𝐶)) ⊆ (Base‘𝐶))
21 eqid 2798 . . . . . . . . . . . 12 (𝐶s (𝑆 ∩ (Base‘𝐶))) = (𝐶s (𝑆 ∩ (Base‘𝐶)))
22 eqid 2798 . . . . . . . . . . . 12 (𝐶cat ((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶))))) = (𝐶cat ((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶)))))
2312, 17, 18, 20, 21, 22fullresc 17113 . . . . . . . . . . 11 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → ((Homf ‘(𝐶s (𝑆 ∩ (Base‘𝐶)))) = (Homf ‘(𝐶cat ((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶)))))) ∧ (compf‘(𝐶s (𝑆 ∩ (Base‘𝐶)))) = (compf‘(𝐶cat ((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶))))))))
2423simpld 498 . . . . . . . . . 10 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (Homf ‘(𝐶s (𝑆 ∩ (Base‘𝐶)))) = (Homf ‘(𝐶cat ((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶)))))))
2516, 24eqtrd 2833 . . . . . . . . 9 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (Homf𝐷) = (Homf ‘(𝐶cat ((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶)))))))
2615fveq2d 6649 . . . . . . . . . 10 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (compf𝐷) = (compf‘(𝐶s (𝑆 ∩ (Base‘𝐶)))))
2723simprd 499 . . . . . . . . . 10 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (compf‘(𝐶s (𝑆 ∩ (Base‘𝐶)))) = (compf‘(𝐶cat ((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶)))))))
2826, 27eqtrd 2833 . . . . . . . . 9 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (compf𝐷) = (compf‘(𝐶cat ((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶)))))))
292ovexi 7169 . . . . . . . . . 10 𝐷 ∈ V
3029a1i 11 . . . . . . . . 9 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → 𝐷 ∈ V)
31 ovexd 7170 . . . . . . . . 9 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (𝐶cat ((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶))))) ∈ V)
3210, 11, 25, 28, 30, 30, 30, 31funcpropd 17162 . . . . . . . 8 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (𝐷 Func 𝐷) = (𝐷 Func (𝐶cat ((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶)))))))
3312, 17, 18, 20fullsubc 17112 . . . . . . . . 9 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → ((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶)))) ∈ (Subcat‘𝐶))
34 funcres2 17160 . . . . . . . . 9 (((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶)))) ∈ (Subcat‘𝐶) → (𝐷 Func (𝐶cat ((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶)))))) ⊆ (𝐷 Func 𝐶))
3533, 34syl 17 . . . . . . . 8 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (𝐷 Func (𝐶cat ((Homf𝐶) ↾ ((𝑆 ∩ (Base‘𝐶)) × (𝑆 ∩ (Base‘𝐶)))))) ⊆ (𝐷 Func 𝐶))
3632, 35eqsstrd 3953 . . . . . . 7 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (𝐷 Func 𝐷) ⊆ (𝐷 Func 𝐶))
3736, 7sseldd 3916 . . . . . 6 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → 𝐼 ∈ (𝐷 Func 𝐶))
389, 37eqeltrrd 2891 . . . . 5 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → ⟨(1st𝐼), (2nd𝐼)⟩ ∈ (𝐷 Func 𝐶))
39 df-br 5031 . . . . 5 ((1st𝐼)(𝐷 Func 𝐶)(2nd𝐼) ↔ ⟨(1st𝐼), (2nd𝐼)⟩ ∈ (𝐷 Func 𝐶))
4038, 39sylibr 237 . . . 4 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (1st𝐼)(𝐷 Func 𝐶)(2nd𝐼))
41 f1oi 6627 . . . . . 6 ( I ↾ (𝑥(Hom ‘𝐷)𝑦)):(𝑥(Hom ‘𝐷)𝑦)–1-1-onto→(𝑥(Hom ‘𝐷)𝑦)
42 eqid 2798 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
434adantr 484 . . . . . . . 8 (((𝐶 ∈ Cat ∧ 𝑆𝑉) ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝐷 ∈ Cat)
44 eqid 2798 . . . . . . . 8 (Hom ‘𝐷) = (Hom ‘𝐷)
45 simprl 770 . . . . . . . 8 (((𝐶 ∈ Cat ∧ 𝑆𝑉) ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝑥 ∈ (Base‘𝐷))
46 simprr 772 . . . . . . . 8 (((𝐶 ∈ Cat ∧ 𝑆𝑉) ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝑦 ∈ (Base‘𝐷))
475, 42, 43, 44, 45, 46idfu2nd 17139 . . . . . . 7 (((𝐶 ∈ Cat ∧ 𝑆𝑉) ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (𝑥(2nd𝐼)𝑦) = ( I ↾ (𝑥(Hom ‘𝐷)𝑦)))
48 eqidd 2799 . . . . . . 7 (((𝐶 ∈ Cat ∧ 𝑆𝑉) ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (𝑥(Hom ‘𝐷)𝑦) = (𝑥(Hom ‘𝐷)𝑦))
49 eqid 2798 . . . . . . . . . 10 (Hom ‘𝐶) = (Hom ‘𝐶)
502, 49resshom 16683 . . . . . . . . 9 (𝑆𝑉 → (Hom ‘𝐶) = (Hom ‘𝐷))
5150ad2antlr 726 . . . . . . . 8 (((𝐶 ∈ Cat ∧ 𝑆𝑉) ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (Hom ‘𝐶) = (Hom ‘𝐷))
525, 42, 43, 45idfu1 17142 . . . . . . . 8 (((𝐶 ∈ Cat ∧ 𝑆𝑉) ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → ((1st𝐼)‘𝑥) = 𝑥)
535, 42, 43, 46idfu1 17142 . . . . . . . 8 (((𝐶 ∈ Cat ∧ 𝑆𝑉) ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → ((1st𝐼)‘𝑦) = 𝑦)
5451, 52, 53oveq123d 7156 . . . . . . 7 (((𝐶 ∈ Cat ∧ 𝑆𝑉) ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (((1st𝐼)‘𝑥)(Hom ‘𝐶)((1st𝐼)‘𝑦)) = (𝑥(Hom ‘𝐷)𝑦))
5547, 48, 54f1oeq123d 6585 . . . . . 6 (((𝐶 ∈ Cat ∧ 𝑆𝑉) ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → ((𝑥(2nd𝐼)𝑦):(𝑥(Hom ‘𝐷)𝑦)–1-1-onto→(((1st𝐼)‘𝑥)(Hom ‘𝐶)((1st𝐼)‘𝑦)) ↔ ( I ↾ (𝑥(Hom ‘𝐷)𝑦)):(𝑥(Hom ‘𝐷)𝑦)–1-1-onto→(𝑥(Hom ‘𝐷)𝑦)))
5641, 55mpbiri 261 . . . . 5 (((𝐶 ∈ Cat ∧ 𝑆𝑉) ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (𝑥(2nd𝐼)𝑦):(𝑥(Hom ‘𝐷)𝑦)–1-1-onto→(((1st𝐼)‘𝑥)(Hom ‘𝐶)((1st𝐼)‘𝑦)))
5756ralrimivva 3156 . . . 4 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → ∀𝑥 ∈ (Base‘𝐷)∀𝑦 ∈ (Base‘𝐷)(𝑥(2nd𝐼)𝑦):(𝑥(Hom ‘𝐷)𝑦)–1-1-onto→(((1st𝐼)‘𝑥)(Hom ‘𝐶)((1st𝐼)‘𝑦)))
5842, 44, 49isffth2 17178 . . . 4 ((1st𝐼)((𝐷 Full 𝐶) ∩ (𝐷 Faith 𝐶))(2nd𝐼) ↔ ((1st𝐼)(𝐷 Func 𝐶)(2nd𝐼) ∧ ∀𝑥 ∈ (Base‘𝐷)∀𝑦 ∈ (Base‘𝐷)(𝑥(2nd𝐼)𝑦):(𝑥(Hom ‘𝐷)𝑦)–1-1-onto→(((1st𝐼)‘𝑥)(Hom ‘𝐶)((1st𝐼)‘𝑦))))
5940, 57, 58sylanbrc 586 . . 3 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → (1st𝐼)((𝐷 Full 𝐶) ∩ (𝐷 Faith 𝐶))(2nd𝐼))
60 df-br 5031 . . 3 ((1st𝐼)((𝐷 Full 𝐶) ∩ (𝐷 Faith 𝐶))(2nd𝐼) ↔ ⟨(1st𝐼), (2nd𝐼)⟩ ∈ ((𝐷 Full 𝐶) ∩ (𝐷 Faith 𝐶)))
6159, 60sylib 221 . 2 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → ⟨(1st𝐼), (2nd𝐼)⟩ ∈ ((𝐷 Full 𝐶) ∩ (𝐷 Faith 𝐶)))
629, 61eqeltrd 2890 1 ((𝐶 ∈ Cat ∧ 𝑆𝑉) → 𝐼 ∈ ((𝐷 Full 𝐶) ∩ (𝐷 Faith 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wcel 2111  wral 3106  Vcvv 3441  cin 3880  wss 3881  cop 4531   class class class wbr 5030   I cid 5424   × cxp 5517  cres 5521  Rel wrel 5524  1-1-ontowf1o 6323  cfv 6324  (class class class)co 7135  1st c1st 7669  2nd c2nd 7670  Basecbs 16475  s cress 16476  Hom chom 16568  Catccat 16927  Homf chomf 16929  compfccomf 16930  cat cresc 17070  Subcatcsubc 17071   Func cfunc 17116  idfunccidfu 17117   Full cful 17164   Faith cfth 17165
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-er 8272  df-map 8391  df-pm 8392  df-ixp 8445  df-en 8493  df-dom 8494  df-sdom 8495  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-nn 11626  df-2 11688  df-3 11689  df-4 11690  df-5 11691  df-6 11692  df-7 11693  df-8 11694  df-9 11695  df-n0 11886  df-z 11970  df-dec 12087  df-ndx 16478  df-slot 16479  df-base 16481  df-sets 16482  df-ress 16483  df-hom 16581  df-cco 16582  df-cat 16931  df-cid 16932  df-homf 16933  df-comf 16934  df-ssc 17072  df-resc 17073  df-subc 17074  df-func 17120  df-idfu 17121  df-full 17166  df-fth 17167
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator