Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > arwlid | Structured version Visualization version GIF version |
Description: Left 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 |
---|---|
arwlid | ⊢ (𝜑 → (( 1 ‘𝑌) · 𝐹) = 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | arwlid.a | . . . . . 6 ⊢ 1 = (Ida‘𝐶) | |
2 | eqid 2738 | . . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
3 | arwlid.f | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌)) | |
4 | arwlid.h | . . . . . . . 8 ⊢ 𝐻 = (Homa‘𝐶) | |
5 | 4 | homarcl 17743 | . . . . . . 7 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐶 ∈ Cat) |
6 | 3, 5 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ Cat) |
7 | eqid 2738 | . . . . . 6 ⊢ (Id‘𝐶) = (Id‘𝐶) | |
8 | 4, 2 | homarcl2 17750 | . . . . . . . 8 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶))) |
9 | 3, 8 | syl 17 | . . . . . . 7 ⊢ (𝜑 → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶))) |
10 | 9 | simprd 496 | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶)) |
11 | 1, 2, 6, 7, 10 | ida2 17774 | . . . . 5 ⊢ (𝜑 → (2nd ‘( 1 ‘𝑌)) = ((Id‘𝐶)‘𝑌)) |
12 | 11 | oveq1d 7290 | . . . 4 ⊢ (𝜑 → ((2nd ‘( 1 ‘𝑌))(〈𝑋, 𝑌〉(comp‘𝐶)𝑌)(2nd ‘𝐹)) = (((Id‘𝐶)‘𝑌)(〈𝑋, 𝑌〉(comp‘𝐶)𝑌)(2nd ‘𝐹))) |
13 | eqid 2738 | . . . . 5 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
14 | 9 | simpld 495 | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶)) |
15 | eqid 2738 | . . . . 5 ⊢ (comp‘𝐶) = (comp‘𝐶) | |
16 | 4, 13 | homahom 17754 | . . . . . 6 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (2nd ‘𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌)) |
17 | 3, 16 | syl 17 | . . . . 5 ⊢ (𝜑 → (2nd ‘𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌)) |
18 | 2, 13, 7, 6, 14, 15, 10, 17 | catlid 17392 | . . . 4 ⊢ (𝜑 → (((Id‘𝐶)‘𝑌)(〈𝑋, 𝑌〉(comp‘𝐶)𝑌)(2nd ‘𝐹)) = (2nd ‘𝐹)) |
19 | 12, 18 | eqtrd 2778 | . . 3 ⊢ (𝜑 → ((2nd ‘( 1 ‘𝑌))(〈𝑋, 𝑌〉(comp‘𝐶)𝑌)(2nd ‘𝐹)) = (2nd ‘𝐹)) |
20 | 19 | oteq3d 4818 | . 2 ⊢ (𝜑 → 〈𝑋, 𝑌, ((2nd ‘( 1 ‘𝑌))(〈𝑋, 𝑌〉(comp‘𝐶)𝑌)(2nd ‘𝐹))〉 = 〈𝑋, 𝑌, (2nd ‘𝐹)〉) |
21 | arwlid.o | . . 3 ⊢ · = (compa‘𝐶) | |
22 | 1, 2, 6, 10, 4 | idahom 17775 | . . 3 ⊢ (𝜑 → ( 1 ‘𝑌) ∈ (𝑌𝐻𝑌)) |
23 | 21, 4, 3, 22, 15 | coaval 17783 | . 2 ⊢ (𝜑 → (( 1 ‘𝑌) · 𝐹) = 〈𝑋, 𝑌, ((2nd ‘( 1 ‘𝑌))(〈𝑋, 𝑌〉(comp‘𝐶)𝑌)(2nd ‘𝐹))〉) |
24 | 4 | homadmcd 17757 | . . 3 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = 〈𝑋, 𝑌, (2nd ‘𝐹)〉) |
25 | 3, 24 | syl 17 | . 2 ⊢ (𝜑 → 𝐹 = 〈𝑋, 𝑌, (2nd ‘𝐹)〉) |
26 | 20, 23, 25 | 3eqtr4d 2788 | 1 ⊢ (𝜑 → (( 1 ‘𝑌) · 𝐹) = 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 〈cop 4567 〈cotp 4569 ‘cfv 6433 (class class class)co 7275 2nd c2nd 7830 Basecbs 16912 Hom chom 16973 compcco 16974 Catccat 17373 Idccid 17374 Homachoma 17738 Idacida 17768 compaccoa 17769 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-ot 4570 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-1st 7831 df-2nd 7832 df-cat 17377 df-cid 17378 df-doma 17739 df-coda 17740 df-homa 17741 df-arw 17742 df-ida 17770 df-coa 17771 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |