MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ussval Structured version   Visualization version   GIF version

Theorem ussval 24163
Description: The uniform structure on uniform space 𝑊. This proof uses a trick with fvprc 6818 to avoid requiring 𝑊 to be a set. (Contributed by Thierry Arnoux, 3-Dec-2017.)
Hypotheses
Ref Expression
ussval.1 𝐵 = (Base‘𝑊)
ussval.2 𝑈 = (UnifSet‘𝑊)
Assertion
Ref Expression
ussval (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊)

Proof of Theorem ussval
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 ussval.2 . . . 4 𝑈 = (UnifSet‘𝑊)
2 ussval.1 . . . . 5 𝐵 = (Base‘𝑊)
32, 2xpeq12i 5651 . . . 4 (𝐵 × 𝐵) = ((Base‘𝑊) × (Base‘𝑊))
41, 3oveq12i 7365 . . 3 (𝑈t (𝐵 × 𝐵)) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))
5 fveq2 6826 . . . . 5 (𝑤 = 𝑊 → (UnifSet‘𝑤) = (UnifSet‘𝑊))
6 fveq2 6826 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
76sqxpeqd 5655 . . . . 5 (𝑤 = 𝑊 → ((Base‘𝑤) × (Base‘𝑤)) = ((Base‘𝑊) × (Base‘𝑊)))
85, 7oveq12d 7371 . . . 4 (𝑤 = 𝑊 → ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
9 df-uss 24160 . . . 4 UnifSt = (𝑤 ∈ V ↦ ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))))
10 ovex 7386 . . . 4 ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ∈ V
118, 9, 10fvmpt 6934 . . 3 (𝑊 ∈ V → (UnifSt‘𝑊) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
124, 11eqtr4id 2783 . 2 (𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
13 0rest 17351 . . 3 (∅ ↾t (𝐵 × 𝐵)) = ∅
14 fvprc 6818 . . . . 5 𝑊 ∈ V → (UnifSet‘𝑊) = ∅)
151, 14eqtrid 2776 . . . 4 𝑊 ∈ V → 𝑈 = ∅)
1615oveq1d 7368 . . 3 𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (∅ ↾t (𝐵 × 𝐵)))
17 fvprc 6818 . . 3 𝑊 ∈ V → (UnifSt‘𝑊) = ∅)
1813, 16, 173eqtr4a 2790 . 2 𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
1912, 18pm2.61i 182 1 (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1540  wcel 2109  Vcvv 3438  c0 4286   × cxp 5621  cfv 6486  (class class class)co 7353  Basecbs 17138  UnifSetcunif 17189  t crest 17342  UnifStcuss 24157
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pr 5374  ax-un 7675
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7356  df-oprab 7357  df-mpo 7358  df-1st 7931  df-2nd 7932  df-rest 17344  df-uss 24160
This theorem is referenced by:  ussid  24164  ressuss  24166
  Copyright terms: Public domain W3C validator