Theorem catlid 17907

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.

Step	Hyp	Ref	Expression
1		oveq2 7459	. . 3 ⊢ (𝑓 = 𝐹 → (( 1 ‘𝑌)(⟨𝑋, 𝑌⟩ · 𝑌)𝑓) = (( 1 ‘𝑌)(⟨𝑋, 𝑌⟩ · 𝑌)𝐹))
2		id 23	. . 3 ⊢ (𝑓 = 𝐹 → 𝑓 = 𝐹)
3	1, 2	eqeq12d 2779	. 2 ⊢ (𝑓 = 𝐹 → ((( 1 ‘𝑌)(⟨𝑋, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ↔ (( 1 ‘𝑌)(⟨𝑋, 𝑌⟩ · 𝑌)𝐹) = 𝐹))
4		oveq1 7458	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑥𝐻𝑌) = (𝑋𝐻𝑌))
5		opeq1 4845	. . . . . . 7 ⊢ (𝑥 = 𝑋 → ⟨𝑥, 𝑌⟩ = ⟨𝑋, 𝑌⟩)
6	5	oveq1d 7466	. . . . . 6 ⊢ (𝑥 = 𝑋 → (⟨𝑥, 𝑌⟩ · 𝑌) = (⟨𝑋, 𝑌⟩ · 𝑌))
7	6	oveqd 7468	. . . . 5 ⊢ (𝑥 = 𝑋 → (( 1 ‘𝑌)(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = (( 1 ‘𝑌)(⟨𝑋, 𝑌⟩ · 𝑌)𝑓))
8	7	eqeq1d 2765	. . . 4 ⊢ (𝑥 = 𝑋 → ((( 1 ‘𝑌)(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ↔ (( 1 ‘𝑌)(⟨𝑋, 𝑌⟩ · 𝑌)𝑓) = 𝑓))
9	4, 8	raleqbidv 3338	. . 3 ⊢ (𝑥 = 𝑋 → (∀𝑓 ∈ (𝑥𝐻𝑌)(( 1 ‘𝑌)(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑌)(( 1 ‘𝑌)(⟨𝑋, 𝑌⟩ · 𝑌)𝑓) = 𝑓))
10		simpl 488	. . . . . . . 8 ⊢ ((∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌⟩ · 𝑥)𝑔) = 𝑓) → ∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓)
11	10	ralimi 3103	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌⟩ · 𝑥)𝑔) = 𝑓) → ∀𝑥 ∈ 𝐵 ∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓)
12	11	a1i 11	. . . . . 6 ⊢ (𝑔 ∈ (𝑌𝐻𝑌) → (∀𝑥 ∈ 𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌⟩ · 𝑥)𝑔) = 𝑓) → ∀𝑥 ∈ 𝐵 ∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓))
13	12	ss2rabi 4004	. . . . 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 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
20	14, 15, 16, 17, 18, 19	cidval 17901	. . . . . 6 ⊢ (𝜑 → ( 1 ‘𝑌) = (℩𝑔 ∈ (𝑌𝐻𝑌)∀𝑥 ∈ 𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌⟩ · 𝑥)𝑔) = 𝑓)))
21	14, 15, 16, 17, 19	catideu 17899	. . . . . . 7 ⊢ (𝜑 → ∃!𝑔 ∈ (𝑌𝐻𝑌)∀𝑥 ∈ 𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌⟩ · 𝑥)𝑔) = 𝑓))
22		riotacl2 7424	. . . . . . 7 ⊢ (∃!𝑔 ∈ (𝑌𝐻𝑌)∀𝑥 ∈ 𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌⟩ · 𝑥)𝑔) = 𝑓) → (℩𝑔 ∈ (𝑌𝐻𝑌)∀𝑥 ∈ 𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌⟩ · 𝑥)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥 ∈ 𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌⟩ · 𝑥)𝑔) = 𝑓)})
23	21, 22	syl 18	. . . . . 6 ⊢ (𝜑 → (℩𝑔 ∈ (𝑌𝐻𝑌)∀𝑥 ∈ 𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌⟩ · 𝑥)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥 ∈ 𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌⟩ · 𝑥)𝑔) = 𝑓)})
24	20, 23	eqeltrd 2864	. . . . 5 ⊢ (𝜑 → ( 1 ‘𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥 ∈ 𝐵 (∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑌𝐻𝑥)(𝑓(⟨𝑌, 𝑌⟩ · 𝑥)𝑔) = 𝑓)})
25	13, 24	sselid 3911	. . . 4 ⊢ (𝜑 → ( 1 ‘𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥 ∈ 𝐵 ∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓})
26		oveq1 7458	. . . . . . . 8 ⊢ (𝑔 = ( 1 ‘𝑌) → (𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = (( 1 ‘𝑌)(⟨𝑥, 𝑌⟩ · 𝑌)𝑓))
27	26	eqeq1d 2765	. . . . . . 7 ⊢ (𝑔 = ( 1 ‘𝑌) → ((𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ↔ (( 1 ‘𝑌)(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓))
28	27	2ralbidv 3230	. . . . . 6 ⊢ (𝑔 = ( 1 ‘𝑌) → (∀𝑥 ∈ 𝐵 ∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓 ↔ ∀𝑥 ∈ 𝐵 ∀𝑓 ∈ (𝑥𝐻𝑌)(( 1 ‘𝑌)(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓))
29	28	elrab 3648	. . . . 5 ⊢ (( 1 ‘𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥 ∈ 𝐵 ∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓} ↔ (( 1 ‘𝑌) ∈ (𝑌𝐻𝑌) ∧ ∀𝑥 ∈ 𝐵 ∀𝑓 ∈ (𝑥𝐻𝑌)(( 1 ‘𝑌)(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓))
30	29	simprbi 503	. . . 4 ⊢ (( 1 ‘𝑌) ∈ {𝑔 ∈ (𝑌𝐻𝑌) ∣ ∀𝑥 ∈ 𝐵 ∀𝑓 ∈ (𝑥𝐻𝑌)(𝑔(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓} → ∀𝑥 ∈ 𝐵 ∀𝑓 ∈ (𝑥𝐻𝑌)(( 1 ‘𝑌)(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓)
31	25, 30	syl 18	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑓 ∈ (𝑥𝐻𝑌)(( 1 ‘𝑌)(⟨𝑥, 𝑌⟩ · 𝑌)𝑓) = 𝑓)
32		catidcl.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
33	9, 31, 32	rspcdva 3581	. 2 ⊢ (𝜑 → ∀𝑓 ∈ (𝑋𝐻𝑌)(( 1 ‘𝑌)(⟨𝑋, 𝑌⟩ · 𝑌)𝑓) = 𝑓)
34		catlid.f	. 2 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌))
35	3, 33, 34	rspcdva 3581	1 ⊢ (𝜑 → (( 1 ‘𝑌)(⟨𝑋, 𝑌⟩ · 𝑌)𝐹) = 𝐹)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃!wreu 3367  {crab 3416  ⟨cop 4840  ‘cfv 6566  ℩crio 7407  (class class class)co 7451  Basecbs 17431  Hom chom 17483  compcco 17484  Catccat 17888  Idccid 17889

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-cat 17892  df-cid 17893

This theorem is used by:  oppccatid  17943  sectcan  17980  sectco  17981  sectmon  18007  monsect  18008  sectid  18011  invisoinvl  18015  subccatid  18071  fucidcl  18193  fuclid  18194  invfuc  18202  arwlid  18297  xpccatid  18412  evlfcl  18446  curf1cl  18452  curf2cl  18455  curfcl  18456  curfuncf  18462  uncfcurf  18463  hofcl  18483  yon12  18489  yon2  18490  yonedalem3b  18503  yonedainv  18505  bj-endmnd  38507  endmndlem  50460  idmon  50465  discsubc  50509  upciclem3  50615  fucoid  50801  fucolid  50814  parcoval2  51097  coccom  51178