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

Theorem ussval 24416
Description: The uniform structure on uniform space 𝑊. This proof uses a trick with fvprc 6873 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 5689 . . . 4 (𝐵 × 𝐵) = ((Base‘𝑊) × (Base‘𝑊))
41, 3oveq12i 7422 . . 3 (𝑈t (𝐵 × 𝐵)) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))
5 fveq2 6881 . . . . 5 (𝑤 = 𝑊 → (UnifSet‘𝑤) = (UnifSet‘𝑊))
6 fveq2 6881 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
76sqxpeqd 5693 . . . . 5 (𝑤 = 𝑊 → ((Base‘𝑤) × (Base‘𝑤)) = ((Base‘𝑊) × (Base‘𝑊)))
85, 7oveq12d 7428 . . . 4 (𝑤 = 𝑊 → ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
9 df-uss 24413 . . . 4 UnifSt = (𝑤 ∈ V ↦ ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))))
10 ovex 7443 . . . 4 ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ∈ V
118, 9, 10fvmpt 6989 . . 3 (𝑊 ∈ V → (UnifSt‘𝑊) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
124, 11eqtr4id 2817 . 2 (𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
13 0rest 17477 . . 3 (∅ ↾t (𝐵 × 𝐵)) = ∅
14 fvprc 6873 . . . . 5 𝑊 ∈ V → (UnifSet‘𝑊) = ∅)
151, 14eqtrid 2810 . . . 4 𝑊 ∈ V → 𝑈 = ∅)
1615oveq1d 7425 . . 3 𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (∅ ↾t (𝐵 × 𝐵)))
17 fvprc 6873 . . 3 𝑊 ∈ V → (UnifSt‘𝑊) = ∅)
1813, 16, 173eqtr4a 2824 . 2 𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
1912, 18pm2.61i 184 1 (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1570  wcel 2143  Vcvv 3455  c0 4286   × cxp 5659  cfv 6536  (class class class)co 7410  Basecbs 17264  UnifSetcunif 17315  t crest 17468  UnifStcuss 24410
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-rest 17470  df-uss 24413
This theorem is referenced by:  ussid  24417  ressuss  24419
  Copyright terms: Public domain W3C validator