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

Theorem ussval 24242
Description: The uniform structure on uniform space 𝑊. This proof uses a trick with fvprc 6819 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 5646 . . . 4 (𝐵 × 𝐵) = ((Base‘𝑊) × (Base‘𝑊))
41, 3oveq12i 7368 . . 3 (𝑈t (𝐵 × 𝐵)) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))
5 fveq2 6827 . . . . 5 (𝑤 = 𝑊 → (UnifSet‘𝑤) = (UnifSet‘𝑊))
6 fveq2 6827 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
76sqxpeqd 5650 . . . . 5 (𝑤 = 𝑊 → ((Base‘𝑤) × (Base‘𝑤)) = ((Base‘𝑊) × (Base‘𝑊)))
85, 7oveq12d 7374 . . . 4 (𝑤 = 𝑊 → ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
9 df-uss 24239 . . . 4 UnifSt = (𝑤 ∈ V ↦ ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))))
10 ovex 7389 . . . 4 ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ∈ V
118, 9, 10fvmpt 6935 . . 3 (𝑊 ∈ V → (UnifSt‘𝑊) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
124, 11eqtr4id 2793 . 2 (𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
13 0rest 17383 . . 3 (∅ ↾t (𝐵 × 𝐵)) = ∅
14 fvprc 6819 . . . . 5 𝑊 ∈ V → (UnifSet‘𝑊) = ∅)
151, 14eqtrid 2786 . . . 4 𝑊 ∈ V → 𝑈 = ∅)
1615oveq1d 7371 . . 3 𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (∅ ↾t (𝐵 × 𝐵)))
17 fvprc 6819 . . 3 𝑊 ∈ V → (UnifSt‘𝑊) = ∅)
1813, 16, 173eqtr4a 2800 . 2 𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
1912, 18pm2.61i 183 1 (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1547  wcel 2119  Vcvv 3431  c0 4261   × cxp 5616  cfv 6485  (class class class)co 7356  Basecbs 17170  UnifSetcunif 17221  t crest 17374  UnifStcuss 24236
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-rest 17376  df-uss 24239
This theorem is referenced by:  ussid  24243  ressuss  24245
  Copyright terms: Public domain W3C validator