Theorem upciclem3 50615

Description: Lemma for upciclem4 50616. (Contributed by Zhi Wang, 17-Sep-2025.)

Hypotheses

Ref	Expression
upcic.b	⊢ 𝐵 = (Base‘𝐷)
upcic.c	⊢ 𝐶 = (Base‘𝐸)
upcic.h	⊢ 𝐻 = (Hom ‘𝐷)
upcic.j	⊢ 𝐽 = (Hom ‘𝐸)
upcic.o	⊢ 𝑂 = (comp‘𝐸)
upcic.f	⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
upcic.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
upcic.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
upcic.z	⊢ (𝜑 → 𝑍 ∈ 𝐶)
upcic.m	⊢ (𝜑 → 𝑀 ∈ (𝑍𝐽(𝐹‘𝑋)))
upcic.1	⊢ (𝜑 → ∀𝑤 ∈ 𝐵 ∀𝑓 ∈ (𝑍𝐽(𝐹‘𝑤))∃!𝑘 ∈ (𝑋𝐻𝑤)𝑓 = (((𝑋𝐺𝑤)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑤))𝑀))
upciclem3.od	⊢ · = (comp‘𝐷)
upciclem3.k	⊢ (𝜑 → 𝐾 ∈ (𝑋𝐻𝑌))
upciclem3.l	⊢ (𝜑 → 𝐿 ∈ (𝑌𝐻𝑋))
upciclem3.mn	⊢ (𝜑 → 𝑀 = (((𝑌𝐺𝑋)‘𝐿)(⟨𝑍, (𝐹‘𝑌)⟩𝑂(𝐹‘𝑋))𝑁))
upciclem3.nm	⊢ (𝜑 → 𝑁 = (((𝑋𝐺𝑌)‘𝐾)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))

Assertion

Ref	Expression
upciclem3	⊢ (𝜑 → (𝐿(⟨𝑋, 𝑌⟩ · 𝑋)𝐾) = ((Id‘𝐷)‘𝑋))

Distinct variable groups:   𝑤,𝐵   𝑓,𝐹,𝑘,𝑤   𝑓,𝐺,𝑘,𝑤   𝑓,𝐻,𝑘,𝑤   𝑓,𝐽,𝑤   𝑓,𝑀,𝑘,𝑤   𝑓,𝑂,𝑘,𝑤   𝑓,𝑋,𝑘,𝑤   𝑓,𝑍,𝑘,𝑤

Allowed substitution hints:   𝜑(𝑤, 𝑓, 𝑘)   𝐵(𝑓, 𝑘)   𝐶(𝑤, 𝑓, 𝑘)   𝐷(𝑤, 𝑓, 𝑘)   · (𝑤, 𝑓, 𝑘)   𝐸(𝑤, 𝑓, 𝑘)   𝐽(𝑘)   𝐾(𝑤, 𝑓, 𝑘)   𝐿(𝑤, 𝑓, 𝑘)   𝑁(𝑤, 𝑓, 𝑘)   𝑌(𝑤, 𝑓, 𝑘)

