Theorem isuplem 49998

Description: Lemma for isup 49999 and other theorems. (Contributed by Zhi Wang, 25-Sep-2025.)

Hypotheses

Ref	Expression
upfval.b	⊢ 𝐵 = (Base‘𝐷)
upfval.c	⊢ 𝐶 = (Base‘𝐸)
upfval.h	⊢ 𝐻 = (Hom ‘𝐷)
upfval.j	⊢ 𝐽 = (Hom ‘𝐸)
upfval.o	⊢ 𝑂 = (comp‘𝐸)
upfval2.w	⊢ (𝜑 → 𝑊 ∈ 𝐶)
upfval3.f	⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)

Assertion

Ref	Expression
isuplem	⊢ (𝜑 → (𝑋(⟨𝐹, 𝐺⟩(𝐷 UP 𝐸)𝑊)𝑀 ↔ ((𝑋 ∈ 𝐵 ∧ 𝑀 ∈ (𝑊𝐽(𝐹‘𝑋))) ∧ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀))))

Distinct variable groups:   𝐵,𝑔,𝑘,𝑦   𝐶,𝑔,𝑘,𝑦   𝐷,𝑔,𝑘,𝑦   𝑔,𝐸,𝑘,𝑦   𝑔,𝐹,𝑘,𝑦   𝑔,𝐺,𝑘,𝑦   𝑔,𝐻,𝑘,𝑦   𝑔,𝐽,𝑘,𝑦   𝑔,𝑀,𝑘,𝑦   𝑔,𝑂,𝑘,𝑦   𝑔,𝑊,𝑘,𝑦   𝑔,𝑋,𝑘,𝑦

Allowed substitution hints:   𝜑(𝑦, 𝑔, 𝑘)

Proof of Theorem isuplem

Dummy variables 𝑚 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		upfval.b	. . 3 ⊢ 𝐵 = (Base‘𝐷)
2		upfval.c	. . 3 ⊢ 𝐶 = (Base‘𝐸)
3		upfval.h	. . 3 ⊢ 𝐻 = (Hom ‘𝐷)
4		upfval.j	. . 3 ⊢ 𝐽 = (Hom ‘𝐸)
5		upfval.o	. . 3 ⊢ 𝑂 = (comp‘𝐸)
6		upfval2.w	. . 3 ⊢ (𝜑 → 𝑊 ∈ 𝐶)
7		upfval3.f	. . 3 ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
8	1, 2, 3, 4, 5, 6, 7	upfval3 49997	. 2 ⊢ (𝜑 → (⟨𝐹, 𝐺⟩(𝐷 UP 𝐸)𝑊) = {⟨𝑥, 𝑚⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑚 ∈ (𝑊𝐽(𝐹‘𝑥))) ∧ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑥𝐻𝑦)𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚))})
9		oveq1 7430	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑥𝐻𝑦) = (𝑋𝐻𝑦))
10		fveq2 6888	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
11	10	opeq2d 4850	. . . . . . 7 ⊢ (𝑥 = 𝑋 → ⟨𝑊, (𝐹‘𝑥)⟩ = ⟨𝑊, (𝐹‘𝑋)⟩)
12	11	oveq1d 7438	. . . . . 6 ⊢ (𝑥 = 𝑋 → (⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦)) = (⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦)))
13		oveq1 7430	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑥𝐺𝑦) = (𝑋𝐺𝑦))
14	13	fveq1d 6890	. . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝑥𝐺𝑦)‘𝑘) = ((𝑋𝐺𝑦)‘𝑘))
15		eqidd 2767	. . . . . 6 ⊢ (𝑥 = 𝑋 → 𝑚 = 𝑚)
16	12, 14, 15	oveq123d 7444	. . . . 5 ⊢ (𝑥 = 𝑋 → (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚))
17	16	eqeq2d 2777	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) ↔ 𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚)))
18	9, 17	reueqbidv 3408	. . 3 ⊢ (𝑥 = 𝑋 → (∃!𝑘 ∈ (𝑥𝐻𝑦)𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚)))
19	18	2ralbidv 3232	. 2 ⊢ (𝑥 = 𝑋 → (∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑥𝐻𝑦)𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚)))
20		oveq2 7431	. . . . 5 ⊢ (𝑚 = 𝑀 → (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀))
21	20	eqeq2d 2777	. . . 4 ⊢ (𝑚 = 𝑀 → (𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) ↔ 𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀)))
22	21	reubidv 3388	. . 3 ⊢ (𝑚 = 𝑀 → (∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀)))
23	22	2ralbidv 3232	. 2 ⊢ (𝑚 = 𝑀 → (∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀)))
24		eqidd 2767	. 2 ⊢ ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → 𝐵 = 𝐵)
25		simpl 488	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → 𝑥 = 𝑋)
26	25	fveq2d 6892	. . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → (𝐹‘𝑥) = (𝐹‘𝑋))
27	26	oveq2d 7439	. 2 ⊢ ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → (𝑊𝐽(𝐹‘𝑥)) = (𝑊𝐽(𝐹‘𝑋)))
28	8, 19, 23, 24, 27	brab2ddw 49648	1 ⊢ (𝜑 → (𝑋(⟨𝐹, 𝐺⟩(𝐷 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  Basecbs 17294  Hom chom 17346  compcco 17347   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

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  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-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-id 5561  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-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-func 17940  df-up 49993

This theorem is used by:  isup  49999  uprcl4  50010  uprcl5  50011