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

Theorem idffth 16793
Description: The identity functor is a fully faithful functor. (Contributed by Mario Carneiro, 27-Jan-2017.)
Hypothesis
Ref Expression
idffth.i 𝐼 = (idfunc𝐶)
Assertion
Ref Expression
idffth (𝐶 ∈ Cat → 𝐼 ∈ ((𝐶 Full 𝐶) ∩ (𝐶 Faith 𝐶)))

Proof of Theorem idffth
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relfunc 16722 . . 3 Rel (𝐶 Func 𝐶)
2 idffth.i . . . 4 𝐼 = (idfunc𝐶)
32idfucl 16741 . . 3 (𝐶 ∈ Cat → 𝐼 ∈ (𝐶 Func 𝐶))
4 1st2nd 7442 . . 3 ((Rel (𝐶 Func 𝐶) ∧ 𝐼 ∈ (𝐶 Func 𝐶)) → 𝐼 = ⟨(1st𝐼), (2nd𝐼)⟩)
51, 3, 4sylancr 577 . 2 (𝐶 ∈ Cat → 𝐼 = ⟨(1st𝐼), (2nd𝐼)⟩)
65, 3eqeltrrd 2886 . . . . 5 (𝐶 ∈ Cat → ⟨(1st𝐼), (2nd𝐼)⟩ ∈ (𝐶 Func 𝐶))
7 df-br 4845 . . . . 5 ((1st𝐼)(𝐶 Func 𝐶)(2nd𝐼) ↔ ⟨(1st𝐼), (2nd𝐼)⟩ ∈ (𝐶 Func 𝐶))
86, 7sylibr 225 . . . 4 (𝐶 ∈ Cat → (1st𝐼)(𝐶 Func 𝐶)(2nd𝐼))
9 f1oi 6386 . . . . . 6 ( I ↾ (𝑥(Hom ‘𝐶)𝑦)):(𝑥(Hom ‘𝐶)𝑦)–1-1-onto→(𝑥(Hom ‘𝐶)𝑦)
10 eqid 2806 . . . . . . . 8 (Base‘𝐶) = (Base‘𝐶)
11 simpl 470 . . . . . . . 8 ((𝐶 ∈ Cat ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝐶 ∈ Cat)
12 eqid 2806 . . . . . . . 8 (Hom ‘𝐶) = (Hom ‘𝐶)
13 simprl 778 . . . . . . . 8 ((𝐶 ∈ Cat ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝑥 ∈ (Base‘𝐶))
14 simprr 780 . . . . . . . 8 ((𝐶 ∈ Cat ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝑦 ∈ (Base‘𝐶))
152, 10, 11, 12, 13, 14idfu2nd 16737 . . . . . . 7 ((𝐶 ∈ Cat ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥(2nd𝐼)𝑦) = ( I ↾ (𝑥(Hom ‘𝐶)𝑦)))
16 eqidd 2807 . . . . . . 7 ((𝐶 ∈ Cat ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥(Hom ‘𝐶)𝑦) = (𝑥(Hom ‘𝐶)𝑦))
172, 10, 11, 13idfu1 16740 . . . . . . . 8 ((𝐶 ∈ Cat ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((1st𝐼)‘𝑥) = 𝑥)
182, 10, 11, 14idfu1 16740 . . . . . . . 8 ((𝐶 ∈ Cat ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((1st𝐼)‘𝑦) = 𝑦)
1917, 18oveq12d 6888 . . . . . . 7 ((𝐶 ∈ Cat ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (((1st𝐼)‘𝑥)(Hom ‘𝐶)((1st𝐼)‘𝑦)) = (𝑥(Hom ‘𝐶)𝑦))
2015, 16, 19f1oeq123d 6345 . . . . . 6 ((𝐶 ∈ Cat ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((𝑥(2nd𝐼)𝑦):(𝑥(Hom ‘𝐶)𝑦)–1-1-onto→(((1st𝐼)‘𝑥)(Hom ‘𝐶)((1st𝐼)‘𝑦)) ↔ ( I ↾ (𝑥(Hom ‘𝐶)𝑦)):(𝑥(Hom ‘𝐶)𝑦)–1-1-onto→(𝑥(Hom ‘𝐶)𝑦)))
219, 20mpbiri 249 . . . . 5 ((𝐶 ∈ Cat ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥(2nd𝐼)𝑦):(𝑥(Hom ‘𝐶)𝑦)–1-1-onto→(((1st𝐼)‘𝑥)(Hom ‘𝐶)((1st𝐼)‘𝑦)))
2221ralrimivva 3159 . . . 4 (𝐶 ∈ Cat → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)(𝑥(2nd𝐼)𝑦):(𝑥(Hom ‘𝐶)𝑦)–1-1-onto→(((1st𝐼)‘𝑥)(Hom ‘𝐶)((1st𝐼)‘𝑦)))
2310, 12, 12isffth2 16776 . . . 4 ((1st𝐼)((𝐶 Full 𝐶) ∩ (𝐶 Faith 𝐶))(2nd𝐼) ↔ ((1st𝐼)(𝐶 Func 𝐶)(2nd𝐼) ∧ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)(𝑥(2nd𝐼)𝑦):(𝑥(Hom ‘𝐶)𝑦)–1-1-onto→(((1st𝐼)‘𝑥)(Hom ‘𝐶)((1st𝐼)‘𝑦))))
248, 22, 23sylanbrc 574 . . 3 (𝐶 ∈ Cat → (1st𝐼)((𝐶 Full 𝐶) ∩ (𝐶 Faith 𝐶))(2nd𝐼))
25 df-br 4845 . . 3 ((1st𝐼)((𝐶 Full 𝐶) ∩ (𝐶 Faith 𝐶))(2nd𝐼) ↔ ⟨(1st𝐼), (2nd𝐼)⟩ ∈ ((𝐶 Full 𝐶) ∩ (𝐶 Faith 𝐶)))
2624, 25sylib 209 . 2 (𝐶 ∈ Cat → ⟨(1st𝐼), (2nd𝐼)⟩ ∈ ((𝐶 Full 𝐶) ∩ (𝐶 Faith 𝐶)))
275, 26eqeltrd 2885 1 (𝐶 ∈ Cat → 𝐼 ∈ ((𝐶 Full 𝐶) ∩ (𝐶 Faith 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1637  wcel 2156  wral 3096  cin 3768  cop 4376   class class class wbr 4844   I cid 5218  cres 5313  Rel wrel 5316  1-1-ontowf1o 6096  cfv 6097  (class class class)co 6870  1st c1st 7392  2nd c2nd 7393  Basecbs 16064  Hom chom 16160  Catccat 16525   Func cfunc 16714  idfunccidfu 16715   Full cful 16762   Faith cfth 16763
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2068  ax-7 2104  ax-8 2158  ax-9 2165  ax-10 2185  ax-11 2201  ax-12 2214  ax-13 2420  ax-ext 2784  ax-rep 4964  ax-sep 4975  ax-nul 4983  ax-pow 5035  ax-pr 5096  ax-un 7175
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2061  df-eu 2634  df-mo 2635  df-clab 2793  df-cleq 2799  df-clel 2802  df-nfc 2937  df-ne 2979  df-ral 3101  df-rex 3102  df-reu 3103  df-rmo 3104  df-rab 3105  df-v 3393  df-sbc 3634  df-csb 3729  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-nul 4117  df-if 4280  df-pw 4353  df-sn 4371  df-pr 4373  df-op 4377  df-uni 4631  df-iun 4714  df-br 4845  df-opab 4907  df-mpt 4924  df-id 5219  df-xp 5317  df-rel 5318  df-cnv 5319  df-co 5320  df-dm 5321  df-rn 5322  df-res 5323  df-ima 5324  df-iota 6060  df-fun 6099  df-fn 6100  df-f 6101  df-f1 6102  df-fo 6103  df-f1o 6104  df-fv 6105  df-riota 6831  df-ov 6873  df-oprab 6874  df-mpt2 6875  df-1st 7394  df-2nd 7395  df-map 8090  df-ixp 8142  df-cat 16529  df-cid 16530  df-func 16718  df-idfu 16719  df-full 16764  df-fth 16765
This theorem is referenced by:  rescfth  16797
  Copyright terms: Public domain W3C validator