| Mathbox for Zhi Wang |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > toplatglb | Structured version Visualization version GIF version | ||
| Description: Greatest lower bounds in a topology are realized by the interior of the intersection. (Contributed by Zhi Wang, 30-Sep-2024.) |
| Ref | Expression |
|---|---|
| topclat.i | ⊢ 𝐼 = (toInc‘𝐽) |
| toplatlub.j | ⊢ (𝜑 → 𝐽 ∈ Top) |
| toplatlub.s | ⊢ (𝜑 → 𝑆 ⊆ 𝐽) |
| toplatglb.g | ⊢ 𝐺 = (glb‘𝐼) |
| toplatglb.e | ⊢ (𝜑 → 𝑆 ≠ ∅) |
| Ref | Expression |
|---|---|
| toplatglb | ⊢ (𝜑 → (𝐺‘𝑆) = ((int‘𝐽)‘∩ 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | topclat.i | . 2 ⊢ 𝐼 = (toInc‘𝐽) | |
| 2 | toplatlub.j | . 2 ⊢ (𝜑 → 𝐽 ∈ Top) | |
| 3 | toplatlub.s | . 2 ⊢ (𝜑 → 𝑆 ⊆ 𝐽) | |
| 4 | toplatglb.g | . . 3 ⊢ 𝐺 = (glb‘𝐼) | |
| 5 | 4 | a1i 11 | . 2 ⊢ (𝜑 → 𝐺 = (glb‘𝐼)) |
| 6 | toplatglb.e | . . . . . 6 ⊢ (𝜑 → 𝑆 ≠ ∅) | |
| 7 | intssuni 4933 | . . . . . 6 ⊢ (𝑆 ≠ ∅ → ∩ 𝑆 ⊆ ∪ 𝑆) | |
| 8 | 6, 7 | syl 18 | . . . . 5 ⊢ (𝜑 → ∩ 𝑆 ⊆ ∪ 𝑆) |
| 9 | 3 | unissd 4880 | . . . . 5 ⊢ (𝜑 → ∪ 𝑆 ⊆ ∪ 𝐽) |
| 10 | 8, 9 | sstrd 3923 | . . . 4 ⊢ (𝜑 → ∩ 𝑆 ⊆ ∪ 𝐽) |
| 11 | eqid 2763 | . . . . 5 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 12 | 11 | ntrval 23381 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ ∩ 𝑆 ⊆ ∪ 𝐽) → ((int‘𝐽)‘∩ 𝑆) = ∪ (𝐽 ∩ 𝒫 ∩ 𝑆)) |
| 13 | 2, 10, 12 | syl2anc 596 | . . 3 ⊢ (𝜑 → ((int‘𝐽)‘∩ 𝑆) = ∪ (𝐽 ∩ 𝒫 ∩ 𝑆)) |
| 14 | 2 | uniexd 7780 | . . . . 5 ⊢ (𝜑 → ∪ 𝐽 ∈ V) |
| 15 | 14, 10 | ssexd 5290 | . . . 4 ⊢ (𝜑 → ∩ 𝑆 ∈ V) |
| 16 | inpw 50139 | . . . . 5 ⊢ (∩ 𝑆 ∈ V → (𝐽 ∩ 𝒫 ∩ 𝑆) = {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ ∩ 𝑆}) | |
| 17 | 16 | unieqd 4883 | . . . 4 ⊢ (∩ 𝑆 ∈ V → ∪ (𝐽 ∩ 𝒫 ∩ 𝑆) = ∪ {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ ∩ 𝑆}) |
| 18 | 15, 17 | syl 18 | . . 3 ⊢ (𝜑 → ∪ (𝐽 ∩ 𝒫 ∩ 𝑆) = ∪ {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ ∩ 𝑆}) |
| 19 | 13, 18 | eqtrd 2798 | . 2 ⊢ (𝜑 → ((int‘𝐽)‘∩ 𝑆) = ∪ {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ ∩ 𝑆}) |
| 20 | 11 | ntropn 23394 | . . 3 ⊢ ((𝐽 ∈ Top ∧ ∩ 𝑆 ⊆ ∪ 𝐽) → ((int‘𝐽)‘∩ 𝑆) ∈ 𝐽) |
| 21 | 2, 10, 20 | syl2anc 596 | . 2 ⊢ (𝜑 → ((int‘𝐽)‘∩ 𝑆) ∈ 𝐽) |
| 22 | 1, 2, 3, 5, 19, 21 | ipoglb 50308 | 1 ⊢ (𝜑 → (𝐺‘𝑆) = ((int‘𝐽)‘∩ 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 {crab 3416 Vcvv 3454 ⊆ wss 3900 ∩ cin 4092 ∅c0 4281 𝒫 cpw 4560 ∪ cuni 4870 ∩ cint 4910 ‘cfv 6555 glbcglb 18510 toInccipo 18727 Topctop 23238 intcnt 23362 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-1st 8022 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-1o 8501 df-er 8742 df-en 8999 df-dom 9000 df-sdom 9001 df-fin 9002 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-nn 12360 df-2 12429 df-3 12430 df-4 12431 df-5 12432 df-6 12433 df-7 12434 df-8 12435 df-9 12436 df-n0 12631 df-z 12718 df-dec 12839 df-uz 12990 df-fz 13664 df-struct 17351 df-sets 17368 df-slot 17386 df-ndx 17398 df-base 17414 df-tset 17473 df-ple 17474 df-ocomp 17475 df-odu 18487 df-proset 18494 df-poset 18513 df-lub 18544 df-glb 18545 df-ipo 18728 df-top 23239 df-ntr 23365 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |