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

Theorem arwrid 18040
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 2736 . . . . . 6 (Base‘𝐶) = (Base‘𝐶)
3 arwlid.f . . . . . . 7 (𝜑𝐹 ∈ (𝑋𝐻𝑌))
4 arwlid.h . . . . . . . 8 𝐻 = (Homa𝐶)
54homarcl 17995 . . . . . . 7 (𝐹 ∈ (𝑋𝐻𝑌) → 𝐶 ∈ Cat)
63, 5syl 17 . . . . . 6 (𝜑𝐶 ∈ Cat)
7 eqid 2736 . . . . . 6 (Id‘𝐶) = (Id‘𝐶)
84, 2homarcl2 18002 . . . . . . . 8 (𝐹 ∈ (𝑋𝐻𝑌) → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶)))
93, 8syl 17 . . . . . . 7 (𝜑 → (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶)))
109simpld 494 . . . . . 6 (𝜑𝑋 ∈ (Base‘𝐶))
111, 2, 6, 7, 10ida2 18026 . . . . 5 (𝜑 → (2nd ‘( 1𝑋)) = ((Id‘𝐶)‘𝑋))
1211oveq2d 7383 . . . 4 (𝜑 → ((2nd𝐹)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(2nd ‘( 1𝑋))) = ((2nd𝐹)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)))
13 eqid 2736 . . . . 5 (Hom ‘𝐶) = (Hom ‘𝐶)
14 eqid 2736 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
159simprd 495 . . . . 5 (𝜑𝑌 ∈ (Base‘𝐶))
164, 13homahom 18006 . . . . . 6 (𝐹 ∈ (𝑋𝐻𝑌) → (2nd𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌))
173, 16syl 17 . . . . 5 (𝜑 → (2nd𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌))
182, 13, 7, 6, 10, 14, 15, 17catrid 17650 . . . 4 (𝜑 → ((2nd𝐹)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)((Id‘𝐶)‘𝑋)) = (2nd𝐹))
1912, 18eqtrd 2771 . . 3 (𝜑 → ((2nd𝐹)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(2nd ‘( 1𝑋))) = (2nd𝐹))
2019oteq3d 4830 . 2 (𝜑 → ⟨𝑋, 𝑌, ((2nd𝐹)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(2nd ‘( 1𝑋)))⟩ = ⟨𝑋, 𝑌, (2nd𝐹)⟩)
21 arwlid.o . . 3 · = (compa𝐶)
221, 2, 6, 10, 4idahom 18027 . . 3 (𝜑 → ( 1𝑋) ∈ (𝑋𝐻𝑋))
2321, 4, 22, 3, 14coaval 18035 . 2 (𝜑 → (𝐹 · ( 1𝑋)) = ⟨𝑋, 𝑌, ((2nd𝐹)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(2nd ‘( 1𝑋)))⟩)
244homadmcd 18009 . . 3 (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = ⟨𝑋, 𝑌, (2nd𝐹)⟩)
253, 24syl 17 . 2 (𝜑𝐹 = ⟨𝑋, 𝑌, (2nd𝐹)⟩)
2620, 23, 253eqtr4d 2781 1 (𝜑 → (𝐹 · ( 1𝑋)) = 𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  cop 4573  cotp 4575  cfv 6498  (class class class)co 7367  2nd c2nd 7941  Basecbs 17179  Hom chom 17231  compcco 17232  Catccat 17630  Idccid 17631  Homachoma 17990  Idacida 18020  compaccoa 18021
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-ot 4576  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-cat 17634  df-cid 17635  df-doma 17991  df-coda 17992  df-homa 17993  df-arw 17994  df-ida 18022  df-coa 18023
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator