| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tusval | Structured version Visualization version GIF version | ||
| Description: The value of the uniform space mapping function. (Contributed by Thierry Arnoux, 5-Dec-2017.) |
| Ref | Expression |
|---|---|
| tusval | ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (toUnifSp‘𝑈) = ({〈(Base‘ndx), dom ∪ 𝑈〉, 〈(UnifSet‘ndx), 𝑈〉} sSet 〈(TopSet‘ndx), (unifTop‘𝑈)〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-tus 24245 | . 2 ⊢ toUnifSp = (𝑢 ∈ ∪ ran UnifOn ↦ ({〈(Base‘ndx), dom ∪ 𝑢〉, 〈(UnifSet‘ndx), 𝑢〉} sSet 〈(TopSet‘ndx), (unifTop‘𝑢)〉)) | |
| 2 | simpr 486 | . . . . . . 7 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → 𝑢 = 𝑈) | |
| 3 | 2 | unieqd 4854 | . . . . . 6 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → ∪ 𝑢 = ∪ 𝑈) |
| 4 | 3 | dmeqd 5854 | . . . . 5 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → dom ∪ 𝑢 = dom ∪ 𝑈) |
| 5 | 4 | opeq2d 4814 | . . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → 〈(Base‘ndx), dom ∪ 𝑢〉 = 〈(Base‘ndx), dom ∪ 𝑈〉) |
| 6 | 2 | opeq2d 4814 | . . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → 〈(UnifSet‘ndx), 𝑢〉 = 〈(UnifSet‘ndx), 𝑈〉) |
| 7 | 5, 6 | preq12d 4676 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → {〈(Base‘ndx), dom ∪ 𝑢〉, 〈(UnifSet‘ndx), 𝑢〉} = {〈(Base‘ndx), dom ∪ 𝑈〉, 〈(UnifSet‘ndx), 𝑈〉}) |
| 8 | 2 | fveq2d 6835 | . . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → (unifTop‘𝑢) = (unifTop‘𝑈)) |
| 9 | 8 | opeq2d 4814 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → 〈(TopSet‘ndx), (unifTop‘𝑢)〉 = 〈(TopSet‘ndx), (unifTop‘𝑈)〉) |
| 10 | 7, 9 | oveq12d 7378 | . 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → ({〈(Base‘ndx), dom ∪ 𝑢〉, 〈(UnifSet‘ndx), 𝑢〉} sSet 〈(TopSet‘ndx), (unifTop‘𝑢)〉) = ({〈(Base‘ndx), dom ∪ 𝑈〉, 〈(UnifSet‘ndx), 𝑈〉} sSet 〈(TopSet‘ndx), (unifTop‘𝑈)〉)) |
| 11 | elfvunirn 6861 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ∈ ∪ ran UnifOn) | |
| 12 | ovexd 7395 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ({〈(Base‘ndx), dom ∪ 𝑈〉, 〈(UnifSet‘ndx), 𝑈〉} sSet 〈(TopSet‘ndx), (unifTop‘𝑈)〉) ∈ V) | |
| 13 | 1, 10, 11, 12 | fvmptd2 6948 | 1 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (toUnifSp‘𝑈) = ({〈(Base‘ndx), dom ∪ 𝑈〉, 〈(UnifSet‘ndx), 𝑈〉} sSet 〈(TopSet‘ndx), (unifTop‘𝑈)〉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 397 = wceq 1548 ∈ wcel 2121 Vcvv 3433 {cpr 4560 〈cop 4564 ∪ cuni 4841 dom cdm 5621 ran crn 5622 ‘cfv 6489 (class class class)co 7360 sSet csts 17128 ndxcnx 17158 Basecbs 17174 TopSetcts 17221 UnifSetcunif 17225 UnifOncust 24187 unifTopcutop 24217 toUnifSpctus 24242 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-nul 5231 ax-pr 5365 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-br 5076 df-opab 5138 df-mpt 5157 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-iota 6445 df-fun 6491 df-fv 6497 df-ov 7363 df-tus 24245 |
| This theorem is referenced by: tuslem 24253 |
| Copyright terms: Public domain | W3C validator |