| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cmpfii | Structured version Visualization version GIF version | ||
| Description: In a compact topology, a system of closed sets with nonempty finite intersections has a nonempty intersection. (Contributed by Stefan O'Rear, 22-Feb-2015.) |
| Ref | Expression |
|---|---|
| cmpfii | ⊢ ((𝐽 ∈ Comp ∧ 𝑋 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑋)) → ∩ 𝑋 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvex 6865 | . . . . 5 ⊢ (Clsd‘𝐽) ∈ V | |
| 2 | 1 | elpw2 5280 | . . . 4 ⊢ (𝑋 ∈ 𝒫 (Clsd‘𝐽) ↔ 𝑋 ⊆ (Clsd‘𝐽)) |
| 3 | 2 | biimpri 230 | . . 3 ⊢ (𝑋 ⊆ (Clsd‘𝐽) → 𝑋 ∈ 𝒫 (Clsd‘𝐽)) |
| 4 | cmptop 23424 | . . . . 5 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ Top) | |
| 5 | cmpfi 23437 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝐽 ∈ Comp ↔ ∀𝑥 ∈ 𝒫 (Clsd‘𝐽)(¬ ∅ ∈ (fi‘𝑥) → ∩ 𝑥 ≠ ∅))) | |
| 6 | 4, 5 | syl 17 | . . . 4 ⊢ (𝐽 ∈ Comp → (𝐽 ∈ Comp ↔ ∀𝑥 ∈ 𝒫 (Clsd‘𝐽)(¬ ∅ ∈ (fi‘𝑥) → ∩ 𝑥 ≠ ∅))) |
| 7 | 6 | ibi 269 | . . 3 ⊢ (𝐽 ∈ Comp → ∀𝑥 ∈ 𝒫 (Clsd‘𝐽)(¬ ∅ ∈ (fi‘𝑥) → ∩ 𝑥 ≠ ∅)) |
| 8 | fveq2 6852 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (fi‘𝑥) = (fi‘𝑋)) | |
| 9 | 8 | eleq2d 2838 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (∅ ∈ (fi‘𝑥) ↔ ∅ ∈ (fi‘𝑋))) |
| 10 | 9 | notbid 320 | . . . . 5 ⊢ (𝑥 = 𝑋 → (¬ ∅ ∈ (fi‘𝑥) ↔ ¬ ∅ ∈ (fi‘𝑋))) |
| 11 | inteq 4898 | . . . . . 6 ⊢ (𝑥 = 𝑋 → ∩ 𝑥 = ∩ 𝑋) | |
| 12 | 11 | neeq1d 3006 | . . . . 5 ⊢ (𝑥 = 𝑋 → (∩ 𝑥 ≠ ∅ ↔ ∩ 𝑋 ≠ ∅)) |
| 13 | 10, 12 | imbi12d 346 | . . . 4 ⊢ (𝑥 = 𝑋 → ((¬ ∅ ∈ (fi‘𝑥) → ∩ 𝑥 ≠ ∅) ↔ (¬ ∅ ∈ (fi‘𝑋) → ∩ 𝑋 ≠ ∅))) |
| 14 | 13 | rspcva 3570 | . . 3 ⊢ ((𝑋 ∈ 𝒫 (Clsd‘𝐽) ∧ ∀𝑥 ∈ 𝒫 (Clsd‘𝐽)(¬ ∅ ∈ (fi‘𝑥) → ∩ 𝑥 ≠ ∅)) → (¬ ∅ ∈ (fi‘𝑋) → ∩ 𝑋 ≠ ∅)) |
| 15 | 3, 7, 14 | syl2anr 605 | . 2 ⊢ ((𝐽 ∈ Comp ∧ 𝑋 ⊆ (Clsd‘𝐽)) → (¬ ∅ ∈ (fi‘𝑋) → ∩ 𝑋 ≠ ∅)) |
| 16 | 15 | 3impia 1126 | 1 ⊢ ((𝐽 ∈ Comp ∧ 𝑋 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑋)) → ∩ 𝑋 ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ w3a 1095 = wceq 1550 ∈ wcel 2132 ≠ wne 2947 ∀wral 3066 ⊆ wss 3895 ∅c0 4276 𝒫 cpw 4545 ∩ cint 4895 ‘cfv 6506 ficfi 9342 Topctop 22922 Clsdccld 23045 Compccmp 23415 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-ral 3067 df-rex 3077 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-int 4896 df-iun 4941 df-iin 4942 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-om 7832 df-1o 8421 df-en 8913 df-dom 8914 df-fin 8916 df-fi 9343 df-top 22923 df-cld 23048 df-cmp 23416 |
| This theorem is referenced by: fclscmpi 24058 cmpfiiin 43216 |
| Copyright terms: Public domain | W3C validator |