Theorem catrid 16345

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		catlid.f	. 2 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌))
2		catlid.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
3		simpr 477	. . . . . . . 8 ⊢ ((∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓) → ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)
4	3	ralimi 2952	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓) → ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)
5	4	a1i 11	. . . . . 6 ⊢ (𝑔 ∈ (𝑋𝐻𝑋) → (∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓) → ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓))
6	5	ss2rabi 3684	. . . . 5 ⊢ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)} ⊆ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓}
7		catidcl.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐶)
8		catidcl.h	. . . . . . 7 ⊢ 𝐻 = (Hom ‘𝐶)
9		catlid.o	. . . . . . 7 ⊢ · = (comp‘𝐶)
10		catidcl.c	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ Cat)
11		catidcl.i	. . . . . . 7 ⊢ 1 = (Id‘𝐶)
12		catidcl.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
13	7, 8, 9, 10, 11, 12	cidval 16338	. . . . . 6 ⊢ (𝜑 → ( 1 ‘𝑋) = (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
14	7, 8, 9, 10, 12	catideu 16336	. . . . . . 7 ⊢ (𝜑 → ∃!𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓))
15		riotacl2 6624	. . . . . . 7 ⊢ (∃!𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓) → (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)})
16	14, 15	syl 17	. . . . . 6 ⊢ (𝜑 → (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)})
17	13, 16	eqeltrd 2701	. . . . 5 ⊢ (𝜑 → ( 1 ‘𝑋) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)})
18	6, 17	sseldi 3601	. . . 4 ⊢ (𝜑 → ( 1 ‘𝑋) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓})
19		oveq2 6658	. . . . . . . 8 ⊢ (𝑔 = ( 1 ‘𝑋) → (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)))
20	19	eqeq1d 2624	. . . . . . 7 ⊢ (𝑔 = ( 1 ‘𝑋) → ((𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓 ↔ (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓))
21	20	2ralbidv 2989	. . . . . 6 ⊢ (𝑔 = ( 1 ‘𝑋) → (∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓 ↔ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓))
22	21	elrab 3363	. . . . 5 ⊢ (( 1 ‘𝑋) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓} ↔ (( 1 ‘𝑋) ∈ (𝑋𝐻𝑋) ∧ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓))
23	22	simprbi 480	. . . 4 ⊢ (( 1 ‘𝑋) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓} → ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓)
24	18, 23	syl 17	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓)
25		oveq2 6658	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝑋𝐻𝑦) = (𝑋𝐻𝑌))
26		oveq2 6658	. . . . . . 7 ⊢ (𝑦 = 𝑌 → (⟨𝑋, 𝑋⟩ · 𝑦) = (⟨𝑋, 𝑋⟩ · 𝑌))
27	26	oveqd 6667	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = (𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)))
28	27	eqeq1d 2624	. . . . 5 ⊢ (𝑦 = 𝑌 → ((𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓 ↔ (𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓))
29	25, 28	raleqbidv 3152	. . . 4 ⊢ (𝑦 = 𝑌 → (∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑌)(𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓))
30	29	rspcv 3305	. . 3 ⊢ (𝑌 ∈ 𝐵 → (∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓 → ∀𝑓 ∈ (𝑋𝐻𝑌)(𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓))
31	2, 24, 30	sylc 65	. 2 ⊢ (𝜑 → ∀𝑓 ∈ (𝑋𝐻𝑌)(𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓)
32		oveq1 6657	. . . 4 ⊢ (𝑓 = 𝐹 → (𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = (𝐹(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)))
33		id 22	. . . 4 ⊢ (𝑓 = 𝐹 → 𝑓 = 𝐹)
34	32, 33	eqeq12d 2637	. . 3 ⊢ (𝑓 = 𝐹 → ((𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓 ↔ (𝐹(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝐹))
35	34	rspcv 3305	. 2 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (∀𝑓 ∈ (𝑋𝐻𝑌)(𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓 → (𝐹(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝐹))
36	1, 31, 35	sylc 65	1 ⊢ (𝜑 → (𝐹(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝐹)

Syntax hints:   → wi 4   ∧ wa 384   = wceq 1483   ∈ wcel 1990  ∀wral 2912  ∃!wreu 2914  {crab 2916  ⟨cop 4183  ‘cfv 5888  ℩crio 6610  (class class class)co 6650  Basecbs 15857  Hom chom 15952  compcco 15953  Catccat 16325  Idccid 16326

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-cat 16329  df-cid 16330

This theorem is referenced by:  oppccatid  16379  sectcan  16415  monsect  16443  invisoinvl  16450  rcaninv  16454  cicref  16461  subccatid  16506  fucidcl  16625  fucrid  16627  invfuc  16634  arwrid  16723  xpccatid  16828  curf2cl  16871  curfuncf  16878  uncfcurf  16879  hofcl  16899  yonedalem3b  16919