| 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 24197 | . 2 ⊢ toUnifSp = (𝑢 ∈ ∪ ran UnifOn ↦ ({〈(Base‘ndx), dom ∪ 𝑢〉, 〈(UnifSet‘ndx), 𝑢〉} sSet 〈(TopSet‘ndx), (unifTop‘𝑢)〉)) | |
| 2 | simpr 484 | . . . . . . 7 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → 𝑢 = 𝑈) | |
| 3 | 2 | unieqd 4896 | . . . . . 6 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → ∪ 𝑢 = ∪ 𝑈) |
| 4 | 3 | dmeqd 5885 | . . . . 5 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → dom ∪ 𝑢 = dom ∪ 𝑈) |
| 5 | 4 | opeq2d 4856 | . . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → 〈(Base‘ndx), dom ∪ 𝑢〉 = 〈(Base‘ndx), dom ∪ 𝑈〉) |
| 6 | 2 | opeq2d 4856 | . . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → 〈(UnifSet‘ndx), 𝑢〉 = 〈(UnifSet‘ndx), 𝑈〉) |
| 7 | 5, 6 | preq12d 4717 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → {〈(Base‘ndx), dom ∪ 𝑢〉, 〈(UnifSet‘ndx), 𝑢〉} = {〈(Base‘ndx), dom ∪ 𝑈〉, 〈(UnifSet‘ndx), 𝑈〉}) |
| 8 | 2 | fveq2d 6880 | . . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → (unifTop‘𝑢) = (unifTop‘𝑈)) |
| 9 | 8 | opeq2d 4856 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → 〈(TopSet‘ndx), (unifTop‘𝑢)〉 = 〈(TopSet‘ndx), (unifTop‘𝑈)〉) |
| 10 | 7, 9 | oveq12d 7423 | . 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢 = 𝑈) → ({〈(Base‘ndx), dom ∪ 𝑢〉, 〈(UnifSet‘ndx), 𝑢〉} sSet 〈(TopSet‘ndx), (unifTop‘𝑢)〉) = ({〈(Base‘ndx), dom ∪ 𝑈〉, 〈(UnifSet‘ndx), 𝑈〉} sSet 〈(TopSet‘ndx), (unifTop‘𝑈)〉)) |
| 11 | elfvunirn 6908 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ∈ ∪ ran UnifOn) | |
| 12 | ovexd 7440 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ({〈(Base‘ndx), dom ∪ 𝑈〉, 〈(UnifSet‘ndx), 𝑈〉} sSet 〈(TopSet‘ndx), (unifTop‘𝑈)〉) ∈ V) | |
| 13 | 1, 10, 11, 12 | fvmptd2 6994 | 1 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (toUnifSp‘𝑈) = ({〈(Base‘ndx), dom ∪ 𝑈〉, 〈(UnifSet‘ndx), 𝑈〉} sSet 〈(TopSet‘ndx), (unifTop‘𝑈)〉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 Vcvv 3459 {cpr 4603 〈cop 4607 ∪ cuni 4883 dom cdm 5654 ran crn 5655 ‘cfv 6531 (class class class)co 7405 sSet csts 17182 ndxcnx 17212 Basecbs 17228 TopSetcts 17277 UnifSetcunif 17281 UnifOncust 24138 unifTopcutop 24169 toUnifSpctus 24194 |
| 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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 |
| 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 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-ss 3943 df-nul 4309 df-if 4501 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-opab 5182 df-mpt 5202 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-iota 6484 df-fun 6533 df-fv 6539 df-ov 7408 df-tus 24197 |
| This theorem is referenced by: tuslem 24205 |
| Copyright terms: Public domain | W3C validator |