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

Theorem arwrid 17986
Description: Right 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
arwrid (𝜑 → (𝐹 · ( 1𝑋)) = 𝐹)

Proof of Theorem arwrid
StepHypRef Expression
1 arwlid.a . . . . . 6 1 = (Ida𝐶)
2 eqid 2731 . . . . . 6 (Base‘𝐶) = (Base‘𝐶)
3 arwlid.f . . . . . . 7 (𝜑𝐹 ∈ (𝑋𝐻𝑌))
4 arwlid.h . . . . . . . 8 𝐻 = (Homa𝐶)
54homarcl 17941 . . . . . . 7 (𝐹 ∈ (𝑋𝐻𝑌) → 𝐶 ∈ Cat)
63, 5syl 17 . . . . . 6 (𝜑𝐶 ∈ Cat)
7 eqid 2731 . . . . . 6 (Id‘𝐶) = (Id‘𝐶)
84, 2homarcl2 17948 . . . . . . . 8 (𝐹 ∈ (𝑋𝐻𝑌) → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶)))
93, 8syl 17 . . . . . . 7 (𝜑 → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶)))
109simpld 494 . . . . . 6 (𝜑𝑋 ∈ (Base‘𝐶))
111, 2, 6, 7, 10ida2 17972 . . . . 5 (𝜑 → (2nd ‘( 1𝑋)) = ((Id‘𝐶)‘𝑋))
1211oveq2d 7368 . . . 4 (𝜑 → ((2nd𝐹)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(2nd ‘( 1𝑋))) = ((2nd𝐹)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)))
13 eqid 2731 . . . . 5 (Hom ‘𝐶) = (Hom ‘𝐶)
14 eqid 2731 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
159simprd 495 . . . . 5 (𝜑𝑌 ∈ (Base‘𝐶))
164, 13homahom 17952 . . . . . 6 (𝐹 ∈ (𝑋𝐻𝑌) → (2nd𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌))
173, 16syl 17 . . . . 5 (𝜑 → (2nd𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌))
182, 13, 7, 6, 10, 14, 15, 17catrid 17596 . . . 4 (𝜑 → ((2nd𝐹)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)) = (2nd𝐹))
1912, 18eqtrd 2766 . . 3 (𝜑 → ((2nd𝐹)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(2nd ‘( 1𝑋))) = (2nd𝐹))
2019oteq3d 4838 . 2 (𝜑 → ⟨𝑋, 𝑌, ((2nd𝐹)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(2nd ‘( 1𝑋)))⟩ = ⟨𝑋, 𝑌, (2nd𝐹)⟩)
21 arwlid.o . . 3 · = (compa𝐶)
221, 2, 6, 10, 4idahom 17973 . . 3 (𝜑 → ( 1𝑋) ∈ (𝑋𝐻𝑋))
2321, 4, 22, 3, 14coaval 17981 . 2 (𝜑 → (𝐹 · ( 1𝑋)) = ⟨𝑋, 𝑌, ((2nd𝐹)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(2nd ‘( 1𝑋)))⟩)
244homadmcd 17955 . . 3 (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = ⟨𝑋, 𝑌, (2nd𝐹)⟩)
253, 24syl 17 . 2 (𝜑𝐹 = ⟨𝑋, 𝑌, (2nd𝐹)⟩)
2620, 23, 253eqtr4d 2776 1 (𝜑 → (𝐹 · ( 1𝑋)) = 𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2111  cop 4581  cotp 4583  cfv 6487  (class class class)co 7352  2nd c2nd 7926  Basecbs 17126  Hom chom 17178  compcco 17179  Catccat 17576  Idccid 17577  Homachoma 17936  Idacida 17966  compaccoa 17967
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-ot 4584  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6443  df-fun 6489  df-fn 6490  df-f 6491  df-f1 6492  df-fo 6493  df-f1o 6494  df-fv 6495  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-1st 7927  df-2nd 7928  df-cat 17580  df-cid 17581  df-doma 17937  df-coda 17938  df-homa 17939  df-arw 17940  df-ida 17968  df-coa 17969
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator