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

Theorem catlid 17563
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 7365 . . 3 (𝑓 = 𝐹 → (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝐹))
2 id 22 . . 3 (𝑓 = 𝐹𝑓 = 𝐹)
31, 2eqeq12d 2752 . 2 (𝑓 = 𝐹 → ((( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓 ↔ (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝐹) = 𝐹))
4 oveq1 7364 . . . 4 (𝑥 = 𝑋 → (𝑥𝐻𝑌) = (𝑋𝐻𝑌))
5 opeq1 4830 . . . . . . 7 (𝑥 = 𝑋 → ⟨𝑥, 𝑌⟩ = ⟨𝑋, 𝑌⟩)
65oveq1d 7372 . . . . . 6 (𝑥 = 𝑋 → (⟨𝑥, 𝑌· 𝑌) = (⟨𝑋, 𝑌· 𝑌))
76oveqd 7374 . . . . 5 (𝑥 = 𝑋 → (( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓))
87eqeq1d 2738 . . . 4 (𝑥 = 𝑋 → ((( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓))
94, 8raleqbidv 3319 . . 3 (𝑥 = 𝑋 → (∀𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑌)(( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓))
10 simpl 483 . . . . . . . 8 ((∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → ∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
1110ralimi 3086 . . . . . . 7 (∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
1211a1i 11 . . . . . 6 (𝑔 ∈ (𝑌𝐻𝑌) → (∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
1312ss2rabi 4034 . . . . 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 17557 . . . . . 6 (𝜑 → ( 1𝑌) = (𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)))
2114, 15, 16, 17, 19catideu 17555 . . . . . . 7 (𝜑 → ∃!𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓))
22 riotacl2 7330 . . . . . . 7 (∃!𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → (𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)})
2321, 22syl 17 . . . . . 6 (𝜑 → (𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)})
2420, 23eqeltrd 2838 . . . . 5 (𝜑 → ( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)})
2513, 24sselid 3942 . . . 4 (𝜑 → ( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓})
26 oveq1 7364 . . . . . . . 8 (𝑔 = ( 1𝑌) → (𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = (( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓))
2726eqeq1d 2738 . . . . . . 7 (𝑔 = ( 1𝑌) → ((𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ (( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
28272ralbidv 3212 . . . . . 6 (𝑔 = ( 1𝑌) → (∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
2928elrab 3645 . . . . 5 (( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓} ↔ (( 1𝑌) ∈ (𝑌𝐻𝑌) ∧ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
3029simprbi 497 . . . 4 (( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓} → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
3125, 30syl 17 . . 3 (𝜑 → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
32 catidcl.x . . 3 (𝜑𝑋𝐵)
339, 31, 32rspcdva 3582 . 2 (𝜑 → ∀𝑓 ∈ (𝑋𝐻𝑌)(( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓)
34 catlid.f . 2 (𝜑𝐹 ∈ (𝑋𝐻𝑌))
353, 33, 34rspcdva 3582 1 (𝜑 → (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝐹) = 𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1541  wcel 2106  wral 3064  ∃!wreu 3351  {crab 3407  cop 4592  cfv 6496  crio 7312  (class class class)co 7357  Basecbs 17083  Hom chom 17144  compcco 17145  Catccat 17544  Idccid 17545
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pr 5384
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-cat 17548  df-cid 17549
This theorem is referenced by:  oppccatid  17601  sectcan  17638  sectco  17639  sectmon  17665  monsect  17666  sectid  17669  invisoinvl  17673  subccatid  17732  fucidcl  17854  fuclid  17855  invfuc  17863  arwlid  17958  xpccatid  18076  evlfcl  18111  curf1cl  18117  curf2cl  18120  curfcl  18121  curfuncf  18127  uncfcurf  18128  hofcl  18148  yon12  18154  yon2  18155  yonedalem3b  18168  yonedainv  18170  bj-endmnd  35789  endmndlem  47025  idmon  47026
  Copyright terms: Public domain W3C validator