| 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 7329 | . . 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 6643 | . 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 17611 | . . 3 ⊢ (𝐶 ∈ Cat → 1 = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥(Hom ‘𝐶)𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥)(𝑔(〈𝑦, 𝑥〉(comp‘𝐶)𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)(𝑓(〈𝑥, 𝑥〉(comp‘𝐶)𝑦)𝑔) = 𝑓)))) |
| 10 | 9 | fneq1d 6593 | . 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 4588 ↦ cmpt 5181 Fn wfn 6495 ‘cfv 6500 ℩crio 7324 (class class class)co 7368 Basecbs 17148 Hom chom 17200 compcco 17201 Catccat 17599 Idccid 17600 |
| 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 5226 ax-sep 5243 ax-nul 5253 ax-pr 5379 |
| 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 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-cid 17604 |
| This theorem is referenced by: oppccatid 17654 fucidcl 17904 fucsect 17911 curfcl 18167 curf2ndf 18182 fucoid 49707 |
| Copyright terms: Public domain | W3C validator |