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

Theorem cidfn 17768
Description: The identity arrow operator is a function from objects to arrows. (Contributed by Mario Carneiro, 4-Jan-2017.)
Hypotheses
Ref Expression
cidfn.b 𝐵 = (Base‘𝐶)
cidfn.i 1 = (Id‘𝐶)
Assertion
Ref Expression
cidfn (𝐶 ∈ Cat → 1 Fn 𝐵)

Proof of Theorem cidfn
Dummy variables 𝑓 𝑔 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 riotaex 7375 . . 3 (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓)) ∈ V
2 eqid 2760 . . 3 (𝑥𝐵 ↦ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓))) = (𝑥𝐵 ↦ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓)))
31, 2fnmpti 6676 . 2 (𝑥𝐵 ↦ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓))) Fn 𝐵
4 cidfn.b . . . 4 𝐵 = (Base‘𝐶)
5 eqid 2760 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
6 eqid 2760 . . . 4 (comp‘𝐶) = (comp‘𝐶)
7 id 23 . . . 4 (𝐶 ∈ Cat → 𝐶 ∈ Cat)
8 cidfn.i . . . 4 1 = (Id‘𝐶)
94, 5, 6, 7, 8cidfval 17765 . . 3 (𝐶 ∈ Cat → 1 = (𝑥𝐵 ↦ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓))))
109fneq1d 6626 . 2 (𝐶 ∈ Cat → ( 1 Fn 𝐵 ↔ (𝑥𝐵 ↦ (𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓))) Fn 𝐵))
113, 10mpbiri 261 1 (𝐶 ∈ Cat → 1 Fn 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wral 3076  cop 4590  cmpt 5186   Fn wfn 6528  cfv 6533  crio 7370  (class class class)co 7414  Basecbs 17302  Hom chom 17354  compcco 17355  Catccat 17753  Idccid 17754
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pr 5398
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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  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 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-cid 17758
This theorem is used by:  oppccatid  17808  fucidcl  18058  fucsect  18065  curfcl  18321  curf2ndf  18336  fucoid  50275
  Copyright terms: Public domain W3C validator