![]() |
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 6899 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 5717 | . . . 4 ⊢ (𝐵 × 𝐵) = ((Base‘𝑊) × (Base‘𝑊)) |
4 | 1, 3 | oveq12i 7443 | . . 3 ⊢ (𝑈 ↾t (𝐵 × 𝐵)) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) |
5 | fveq2 6907 | . . . . 5 ⊢ (𝑤 = 𝑊 → (UnifSet‘𝑤) = (UnifSet‘𝑊)) | |
6 | fveq2 6907 | . . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊)) | |
7 | 6 | sqxpeqd 5721 | . . . . 5 ⊢ (𝑤 = 𝑊 → ((Base‘𝑤) × (Base‘𝑤)) = ((Base‘𝑊) × (Base‘𝑊))) |
8 | 5, 7 | oveq12d 7449 | . . . 4 ⊢ (𝑤 = 𝑊 → ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))) |
9 | df-uss 24281 | . . . 4 ⊢ UnifSt = (𝑤 ∈ V ↦ ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤)))) | |
10 | ovex 7464 | . . . 4 ⊢ ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ∈ V | |
11 | 8, 9, 10 | fvmpt 7016 | . . 3 ⊢ (𝑊 ∈ V → (UnifSt‘𝑊) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))) |
12 | 4, 11 | eqtr4id 2794 | . 2 ⊢ (𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊)) |
13 | 0rest 17476 | . . 3 ⊢ (∅ ↾t (𝐵 × 𝐵)) = ∅ | |
14 | fvprc 6899 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → (UnifSet‘𝑊) = ∅) | |
15 | 1, 14 | eqtrid 2787 | . . . 4 ⊢ (¬ 𝑊 ∈ V → 𝑈 = ∅) |
16 | 15 | oveq1d 7446 | . . 3 ⊢ (¬ 𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (∅ ↾t (𝐵 × 𝐵))) |
17 | fvprc 6899 | . . 3 ⊢ (¬ 𝑊 ∈ V → (UnifSt‘𝑊) = ∅) | |
18 | 13, 16, 17 | 3eqtr4a 2801 | . 2 ⊢ (¬ 𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊)) |
19 | 12, 18 | pm2.61i 182 | 1 ⊢ (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1537 ∈ wcel 2106 Vcvv 3478 ∅c0 4339 × cxp 5687 ‘cfv 6563 (class class class)co 7431 Basecbs 17245 UnifSetcunif 17308 ↾t crest 17467 UnifStcuss 24278 |
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 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pr 5438 ax-un 7754 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-ov 7434 df-oprab 7435 df-mpo 7436 df-1st 8013 df-2nd 8014 df-rest 17469 df-uss 24281 |
This theorem is referenced by: ussid 24285 ressuss 24287 |
Copyright terms: Public domain | W3C validator |