Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cmppcmp Structured version   Visualization version   GIF version

Theorem cmppcmp 34116
Description: Every compact space is paracompact. (Contributed by Thierry Arnoux, 7-Jan-2020.)
Assertion
Ref Expression
cmppcmp (𝐽 ∈ Comp → 𝐽 ∈ Paracomp)

Proof of Theorem cmppcmp
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cmptop 23435 . 2 (𝐽 ∈ Comp → 𝐽 ∈ Top)
2 cmpcref 34108 . . . . . 6 Comp = CovHasRefFin
32eleq2i 2853 . . . . 5 (𝐽 ∈ Comp ↔ 𝐽 ∈ CovHasRefFin)
4 eqid 2761 . . . . . 6 𝐽 = 𝐽
54iscref 34102 . . . . 5 (𝐽 ∈ CovHasRefFin ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦)))
63, 5bitri 277 . . . 4 (𝐽 ∈ Comp ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦)))
76simprbi 501 . . 3 (𝐽 ∈ Comp → ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦))
8 simprl 780 . . . . . . . . . . . 12 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ (𝒫 𝐽 ∩ Fin))
9 elin 3920 . . . . . . . . . . . 12 (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ↔ (𝑧 ∈ 𝒫 𝐽𝑧 ∈ Fin))
108, 9sylib 220 . . . . . . . . . . 11 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → (𝑧 ∈ 𝒫 𝐽𝑧 ∈ Fin))
1110simpld 498 . . . . . . . . . 10 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ 𝒫 𝐽)
121ad3antrrr 740 . . . . . . . . . . 11 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝐽 ∈ Top)
1310simprd 499 . . . . . . . . . . 11 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ Fin)
14 simplr 778 . . . . . . . . . . . 12 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝐽 = 𝑦)
15 simprr 782 . . . . . . . . . . . . 13 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧Ref𝑦)
16 eqid 2761 . . . . . . . . . . . . . 14 𝑧 = 𝑧
17 eqid 2761 . . . . . . . . . . . . . 14 𝑦 = 𝑦
1816, 17refbas 23550 . . . . . . . . . . . . 13 (𝑧Ref𝑦 𝑦 = 𝑧)
1915, 18syl 17 . . . . . . . . . . . 12 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑦 = 𝑧)
2014, 19eqtrd 2796 . . . . . . . . . . 11 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝐽 = 𝑧)
214, 16finlocfin 23560 . . . . . . . . . . 11 ((𝐽 ∈ Top ∧ 𝑧 ∈ Fin ∧ 𝐽 = 𝑧) → 𝑧 ∈ (LocFin‘𝐽))
2212, 13, 20, 21syl3anc 1389 . . . . . . . . . 10 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ (LocFin‘𝐽))
2311, 22elind 4152 . . . . . . . . 9 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽)))
2423, 15jca 519 . . . . . . . 8 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → (𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽)) ∧ 𝑧Ref𝑦))
2524ex 416 . . . . . . 7 (((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) → ((𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦) → (𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽)) ∧ 𝑧Ref𝑦)))
2625reximdv2 3171 . . . . . 6 (((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) → (∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦))
2726ex 416 . . . . 5 ((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) → ( 𝐽 = 𝑦 → (∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
2827a2d 29 . . . 4 ((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) → (( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦) → ( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
2928ralimdva 3173 . . 3 (𝐽 ∈ Comp → (∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦) → ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
307, 29mpd 15 . 2 (𝐽 ∈ Comp → ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦))
31 ispcmp 34115 . . 3 (𝐽 ∈ Paracomp ↔ 𝐽 ∈ CovHasRef(LocFin‘𝐽))
324iscref 34102 . . 3 (𝐽 ∈ CovHasRef(LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
3331, 32bitri 277 . 2 (𝐽 ∈ Paracomp ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
341, 30, 33sylanbrc 592 1 (𝐽 ∈ Comp → 𝐽 ∈ Paracomp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  wral 3075  wrex 3085  cin 3903  𝒫 cpw 4554   cuni 4864   class class class wbr 5099  cfv 6517  Fincfn 8923  Topctop 22933  Compccmp 23426  Refcref 23542  LocFinclocfin 23544  CovHasRefccref 34100  Paracompcpcmp 34113
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714  ax-reg 9537  ax-inf2 9593  ax-ac2 10417
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4905  df-iun 4950  df-iin 4951  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-se 5599  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-pred 6284  df-ord 6345  df-on 6346  df-lim 6347  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-isom 6526  df-riota 7349  df-ov 7395  df-om 7843  df-1st 7966  df-2nd 7967  df-frecs 8257  df-wrecs 8288  df-recs 8337  df-rdg 8376  df-1o 8432  df-en 8924  df-dom 8925  df-fin 8927  df-r1 9719  df-rank 9720  df-card 9894  df-ac 10069  df-top 22934  df-cmp 23427  df-ref 23545  df-locfin 23547  df-cref 34101  df-pcmp 34114
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator