Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > cmpfiiin | 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 |
---|---|
cmpfiiin.x | ⊢ 𝑋 = ∪ 𝐽 |
cmpfiiin.j | ⊢ (𝜑 → 𝐽 ∈ Comp) |
cmpfiiin.s | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → 𝑆 ∈ (Clsd‘𝐽)) |
cmpfiiin.z | ⊢ ((𝜑 ∧ (𝑙 ⊆ 𝐼 ∧ 𝑙 ∈ Fin)) → (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆) ≠ ∅) |
Ref | Expression |
---|---|
cmpfiiin | ⊢ (𝜑 → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) ≠ ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cmpfiiin.j | . . . . 5 ⊢ (𝜑 → 𝐽 ∈ Comp) | |
2 | cmptop 21008 | . . . . 5 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ Top) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐽 ∈ Top) |
4 | cmpfiiin.x | . . . . 5 ⊢ 𝑋 = ∪ 𝐽 | |
5 | 4 | topcld 20649 | . . . 4 ⊢ (𝐽 ∈ Top → 𝑋 ∈ (Clsd‘𝐽)) |
6 | 3, 5 | syl 17 | . . 3 ⊢ (𝜑 → 𝑋 ∈ (Clsd‘𝐽)) |
7 | cmpfiiin.s | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → 𝑆 ∈ (Clsd‘𝐽)) | |
8 | 4 | cldss 20643 | . . . . 5 ⊢ (𝑆 ∈ (Clsd‘𝐽) → 𝑆 ⊆ 𝑋) |
9 | 7, 8 | syl 17 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → 𝑆 ⊆ 𝑋) |
10 | 9 | ralrimiva 2949 | . . 3 ⊢ (𝜑 → ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) |
11 | riinint 5303 | . . 3 ⊢ ((𝑋 ∈ (Clsd‘𝐽) ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) = ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) | |
12 | 6, 10, 11 | syl2anc 691 | . 2 ⊢ (𝜑 → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) = ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
13 | 6 | snssd 4281 | . . . 4 ⊢ (𝜑 → {𝑋} ⊆ (Clsd‘𝐽)) |
14 | eqid 2610 | . . . . . 6 ⊢ (𝑘 ∈ 𝐼 ↦ 𝑆) = (𝑘 ∈ 𝐼 ↦ 𝑆) | |
15 | 7, 14 | fmptd 6292 | . . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝐼 ↦ 𝑆):𝐼⟶(Clsd‘𝐽)) |
16 | frn 5966 | . . . . 5 ⊢ ((𝑘 ∈ 𝐼 ↦ 𝑆):𝐼⟶(Clsd‘𝐽) → ran (𝑘 ∈ 𝐼 ↦ 𝑆) ⊆ (Clsd‘𝐽)) | |
17 | 15, 16 | syl 17 | . . . 4 ⊢ (𝜑 → ran (𝑘 ∈ 𝐼 ↦ 𝑆) ⊆ (Clsd‘𝐽)) |
18 | 13, 17 | unssd 3751 | . . 3 ⊢ (𝜑 → ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) ⊆ (Clsd‘𝐽)) |
19 | elin 3758 | . . . . . . 7 ⊢ (𝑙 ∈ (𝒫 𝐼 ∩ Fin) ↔ (𝑙 ∈ 𝒫 𝐼 ∧ 𝑙 ∈ Fin)) | |
20 | elpwi 4117 | . . . . . . . 8 ⊢ (𝑙 ∈ 𝒫 𝐼 → 𝑙 ⊆ 𝐼) | |
21 | 20 | anim1i 590 | . . . . . . 7 ⊢ ((𝑙 ∈ 𝒫 𝐼 ∧ 𝑙 ∈ Fin) → (𝑙 ⊆ 𝐼 ∧ 𝑙 ∈ Fin)) |
22 | 19, 21 | sylbi 206 | . . . . . 6 ⊢ (𝑙 ∈ (𝒫 𝐼 ∩ Fin) → (𝑙 ⊆ 𝐼 ∧ 𝑙 ∈ Fin)) |
23 | cmpfiiin.z | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑙 ⊆ 𝐼 ∧ 𝑙 ∈ Fin)) → (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆) ≠ ∅) | |
24 | nesym 2838 | . . . . . . 7 ⊢ ((𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆) ≠ ∅ ↔ ¬ ∅ = (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆)) | |
25 | 23, 24 | sylib 207 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑙 ⊆ 𝐼 ∧ 𝑙 ∈ Fin)) → ¬ ∅ = (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆)) |
26 | 22, 25 | sylan2 490 | . . . . 5 ⊢ ((𝜑 ∧ 𝑙 ∈ (𝒫 𝐼 ∩ Fin)) → ¬ ∅ = (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆)) |
27 | 26 | nrexdv 2984 | . . . 4 ⊢ (𝜑 → ¬ ∃𝑙 ∈ (𝒫 𝐼 ∩ Fin)∅ = (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆)) |
28 | elrfirn2 36277 | . . . . 5 ⊢ ((𝑋 ∈ (Clsd‘𝐽) ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (∅ ∈ (fi‘({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) ↔ ∃𝑙 ∈ (𝒫 𝐼 ∩ Fin)∅ = (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆))) | |
29 | 6, 10, 28 | syl2anc 691 | . . . 4 ⊢ (𝜑 → (∅ ∈ (fi‘({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) ↔ ∃𝑙 ∈ (𝒫 𝐼 ∩ Fin)∅ = (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆))) |
30 | 27, 29 | mtbird 314 | . . 3 ⊢ (𝜑 → ¬ ∅ ∈ (fi‘({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)))) |
31 | cmpfii 21022 | . . 3 ⊢ ((𝐽 ∈ Comp ∧ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)))) → ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) ≠ ∅) | |
32 | 1, 18, 30, 31 | syl3anc 1318 | . 2 ⊢ (𝜑 → ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) ≠ ∅) |
33 | 12, 32 | eqnetrd 2849 | 1 ⊢ (𝜑 → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ∀wral 2896 ∃wrex 2897 ∪ cun 3538 ∩ cin 3539 ⊆ wss 3540 ∅c0 3874 𝒫 cpw 4108 {csn 4125 ∪ cuni 4372 ∩ cint 4410 ∩ ciin 4456 ↦ cmpt 4643 ran crn 5039 ⟶wf 5800 ‘cfv 5804 Fincfn 7841 ficfi 8199 Topctop 20517 Clsdccld 20630 Compccmp 20999 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-iin 4458 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-2o 7448 df-oadd 7451 df-er 7629 df-map 7746 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-fi 8200 df-top 20521 df-cld 20633 df-cmp 21000 |
This theorem is referenced by: kelac1 36651 |
Copyright terms: Public domain | W3C validator |