Theorem oppcup 50026

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 17799	. . 3 ⊢ 𝐵 = (Base‘𝑂)
4		oppcup.p	. . . 4 ⊢ 𝑃 = (oppCat‘𝐸)
5		oppcup.c	. . . 4 ⊢ 𝐶 = (Base‘𝐸)
6	4, 5	oppcbas 17799	. . 3 ⊢ 𝐶 = (Base‘𝑃)
7		eqid 2766	. . 3 ⊢ (Hom ‘𝑂) = (Hom ‘𝑂)
8		eqid 2766	. . 3 ⊢ (Hom ‘𝑃) = (Hom ‘𝑃)
9		eqid 2766	. . 3 ⊢ (comp‘𝑃) = (comp‘𝑃)
10		oppcup.w	. . 3 ⊢ (𝜑 → 𝑊 ∈ 𝐶)
11		oppcup.f	. . . 4 ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
12	1, 4, 11	funcoppc 17957	. . 3 ⊢ (𝜑 → 𝐹(𝑂 Func 𝑃)tpos 𝐺)
13		oppcup.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
14		oppcup.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ((𝐹‘𝑋)𝐽𝑊))
15		oppcup.j	. . . . 5 ⊢ 𝐽 = (Hom ‘𝐸)
16	15, 4	oppchom 17796	. . . 4 ⊢ (𝑊(Hom ‘𝑃)(𝐹‘𝑋)) = ((𝐹‘𝑋)𝐽𝑊)
17	14, 16	eleqtrrdi 2877	. . 3 ⊢ (𝜑 → 𝑀 ∈ (𝑊(Hom ‘𝑃)(𝐹‘𝑋)))
18	3, 6, 7, 8, 9, 10, 12, 13, 17	isup 49999	. 2 ⊢ (𝜑 → (𝑋(⟨𝐹, tpos 𝐺⟩(𝑂 UP 𝑃)𝑊)𝑀 ↔ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊(Hom ‘𝑃)(𝐹‘𝑦))∃!𝑘 ∈ (𝑋(Hom ‘𝑂)𝑦)𝑔 = (((𝑋tpos 𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀)))
19	15, 4	oppchom 17796	. . . . 5 ⊢ (𝑊(Hom ‘𝑃)(𝐹‘𝑦)) = ((𝐹‘𝑦)𝐽𝑊)
20	19	a1i 11	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑊(Hom ‘𝑃)(𝐹‘𝑦)) = ((𝐹‘𝑦)𝐽𝑊))
21		oppcup.h	. . . . . . 7 ⊢ 𝐻 = (Hom ‘𝐷)
22	21, 1	oppchom 17796	. . . . . 6 ⊢ (𝑋(Hom ‘𝑂)𝑦) = (𝑦𝐻𝑋)
23	22	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑋(Hom ‘𝑂)𝑦) = (𝑦𝐻𝑋))
24		ovtpos 8246	. . . . . . . . 9 ⊢ (𝑋tpos 𝐺𝑦) = (𝑦𝐺𝑋)
25	24	fveq1i 6889	. . . . . . . 8 ⊢ ((𝑋tpos 𝐺𝑦)‘𝑘) = ((𝑦𝐺𝑋)‘𝑘)
26	25	oveq1i 7433	. . . . . . 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 17948	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝐹:𝐵⟶𝐶)
31	13	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝑋 ∈ 𝐵)
32	30, 31	ffvelcdmd 7087	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐹‘𝑋) ∈ 𝐶)
33		simpr 490	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
34	30, 33	ffvelcdmd 7087	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐹‘𝑦) ∈ 𝐶)
35	5, 27, 4, 28, 32, 34	oppcco 17798	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (((𝑦𝐺𝑋)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀) = (𝑀(⟨(𝐹‘𝑦), (𝐹‘𝑋)⟩ ∙ 𝑊)((𝑦𝐺𝑋)‘𝑘)))
36	26, 35	eqtrid 2813	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (((𝑋tpos 𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀) = (𝑀(⟨(𝐹‘𝑦), (𝐹‘𝑋)⟩ ∙ 𝑊)((𝑦𝐺𝑋)‘𝑘)))
37	36	eqeq2d 2777	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑔 = (((𝑋tpos 𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀) ↔ 𝑔 = (𝑀(⟨(𝐹‘𝑦), (𝐹‘𝑋)⟩ ∙ 𝑊)((𝑦𝐺𝑋)‘𝑘))))
38	23, 37	reueqbidv 3408	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (∃!𝑘 ∈ (𝑋(Hom ‘𝑂)𝑦)𝑔 = (((𝑋tpos 𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀) ↔ ∃!𝑘 ∈ (𝑦𝐻𝑋)𝑔 = (𝑀(⟨(𝐹‘𝑦), (𝐹‘𝑋)⟩ ∙ 𝑊)((𝑦𝐺𝑋)‘𝑘))))
39	20, 38	raleqbidv 3341	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (∀𝑔 ∈ (𝑊(Hom ‘𝑃)(𝐹‘𝑦))∃!𝑘 ∈ (𝑋(Hom ‘𝑂)𝑦)𝑔 = (((𝑋tpos 𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩(comp‘𝑃)(𝐹‘𝑦))𝑀) ↔ ∀𝑔 ∈ ((𝐹‘𝑦)𝐽𝑊)∃!𝑘 ∈ (𝑦𝐻𝑋)𝑔 = (𝑀(⟨(𝐹‘𝑦), (𝐹‘𝑋)⟩ ∙ 𝑊)((𝑦𝐺𝑋)‘𝑘))))
40	39	ralbidva 3189	. 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 2146  ∀wral 3082  ∃!wreu 3370  ⟨cop 4600   class class class wbr 5114  ‘cfv 6543  (class class class)co 7423  tpos ctpos 8230  Basecbs 17294  Hom chom 17346  compcco 17347  oppCatcoppc 17792   Func cfunc 17936   UP cup 49992

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 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-cnex 11174  ax-resscn 11175  ax-1cn 11176  ax-icn 11177  ax-addcl 11178  ax-addrcl 11179  ax-mulcl 11180  ax-mulrcl 11181  ax-mulcom 11182  ax-addass 11183  ax-mulass 11184  ax-distr 11185  ax-i2m1 11186  ax-1ne0 11187  ax-1rid 11188  ax-rnegex 11189  ax-rrecex 11190  ax-cnre 11191  ax-pre-lttri 11192  ax-pre-lttrn 11193  ax-pre-ltadd 11194  ax-pre-mulgt0 11195

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 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-om 7872  df-1st 7995  df-2nd 7996  df-tpos 8231  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-er 8703  df-map 8835  df-ixp 8905  df-en 8953  df-dom 8954  df-sdom 8955  df-pnf 11263  df-mnf 11264  df-xr 11265  df-ltxr 11266  df-le 11267  df-sub 11461  df-neg 11462  df-nn 12252  df-2 12321  df-3 12322  df-4 12323  df-5 12324  df-6 12325  df-7 12326  df-8 12327  df-9 12328  df-n0 12523  df-z 12610  df-dec 12730  df-sets 17249  df-slot 17267  df-ndx 17279  df-base 17295  df-hom 17359  df-cco 17360  df-cat 17749  df-cid 17750  df-oppc 17793  df-func 17940  df-up 49993

This theorem is used by:  oppcup2  50027  ranup  50461  islmd  50484