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

Theorem catlid 17309
Description: Left identity property of an identity arrow. (Contributed by Mario Carneiro, 2-Jan-2017.)
Hypotheses
Ref Expression
catidcl.b 𝐵 = (Base‘𝐶)
catidcl.h 𝐻 = (Hom ‘𝐶)
catidcl.i 1 = (Id‘𝐶)
catidcl.c (𝜑𝐶 ∈ Cat)
catidcl.x (𝜑𝑋𝐵)
catlid.o · = (comp‘𝐶)
catlid.y (𝜑𝑌𝐵)
catlid.f (𝜑𝐹 ∈ (𝑋𝐻𝑌))
Assertion
Ref Expression
catlid (𝜑 → (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝐹) = 𝐹)

Proof of Theorem catlid
Dummy variables 𝑓 𝑔 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 7263 . . 3 (𝑓 = 𝐹 → (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝐹))
2 id 22 . . 3 (𝑓 = 𝐹𝑓 = 𝐹)
31, 2eqeq12d 2754 . 2 (𝑓 = 𝐹 → ((( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓 ↔ (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝐹) = 𝐹))
4 oveq1 7262 . . . 4 (𝑥 = 𝑋 → (𝑥𝐻𝑌) = (𝑋𝐻𝑌))
5 opeq1 4801 . . . . . . 7 (𝑥 = 𝑋 → ⟨𝑥, 𝑌⟩ = ⟨𝑋, 𝑌⟩)
65oveq1d 7270 . . . . . 6 (𝑥 = 𝑋 → (⟨𝑥, 𝑌· 𝑌) = (⟨𝑋, 𝑌· 𝑌))
76oveqd 7272 . . . . 5 (𝑥 = 𝑋 → (( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓))
87eqeq1d 2740 . . . 4 (𝑥 = 𝑋 → ((( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓))
94, 8raleqbidv 3327 . . 3 (𝑥 = 𝑋 → (∀𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑌)(( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓))
10 simpl 482 . . . . . . . 8 ((∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → ∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
1110ralimi 3086 . . . . . . 7 (∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
1211a1i 11 . . . . . 6 (𝑔 ∈ (𝑌𝐻𝑌) → (∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
1312ss2rabi 4006 . . . . 5 {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)} ⊆ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓}
14 catidcl.b . . . . . . 7 𝐵 = (Base‘𝐶)
15 catidcl.h . . . . . . 7 𝐻 = (Hom ‘𝐶)
16 catlid.o . . . . . . 7 · = (comp‘𝐶)
17 catidcl.c . . . . . . 7 (𝜑𝐶 ∈ Cat)
18 catidcl.i . . . . . . 7 1 = (Id‘𝐶)
19 catlid.y . . . . . . 7 (𝜑𝑌𝐵)
2014, 15, 16, 17, 18, 19cidval 17303 . . . . . 6 (𝜑 → ( 1𝑌) = (𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)))
2114, 15, 16, 17, 19catideu 17301 . . . . . . 7 (𝜑 → ∃!𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓))
22 riotacl2 7229 . . . . . . 7 (∃!𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → (𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)})
2321, 22syl 17 . . . . . 6 (𝜑 → (𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)})
2420, 23eqeltrd 2839 . . . . 5 (𝜑 → ( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)})
2513, 24sselid 3915 . . . 4 (𝜑 → ( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓})
26 oveq1 7262 . . . . . . . 8 (𝑔 = ( 1𝑌) → (𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = (( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓))
2726eqeq1d 2740 . . . . . . 7 (𝑔 = ( 1𝑌) → ((𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ (( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
28272ralbidv 3122 . . . . . 6 (𝑔 = ( 1𝑌) → (∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
2928elrab 3617 . . . . 5 (( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓} ↔ (( 1𝑌) ∈ (𝑌𝐻𝑌) ∧ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
3029simprbi 496 . . . 4 (( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓} → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
3125, 30syl 17 . . 3 (𝜑 → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
32 catidcl.x . . 3 (𝜑𝑋𝐵)
339, 31, 32rspcdva 3554 . 2 (𝜑 → ∀𝑓 ∈ (𝑋𝐻𝑌)(( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓)
34 catlid.f . 2 (𝜑𝐹 ∈ (𝑋𝐻𝑌))
353, 33, 34rspcdva 3554 1 (𝜑 → (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝐹) = 𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2108  wral 3063  ∃!wreu 3065  {crab 3067  cop 4564  cfv 6418  crio 7211  (class class class)co 7255  Basecbs 16840  Hom chom 16899  compcco 16900  Catccat 17290  Idccid 17291
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-cat 17294  df-cid 17295
This theorem is referenced by:  oppccatid  17347  sectcan  17384  sectco  17385  sectmon  17411  monsect  17412  sectid  17415  invisoinvl  17419  subccatid  17477  fucidcl  17599  fuclid  17600  invfuc  17608  arwlid  17703  xpccatid  17821  evlfcl  17856  curf1cl  17862  curf2cl  17865  curfcl  17866  curfuncf  17872  uncfcurf  17873  hofcl  17893  yon12  17899  yon2  17900  yonedalem3b  17913  yonedainv  17915  bj-endmnd  35416  endmndlem  46184  idmon  46185
  Copyright terms: Public domain W3C validator