Theorem catrid 17772

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 7420	. . 3 ⊢ (𝑓 = 𝐹 → (𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = (𝐹(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)))
2		id 23	. . 3 ⊢ (𝑓 = 𝐹 → 𝑓 = 𝐹)
3	1, 2	eqeq12d 2776	. 2 ⊢ (𝑓 = 𝐹 → ((𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓 ↔ (𝐹(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝐹))
4		oveq2 7421	. . . 4 ⊢ (𝑦 = 𝑌 → (𝑋𝐻𝑦) = (𝑋𝐻𝑌))
5		oveq2 7421	. . . . . 6 ⊢ (𝑦 = 𝑌 → (⟨𝑋, 𝑋⟩ · 𝑦) = (⟨𝑋, 𝑋⟩ · 𝑌))
6	5	oveqd 7430	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = (𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)))
7	6	eqeq1d 2762	. . . 4 ⊢ (𝑦 = 𝑌 → ((𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓 ↔ (𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓))
8	4, 7	raleqbidv 3334	. . 3 ⊢ (𝑦 = 𝑌 → (∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑌)(𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓))
9		simpr 490	. . . . . . . 8 ⊢ ((∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓) → ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)
10	9	ralimi 3099	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓) → ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)
11	10	a1i 11	. . . . . 6 ⊢ (𝑔 ∈ (𝑋𝐻𝑋) → (∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓) → ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓))
12	11	ss2rabi 4024	. . . . 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 17765	. . . . . 6 ⊢ (𝜑 → ( 1 ‘𝑋) = (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
20	13, 14, 15, 16, 18	catideu 17763	. . . . . . 7 ⊢ (𝜑 → ∃!𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓))
21		riotacl2 7386	. . . . . . 7 ⊢ (∃!𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓) → (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)})
22	20, 21	syl 18	. . . . . 6 ⊢ (𝜑 → (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)})
23	19, 22	eqeltrd 2860	. . . . 5 ⊢ (𝜑 → ( 1 ‘𝑋) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)})
24	12, 23	sselid 3929	. . . 4 ⊢ (𝜑 → ( 1 ‘𝑋) ∈ {𝑔 ∈ (𝑋𝐻𝑋) ∣ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓})
25		oveq2 7421	. . . . . . . 8 ⊢ (𝑔 = ( 1 ‘𝑋) → (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)))
26	25	eqeq1d 2762	. . . . . . 7 ⊢ (𝑔 = ( 1 ‘𝑋) → ((𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓 ↔ (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓))
27	26	2ralbidv 3226	. . . . . 6 ⊢ (𝑔 = ( 1 ‘𝑋) → (∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓 ↔ ∀𝑦 ∈ 𝐵 ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)( 1 ‘𝑋)) = 𝑓))
28	27	elrab 3645	. . . . 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 3577	. 2 ⊢ (𝜑 → ∀𝑓 ∈ (𝑋𝐻𝑌)(𝑓(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝑓)
33		catlid.f	. 2 ⊢ (𝜑 → 𝐹 ∈ (𝑋𝐻𝑌))
34	3, 32, 33	rspcdva 3577	1 ⊢ (𝜑 → (𝐹(⟨𝑋, 𝑋⟩ · 𝑌)( 1 ‘𝑋)) = 𝐹)

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  monsect  17872  invisoinvl  17879  rcaninv  17883  subccatid  17935  fucidcl  18057  fucrid  18059  invfuc  18066  arwrid  18162  xpccatid  18276  curf2cl  18319  curfuncf  18326  uncfcurf  18327  hofcl  18347  yonedalem3b  18367  bj-endmnd  38070  endmndlem  49941  idepi  49947  upeu2lem  49954  fucorid  50288  precofvalALT  50294  concom  50589