| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > setsmstsetg | GIF version | ||
| Description: The topology of a constructed metric space. (Contributed by Mario Carneiro, 28-Aug-2015.) (Revised by Jim Kingdon, 7-May-2023.) |
| Ref | Expression |
|---|---|
| setsms.x | ⊢ (𝜑 → 𝑋 = (Base‘𝑀)) |
| setsms.d | ⊢ (𝜑 → 𝐷 = ((dist‘𝑀) ↾ (𝑋 × 𝑋))) |
| setsms.k | ⊢ (𝜑 → 𝐾 = (𝑀 sSet 〈(TopSet‘ndx), (MetOpen‘𝐷)〉)) |
| setsmsbasg.m | ⊢ (𝜑 → 𝑀 ∈ 𝑉) |
| setsmsbasg.d | ⊢ (𝜑 → (MetOpen‘𝐷) ∈ 𝑊) |
| Ref | Expression |
|---|---|
| setsmstsetg | ⊢ (𝜑 → (MetOpen‘𝐷) = (TopSet‘𝐾)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | setsmsbasg.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ 𝑉) | |
| 2 | setsmsbasg.d | . . 3 ⊢ (𝜑 → (MetOpen‘𝐷) ∈ 𝑊) | |
| 3 | tsetslid 13525 | . . . 4 ⊢ (TopSet = Slot (TopSet‘ndx) ∧ (TopSet‘ndx) ∈ ℕ) | |
| 4 | 3 | setsslid 13386 | . . 3 ⊢ ((𝑀 ∈ 𝑉 ∧ (MetOpen‘𝐷) ∈ 𝑊) → (MetOpen‘𝐷) = (TopSet‘(𝑀 sSet 〈(TopSet‘ndx), (MetOpen‘𝐷)〉))) |
| 5 | 1, 2, 4 | syl2anc 415 | . 2 ⊢ (𝜑 → (MetOpen‘𝐷) = (TopSet‘(𝑀 sSet 〈(TopSet‘ndx), (MetOpen‘𝐷)〉))) |
| 6 | setsms.k | . . 3 ⊢ (𝜑 → 𝐾 = (𝑀 sSet 〈(TopSet‘ndx), (MetOpen‘𝐷)〉)) | |
| 7 | 6 | fveq2d 5697 | . 2 ⊢ (𝜑 → (TopSet‘𝐾) = (TopSet‘(𝑀 sSet 〈(TopSet‘ndx), (MetOpen‘𝐷)〉))) |
| 8 | 5, 7 | eqtr4d 2274 | 1 ⊢ (𝜑 → (MetOpen‘𝐷) = (TopSet‘𝐾)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1402 ∈ wcel 2209 〈cop 3711 × cxp 4770 ↾ cres 4774 ‘cfv 5375 (class class class)co 6079 ndxcnx 13332 sSet csts 13333 Basecbs 13335 TopSetcts 13420 distcds 13423 MetOpencmopn 14861 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1re 8267 ax-addrcl 8270 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-iota 5335 df-fun 5377 df-fv 5383 df-ov 6082 df-oprab 6083 df-mpo 6084 df-inn 9288 df-2 9346 df-3 9347 df-4 9348 df-5 9349 df-6 9350 df-7 9351 df-8 9352 df-9 9353 df-ndx 13338 df-slot 13339 df-sets 13342 df-tset 13433 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |