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

Theorem catlid 17771
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 7421 . . 3 (𝑓 = 𝐹 → (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝐹))
2 id 23 . . 3 (𝑓 = 𝐹𝑓 = 𝐹)
31, 2eqeq12d 2776 . 2 (𝑓 = 𝐹 → ((( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓 ↔ (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝐹) = 𝐹))
4 oveq1 7420 . . . 4 (𝑥 = 𝑋 → (𝑥𝐻𝑌) = (𝑋𝐻𝑌))
5 opeq1 4833 . . . . . . 7 (𝑥 = 𝑋 → ⟨𝑥, 𝑌⟩ = ⟨𝑋, 𝑌⟩)
65oveq1d 7428 . . . . . 6 (𝑥 = 𝑋 → (⟨𝑥, 𝑌· 𝑌) = (⟨𝑋, 𝑌· 𝑌))
76oveqd 7430 . . . . 5 (𝑥 = 𝑋 → (( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓))
87eqeq1d 2762 . . . 4 (𝑥 = 𝑋 → ((( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓))
94, 8raleqbidv 3334 . . 3 (𝑥 = 𝑋 → (∀𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑌)(( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓))
10 simpl 488 . . . . . . . 8 ((∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → ∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
1110ralimi 3099 . . . . . . 7 (∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
1211a1i 11 . . . . . 6 (𝑔 ∈ (𝑌𝐻𝑌) → (∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
1312ss2rabi 4024 . . . . 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 17765 . . . . . 6 (𝜑 → ( 1𝑌) = (𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)))
2114, 15, 16, 17, 19catideu 17763 . . . . . . 7 (𝜑 → ∃!𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓))
22 riotacl2 7386 . . . . . . 7 (∃!𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓) → (𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)})
2321, 22syl 18 . . . . . 6 (𝜑 → (𝑔 ∈ (𝑌𝐻𝑌)∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)})
2420, 23eqeltrd 2860 . . . . 5 (𝜑 → ( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌· 𝑥)𝑔) = 𝑓)})
2513, 24sselid 3929 . . . 4 (𝜑 → ( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓})
26 oveq1 7420 . . . . . . . 8 (𝑔 = ( 1𝑌) → (𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = (( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓))
2726eqeq1d 2762 . . . . . . 7 (𝑔 = ( 1𝑌) → ((𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ (( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
28272ralbidv 3226 . . . . . 6 (𝑔 = ( 1𝑌) → (∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓 ↔ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
2928elrab 3645 . . . . 5 (( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓} ↔ (( 1𝑌) ∈ (𝑌𝐻𝑌) ∧ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓))
3029simprbi 503 . . . 4 (( 1𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓} → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
3125, 30syl 18 . . 3 (𝜑 → ∀𝑥𝐵𝑓 ∈ (𝑥𝐻𝑌)(( 1𝑌)(⟨𝑥, 𝑌· 𝑌)𝑓) = 𝑓)
32 catidcl.x . . 3 (𝜑𝑋𝐵)
339, 31, 32rspcdva 3577 . 2 (𝜑 → ∀𝑓 ∈ (𝑋𝐻𝑌)(( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝑓) = 𝑓)
34 catlid.f . 2 (𝜑𝐹 ∈ (𝑋𝐻𝑌))
353, 33, 34rspcdva 3577 1 (𝜑 → (( 1𝑌)(⟨𝑋, 𝑌· 𝑌)𝐹) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wral 3076  ∃!wreu 3363  {crab 3412  cop 4590  cfv 6533  crio 7369  (class class class)co 7413  Basecbs 17301  Hom chom 17353  compcco 17354  Catccat 17752  Idccid 17753
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-cat 17756  df-cid 17757
This theorem is used by:  oppccatid  17807  sectcan  17844  sectco  17845  sectmon  17871  monsect  17872  sectid  17875  invisoinvl  17879  subccatid  17935  fucidcl  18057  fuclid  18058  invfuc  18066  arwlid  18161  xpccatid  18276  evlfcl  18310  curf1cl  18316  curf2cl  18319  curfcl  18320  curfuncf  18326  uncfcurf  18327  hofcl  18347  yon12  18353  yon2  18354  yonedalem3b  18367  yonedainv  18369  bj-endmnd  38070  endmndlem  49941  idmon  49946  discsubc  49990  upciclem3  50094  fucoid  50274  fucolid  50287  coccom  50590
  Copyright terms: Public domain W3C validator