| 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 2760 | . . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
| 3 | arwlid.f | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌)) | |
| 4 | arwlid.h | . . . . . . . 8 ⊢ 𝐻 = (Homa‘𝐶) | |
| 5 | 4 | homarcl 18208 | . . . . . . 7 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐶 ∈ Cat) |
| 6 | 3, 5 | syl 18 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ Cat) |
| 7 | eqid 2760 | . . . . . 6 ⊢ (Id‘𝐶) = (Id‘𝐶) | |
| 8 | 4, 2 | homarcl2 18215 | . . . . . . . 8 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶))) |
| 9 | 3, 8 | syl 18 | . . . . . . 7 ⊢ (𝜑 → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶))) |
| 10 | 9 | simpld 500 | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶)) |
| 11 | 1, 2, 6, 7, 10 | ida2 18239 | . . . . 5 ⊢ (𝜑 → (2nd ‘( 1 ‘𝑋)) = ((Id‘𝐶)‘𝑋)) |
| 12 | 11 | oveq2d 7436 | . . . 4 ⊢ (𝜑 → ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)(2nd ‘( 1 ‘𝑋))) = ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋))) |
| 13 | eqid 2760 | . . . . 5 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
| 14 | eqid 2760 | . . . . 5 ⊢ (comp‘𝐶) = (comp‘𝐶) | |
| 15 | 9 | simprd 501 | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶)) |
| 16 | 4, 13 | homahom 18219 | . . . . . 6 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (2nd ‘𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌)) |
| 17 | 3, 16 | syl 18 | . . . . 5 ⊢ (𝜑 → (2nd ‘𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌)) |
| 18 | 2, 13, 7, 6, 10, 14, 15, 17 | catrid 17863 | . . . 4 ⊢ (𝜑 → ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)) = (2nd ‘𝐹)) |
| 19 | 12, 18 | eqtrd 2795 | . . 3 ⊢ (𝜑 → ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)(2nd ‘( 1 ‘𝑋))) = (2nd ‘𝐹)) |
| 20 | 19 | oteq3d 4864 | . 2 ⊢ (𝜑 → 〈𝑋, 𝑌, ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)(2nd ‘( 1 ‘𝑋)))〉 = 〈𝑋, 𝑌, (2nd ‘𝐹)〉) |
| 21 | arwlid.o | . . 3 ⊢ · = (compa‘𝐶) | |
| 22 | 1, 2, 6, 10, 4 | idahom 18240 | . . 3 ⊢ (𝜑 → ( 1 ‘𝑋) ∈ (𝑋𝐻𝑋)) |
| 23 | 21, 4, 22, 3, 14 | coaval 18248 | . 2 ⊢ (𝜑 → (𝐹 · ( 1 ‘𝑋)) = 〈𝑋, 𝑌, ((2nd ‘𝐹)(〈𝑋, 𝑋〉(comp‘𝐶)𝑌)(2nd ‘( 1 ‘𝑋)))〉) |
| 24 | 4 | homadmcd 18222 | . . 3 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = 〈𝑋, 𝑌, (2nd ‘𝐹)〉) |
| 25 | 3, 24 | syl 18 | . 2 ⊢ (𝜑 → 𝐹 = 〈𝑋, 𝑌, (2nd ‘𝐹)〉) |
| 26 | 20, 23, 25 | 3eqtr4d 2805 | 1 ⊢ (𝜑 → (𝐹 · ( 1 ‘𝑋)) = 𝐹) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 〈cop 4834 〈cotp 4857 ‘cfv 6538 (class class class)co 7420 2nd c2nd 8000 Basecbs 17392 Hom chom 17444 compcco 17445 Catccat 17843 Idccid 17844 Homachoma 18203 Idacida 18233 compaccoa 18234 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-ot 4858 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 df-cat 17847 df-cid 17848 df-doma 18204 df-coda 18205 df-homa 18206 df-arw 18207 df-ida 18235 df-coa 18236 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |