| 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 13187 | . . . 4 ⊢ (TopSet = Slot (TopSet‘ndx) ∧ (TopSet‘ndx) ∈ ℕ) | |
| 4 | 3 | setsslid 13049 | . . 3 ⊢ ((𝑀 ∈ 𝑉 ∧ (MetOpen‘𝐷) ∈ 𝑊) → (MetOpen‘𝐷) = (TopSet‘(𝑀 sSet 〈(TopSet‘ndx), (MetOpen‘𝐷)〉))) |
| 5 | 1, 2, 4 | syl2anc 411 | . 2 ⊢ (𝜑 → (MetOpen‘𝐷) = (TopSet‘(𝑀 sSet 〈(TopSet‘ndx), (MetOpen‘𝐷)〉))) |
| 6 | setsms.k | . . 3 ⊢ (𝜑 → 𝐾 = (𝑀 sSet 〈(TopSet‘ndx), (MetOpen‘𝐷)〉)) | |
| 7 | 6 | fveq2d 5607 | . 2 ⊢ (𝜑 → (TopSet‘𝐾) = (TopSet‘(𝑀 sSet 〈(TopSet‘ndx), (MetOpen‘𝐷)〉))) |
| 8 | 5, 7 | eqtr4d 2245 | 1 ⊢ (𝜑 → (MetOpen‘𝐷) = (TopSet‘𝐾)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1375 ∈ wcel 2180 〈cop 3649 × cxp 4694 ↾ cres 4698 ‘cfv 5294 (class class class)co 5974 ndxcnx 12995 sSet csts 12996 Basecbs 12998 TopSetcts 13082 distcds 13085 MetOpencmopn 14470 |
| 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 617 ax-in2 618 ax-io 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-13 2182 ax-14 2183 ax-ext 2191 ax-sep 4181 ax-pow 4237 ax-pr 4272 ax-un 4501 ax-setind 4606 ax-cnex 8058 ax-resscn 8059 ax-1re 8061 ax-addrcl 8064 |
| This theorem depends on definitions: df-bi 117 df-3an 985 df-tru 1378 df-fal 1381 df-nf 1487 df-sb 1789 df-eu 2060 df-mo 2061 df-clab 2196 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ne 2381 df-ral 2493 df-rex 2494 df-rab 2497 df-v 2781 df-sbc 3009 df-dif 3179 df-un 3181 df-in 3183 df-ss 3190 df-nul 3472 df-pw 3631 df-sn 3652 df-pr 3653 df-op 3655 df-uni 3868 df-int 3903 df-br 4063 df-opab 4125 df-mpt 4126 df-id 4361 df-xp 4702 df-rel 4703 df-cnv 4704 df-co 4705 df-dm 4706 df-rn 4707 df-res 4708 df-iota 5254 df-fun 5296 df-fv 5302 df-ov 5977 df-oprab 5978 df-mpo 5979 df-inn 9079 df-2 9137 df-3 9138 df-4 9139 df-5 9140 df-6 9141 df-7 9142 df-8 9143 df-9 9144 df-ndx 13001 df-slot 13002 df-sets 13005 df-tset 13095 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |