Theorem catrid 17757

Description: Right 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
catrid	⊢ (𝜑 → (𝐹(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝐹)

Proof of Theorem catrid

Dummy variables 𝑓 𝑔 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq1 7423	. . 3 ⊢ (𝑓 = 𝐹 → (𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = (𝐹(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)))
2		id 23	. . 3 ⊢ (𝑓 = 𝐹 → 𝑓 = 𝐹)
3	1, 2	eqeq12d 2781	. 2 ⊢ (𝑓 = 𝐹 → ((𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓 ↔ (𝐹(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝐹))
4		oveq2 7424	. . . 4 ⊢ (𝑦 = 𝑌 → (𝑋𝐻𝑦) = (𝑋𝐻𝑌))
5		oveq2 7424	. . . . . 6 ⊢ (𝑦 = 𝑌 → (⟨𝑋, 𝑋⟩ · 𝑦) = (⟨𝑋, 𝑋⟩ · 𝑌))
6	5	oveqd 7433	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = (𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)))
7	6	eqeq1d 2767	. . . 4 ⊢ (𝑦 = 𝑌 → ((𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓 ↔ (𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓))
8	4, 7	raleqbidv 3340	. . 3 ⊢ (𝑦 = 𝑌 → (∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑌)(𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓))
9		simpr 490	. . . . . . . 8 ⊢ ((∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓) → ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)
10	9	ralimi 3104	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓) → ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)
11	10	a1i 11	. . . . . 6 ⊢ (𝑔 ∈ (𝑋𝐻𝑋) → (∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓) → ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓))
12	11	ss2rabi 4031	. . . . 5 ⊢ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)} ⊆ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓}
13		catidcl.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐶)
14		catidcl.h	. . . . . . 7 ⊢ 𝐻 = (Hom ‘𝐶)
15		catlid.o	. . . . . . 7 ⊢ · = (comp‘𝐶)
16		catidcl.c	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ Cat)
17		catidcl.i	. . . . . . 7 ⊢ 1 = (Id‘𝐶)
18		catidcl.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
19	13, 14, 15, 16, 17, 18	cidval 17750	. . . . . 6 ⊢ (𝜑 → ( 1 ‘𝑋) = (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
20	13, 14, 15, 16, 18	catideu 17748	. . . . . . 7 ⊢ (𝜑 → ∃!𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓))
21		riotacl2 7389	. . . . . . 7 ⊢ (∃!𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓) → (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)})
22	20, 21	syl 18	. . . . . 6 ⊢ (𝜑 → (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)})
23	19, 22	eqeltrd 2865	. . . . 5 ⊢ (𝜑 → ( 1 ‘𝑋) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)})
24	12, 23	sselid 3936	. . . 4 ⊢ (𝜑 → ( 1 ‘𝑋) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓})
25		oveq2 7424	. . . . . . . 8 ⊢ (𝑔 = ( 1 ‘𝑋) → (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)))
26	25	eqeq1d 2767	. . . . . . 7 ⊢ (𝑔 = ( 1 ‘𝑋) → ((𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓 ↔ (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓))
27	26	2ralbidv 3231	. . . . . 6 ⊢ (𝑔 = ( 1 ‘𝑋) → (∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓 ↔ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓))
28	27	elrab 3652	. . . . 5 ⊢ (( 1 ‘𝑋) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓} ↔ (( 1 ‘𝑋) ∈ (𝑋𝐻𝑋) ∧ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓))
29	28	simprbi 503	. . . 4 ⊢ (( 1 ‘𝑋) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓} → ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓)
30	24, 29	syl 18	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓)
31		catlid.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
32	8, 30, 31	rspcdva 3584	. 2 ⊢ (𝜑 → ∀𝑓 ∈ (𝑋𝐻𝑌)(𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓)
33		catlid.f	. 2 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌))
34	3, 32, 33	rspcdva 3584	1 ⊢ (𝜑 → (𝐹(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝐹)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ∃!wreu 3369  {crab 3418  ⟨cop 4597  ‘cfv 6540  ℩crio 7372  (class class class)co 7416  Basecbs 17286  Hom chom 17338  compcco 17339  Catccat 17737  Idccid 17738

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-ov 7419  df-cat 17741  df-cid 17742

This theorem is used by:  oppccatid  17792  sectcan  17829  monsect  17857  invisoinvl  17864  rcaninv  17868  subccatid  17920  fucidcl  18042  fucrid  18044  invfuc  18051  arwrid  18147  xpccatid  18261  curf2cl  18304  curfuncf  18311  uncfcurf  18312  hofcl  18332  yonedalem3b  18352  bj-endmnd  37995  endmndlem  49826  idepi  49832  upeu2lem  49839  fucorid  50173  precofvalALT  50179  concom  50474