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

Theorem arwlid 18133
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 2763 . . . . . 6 (Base‘𝐶) = (Base‘𝐶)
3 arwlid.f . . . . . . 7 (𝜑𝐹 ∈ (𝑋𝐻𝑌))
4 arwlid.h . . . . . . . 8 𝐻 = (Homa𝐶)
54homarcl 18089 . . . . . . 7 (𝐹 ∈ (𝑋𝐻𝑌) → 𝐶 ∈ Cat)
63, 5syl 18 . . . . . 6 (𝜑𝐶 ∈ Cat)
7 eqid 2763 . . . . . 6 (Id‘𝐶) = (Id‘𝐶)
84, 2homarcl2 18096 . . . . . . . 8 (𝐹 ∈ (𝑋𝐻𝑌) → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶)))
93, 8syl 18 . . . . . . 7 (𝜑 → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶)))
109simprd 500 . . . . . 6 (𝜑𝑌 ∈ (Base‘𝐶))
111, 2, 6, 7, 10ida2 18120 . . . . 5 (𝜑 → (2nd ‘( 1𝑌)) = ((Id‘𝐶)‘𝑌))
1211oveq1d 7425 . . . 4 (𝜑 → ((2nd ‘( 1𝑌))(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)(2nd𝐹)) = (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)(2nd𝐹)))
13 eqid 2763 . . . . 5 (Hom ‘𝐶) = (Hom ‘𝐶)
149simpld 499 . . . . 5 (𝜑𝑋 ∈ (Base‘𝐶))
15 eqid 2763 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
164, 13homahom 18100 . . . . . 6 (𝐹 ∈ (𝑋𝐻𝑌) → (2nd𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌))
173, 16syl 18 . . . . 5 (𝜑 → (2nd𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌))
182, 13, 7, 6, 14, 15, 10, 17catlid 17743 . . . 4 (𝜑 → (((Id‘𝐶)‘𝑌)(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)(2nd𝐹)) = (2nd𝐹))
1912, 18eqtrd 2798 . . 3 (𝜑 → ((2nd ‘( 1𝑌))(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)(2nd𝐹)) = (2nd𝐹))
2019oteq3d 4852 . 2 (𝜑 → ⟨𝑋, 𝑌, ((2nd ‘( 1𝑌))(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)(2nd𝐹))⟩ = ⟨𝑋, 𝑌, (2nd𝐹)⟩)
21 arwlid.o . . 3 · = (compa𝐶)
221, 2, 6, 10, 4idahom 18121 . . 3 (𝜑 → ( 1𝑌) ∈ (𝑌𝐻𝑌))
2321, 4, 3, 22, 15coaval 18129 . 2 (𝜑 → (( 1𝑌) · 𝐹) = ⟨𝑋, 𝑌, ((2nd ‘( 1𝑌))(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑌)(2nd𝐹))⟩)
244homadmcd 18103 . . 3 (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = ⟨𝑋, 𝑌, (2nd𝐹)⟩)
253, 24syl 18 . 2 (𝜑𝐹 = ⟨𝑋, 𝑌, (2nd𝐹)⟩)
2620, 23, 253eqtr4d 2808 1 (𝜑 → (( 1𝑌) · 𝐹) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400   = wceq 1570  wcel 2143  cop 4595  cotp 4597  cfv 6536  (class class class)co 7410  2nd c2nd 7981  Basecbs 17273  Hom chom 17325  compcco 17326  Catccat 17724  Idccid 17725  Homachoma 18084  Idacida 18114  compaccoa 18115
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-ot 4598  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-cat 17728  df-cid 17729  df-doma 18085  df-coda 18086  df-homa 18087  df-arw 18088  df-ida 18116  df-coa 18117
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator