| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cidfn | Structured version Visualization version GIF version | ||
| Description: The identity arrow operator is a function from objects to arrows. (Contributed by Mario Carneiro, 4-Jan-2017.) |
| Ref | Expression |
|---|---|
| cidfn.b | ⊢ 𝐵 = (Base‘𝐶) |
| cidfn.i | ⊢ 1 = (Id‘𝐶) |
| Ref | Expression |
|---|---|
| cidfn | ⊢ (𝐶 ∈ Cat → 1 Fn 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | riotaex 7322 | . . 3 ⊢ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(〈𝑦, 𝑥〉(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(〈𝑥, 𝑥〉(comp‘𝐶)𝑦)𝑔) = 𝑓)) ∈ V | |
| 2 | eqid 2737 | . . 3 ⊢ (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(〈𝑦, 𝑥〉(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(〈𝑥, 𝑥〉(comp‘𝐶)𝑦)𝑔) = 𝑓))) = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(〈𝑦, 𝑥〉(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(〈𝑥, 𝑥〉(comp‘𝐶)𝑦)𝑔) = 𝑓))) | |
| 3 | 1, 2 | fnmpti 6636 | . 2 ⊢ (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(〈𝑦, 𝑥〉(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(〈𝑥, 𝑥〉(comp‘𝐶)𝑦)𝑔) = 𝑓))) Fn 𝐵 |
| 4 | cidfn.b | . . . 4 ⊢ 𝐵 = (Base‘𝐶) | |
| 5 | eqid 2737 | . . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
| 6 | eqid 2737 | . . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶) | |
| 7 | id 22 | . . . 4 ⊢ (𝐶 ∈ Cat → 𝐶 ∈ Cat) | |
| 8 | cidfn.i | . . . 4 ⊢ 1 = (Id‘𝐶) | |
| 9 | 4, 5, 6, 7, 8 | cidfval 17636 | . . 3 ⊢ (𝐶 ∈ Cat → 1 = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(〈𝑦, 𝑥〉(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(〈𝑥, 𝑥〉(comp‘𝐶)𝑦)𝑔) = 𝑓)))) |
| 10 | 9 | fneq1d 6586 | . 2 ⊢ (𝐶 ∈ Cat → ( 1 Fn 𝐵 ↔ (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(〈𝑦, 𝑥〉(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(〈𝑥, 𝑥〉(comp‘𝐶)𝑦)𝑔) = 𝑓))) Fn 𝐵)) |
| 11 | 3, 10 | mpbiri 258 | 1 ⊢ (𝐶 ∈ Cat → 1 Fn 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 〈cop 4574 ↦ cmpt 5167 Fn wfn 6488 ‘cfv 6493 ℩crio 7317 (class class class)co 7361 Basecbs 17173 Hom chom 17225 compcco 17226 Catccat 17624 Idccid 17625 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pr 5371 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-cid 17629 |
| This theorem is referenced by: oppccatid 17679 fucidcl 17929 fucsect 17936 curfcl 18192 curf2ndf 18207 fucoid 49838 |
| Copyright terms: Public domain | W3C validator |