MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  arwlid Structured version   Visualization version   GIF version

Theorem arwlid 18186
Description: Left identity of a category using arrow notation. (Contributed by Mario Carneiro, 11-Jan-2017.)
Hypotheses
Ref Expression
arwlid.h 𝐻 = (Homa𝐶)
arwlid.o · = (compa𝐶)
arwlid.a 1 = (Ida𝐶)
arwlid.f (𝜑𝐹 ∈ (𝑋𝐻𝑌))
Assertion
Ref Expression
arwlid (𝜑 → (( 1𝑌) · 𝐹) = 𝐹)

Proof of Theorem arwlid
StepHypRef Expression
1 arwlid.a . . . . . 6 1 = (Ida𝐶)
2 eqid 2760 . . . . . 6 (Base‘𝐶) = (Base‘𝐶)
3 arwlid.f . . . . . . 7 (𝜑𝐹 ∈ (𝑋𝐻𝑌))
4 arwlid.h . . . . . . . 8 𝐻 = (Homa𝐶)
54homarcl 18142 . . . . . . 7 (𝐹 ∈ (𝑋𝐻𝑌) → 𝐶 ∈ Cat)
63, 5syl 18 . . . . . 6 (𝜑𝐶 ∈ Cat)
7 eqid 2760 . . . . . 6 (Id‘𝐶) = (Id‘𝐶)
84, 2homarcl2 18149 . . . . . . . 8 (𝐹 ∈ (𝑋𝐻𝑌) → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶)))
93, 8syl 18 . . . . . . 7 (𝜑 → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶)))
109simprd 501 . . . . . 6 (𝜑𝑌 ∈ (Base‘𝐶))
111, 2, 6, 7, 10ida2 18173 . . . . 5 (𝜑 → (2nd ‘( 1𝑌)) = ((Id‘𝐶)‘𝑌))
1211oveq1d 7431 . . . 4 (𝜑 → ((2nd ‘( 1𝑌))(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)(2nd𝐹)) = (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)(2nd𝐹)))
13 eqid 2760 . . . . 5 (Hom ‘𝐶) = (Hom ‘𝐶)
149simpld 500 . . . . 5 (𝜑𝑋 ∈ (Base‘𝐶))
15 eqid 2760 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
164, 13homahom 18153 . . . . . 6 (𝐹 ∈ (𝑋𝐻𝑌) → (2nd𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌))
173, 16syl 18 . . . . 5 (𝜑 → (2nd𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌))
182, 13, 7, 6, 14, 15, 10, 17catlid 17796 . . . 4 (𝜑 → (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)(2nd𝐹)) = (2nd𝐹))
1912, 18eqtrd 2795 . . 3 (𝜑 → ((2nd ‘( 1𝑌))(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)(2nd𝐹)) = (2nd𝐹))
2019oteq3d 4847 . 2 (𝜑 → ⟨𝑋, 𝑌, ((2nd ‘( 1𝑌))(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)(2nd𝐹))⟩ = ⟨𝑋, 𝑌, (2nd𝐹)⟩)
21 arwlid.o . . 3 · = (compa𝐶)
221, 2, 6, 10, 4idahom 18174 . . 3 (𝜑 → ( 1𝑌) ∈ (𝑌𝐻𝑌))
2321, 4, 3, 22, 15coaval 18182 . 2 (𝜑 → (( 1𝑌) · 𝐹) = ⟨𝑋, 𝑌, ((2nd ‘( 1𝑌))(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)(2nd𝐹))⟩)
244homadmcd 18156 . . 3 (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = ⟨𝑋, 𝑌, (2nd𝐹)⟩)
253, 24syl 18 . 2 (𝜑𝐹 = ⟨𝑋, 𝑌, (2nd𝐹)⟩)
2620, 23, 253eqtr4d 2805 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 6535  (class class class)co 7416  2nd c2nd 7991  Basecbs 17326  Hom chom 17378  compcco 17379  Catccat 17777  Idccid 17778  Homachoma 18137  Idacida 18167  compaccoa 18168
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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7742
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 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 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 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6491  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7992  df-2nd 7993  df-cat 17781  df-cid 17782  df-doma 18138  df-coda 18139  df-homa 18140  df-arw 18141  df-ida 18169  df-coa 18170
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator