| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ussval | Structured version Visualization version GIF version | ||
| Description: The uniform structure on uniform space 𝑊. This proof uses a trick with fvprc 6850 to avoid requiring 𝑊 to be a set. (Contributed by Thierry Arnoux, 3-Dec-2017.) |
| Ref | Expression |
|---|---|
| ussval.1 | ⊢ 𝐵 = (Base‘𝑊) |
| ussval.2 | ⊢ 𝑈 = (UnifSet‘𝑊) |
| Ref | Expression |
|---|---|
| ussval | ⊢ (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ussval.2 | . . . 4 ⊢ 𝑈 = (UnifSet‘𝑊) | |
| 2 | ussval.1 | . . . . 5 ⊢ 𝐵 = (Base‘𝑊) | |
| 3 | 2, 2 | xpeq12i 5666 | . . . 4 ⊢ (𝐵 × 𝐵) = ((Base‘𝑊) × (Base‘𝑊)) |
| 4 | 1, 3 | oveq12i 7399 | . . 3 ⊢ (𝑈 ↾t (𝐵 × 𝐵)) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) |
| 5 | fveq2 6858 | . . . . 5 ⊢ (𝑤 = 𝑊 → (UnifSet‘𝑤) = (UnifSet‘𝑊)) | |
| 6 | fveq2 6858 | . . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊)) | |
| 7 | 6 | sqxpeqd 5670 | . . . . 5 ⊢ (𝑤 = 𝑊 → ((Base‘𝑤) × (Base‘𝑤)) = ((Base‘𝑊) × (Base‘𝑊))) |
| 8 | 5, 7 | oveq12d 7405 | . . . 4 ⊢ (𝑤 = 𝑊 → ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))) |
| 9 | df-uss 24144 | . . . 4 ⊢ UnifSt = (𝑤 ∈ V ↦ ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤)))) | |
| 10 | ovex 7420 | . . . 4 ⊢ ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ∈ V | |
| 11 | 8, 9, 10 | fvmpt 6968 | . . 3 ⊢ (𝑊 ∈ V → (UnifSt‘𝑊) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))) |
| 12 | 4, 11 | eqtr4id 2783 | . 2 ⊢ (𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊)) |
| 13 | 0rest 17392 | . . 3 ⊢ (∅ ↾t (𝐵 × 𝐵)) = ∅ | |
| 14 | fvprc 6850 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → (UnifSet‘𝑊) = ∅) | |
| 15 | 1, 14 | eqtrid 2776 | . . . 4 ⊢ (¬ 𝑊 ∈ V → 𝑈 = ∅) |
| 16 | 15 | oveq1d 7402 | . . 3 ⊢ (¬ 𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (∅ ↾t (𝐵 × 𝐵))) |
| 17 | fvprc 6850 | . . 3 ⊢ (¬ 𝑊 ∈ V → (UnifSt‘𝑊) = ∅) | |
| 18 | 13, 16, 17 | 3eqtr4a 2790 | . 2 ⊢ (¬ 𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊)) |
| 19 | 12, 18 | pm2.61i 182 | 1 ⊢ (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 = wceq 1540 ∈ wcel 2109 Vcvv 3447 ∅c0 4296 × cxp 5636 ‘cfv 6511 (class class class)co 7387 Basecbs 17179 UnifSetcunif 17230 ↾t crest 17383 UnifStcuss 24141 |
| 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 5234 ax-sep 5251 ax-nul 5261 ax-pr 5387 ax-un 7711 |
| 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 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-ov 7390 df-oprab 7391 df-mpo 7392 df-1st 7968 df-2nd 7969 df-rest 17385 df-uss 24144 |
| This theorem is referenced by: ussid 24148 ressuss 24150 |
| Copyright terms: Public domain | W3C validator |