Theorem cidfn 17903

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.

Step	Hyp	Ref	Expression
1		riotaex 7412	. . 3 ⊢ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓)) ∈ V
2		eqid 2763	. . 3 ⊢ (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓))) = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓)))
3	1, 2	fnmpti 6712	. 2 ⊢ (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓))) Fn 𝐵
4		cidfn.b	. . . 4 ⊢ 𝐵 = (Base‘𝐶)
5		eqid 2763	. . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
6		eqid 2763	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
7		id 23	. . . 4 ⊢ (𝐶 ∈ Cat → 𝐶 ∈ Cat)
8		cidfn.i	. . . 4 ⊢ 1 = (Id‘𝐶)
9	4, 5, 6, 7, 8	cidfval 17900	. . 3 ⊢ (𝐶 ∈ Cat → 1 = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓))))
10	9	fneq1d 6662	. 2 ⊢ (𝐶 ∈ Cat → ( 1 Fn 𝐵 ↔ (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)𝑔) = 𝑓))) Fn 𝐵))
11	3, 10	mpbiri 261	1 ⊢ (𝐶 ∈ Cat → 1 Fn 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ⟨cop 4840   ↦ cmpt 5192   Fn wfn 6561  ‘cfv 6566  ℩crio 7407  (class class class)co 7451  Basecbs 17431  Hom chom 17483  compcco 17484  Catccat 17888  Idccid 17889

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-cid 17893

This theorem is used by:  oppccatid  17943  fucidcl  18193  fucsect  18200  curfcl  18456  curf2ndf  18471  fucoid  50801