Theorem cmppcmp 34257

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.

Step	Hyp	Ref	Expression
1		cmptop 23563	. 2 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ Top)
2		cmpcref 34249	. . . . . 6 ⊢ Comp = CovHasRefFin
3	2	eleq2i 2854	. . . . 5 ⊢ (𝐽 ∈ Comp ↔ 𝐽 ∈ CovHasRefFin)
4		eqid 2762	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
5	4	iscref 34243	. . . . 5 ⊢ (𝐽 ∈ CovHasRefFin ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦)))
6	3, 5	bitri 278	. . . 4 ⊢ (𝐽 ∈ Comp ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦)))
7	6	simprbi 502	. . 3 ⊢ (𝐽 ∈ Comp → ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦))
8		simprl 782	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ (𝒫 𝐽 ∩ Fin))
9		elin 3920	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ↔ (𝑧 ∈ 𝒫 𝐽 ∧ 𝑧 ∈ Fin))
10	8, 9	sylib 221	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → (𝑧 ∈ 𝒫 𝐽 ∧ 𝑧 ∈ Fin))
11	10	simpld 499	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ 𝒫 𝐽)
12	1	ad3antrrr 742	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝐽 ∈ Top)
13	10	simprd 500	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ Fin)
14		simplr 780	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → ∪ 𝐽 = ∪ 𝑦)
15		simprr 784	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧Ref𝑦)
16		eqid 2762	. . . . . . . . . . . . . 14 ⊢ ∪ 𝑧 = ∪ 𝑧
17		eqid 2762	. . . . . . . . . . . . . 14 ⊢ ∪ 𝑦 = ∪ 𝑦
18	16, 17	refbas 23678	. . . . . . . . . . . . 13 ⊢ (𝑧Ref𝑦 → ∪ 𝑦 = ∪ 𝑧)
19	15, 18	syl 18	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → ∪ 𝑦 = ∪ 𝑧)
20	14, 19	eqtrd 2797	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → ∪ 𝐽 = ∪ 𝑧)
21	4, 16	finlocfin 23688	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑧 ∈ Fin ∧ ∪ 𝐽 = ∪ 𝑧) → 𝑧 ∈ (LocFin‘𝐽))
22	12, 13, 20, 21	syl3anc 1397	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ (LocFin‘𝐽))
23	11, 22	elind 4152	. . . . . . . . 9 ⊢ ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → 𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽)))
24	23, 15	jca 520	. . . . . . . 8 ⊢ ((((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) ∧ (𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦)) → (𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽)) ∧ 𝑧Ref𝑦))
25	24	ex 417	. . . . . . 7 ⊢ (((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) → ((𝑧 ∈ (𝒫 𝐽 ∩ Fin) ∧ 𝑧Ref𝑦) → (𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽)) ∧ 𝑧Ref𝑦)))
26	25	reximdv2 3174	. . . . . 6 ⊢ (((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) ∧ ∪ 𝐽 = ∪ 𝑦) → (∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦))
27	26	ex 417	. . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) → (∪ 𝐽 = ∪ 𝑦 → (∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
28	27	a2d 30	. . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑦 ∈ 𝒫 𝐽) → ((∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦) → (∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
29	28	ralimdva 3176	. . 3 ⊢ (𝐽 ∈ Comp → (∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ Fin)𝑧Ref𝑦) → ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
30	7, 29	mpd 16	. 2 ⊢ (𝐽 ∈ Comp → ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦))
31		ispcmp 34256	. . 3 ⊢ (𝐽 ∈ Paracomp ↔ 𝐽 ∈ CovHasRef(LocFin‘𝐽))
32	4	iscref 34243	. . 3 ⊢ (𝐽 ∈ CovHasRef(LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
33	31, 32	bitri 278	. 2 ⊢ (𝐽 ∈ Paracomp ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ (LocFin‘𝐽))𝑧Ref𝑦)))
34	1, 30, 33	sylanbrc 594	1 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ Paracomp)

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142  ∀wral 3078  ∃wrex 3088   ∩ cin 3903  𝒫 cpw 4561  ∪ cuni 4871   class class class wbr 5108  ‘cfv 6536  Fincfn 8941  Topctop 23061  Compccmp 23554  Refcref 23670  LocFinclocfin 23672  CovHasRefccref 34241  Paracompcpcmp 34254

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-reg 9552  ax-inf2 9608  ax-ac2 10453

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-iin 4958  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-se 5614  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7369  df-ov 7415  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-1o 8451  df-en 8942  df-dom 8943  df-fin 8945  df-r1 9734  df-rank 9735  df-scott 9856  df-card 9932  df-ac 10107  df-top 23062  df-cmp 23555  df-ref 23673  df-locfin 23675  df-cref 34242  df-pcmp 34255

This theorem is used by: (None)