Theorem oppcup 50538

Description: The universal pair ⟨𝑋, 𝑀⟩ from a functor to an object is universal from an object to a functor in the opposite category. (Contributed by Zhi Wang, 24-Sep-2025.)

Hypotheses

Ref	Expression
oppcup.b	⊢ 𝐵 = (Base‘𝐷)
oppcup.c	⊢ 𝐶 = (Base‘𝐸)
oppcup.h	⊢ 𝐻 = (Hom ‘𝐷)
oppcup.j	⊢ 𝐽 = (Hom ‘𝐸)
oppcup.xb	⊢ ∙ = (comp‘𝐸)
oppcup.w	⊢ (𝜑 → 𝑊 ∈ 𝐶)
oppcup.f	⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
oppcup.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
oppcup.m	⊢ (𝜑 → 𝑀 ∈ ((𝐹‘𝑋)𝐽𝑊))
oppcup.o	⊢ 𝑂 = (oppCat‘𝐷)
oppcup.p	⊢ 𝑃 = (oppCat‘𝐸)

Assertion

Ref	Expression
oppcup	⊢ (𝜑 → (𝑋(⟨𝐹, tpos 𝐺⟩(𝑂 UP 𝑃)𝑊)𝑀 ↔ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ ((𝐹‘𝑦)𝐽𝑊)∃!𝑘 ∈ (𝑦𝐻𝑋)𝑔 = (𝑀(⟨(𝐹‘𝑦), (𝐹‘𝑋)⟩ ∙ 𝑊)((𝑦𝐺𝑋)‘𝑘))))

Distinct variable groups:   𝐵,𝑔,𝑘,𝑦   𝐶,𝑔,𝑘,𝑦   𝑔,𝐹,𝑘,𝑦   𝑔,𝐺,𝑘,𝑦   𝑘,𝐻   𝑔,𝑀,𝑘,𝑦   𝑔,𝑂,𝑘,𝑦   𝑃,𝑔,𝑘,𝑦   𝑔,𝑊,𝑘,𝑦   𝑔,𝑋,𝑘,𝑦   𝜑,𝑔,𝑘,𝑦

Allowed substitution hints:   𝐷(𝑦, 𝑔, 𝑘)   ∙ (𝑦, 𝑔, 𝑘)   𝐸(𝑦, 𝑔, 𝑘)   𝐻(𝑦, 𝑔)   𝐽(𝑦, 𝑔, 𝑘)

Proof of Theorem oppcup

