| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > arwrid | Structured version Visualization version GIF version | ||
| Description: Right identity of a category using arrow notation. (Contributed by Mario Carneiro, 11-Jan-2017.) |
| Ref | Expression |
|---|---|
| arwlid.h | ⊢ 𝐻 = (Homa‘𝐶) |
| arwlid.o | ⊢ · = (compa‘𝐶) |
| arwlid.a | ⊢ 1 = (Ida‘𝐶) |
| arwlid.f | ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌)) |
| Ref | Expression |
|---|---|
| arwrid | ⊢ (𝜑 → (𝐹 · ( 1 ‘𝑋)) = 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | arwlid.a | . . . . . 6 ⊢ 1 = (Ida‘𝐶) | |
| 2 | eqid 2761 | . . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
| 3 | arwlid.f | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌)) | |
| 4 | arwlid.h | . . . . . . . 8 ⊢ 𝐻 = (Homa‘𝐶) | |
| 5 | 4 | homarcl 18183 | . . . . . . 7 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐶 ∈ Cat) |
| 6 | 3, 5 | syl 18 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ Cat) |
| 7 | eqid 2761 | . . . . . 6 ⊢ (Id‘𝐶) = (Id‘𝐶) | |
| 8 | 4, 2 | homarcl2 18190 | . . . . . . . 8 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶))) |
| 9 | 3, 8 | syl 18 | . . . . . . 7 ⊢ (𝜑 → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶))) |
| 10 | 9 | simpld 500 | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶)) |
| 11 | 1, 2, 6, 7, 10 | ida2 18214 | . . . . 5 ⊢ (𝜑 → (2nd ‘( 1 ‘𝑋)) = ((Id‘𝐶)‘𝑋)) |
| 12 | 11 | oveq2d 7428 | . . . 4 ⊢ (𝜑 → ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)(2nd ‘( 1 ‘𝑋))) = ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋))) |
| 13 | eqid 2761 | . . . . 5 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
| 14 | eqid 2761 | . . . . 5 ⊢ (comp‘𝐶) = (comp‘𝐶) | |
| 15 | 9 | simprd 501 | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶)) |
| 16 | 4, 13 | homahom 18194 | . . . . . 6 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (2nd ‘𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌)) |
| 17 | 3, 16 | syl 18 | . . . . 5 ⊢ (𝜑 → (2nd ‘𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌)) |
| 18 | 2, 13, 7, 6, 10, 14, 15, 17 | catrid 17838 | . . . 4 ⊢ (𝜑 → ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)) = (2nd ‘𝐹)) |
| 19 | 12, 18 | eqtrd 2796 | . . 3 ⊢ (𝜑 → ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)(2nd ‘( 1 ‘𝑋))) = (2nd ‘𝐹)) |
| 20 | 19 | oteq3d 4847 | . 2 ⊢ (𝜑 → 〈𝑋, 𝑌, ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)(2nd ‘( 1 ‘𝑋)))〉 = 〈𝑋, 𝑌, (2nd ‘𝐹)〉) |
| 21 | arwlid.o | . . 3 ⊢ · = (compa‘𝐶) | |
| 22 | 1, 2, 6, 10, 4 | idahom 18215 | . . 3 ⊢ (𝜑 → ( 1 ‘𝑋) ∈ (𝑋𝐻𝑋)) |
| 23 | 21, 4, 22, 3, 14 | coaval 18223 | . 2 ⊢ (𝜑 → (𝐹 · ( 1 ‘𝑋)) = 〈𝑋, 𝑌, ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)(2nd ‘( 1 ‘𝑋)))〉) |
| 24 | 4 | homadmcd 18197 | . . 3 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = 〈𝑋, 𝑌, (2nd ‘𝐹)〉) |
| 25 | 3, 24 | syl 18 | . 2 ⊢ (𝜑 → 𝐹 = 〈𝑋, 𝑌, (2nd ‘𝐹)〉) |
| 26 | 20, 23, 25 | 3eqtr4d 2806 | 1 ⊢ (𝜑 → (𝐹 · ( 1 ‘𝑋)) = 𝐹) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 〈cop 4590 〈cotp 4592 ‘cfv 6531 (class class class)co 7412 2nd c2nd 7989 Basecbs 17367 Hom chom 17419 compcco 17420 Catccat 17818 Idccid 17819 Homachoma 18178 Idacida 18208 compaccoa 18209 |
| 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-pow 5327 ax-pr 5391 ax-un 7740 |
| 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-rmo 3366 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-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-ot 4593 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 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7990 df-2nd 7991 df-cat 17822 df-cid 17823 df-doma 18179 df-coda 18180 df-homa 18181 df-arw 18182 df-ida 18210 df-coa 18211 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |