Theorem isuplem 50510

Description: Lemma for isup 50511 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 50509	. 2 ⊢ (𝜑 → (⟨𝐹, 𝐺⟩(𝐷 UP 𝐸)𝑊) = {⟨𝑥, 𝑚⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑚 ∈ (𝑊𝐽(𝐹‘𝑥))) ∧ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑥𝐻𝑦)𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚))})
9		oveq1 7453	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑥𝐻𝑦) = (𝑋𝐻𝑦))
10		fveq2 6911	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
11	10	opeq2d 4850	. . . . . . 7 ⊢ (𝑥 = 𝑋 → ⟨𝑊, (𝐹‘𝑥)⟩ = ⟨𝑊, (𝐹‘𝑋)⟩)
12	11	oveq1d 7461	. . . . . 6 ⊢ (𝑥 = 𝑋 → (⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦)) = (⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦)))
13		oveq1 7453	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑥𝐺𝑦) = (𝑋𝐺𝑦))
14	13	fveq1d 6913	. . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝑥𝐺𝑦)‘𝑘) = ((𝑋𝐺𝑦)‘𝑘))
15		eqidd 2764	. . . . . 6 ⊢ (𝑥 = 𝑋 → 𝑚 = 𝑚)
16	12, 14, 15	oveq123d 7467	. . . . 5 ⊢ (𝑥 = 𝑋 → (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚))
17	16	eqeq2d 2774	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) ↔ 𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚)))
18	9, 17	reueqbidv 3405	. . 3 ⊢ (𝑥 = 𝑋 → (∃!𝑘 ∈ (𝑥𝐻𝑦)𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚)))
19	18	2ralbidv 3230	. 2 ⊢ (𝑥 = 𝑋 → (∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑥𝐻𝑦)𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚)))
20		oveq2 7454	. . . . 5 ⊢ (𝑚 = 𝑀 → (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀))
21	20	eqeq2d 2774	. . . 4 ⊢ (𝑚 = 𝑀 → (𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) ↔ 𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀)))
22	21	reubidv 3385	. . 3 ⊢ (𝑚 = 𝑀 → (∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀)))
23	22	2ralbidv 3230	. 2 ⊢ (𝑚 = 𝑀 → (∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀)))
24		eqidd 2764	. 2 ⊢ ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → 𝐵 = 𝐵)
25		simpl 488	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → 𝑥 = 𝑋)
26	25	fveq2d 6915	. . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → (𝐹‘𝑥) = (𝐹‘𝑋))
27	26	oveq2d 7462	. 2 ⊢ ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → (𝑊𝐽(𝐹‘𝑥)) = (𝑊𝐽(𝐹‘𝑋)))
28	8, 19, 23, 24, 27	brab2ddw 50155	1 ⊢ (𝜑 → (𝑋(⟨𝐹, 𝐺⟩(𝐷 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  Basecbs 17419  Hom chom 17471  compcco 17472   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

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-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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  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-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-1st 8028  df-2nd 8029  df-func 18065  df-up 50505

This theorem is used by:  isup  50511  uprcl4  50522  uprcl5  50523