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 33798
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 23368 . 2 (𝐽 ∈ Comp → 𝐽 ∈ Top)
2 cmpcref 33790 . . . . . 6 Comp = CovHasRefFin
32eleq2i 2825 . . . . 5 (𝐽 ∈ Comp ↔ 𝐽 ∈ CovHasRefFin)
4 eqid 2734 . . . . . 6 𝐽 = 𝐽
54iscref 33784 . . . . 5 (𝐽 ∈ CovHasRefFin ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦)))
63, 5bitri 275 . . . 4 (𝐽 ∈ Comp ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦)))
76simprbi 496 . . 3 (𝐽 ∈ Comp → ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦))
8 simprl 770 . . . . . . . . . . . 12 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ (𝒫 𝐽 ∩ Fin))
9 elin 3949 . . . . . . . . . . . 12 (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ↔ (𝑧 ∈ 𝒫 𝐽𝑧 ∈ Fin))
108, 9sylib 218 . . . . . . . . . . 11 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → (𝑧 ∈ 𝒫 𝐽𝑧 ∈ Fin))
1110simpld 494 . . . . . . . . . 10 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ 𝒫 𝐽)
121ad3antrrr 730 . . . . . . . . . . 11 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝐽 ∈ Top)
1310simprd 495 . . . . . . . . . . 11 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ Fin)
14 simplr 768 . . . . . . . . . . . 12 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝐽 = 𝑦)
15 simprr 772 . . . . . . . . . . . . 13 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧Ref𝑦)
16 eqid 2734 . . . . . . . . . . . . . 14 𝑧 = 𝑧
17 eqid 2734 . . . . . . . . . . . . . 14 𝑦 = 𝑦
1816, 17refbas 23483 . . . . . . . . . . . . 13 (𝑧Ref𝑦 𝑦 = 𝑧)
1915, 18syl 17 . . . . . . . . . . . 12 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑦 = 𝑧)
2014, 19eqtrd 2769 . . . . . . . . . . 11 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝐽 = 𝑧)
214, 16finlocfin 23493 . . . . . . . . . . 11 ((𝐽 ∈ Top ∧ 𝑧 ∈ Fin ∧ 𝐽 = 𝑧) → 𝑧 ∈ (LocFin‘𝐽))
2212, 13, 20, 21syl3anc 1372 . . . . . . . . . 10 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ (LocFin‘𝐽))
2311, 22elind 4182 . . . . . . . . 9 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽)))
2423, 15jca 511 . . . . . . . 8 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → (𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽)) ∧ 𝑧Ref𝑦))
2524ex 412 . . . . . . 7 (((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) → ((𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦) → (𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽)) ∧ 𝑧Ref𝑦)))
2625reximdv2 3151 . . . . . 6 (((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) → (∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦))
2726ex 412 . . . . 5 ((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) → ( 𝐽 = 𝑦 → (∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
2827a2d 29 . . . 4 ((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) → (( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦) → ( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
2928ralimdva 3154 . . 3 (𝐽 ∈ Comp → (∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦) → ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
307, 29mpd 15 . 2 (𝐽 ∈ Comp → ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦))
31 ispcmp 33797 . . 3 (𝐽 ∈ Paracomp ↔ 𝐽 ∈ CovHasRef(LocFin‘𝐽))
324iscref 33784 . . 3 (𝐽 ∈ CovHasRef(LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
3331, 32bitri 275 . 2 (𝐽 ∈ Paracomp ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
341, 30, 33sylanbrc 583 1 (𝐽 ∈ Comp → 𝐽 ∈ Paracomp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2107  wral 3050  wrex 3059  cin 3932  𝒫 cpw 4582   cuni 4889   class class class wbr 5125  cfv 6542  Fincfn 8968  Topctop 22866  Compccmp 23359  Refcref 23475  LocFinclocfin 23477  CovHasRefccref 33782  Paracompcpcmp 33795
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-rep 5261  ax-sep 5278  ax-nul 5288  ax-pow 5347  ax-pr 5414  ax-un 7738  ax-reg 9615  ax-inf2 9664  ax-ac2 10486
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3773  df-csb 3882  df-dif 3936  df-un 3938  df-in 3940  df-ss 3950  df-pss 3953  df-nul 4316  df-if 4508  df-pw 4584  df-sn 4609  df-pr 4611  df-op 4615  df-uni 4890  df-int 4929  df-iun 4975  df-iin 4976  df-br 5126  df-opab 5188  df-mpt 5208  df-tr 5242  df-id 5560  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-se 5620  df-we 5621  df-xp 5673  df-rel 5674  df-cnv 5675  df-co 5676  df-dm 5677  df-rn 5678  df-res 5679  df-ima 5680  df-pred 6303  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6495  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-isom 6551  df-riota 7371  df-ov 7417  df-om 7871  df-1st 7997  df-2nd 7998  df-frecs 8289  df-wrecs 8320  df-recs 8394  df-rdg 8433  df-1o 8489  df-en 8969  df-dom 8970  df-fin 8972  df-r1 9787  df-rank 9788  df-card 9962  df-ac 10139  df-top 22867  df-cmp 23360  df-ref 23478  df-locfin 23480  df-cref 33783  df-pcmp 33796
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator