| 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 2762 | . . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
| 3 | arwlid.f | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌)) | |
| 4 | arwlid.h | . . . . . . . 8 ⊢ 𝐻 = (Homa‘𝐶) | |
| 5 | 4 | homarcl 18123 | . . . . . . 7 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐶 ∈ Cat) |
| 6 | 3, 5 | syl 18 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ Cat) |
| 7 | eqid 2762 | . . . . . 6 ⊢ (Id‘𝐶) = (Id‘𝐶) | |
| 8 | 4, 2 | homarcl2 18130 | . . . . . . . 8 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶))) |
| 9 | 3, 8 | syl 18 | . . . . . . 7 ⊢ (𝜑 → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶))) |
| 10 | 9 | simpld 500 | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶)) |
| 11 | 1, 2, 6, 7, 10 | ida2 18154 | . . . . 5 ⊢ (𝜑 → (2nd ‘( 1 ‘𝑋)) = ((Id‘𝐶)‘𝑋)) |
| 12 | 11 | oveq2d 7433 | . . . 4 ⊢ (𝜑 → ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)(2nd ‘( 1 ‘𝑋))) = ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋))) |
| 13 | eqid 2762 | . . . . 5 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
| 14 | eqid 2762 | . . . . 5 ⊢ (comp‘𝐶) = (comp‘𝐶) | |
| 15 | 9 | simprd 501 | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶)) |
| 16 | 4, 13 | homahom 18134 | . . . . . 6 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (2nd ‘𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌)) |
| 17 | 3, 16 | syl 18 | . . . . 5 ⊢ (𝜑 → (2nd ‘𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌)) |
| 18 | 2, 13, 7, 6, 10, 14, 15, 17 | catrid 17778 | . . . 4 ⊢ (𝜑 → ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)) = (2nd ‘𝐹)) |
| 19 | 12, 18 | eqtrd 2797 | . . 3 ⊢ (𝜑 → ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)(2nd ‘( 1 ‘𝑋))) = (2nd ‘𝐹)) |
| 20 | 19 | oteq3d 4850 | . 2 ⊢ (𝜑 → 〈𝑋, 𝑌, ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)(2nd ‘( 1 ‘𝑋)))〉 = 〈𝑋, 𝑌, (2nd ‘𝐹)〉) |
| 21 | arwlid.o | . . 3 ⊢ · = (compa‘𝐶) | |
| 22 | 1, 2, 6, 10, 4 | idahom 18155 | . . 3 ⊢ (𝜑 → ( 1 ‘𝑋) ∈ (𝑋𝐻𝑋)) |
| 23 | 21, 4, 22, 3, 14 | coaval 18163 | . 2 ⊢ (𝜑 → (𝐹 · ( 1 ‘𝑋)) = 〈𝑋, 𝑌, ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)(2nd ‘( 1 ‘𝑋)))〉) |
| 24 | 4 | homadmcd 18137 | . . 3 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = 〈𝑋, 𝑌, (2nd ‘𝐹)〉) |
| 25 | 3, 24 | syl 18 | . 2 ⊢ (𝜑 → 𝐹 = 〈𝑋, 𝑌, (2nd ‘𝐹)〉) |
| 26 | 20, 23, 25 | 3eqtr4d 2807 | 1 ⊢ (𝜑 → (𝐹 · ( 1 ‘𝑋)) = 𝐹) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 〈cop 4593 〈cotp 4595 ‘cfv 6537 (class class class)co 7417 2nd c2nd 7989 Basecbs 17307 Hom chom 17359 compcco 17360 Catccat 17758 Idccid 17759 Homachoma 18118 Idacida 18148 compaccoa 18149 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-ot 4596 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-1st 7990 df-2nd 7991 df-cat 17762 df-cid 17763 df-doma 18119 df-coda 18120 df-homa 18121 df-arw 18122 df-ida 18150 df-coa 18151 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |