| 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 6826 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 5652 | . . . 4 ⊢ (𝐵 × 𝐵) = ((Base‘𝑊) × (Base‘𝑊)) |
| 4 | 1, 3 | oveq12i 7370 | . . 3 ⊢ (𝑈 ↾t (𝐵 × 𝐵)) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) |
| 5 | fveq2 6834 | . . . . 5 ⊢ (𝑤 = 𝑊 → (UnifSet‘𝑤) = (UnifSet‘𝑊)) | |
| 6 | fveq2 6834 | . . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊)) | |
| 7 | 6 | sqxpeqd 5656 | . . . . 5 ⊢ (𝑤 = 𝑊 → ((Base‘𝑤) × (Base‘𝑤)) = ((Base‘𝑊) × (Base‘𝑊))) |
| 8 | 5, 7 | oveq12d 7376 | . . . 4 ⊢ (𝑤 = 𝑊 → ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))) |
| 9 | df-uss 24200 | . . . 4 ⊢ UnifSt = (𝑤 ∈ V ↦ ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤)))) | |
| 10 | ovex 7391 | . . . 4 ⊢ ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ∈ V | |
| 11 | 8, 9, 10 | fvmpt 6941 | . . 3 ⊢ (𝑊 ∈ V → (UnifSt‘𝑊) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))) |
| 12 | 4, 11 | eqtr4id 2790 | . 2 ⊢ (𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊)) |
| 13 | 0rest 17349 | . . 3 ⊢ (∅ ↾t (𝐵 × 𝐵)) = ∅ | |
| 14 | fvprc 6826 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → (UnifSet‘𝑊) = ∅) | |
| 15 | 1, 14 | eqtrid 2783 | . . . 4 ⊢ (¬ 𝑊 ∈ V → 𝑈 = ∅) |
| 16 | 15 | oveq1d 7373 | . . 3 ⊢ (¬ 𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (∅ ↾t (𝐵 × 𝐵))) |
| 17 | fvprc 6826 | . . 3 ⊢ (¬ 𝑊 ∈ V → (UnifSt‘𝑊) = ∅) | |
| 18 | 13, 16, 17 | 3eqtr4a 2797 | . 2 ⊢ (¬ 𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊)) |
| 19 | 12, 18 | pm2.61i 182 | 1 ⊢ (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 = wceq 1541 ∈ wcel 2113 Vcvv 3440 ∅c0 4285 × cxp 5622 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 UnifSetcunif 17187 ↾t crest 17340 UnifStcuss 24197 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 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 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-rest 17342 df-uss 24200 |
| This theorem is referenced by: ussid 24204 ressuss 24206 |
| Copyright terms: Public domain | W3C validator |