Theorem pcmplfinf 29928

Description: Given a paracompact topology 𝐽 and an open cover 𝑈, there exists an open refinement ran 𝑓 that is locally finite, using the same index as the original cover 𝑈. (Contributed by Thierry Arnoux, 31-Jan-2020.)

Hypothesis

Ref	Expression
pcmplfin.x	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
pcmplfinf	⊢ ((𝐽 ∈ Paracomp ∧ 𝑈 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝑈) → ∃𝑓(𝑓:𝑈⟶𝐽 ∧ ran 𝑓Ref𝑈 ∧ ran 𝑓 ∈ (LocFin‘𝐽)))

Distinct variable groups:   𝑓,𝐽   𝑈,𝑓   𝑓,𝑋

Proof of Theorem pcmplfinf

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		pcmplfin.x	. . 3 ⊢ 𝑋 = ∪ 𝐽
2		simpll2 1101	. . 3 ⊢ ((((𝐽 ∈ Paracomp ∧ 𝑈 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝑈) ∧ 𝑣 ∈ 𝒫 𝐽) ∧ (𝑣 ∈ (LocFin‘𝐽) ∧ 𝑣Ref𝑈)) → 𝑈 ⊆ 𝐽)
3		simpll3 1102	. . 3 ⊢ ((((𝐽 ∈ Paracomp ∧ 𝑈 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝑈) ∧ 𝑣 ∈ 𝒫 𝐽) ∧ (𝑣 ∈ (LocFin‘𝐽) ∧ 𝑣Ref𝑈)) → 𝑋 = ∪ 𝑈)
4		elpwi 4168	. . . 4 ⊢ (𝑣 ∈ 𝒫 𝐽 → 𝑣 ⊆ 𝐽)
5	4	ad2antlr 763	. . 3 ⊢ ((((𝐽 ∈ Paracomp ∧ 𝑈 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝑈) ∧ 𝑣 ∈ 𝒫 𝐽) ∧ (𝑣 ∈ (LocFin‘𝐽) ∧ 𝑣Ref𝑈)) → 𝑣 ⊆ 𝐽)
6		simprr 796	. . 3 ⊢ ((((𝐽 ∈ Paracomp ∧ 𝑈 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝑈) ∧ 𝑣 ∈ 𝒫 𝐽) ∧ (𝑣 ∈ (LocFin‘𝐽) ∧ 𝑣Ref𝑈)) → 𝑣Ref𝑈)
7		simprl 794	. . 3 ⊢ ((((𝐽 ∈ Paracomp ∧ 𝑈 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝑈) ∧ 𝑣 ∈ 𝒫 𝐽) ∧ (𝑣 ∈ (LocFin‘𝐽) ∧ 𝑣Ref𝑈)) → 𝑣 ∈ (LocFin‘𝐽))
8	1, 2, 3, 5, 6, 7	locfinref 29908	. 2 ⊢ ((((𝐽 ∈ Paracomp ∧ 𝑈 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝑈) ∧ 𝑣 ∈ 𝒫 𝐽) ∧ (𝑣 ∈ (LocFin‘𝐽) ∧ 𝑣Ref𝑈)) → ∃𝑓(𝑓:𝑈⟶𝐽 ∧ ran 𝑓Ref𝑈 ∧ ran 𝑓 ∈ (LocFin‘𝐽)))
9	1	pcmplfin 29927	. 2 ⊢ ((𝐽 ∈ Paracomp ∧ 𝑈 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝑈) → ∃𝑣 ∈ 𝒫 𝐽(𝑣 ∈ (LocFin‘𝐽) ∧ 𝑣Ref𝑈))
10	8, 9	r19.29a 3078	1 ⊢ ((𝐽 ∈ Paracomp ∧ 𝑈 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝑈) → ∃𝑓(𝑓:𝑈⟶𝐽 ∧ ran 𝑓Ref𝑈 ∧ ran 𝑓 ∈ (LocFin‘𝐽)))

Syntax hints:   → wi 4   ∧ wa 384   ∧ w3a 1037   = wceq 1483  ∃wex 1704   ∈ wcel 1990   ⊆ wss 3574  𝒫 cpw 4158  ∪ cuni 4436   class class class wbr 4653  ran crn 5115  ⟶wf 5884  ‘cfv 5888  Refcref 21305  LocFinclocfin 21307  Paracompcpcmp 29922

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-reg 8497  ax-inf2 8538  ax-ac2 9285

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-iin 4523  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-se 5074  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-isom 5897  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-en 7956  df-dom 7957  df-fin 7959  df-r1 8627  df-rank 8628  df-card 8765  df-ac 8939  df-top 20699  df-topon 20716  df-ref 21308  df-locfin 21310  df-cref 29910  df-pcmp 29923

This theorem is referenced by: (None)