Proof of Theorem upciclem3

Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6916	. . . 4 ⊢ (𝑝 = (𝐿(⟨𝑋, 𝑌⟩ · 𝑋)𝐾) → ((𝑋𝐺𝑋)‘𝑝) = ((𝑋𝐺𝑋)‘(𝐿(⟨𝑋, 𝑌⟩ · 𝑋)𝐾)))
2	1	oveq1d 7466	. . 3 ⊢ (𝑝 = (𝐿(⟨𝑋, 𝑌⟩ · 𝑋)𝐾) → (((𝑋𝐺𝑋)‘𝑝)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀) = (((𝑋𝐺𝑋)‘(𝐿(⟨𝑋, 𝑌⟩ · 𝑋)𝐾))(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀))
3	2	eqeq2d 2774	. 2 ⊢ (𝑝 = (𝐿(⟨𝑋, 𝑌⟩ · 𝑋)𝐾) → (𝑀 = (((𝑋𝐺𝑋)‘𝑝)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀) ↔ 𝑀 = (((𝑋𝐺𝑋)‘(𝐿(⟨𝑋, 𝑌⟩ · 𝑋)𝐾))(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀)))
4		fveq2 6916	. . . 4 ⊢ (𝑝 = ((Id‘𝐷)‘𝑋) → ((𝑋𝐺𝑋)‘𝑝) = ((𝑋𝐺𝑋)‘((Id‘𝐷)‘𝑋)))
5	4	oveq1d 7466	. . 3 ⊢ (𝑝 = ((Id‘𝐷)‘𝑋) → (((𝑋𝐺𝑋)‘𝑝)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀) = (((𝑋𝐺𝑋)‘((Id‘𝐷)‘𝑋))(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀))
6	5	eqeq2d 2774	. 2 ⊢ (𝑝 = ((Id‘𝐷)‘𝑋) → (𝑀 = (((𝑋𝐺𝑋)‘𝑝)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀) ↔ 𝑀 = (((𝑋𝐺𝑋)‘((Id‘𝐷)‘𝑋))(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀)))
7		upcic.1	. . 3 ⊢ (𝜑 → ∀𝑤 ∈ 𝐵 ∀𝑓 ∈ (𝑍𝐽(𝐹‘𝑤))∃!𝑘 ∈ (𝑋𝐻𝑤)𝑓 = (((𝑋𝐺𝑤)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑤))𝑀))
8		upcic.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
9		upcic.m	. . 3 ⊢ (𝜑 → 𝑀 ∈ (𝑍𝐽(𝐹‘𝑋)))
10	7, 8, 9	upciclem1 50613	. 2 ⊢ (𝜑 → ∃!𝑝 ∈ (𝑋𝐻𝑋)𝑀 = (((𝑋𝐺𝑋)‘𝑝)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀))
11		upcic.b	. . 3 ⊢ 𝐵 = (Base‘𝐷)
12		upcic.h	. . 3 ⊢ 𝐻 = (Hom ‘𝐷)
13		upciclem3.od	. . 3 ⊢ · = (comp‘𝐷)
14		upcic.f	. . . 4 ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
15	14	funcrcl2 50524	. . 3 ⊢ (𝜑 → 𝐷 ∈ Cat)
16		upcic.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
17		upciclem3.k	. . 3 ⊢ (𝜑 → 𝐾 ∈ (𝑋𝐻𝑌))
18		upciclem3.l	. . 3 ⊢ (𝜑 → 𝐿 ∈ (𝑌𝐻𝑋))
19	11, 12, 13, 15, 8, 16, 8, 17, 18	catcocl 17909	. 2 ⊢ (𝜑 → (𝐿(⟨𝑋, 𝑌⟩ · 𝑋)𝐾) ∈ (𝑋𝐻𝑋))
20		eqid 2763	. . 3 ⊢ (Id‘𝐷) = (Id‘𝐷)
21	11, 12, 20, 15, 8	catidcl 17906	. 2 ⊢ (𝜑 → ((Id‘𝐷)‘𝑋) ∈ (𝑋𝐻𝑋))
22		upciclem3.mn	. . 3 ⊢ (𝜑 → 𝑀 = (((𝑌𝐺𝑋)‘𝐿)(⟨𝑍, (𝐹‘𝑌)⟩𝑂(𝐹‘𝑋))𝑁))
23		upcic.c	. . . 4 ⊢ 𝐶 = (Base‘𝐸)
24		upcic.j	. . . 4 ⊢ 𝐽 = (Hom ‘𝐸)
25		upcic.o	. . . 4 ⊢ 𝑂 = (comp‘𝐸)
26		upcic.z	. . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝐶)
27		upciclem3.nm	. . . 4 ⊢ (𝜑 → 𝑁 = (((𝑋𝐺𝑌)‘𝐾)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
28	11, 23, 12, 24, 25, 14, 8, 16, 8, 26, 9, 13, 17, 18, 27	upciclem2 50614	. . 3 ⊢ (𝜑 → (((𝑋𝐺𝑋)‘(𝐿(⟨𝑋, 𝑌⟩ · 𝑋)𝐾))(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀) = (((𝑌𝐺𝑋)‘𝐿)(⟨𝑍, (𝐹‘𝑌)⟩𝑂(𝐹‘𝑋))𝑁))
29	22, 28	eqtr4d 2801	. 2 ⊢ (𝜑 → 𝑀 = (((𝑋𝐺𝑋)‘(𝐿(⟨𝑋, 𝑌⟩ · 𝑋)𝐾))(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀))
30		eqid 2763	. . . . 5 ⊢ (Id‘𝐸) = (Id‘𝐸)
31	11, 20, 30, 14, 8	funcid 18095	. . . 4 ⊢ (𝜑 → ((𝑋𝐺𝑋)‘((Id‘𝐷)‘𝑋)) = ((Id‘𝐸)‘(𝐹‘𝑋)))
32	31	oveq1d 7466	. . 3 ⊢ (𝜑 → (((𝑋𝐺𝑋)‘((Id‘𝐷)‘𝑋))(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀) = (((Id‘𝐸)‘(𝐹‘𝑋))(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀))
33	14	funcrcl3 50525	. . . 4 ⊢ (𝜑 → 𝐸 ∈ Cat)
34	11, 23, 14	funcf1 18091	. . . . 5 ⊢ (𝜑 → 𝐹:𝐵⟶𝐶)
35	34, 8	ffvelcdmd 7117	. . . 4 ⊢ (𝜑 → (𝐹‘𝑋) ∈ 𝐶)
36	23, 24, 30, 33, 26, 25, 35, 9	catlid 17907	. . 3 ⊢ (𝜑 → (((Id‘𝐸)‘(𝐹‘𝑋))(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀) = 𝑀)
37	32, 36	eqtr2d 2799	. 2 ⊢ (𝜑 → 𝑀 = (((𝑋𝐺𝑋)‘((Id‘𝐷)‘𝑋))(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑋))𝑀))
38	3, 6, 10, 19, 21, 29, 37	reu2eqd 3697	1 ⊢ (𝜑 → (𝐿(⟨𝑋, 𝑌⟩ · 𝑋)𝐾) = ((Id‘𝐷)‘𝑋))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃!wreu 3367  ⟨cop 4840   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  Hom chom 17483  compcco 17484  Idccid 17889   Func cfunc 18079

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-pow 5334  ax-pr 5398  ax-un 7783

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-pw 4562  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-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-map 8887  df-ixp 8964  df-cat 17892  df-cid 17893  df-func 18083

This theorem is used by:  upciclem4  50616