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 50388
Description: Lemma for isup 50389 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 50387 . 2 (𝜑 → (⟨𝐹, 𝐺⟩(𝐷 UP 𝐸)𝑊) = {⟨𝑥, 𝑚⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑚 ∈ (𝑊𝐽(𝐹‘𝑥))) ∧ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑥𝐻𝑦)𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚))})
9 oveq1 7427 . . . 4 (𝑥 = 𝑋 → (𝑥𝐻𝑦) = (𝑋𝐻𝑦))
10 fveq2 6885 . . . . . . . 8 (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
1110opeq2d 4846 . . . . . . 7 (𝑥 = 𝑋 → ⟨𝑊, (𝐹‘𝑥)⟩ = ⟨𝑊, (𝐹‘𝑋)⟩)
1211oveq1d 7435 . . . . . 6 (𝑥 = 𝑋 → (⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦)) = (⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦)))
13 oveq1 7427 . . . . . . 7 (𝑥 = 𝑋 → (𝑥𝐺𝑦) = (𝑋𝐺𝑦))
1413fveq1d 6887 . . . . . 6 (𝑥 = 𝑋 → ((𝑥𝐺𝑦)‘𝑘) = ((𝑋𝐺𝑦)‘𝑘))
15 eqidd 2761 . . . . . 6 (𝑥 = 𝑋 → 𝑚 = 𝑚)
1612, 14, 15oveq123d 7441 . . . . 5 (𝑥 = 𝑋 → (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚))
1716eqeq2d 2771 . . . 4 (𝑥 = 𝑋 → (𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) ↔ 𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚)))
189, 17reueqbidv 3401 . . 3 (𝑥 = 𝑋 → (∃!𝑘 ∈ (𝑥𝐻𝑦)𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚)))
19182ralbidv 3226 . 2 (𝑥 = 𝑋 → (∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑥𝐻𝑦)𝑔 = (((𝑥𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑥)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚)))
20 oveq2 7428 . . . . 5 (𝑚 = 𝑀 → (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀))
2120eqeq2d 2771 . . . 4 (𝑚 = 𝑀 → (𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) ↔ 𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀)))
2221reubidv 3381 . . 3 (𝑚 = 𝑀 → (∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀)))
23222ralbidv 3226 . 2 (𝑚 = 𝑀 → (∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑚) ↔ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀)))
24 eqidd 2761 . 2 ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → 𝐵 = 𝐵)
25 simpl 488 . . . 4 ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → 𝑥 = 𝑋)
2625fveq2d 6889 . . 3 ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → (𝐹‘𝑥) = (𝐹‘𝑋))
2726oveq2d 7436 . 2 ((𝑥 = 𝑋 ∧ 𝑚 = 𝑀) → (𝑊𝐽(𝐹‘𝑥)) = (𝑊𝐽(𝐹‘𝑋)))
288, 19, 23, 24, 27brab2ddw 50033 1 (𝜑 → (𝑋(⟨𝐹, 𝐺⟩(𝐷 UP 𝐸)𝑊)𝑀 ↔ ((𝑋 ∈ 𝐵 ∧ 𝑀 ∈ (𝑊𝐽(𝐹‘𝑋))) ∧ ∀𝑦 ∈ 𝐵 ∀𝑔 ∈ (𝑊𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑔 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑊, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃!wreu 3363  ⟨cop 4834   class class class wbr 5102  ‘cfv 6538  (class class class)co 7420  Basecbs 17392  Hom chom 17444  compcco 17445   Func cfunc 18034   UP cup 50382
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-func 18038  df-up 50383
This theorem is used by:  isup  50389  uprcl4  50400  uprcl5  50401
  Copyright terms: Public domain W3C validator