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 34165
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 23513 . 2 (𝐽 ∈ Comp → 𝐽 ∈ Top)
2 cmpcref 34157 . . . . . 6 Comp = CovHasRefFin
32eleq2i 2857 . . . . 5 (𝐽 ∈ Comp ↔ 𝐽 ∈ CovHasRefFin)
4 eqid 2765 . . . . . 6 𝐽 = 𝐽
54iscref 34151 . . . . 5 (𝐽 ∈ CovHasRefFin ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦)))
63, 5bitri 278 . . . 4 (𝐽 ∈ Comp ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦)))
76simprbi 502 . . 3 (𝐽 ∈ Comp → ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦))
8 simprl 782 . . . . . . . . . . . 12 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ (𝒫 𝐽 ∩ Fin))
9 elin 3923 . . . . . . . . . . . 12 (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ↔ (𝑧 ∈ 𝒫 𝐽𝑧 ∈ Fin))
108, 9sylib 221 . . . . . . . . . . 11 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → (𝑧 ∈ 𝒫 𝐽𝑧 ∈ Fin))
1110simpld 499 . . . . . . . . . 10 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ 𝒫 𝐽)
121ad3antrrr 742 . . . . . . . . . . 11 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝐽 ∈ Top)
1310simprd 500 . . . . . . . . . . 11 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ Fin)
14 simplr 780 . . . . . . . . . . . 12 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝐽 = 𝑦)
15 simprr 784 . . . . . . . . . . . . 13 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧Ref𝑦)
16 eqid 2765 . . . . . . . . . . . . . 14 𝑧 = 𝑧
17 eqid 2765 . . . . . . . . . . . . . 14 𝑦 = 𝑦
1816, 17refbas 23628 . . . . . . . . . . . . 13 (𝑧Ref𝑦 𝑦 = 𝑧)
1915, 18syl 18 . . . . . . . . . . . 12 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑦 = 𝑧)
2014, 19eqtrd 2800 . . . . . . . . . . 11 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝐽 = 𝑧)
214, 16finlocfin 23638 . . . . . . . . . . 11 ((𝐽 ∈ Top ∧ 𝑧 ∈ Fin ∧ 𝐽 = 𝑧) → 𝑧 ∈ (LocFin‘𝐽))
2212, 13, 20, 21syl3anc 1394 . . . . . . . . . 10 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ (LocFin‘𝐽))
2311, 22elind 4155 . . . . . . . . 9 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽)))
2423, 15jca 520 . . . . . . . 8 ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → (𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽)) ∧ 𝑧Ref𝑦))
2524ex 417 . . . . . . 7 (((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) → ((𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦) → (𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽)) ∧ 𝑧Ref𝑦)))
2625reximdv2 3175 . . . . . 6 (((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ 𝐽 = 𝑦) → (∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦))
2726ex 417 . . . . 5 ((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) → ( 𝐽 = 𝑦 → (∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
2827a2d 30 . . . 4 ((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) → (( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦) → ( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
2928ralimdva 3177 . . 3 (𝐽 ∈ Comp → (∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦) → ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
307, 29mpd 16 . 2 (𝐽 ∈ Comp → ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦))
31 ispcmp 34164 . . 3 (𝐽 ∈ Paracomp ↔ 𝐽 ∈ CovHasRef(LocFin‘𝐽))
324iscref 34151 . . 3 (𝐽 ∈ CovHasRef(LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
3331, 32bitri 278 . 2 (𝐽 ∈ Paracomp ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽( 𝐽 = 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
341, 30, 33sylanbrc 594 1 (𝐽 ∈ Comp → 𝐽 ∈ Paracomp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1563  wcel 2145  wral 3079  wrex 3089  cin 3906  𝒫 cpw 4558   cuni 4868   class class class wbr 5105  cfv 6525  Fincfn 8931  Topctop 23011  Compccmp 23504  Refcref 23620  LocFinclocfin 23622  CovHasRefccref 34149  Paracompcpcmp 34162
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722  ax-reg 9542  ax-inf2 9598  ax-ac2 10435
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-int 4909  df-iun 4954  df-iin 4955  df-br 5106  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-se 5606  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-pred 6292  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-isom 6534  df-riota 7357  df-ov 7403  df-om 7851  df-1st 7974  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-1o 8441  df-en 8932  df-dom 8933  df-fin 8935  df-r1 9724  df-rank 9725  df-card 9913  df-ac 10088  df-top 23012  df-cmp 23505  df-ref 23623  df-locfin 23625  df-cref 34150  df-pcmp 34163
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator