MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cmpfii Structured version   Visualization version   GIF version

Theorem cmpfii 23476
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.)
Assertion
Ref Expression
cmpfii ((𝐽 ∈ Comp ∧ 𝑋 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑋)) → 𝑋 ≠ ∅)

Proof of Theorem cmpfii
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 fvex 6880 . . . . 5 (Clsd‘𝐽) ∈ V
21elpw2 5291 . . . 4 (𝑋 ∈ 𝒫 (Clsd‘𝐽) ↔ 𝑋 ⊆ (Clsd‘𝐽))
32biimpri 230 . . 3 (𝑋 ⊆ (Clsd‘𝐽) → 𝑋 ∈ 𝒫 (Clsd‘𝐽))
4 cmptop 23462 . . . . 5 (𝐽 ∈ Comp → 𝐽 ∈ Top)
5 cmpfi 23475 . . . . 5 (𝐽 ∈ Top → (𝐽 ∈ Comp ↔ ∀𝑥 ∈ 𝒫 (Clsd‘𝐽)(¬ ∅ ∈ (fi‘𝑥) → 𝑥 ≠ ∅)))
64, 5syl 17 . . . 4 (𝐽 ∈ Comp → (𝐽 ∈ Comp ↔ ∀𝑥 ∈ 𝒫 (Clsd‘𝐽)(¬ ∅ ∈ (fi‘𝑥) → 𝑥 ≠ ∅)))
76ibi 269 . . 3 (𝐽 ∈ Comp → ∀𝑥 ∈ 𝒫 (Clsd‘𝐽)(¬ ∅ ∈ (fi‘𝑥) → 𝑥 ≠ ∅))
8 fveq2 6867 . . . . . . 7 (𝑥 = 𝑋 → (fi‘𝑥) = (fi‘𝑋))
98eleq2d 2849 . . . . . 6 (𝑥 = 𝑋 → (∅ ∈ (fi‘𝑥) ↔ ∅ ∈ (fi‘𝑋)))
109notbid 320 . . . . 5 (𝑥 = 𝑋 → (¬ ∅ ∈ (fi‘𝑥) ↔ ¬ ∅ ∈ (fi‘𝑋)))
11 inteq 4909 . . . . . 6 (𝑥 = 𝑋 𝑥 = 𝑋)
1211neeq1d 3017 . . . . 5 (𝑥 = 𝑋 → ( 𝑥 ≠ ∅ ↔ 𝑋 ≠ ∅))
1310, 12imbi12d 346 . . . 4 (𝑥 = 𝑋 → ((¬ ∅ ∈ (fi‘𝑥) → 𝑥 ≠ ∅) ↔ (¬ ∅ ∈ (fi‘𝑋) → 𝑋 ≠ ∅)))
1413rspcva 3580 . . 3 ((𝑋 ∈ 𝒫 (Clsd‘𝐽) ∧ ∀𝑥 ∈ 𝒫 (Clsd‘𝐽)(¬ ∅ ∈ (fi‘𝑥) → 𝑥 ≠ ∅)) → (¬ ∅ ∈ (fi‘𝑋) → 𝑋 ≠ ∅))
153, 7, 14syl2anr 606 . 2 ((𝐽 ∈ Comp ∧ 𝑋 ⊆ (Clsd‘𝐽)) → (¬ ∅ ∈ (fi‘𝑋) → 𝑋 ≠ ∅))
16153impia 1131 1 ((𝐽 ∈ Comp ∧ 𝑋 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑋)) → 𝑋 ≠ ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  w3a 1099   = wceq 1561  wcel 2143  wne 2958  wral 3077  wss 3905  c0 4286  𝒫 cpw 4556   cint 4906  cfv 6521  ficfi 9354  Topctop 22960  Clsdccld 23083  Compccmp 23453
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5247  ax-nul 5257  ax-pow 5323  ax-pr 5391  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-nf 1805  df-sb 2092  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3078  df-rex 3088  df-reu 3369  df-rab 3416  df-v 3457  df-sbc 3746  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5102  df-opab 5164  df-mpt 5183  df-tr 5209  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-om 7847  df-1o 8437  df-en 8928  df-dom 8929  df-fin 8931  df-fi 9355  df-top 22961  df-cld 23086  df-cmp 23454
This theorem is referenced by:  fclscmpi  24096  cmpfiiin  43283
  Copyright terms: Public domain W3C validator