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

Theorem catlid 17644
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 7395 . . 3 (𝑓 = 𝐹 → (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝐹))
2 id 22 . . 3 (𝑓 = 𝐹𝑓 = 𝐹)
31, 2eqeq12d 2745 . 2 (𝑓 = 𝐹 → ((( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓 ↔ (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝐹) = 𝐹))
4 oveq1 7394 . . . 4 (𝑥 = 𝑋 → (𝑥𝐻𝑌) = (𝑋𝐻𝑌))
5 opeq1 4837 . . . . . . 7 (𝑥 = 𝑋 → ⟨𝑥, 𝑌⟩ = ⟨𝑋, 𝑌⟩)
65oveq1d 7402 . . . . . 6 (𝑥 = 𝑋 → (⟨𝑥, 𝑌· 𝑌) = (⟨𝑋, 𝑌· 𝑌))
76oveqd 7404 . . . . 5 (𝑥 = 𝑋 → (( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓))
87eqeq1d 2731 . . . 4 (𝑥 = 𝑋 → ((( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓))
94, 8raleqbidv 3319 . . 3 (𝑥 = 𝑋 → (∀𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑌)(( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓))
10 simpl 482 . . . . . . . 8 ((∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → ∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
1110ralimi 3066 . . . . . . 7 (∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
1211a1i 11 . . . . . 6 (𝑔 ∈ (𝑌𝐻𝑌) → (∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
1312ss2rabi 4040 . . . . 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 17638 . . . . . 6 (𝜑 → ( 1𝑌) = (𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)))
2114, 15, 16, 17, 19catideu 17636 . . . . . . 7 (𝜑 → ∃!𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓))
22 riotacl2 7360 . . . . . . 7 (∃!𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → (𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)})
2321, 22syl 17 . . . . . 6 (𝜑 → (𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)})
2420, 23eqeltrd 2828 . . . . 5 (𝜑 → ( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)})
2513, 24sselid 3944 . . . 4 (𝜑 → ( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓})
26 oveq1 7394 . . . . . . . 8 (𝑔 = ( 1𝑌) → (𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = (( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓))
2726eqeq1d 2731 . . . . . . 7 (𝑔 = ( 1𝑌) → ((𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ (( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
28272ralbidv 3201 . . . . . 6 (𝑔 = ( 1𝑌) → (∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
2928elrab 3659 . . . . 5 (( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓} ↔ (( 1𝑌) ∈ (𝑌𝐻𝑌) ∧ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
3029simprbi 496 . . . 4 (( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓} → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
3125, 30syl 17 . . 3 (𝜑 → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
32 catidcl.x . . 3 (𝜑𝑋𝐵)
339, 31, 32rspcdva 3589 . 2 (𝜑 → ∀𝑓 ∈ (𝑋𝐻𝑌)(( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓)
34 catlid.f . 2 (𝜑𝐹 ∈ (𝑋𝐻𝑌))
353, 33, 34rspcdva 3589 1 (𝜑 → (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝐹) = 𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  wral 3044  ∃!wreu 3352  {crab 3405  cop 4595  cfv 6511  crio 7343  (class class class)co 7387  Basecbs 17179  Hom chom 17231  compcco 17232  Catccat 17625  Idccid 17626
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-cat 17629  df-cid 17630
This theorem is referenced by:  oppccatid  17680  sectcan  17717  sectco  17718  sectmon  17744  monsect  17745  sectid  17748  invisoinvl  17752  subccatid  17808  fucidcl  17930  fuclid  17931  invfuc  17939  arwlid  18034  xpccatid  18149  evlfcl  18183  curf1cl  18189  curf2cl  18192  curfcl  18193  curfuncf  18199  uncfcurf  18200  hofcl  18220  yon12  18226  yon2  18227  yonedalem3b  18240  yonedainv  18242  bj-endmnd  37306  endmndlem  49001  idmon  49006  discsubc  49050  upciclem3  49154  fucoid  49334  fucolid  49347  coccom  49650
  Copyright terms: Public domain W3C validator