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

Theorem ussval 24234
Description: The uniform structure on uniform space 𝑊. This proof uses a trick with fvprc 6826 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 5652 . . . 4 (𝐵 × 𝐵) = ((Base‘𝑊) × (Base‘𝑊))
41, 3oveq12i 7372 . . 3 (𝑈t (𝐵 × 𝐵)) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))
5 fveq2 6834 . . . . 5 (𝑤 = 𝑊 → (UnifSet‘𝑤) = (UnifSet‘𝑊))
6 fveq2 6834 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
76sqxpeqd 5656 . . . . 5 (𝑤 = 𝑊 → ((Base‘𝑤) × (Base‘𝑤)) = ((Base‘𝑊) × (Base‘𝑊)))
85, 7oveq12d 7378 . . . 4 (𝑤 = 𝑊 → ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
9 df-uss 24231 . . . 4 UnifSt = (𝑤 ∈ V ↦ ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))))
10 ovex 7393 . . . 4 ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ∈ V
118, 9, 10fvmpt 6941 . . 3 (𝑊 ∈ V → (UnifSt‘𝑊) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
124, 11eqtr4id 2791 . 2 (𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
13 0rest 17383 . . 3 (∅ ↾t (𝐵 × 𝐵)) = ∅
14 fvprc 6826 . . . . 5 𝑊 ∈ V → (UnifSet‘𝑊) = ∅)
151, 14eqtrid 2784 . . . 4 𝑊 ∈ V → 𝑈 = ∅)
1615oveq1d 7375 . . 3 𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (∅ ↾t (𝐵 × 𝐵)))
17 fvprc 6826 . . 3 𝑊 ∈ V → (UnifSt‘𝑊) = ∅)
1813, 16, 173eqtr4a 2798 . 2 𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
1912, 18pm2.61i 182 1 (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1542  wcel 2114  Vcvv 3430  c0 4274   × cxp 5622  cfv 6492  (class class class)co 7360  Basecbs 17170  UnifSetcunif 17221  t crest 17374  UnifStcuss 24228
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pr 5370  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-rest 17376  df-uss 24231
This theorem is referenced by:  ussid  24235  ressuss  24237
  Copyright terms: Public domain W3C validator