Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  isuplem Structured version   Visualization version   GIF version

Theorem isuplem 50231
Description: Lemma for isup 50232 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.
StepHypRef 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 𝐸)𝐺)
81, 2, 3, 4, 5, 6, 7upfval3 50230 . 2 (𝜑 → (⟨𝐹, 𝐺⟩(𝐷 UP 𝐸)𝑊) = {⟨𝑥, 𝑚⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑚 ∈ (𝑊𝐽(𝐹‘𝑥))) ∧ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑥𝐻𝑦)𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚))})
9 oveq1 7419 . . . 4 (𝑥 = 𝑋 → (𝑥𝐻𝑦) = (𝑋𝐻𝑦))
10 fveq2 6877 . . . . . . . 8 (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
1110opeq2d 4840 . . . . . . 7 (𝑥 = 𝑋 → ⟨𝑊, (𝐹‘𝑥)⟩ = ⟨𝑊, (𝐹‘𝑋)⟩)
1211oveq1d 7427 . . . . . 6 (𝑥 = 𝑋 → (⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦)) = (⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦)))
13 oveq1 7419 . . . . . . 7 (𝑥 = 𝑋 → (𝑥𝐺𝑦) = (𝑋𝐺𝑦))
1413fveq1d 6879 . . . . . 6 (𝑥 = 𝑋 → ((𝑥𝐺𝑦)‘𝑘) = ((𝑋𝐺𝑦)‘𝑘))
15 eqidd 2762 . . . . . 6 (𝑥 = 𝑋 → 𝑚 = 𝑚)
1612, 14, 15oveq123d 7433 . . . . 5 (𝑥 = 𝑋 → (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚))
1716eqeq2d 2772 . . . 4 (𝑥 = 𝑋 → (𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) ↔ 𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚)))
189, 17reueqbidv 3402 . . 3 (𝑥 = 𝑋 → (∃!𝑘 ∈ (𝑥𝐻𝑦)𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚)))
19182ralbidv 3227 . 2 (𝑥 = 𝑋 → (∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑥𝐻𝑦)𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚)))
20 oveq2 7420 . . . . 5 (𝑚 = 𝑀 → (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀))
2120eqeq2d 2772 . . . 4 (𝑚 = 𝑀 → (𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) ↔ 𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀)))
2221reubidv 3382 . . 3 (𝑚 = 𝑀 → (∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀)))
23222ralbidv 3227 . 2 (𝑚 = 𝑀 → (∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀)))
24 eqidd 2762 . 2 ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → 𝐵 = 𝐵)
25 simpl 488 . . . 4 ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → 𝑥 = 𝑋)
2625fveq2d 6881 . . 3 ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → (𝐹‘𝑥) = (𝐹‘𝑋))
2726oveq2d 7428 . 2 ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → (𝑊𝐽(𝐹‘𝑥)) = (𝑊𝐽(𝐹‘𝑋)))
288, 19, 23, 24, 27brab2ddw 49883 1 (𝜑 → (𝑋(⟨𝐹, 𝐺⟩(𝐷 UP 𝐸)𝑊)𝑀 ↔ ((𝑋 ∈ 𝐵 ∧ 𝑀 ∈ (𝑊𝐽(𝐹‘𝑋))) ∧ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃!wreu 3364  ⟨cop 4590   class class class wbr 5103  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  Hom chom 17419  compcco 17420   Func cfunc 18009   UP cup 50225
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991  df-func 18013  df-up 50226
This theorem is used by:  isup  50232  uprcl4  50243  uprcl5  50244
  Copyright terms: Public domain W3C validator