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

Theorem ussval 22862
Description: The uniform structure on uniform space 𝑊. This proof uses a trick with fvprc 6658 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 fveq2 6665 . . . . 5 (𝑤 = 𝑊 → (UnifSet‘𝑤) = (UnifSet‘𝑊))
2 fveq2 6665 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
32sqxpeqd 5582 . . . . 5 (𝑤 = 𝑊 → ((Base‘𝑤) × (Base‘𝑤)) = ((Base‘𝑊) × (Base‘𝑊)))
41, 3oveq12d 7168 . . . 4 (𝑤 = 𝑊 → ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
5 df-uss 22859 . . . 4 UnifSt = (𝑤 ∈ V ↦ ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))))
6 ovex 7183 . . . 4 ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ∈ V
74, 5, 6fvmpt 6763 . . 3 (𝑊 ∈ V → (UnifSt‘𝑊) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
8 ussval.2 . . . 4 𝑈 = (UnifSet‘𝑊)
9 ussval.1 . . . . 5 𝐵 = (Base‘𝑊)
109, 9xpeq12i 5578 . . . 4 (𝐵 × 𝐵) = ((Base‘𝑊) × (Base‘𝑊))
118, 10oveq12i 7162 . . 3 (𝑈t (𝐵 × 𝐵)) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))
127, 11syl6reqr 2875 . 2 (𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
13 0rest 16697 . . 3 (∅ ↾t (𝐵 × 𝐵)) = ∅
14 fvprc 6658 . . . . 5 𝑊 ∈ V → (UnifSet‘𝑊) = ∅)
158, 14syl5eq 2868 . . . 4 𝑊 ∈ V → 𝑈 = ∅)
1615oveq1d 7165 . . 3 𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (∅ ↾t (𝐵 × 𝐵)))
17 fvprc 6658 . . 3 𝑊 ∈ V → (UnifSt‘𝑊) = ∅)
1813, 16, 173eqtr4a 2882 . 2 𝑊 ∈ V → (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
1912, 18pm2.61i 184 1 (𝑈t (𝐵 × 𝐵)) = (UnifSt‘𝑊)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1533  wcel 2110  Vcvv 3495  c0 4291   × cxp 5548  cfv 6350  (class class class)co 7150  Basecbs 16477  UnifSetcunif 16569  t crest 16688  UnifStcuss 22856
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-rep 5183  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5455  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-f1 6355  df-fo 6356  df-f1o 6357  df-fv 6358  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7683  df-2nd 7684  df-rest 16690  df-uss 22859
This theorem is referenced by:  ussid  22863  ressuss  22866
  Copyright terms: Public domain W3C validator