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

Theorem cidfn 17853
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 7381 . . 3 (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓)) ∈ V
2 eqid 2761 . . 3 (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓))) = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓)))
31, 2fnmpti 6682 . 2 (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓))) Fn 𝐵
4 cidfn.b . . . 4 𝐵 = (Base‘𝐶)
5 eqid 2761 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
6 eqid 2761 . . . 4 (comp‘𝐶) = (comp‘𝐶)
7 id 23 . . . 4 (𝐶 ∈ Cat → 𝐶 ∈ Cat)
8 cidfn.i . . . 4 1 = (Id‘𝐶)
94, 5, 6, 7, 8cidfval 17850 . . 3 (𝐶 ∈ Cat → 1 = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓))))
109fneq1d 6632 . 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 3077  ⟨cop 4590   ↦ cmpt 5186   Fn wfn 6533  ‘cfv 6538  ℩crio 7376  (class class class)co 7420  Basecbs 17387  Hom chom 17439  compcco 17440  Catccat 17838  Idccid 17839
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-cid 17843
This theorem is used by:  oppccatid  17893  fucidcl  18143  fucsect  18150  curfcl  18406  curf2ndf  18421  fucoid  50455
  Copyright terms: Public domain W3C validator