Step	Hyp	Ref	Expression
1		oppcup.o	. . . 4 ⊢ 𝑂 = (oppCat‘𝐷)
2		oppcup.b	. . . 4 ⊢ 𝐵 = (Base‘𝐷)
3	1, 2	oppcbas 17924	. . 3 ⊢ 𝐵 = (Base‘𝑂)
4		oppcup.p	. . . 4 ⊢ 𝑃 = (oppCat‘𝐸)
5		oppcup.c	. . . 4 ⊢ 𝐶 = (Base‘𝐸)
6	4, 5	oppcbas 17924	. . 3 ⊢ 𝐶 = (Base‘𝑃)
7		eqid 2763	. . 3 ⊢ (Hom ‘𝑂) = (Hom ‘𝑂)
8		eqid 2763	. . 3 ⊢ (Hom ‘𝑃) = (Hom ‘𝑃)
9		eqid 2763	. . 3 ⊢ (comp‘𝑃) = (comp‘𝑃)
10		oppcup.w	. . 3 ⊢ (𝜑 → 𝑊 ∈ 𝐶)
11		oppcup.f	. . . 4 ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
12	1, 4, 11	funcoppc 18082	. . 3 ⊢ (𝜑 → 𝐹(𝑂 Func 𝑃)tpos 𝐺)
13		oppcup.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
14		oppcup.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ((𝐹‘𝑋)𝐽𝑊))
15		oppcup.j	. . . . 5 ⊢ 𝐽 = (Hom ‘𝐸)
16	15, 4	oppchom 17921	. . . 4 ⊢ (𝑊(Hom ‘𝑃)(𝐹‘𝑋)) = ((𝐹‘𝑋)𝐽𝑊)
17	14, 16	eleqtrrdi 2875	. . 3 ⊢ (𝜑 → 𝑀 ∈ (𝑊(Hom ‘𝑃)(𝐹‘𝑋)))
18	3, 6, 7, 8, 9, 10, 12, 13, 17	isup 50511	. 2 ⊢ (𝜑 → (𝑋(⟨𝐹, tpos 𝐺⟩(𝑂 UP 𝑃)𝑊)𝑀 ↔ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊(Hom ‘𝑃)(𝐹‘𝑦))∃!𝑘 ∈ (𝑋(Hom ‘𝑂)𝑦)𝑔 = (((𝑋tpos 𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀)))
19	15, 4	oppchom 17921	. . . . 5 ⊢ (𝑊(Hom ‘𝑃)(𝐹‘𝑦)) = ((𝐹‘𝑦)𝐽𝑊)
20	19	a1i 11	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑊(Hom ‘𝑃)(𝐹‘𝑦)) = ((𝐹‘𝑦)𝐽𝑊))
21		oppcup.h	. . . . . . 7 ⊢ 𝐻 = (Hom ‘𝐷)
22	21, 1	oppchom 17921	. . . . . 6 ⊢ (𝑋(Hom ‘𝑂)𝑦) = (𝑦𝐻𝑋)
23	22	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑋(Hom ‘𝑂)𝑦) = (𝑦𝐻𝑋))
24		ovtpos 8289	. . . . . . . . 9 ⊢ (𝑋tpos 𝐺𝑦) = (𝑦𝐺𝑋)
25	24	fveq1i 6912	. . . . . . . 8 ⊢ ((𝑋tpos 𝐺𝑦)‘𝑘) = ((𝑦𝐺𝑋)‘𝑘)
26	25	oveq1i 7456	. . . . . . 7 ⊢ (((𝑋tpos 𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀) = (((𝑦𝐺𝑋)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀)
27		oppcup.xb	. . . . . . . 8 ⊢ ∙ = (comp‘𝐸)
28	10	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝑊 ∈ 𝐶)
29	11	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝐹(𝐷 Func 𝐸)𝐺)
30	2, 5, 29	funcf1 18073	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝐹:𝐵⟶𝐶)
31	13	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝑋 ∈ 𝐵)
32	30, 31	ffvelcdmd 7112	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐹‘𝑋) ∈ 𝐶)
33		simpr 490	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
34	30, 33	ffvelcdmd 7112	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐹‘𝑦) ∈ 𝐶)
35	5, 27, 4, 28, 32, 34	oppcco 17923	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (((𝑦𝐺𝑋)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀) = (𝑀(⟨(𝐹‘𝑦), (𝐹‘𝑋)⟩ ∙ 𝑊)((𝑦𝐺𝑋)‘𝑘)))
36	26, 35	eqtrid 2810	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (((𝑋tpos 𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀) = (𝑀(⟨(𝐹‘𝑦), (𝐹‘𝑋)⟩ ∙ 𝑊)((𝑦𝐺𝑋)‘𝑘)))
37	36	eqeq2d 2774	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑔 = (((𝑋tpos 𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀) ↔ 𝑔 = (𝑀(⟨(𝐹‘𝑦), (𝐹‘𝑋)⟩ ∙ 𝑊)((𝑦𝐺𝑋)‘𝑘))))
38	23, 37	reueqbidv 3405	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (∃!𝑘 ∈ (𝑋(Hom ‘𝑂)𝑦)𝑔 = (((𝑋tpos 𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀) ↔ ∃!𝑘 ∈ (𝑦𝐻𝑋)𝑔 = (𝑀(⟨(𝐹‘𝑦), (𝐹‘𝑋)⟩ ∙ 𝑊)((𝑦𝐺𝑋)‘𝑘))))
39	20, 38	raleqbidv 3338	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (∀𝑔 ∈ (𝑊(Hom ‘𝑃)(𝐹‘𝑦))∃!𝑘 ∈ (𝑋(Hom ‘𝑂)𝑦)𝑔 = (((𝑋tpos 𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀) ↔ ∀𝑔 ∈ ((𝐹‘𝑦)𝐽𝑊)∃!𝑘 ∈ (𝑦𝐻𝑋)𝑔 = (𝑀(⟨(𝐹‘𝑦), (𝐹‘𝑋)⟩ ∙ 𝑊)((𝑦𝐺𝑋)‘𝑘))))
40	39	ralbidva 3187	. 2 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊(Hom ‘𝑃)(𝐹‘𝑦))∃!𝑘 ∈ (𝑋(Hom ‘𝑂)𝑦)𝑔 = (((𝑋tpos 𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀) ↔ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ ((𝐹‘𝑦)𝐽𝑊)∃!𝑘 ∈ (𝑦𝐻𝑋)𝑔 = (𝑀(⟨(𝐹‘𝑦), (𝐹‘𝑋)⟩ ∙ 𝑊)((𝑦𝐺𝑋)‘𝑘))))
41	18, 40	bitrd 282	1 ⊢ (𝜑 → (𝑋(⟨𝐹, tpos 𝐺⟩(𝑂 UP 𝑃)𝑊)𝑀 ↔ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ ((𝐹‘𝑦)𝐽𝑊)∃!𝑘 ∈ (𝑦𝐻𝑋)𝑔 = (𝑀(⟨(𝐹‘𝑦), (𝐹‘𝑋)⟩ ∙ 𝑊)((𝑦𝐺𝑋)‘𝑘))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃!wreu 3367  ⟨cop 4838   class class class wbr 5106  ‘cfv 6561  (class class class)co 7446  tpos ctpos 8273  Basecbs 17419  Hom chom 17471  compcco 17472  oppCatcoppc 17917   Func cfunc 18061   UP cup 50504

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 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778  ax-cnex 11286  ax-resscn 11287  ax-1cn 11288  ax-icn 11289  ax-addcl 11290  ax-addrcl 11291  ax-mulcl 11292  ax-mulrcl 11293  ax-mulcom 11294  ax-addass 11295  ax-mulass 11296  ax-distr 11297  ax-i2m1 11298  ax-1ne0 11299  ax-1rid 11300  ax-rnegex 11301  ax-rrecex 11302  ax-cnre 11303  ax-pre-lttri 11304  ax-pre-lttrn 11305  ax-pre-ltadd 11306  ax-pre-mulgt0 11307

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-nel 3066  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-pss 4017  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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7403  df-ov 7449  df-oprab 7450  df-mpo 7451  df-om 7905  df-1st 8028  df-2nd 8029  df-tpos 8274  df-frecs 8330  df-wrecs 8361  df-recs 8410  df-rdg 8449  df-er 8748  df-map 8880  df-ixp 8957  df-en 9005  df-dom 9006  df-sdom 9007  df-pnf 11375  df-mnf 11376  df-xr 11377  df-ltxr 11378  df-le 11379  df-sub 11573  df-neg 11574  df-nn 12366  df-2 12435  df-3 12436  df-4 12437  df-5 12438  df-6 12439  df-7 12440  df-8 12441  df-9 12442  df-n0 12637  df-z 12724  df-dec 12845  df-sets 17374  df-slot 17392  df-ndx 17404  df-base 17420  df-hom 17484  df-cco 17485  df-cat 17874  df-cid 17875  df-oppc 17918  df-func 18065  df-up 50505

This theorem is used by:  oppcup2  50539  ranup  51040  islmd  51063