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 22005 | . . . . 5 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ Top) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐽 ∈ Top) |
4 | cmpfiiin.x | . . . . 5 ⊢ 𝑋 = ∪ 𝐽 | |
5 | 4 | topcld 21645 | . . . 4 ⊢ (𝐽 ∈ Top → 𝑋 ∈ (Clsd‘𝐽)) |
6 | 3, 5 | syl 17 | . . 3 ⊢ (𝜑 → 𝑋 ∈ (Clsd‘𝐽)) |
7 | cmpfiiin.s | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → 𝑆 ∈ (Clsd‘𝐽)) | |
8 | 4 | cldss 21639 | . . . . 5 ⊢ (𝑆 ∈ (Clsd‘𝐽) → 𝑆 ⊆ 𝑋) |
9 | 7, 8 | syl 17 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → 𝑆 ⊆ 𝑋) |
10 | 9 | ralrimiva 3184 | . . 3 ⊢ (𝜑 → ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) |
11 | riinint 5841 | . . 3 ⊢ ((𝑋 ∈ (Clsd‘𝐽) ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) = ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) | |
12 | 6, 10, 11 | syl2anc 586 | . 2 ⊢ (𝜑 → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) = ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
13 | 6 | snssd 4744 | . . . 4 ⊢ (𝜑 → {𝑋} ⊆ (Clsd‘𝐽)) |
14 | 7 | fmpttd 6881 | . . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝐼 ↦ 𝑆):𝐼⟶(Clsd‘𝐽)) |
15 | 14 | frnd 6523 | . . . 4 ⊢ (𝜑 → ran (𝑘 ∈ 𝐼 ↦ 𝑆) ⊆ (Clsd‘𝐽)) |
16 | 13, 15 | unssd 4164 | . . 3 ⊢ (𝜑 → ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) ⊆ (Clsd‘𝐽)) |
17 | elin 4171 | . . . . . . 7 ⊢ (𝑙 ∈ (𝒫 𝐼 ∩ Fin) ↔ (𝑙 ∈ 𝒫 𝐼 ∧ 𝑙 ∈ Fin)) | |
18 | elpwi 4550 | . . . . . . . 8 ⊢ (𝑙 ∈ 𝒫 𝐼 → 𝑙 ⊆ 𝐼) | |
19 | 18 | anim1i 616 | . . . . . . 7 ⊢ ((𝑙 ∈ 𝒫 𝐼 ∧ 𝑙 ∈ Fin) → (𝑙 ⊆ 𝐼 ∧ 𝑙 ∈ Fin)) |
20 | 17, 19 | sylbi 219 | . . . . . 6 ⊢ (𝑙 ∈ (𝒫 𝐼 ∩ Fin) → (𝑙 ⊆ 𝐼 ∧ 𝑙 ∈ Fin)) |
21 | cmpfiiin.z | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑙 ⊆ 𝐼 ∧ 𝑙 ∈ Fin)) → (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆) ≠ ∅) | |
22 | nesym 3074 | . . . . . . 7 ⊢ ((𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆) ≠ ∅ ↔ ¬ ∅ = (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆)) | |
23 | 21, 22 | sylib 220 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑙 ⊆ 𝐼 ∧ 𝑙 ∈ Fin)) → ¬ ∅ = (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆)) |
24 | 20, 23 | sylan2 594 | . . . . 5 ⊢ ((𝜑 ∧ 𝑙 ∈ (𝒫 𝐼 ∩ Fin)) → ¬ ∅ = (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆)) |
25 | 24 | nrexdv 3272 | . . . 4 ⊢ (𝜑 → ¬ ∃𝑙 ∈ (𝒫 𝐼 ∩ Fin)∅ = (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆)) |
26 | elrfirn2 39300 | . . . . 5 ⊢ ((𝑋 ∈ (Clsd‘𝐽) ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (∅ ∈ (fi‘({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) ↔ ∃𝑙 ∈ (𝒫 𝐼 ∩ Fin)∅ = (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆))) | |
27 | 6, 10, 26 | syl2anc 586 | . . . 4 ⊢ (𝜑 → (∅ ∈ (fi‘({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) ↔ ∃𝑙 ∈ (𝒫 𝐼 ∩ Fin)∅ = (𝑋 ∩ ∩ 𝑘 ∈ 𝑙 𝑆))) |
28 | 25, 27 | mtbird 327 | . . 3 ⊢ (𝜑 → ¬ ∅ ∈ (fi‘({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)))) |
29 | cmpfii 22019 | . . 3 ⊢ ((𝐽 ∈ Comp ∧ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)))) → ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) ≠ ∅) | |
30 | 1, 16, 28, 29 | syl3anc 1367 | . 2 ⊢ (𝜑 → ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) ≠ ∅) |
31 | 12, 30 | eqnetrd 3085 | 1 ⊢ (𝜑 → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 ∀wral 3140 ∃wrex 3141 ∪ cun 3936 ∩ cin 3937 ⊆ wss 3938 ∅c0 4293 𝒫 cpw 4541 {csn 4569 ∪ cuni 4840 ∩ cint 4878 ∩ ciin 4922 ↦ cmpt 5148 ran crn 5558 ‘cfv 6357 Fincfn 8511 ficfi 8876 Topctop 21503 Clsdccld 21626 Compccmp 21996 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-iin 4924 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-2o 8105 df-oadd 8108 df-er 8291 df-map 8410 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-fi 8877 df-top 21504 df-cld 21629 df-cmp 21997 |
This theorem is referenced by: kelac1 39670 |
Copyright terms: Public domain | W3C validator |