Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > topnpropgd | GIF version |
Description: The topology extractor function depends only on the base and topology components. (Contributed by NM, 18-Jul-2006.) (Revised by Jim Kingdon, 13-Feb-2023.) |
Ref | Expression |
---|---|
topnpropd.1 | ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿)) |
topnpropd.2 | ⊢ (𝜑 → (TopSet‘𝐾) = (TopSet‘𝐿)) |
topnpropgd.k | ⊢ (𝜑 → 𝐾 ∈ 𝑉) |
topnpropgd.l | ⊢ (𝜑 → 𝐿 ∈ 𝑊) |
Ref | Expression |
---|---|
topnpropgd | ⊢ (𝜑 → (TopOpen‘𝐾) = (TopOpen‘𝐿)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | topnpropd.2 | . . 3 ⊢ (𝜑 → (TopSet‘𝐾) = (TopSet‘𝐿)) | |
2 | topnpropd.1 | . . 3 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿)) | |
3 | 1, 2 | oveq12d 5792 | . 2 ⊢ (𝜑 → ((TopSet‘𝐾) ↾t (Base‘𝐾)) = ((TopSet‘𝐿) ↾t (Base‘𝐿))) |
4 | topnpropgd.k | . . 3 ⊢ (𝜑 → 𝐾 ∈ 𝑉) | |
5 | eqid 2139 | . . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
6 | eqid 2139 | . . . 4 ⊢ (TopSet‘𝐾) = (TopSet‘𝐾) | |
7 | 5, 6 | topnvalg 12132 | . . 3 ⊢ (𝐾 ∈ 𝑉 → ((TopSet‘𝐾) ↾t (Base‘𝐾)) = (TopOpen‘𝐾)) |
8 | 4, 7 | syl 14 | . 2 ⊢ (𝜑 → ((TopSet‘𝐾) ↾t (Base‘𝐾)) = (TopOpen‘𝐾)) |
9 | topnpropgd.l | . . 3 ⊢ (𝜑 → 𝐿 ∈ 𝑊) | |
10 | eqid 2139 | . . . 4 ⊢ (Base‘𝐿) = (Base‘𝐿) | |
11 | eqid 2139 | . . . 4 ⊢ (TopSet‘𝐿) = (TopSet‘𝐿) | |
12 | 10, 11 | topnvalg 12132 | . . 3 ⊢ (𝐿 ∈ 𝑊 → ((TopSet‘𝐿) ↾t (Base‘𝐿)) = (TopOpen‘𝐿)) |
13 | 9, 12 | syl 14 | . 2 ⊢ (𝜑 → ((TopSet‘𝐿) ↾t (Base‘𝐿)) = (TopOpen‘𝐿)) |
14 | 3, 8, 13 | 3eqtr3d 2180 | 1 ⊢ (𝜑 → (TopOpen‘𝐾) = (TopOpen‘𝐿)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1331 ∈ wcel 1480 ‘cfv 5123 (class class class)co 5774 Basecbs 11959 TopSetcts 12027 ↾t crest 12120 TopOpenctopn 12121 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-coll 4043 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-cnex 7711 ax-resscn 7712 ax-1re 7714 ax-addrcl 7717 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-inn 8721 df-2 8779 df-3 8780 df-4 8781 df-5 8782 df-6 8783 df-7 8784 df-8 8785 df-9 8786 df-ndx 11962 df-slot 11963 df-base 11965 df-tset 12040 df-rest 12122 df-topn 12123 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |