Theorem cvmcov 35318

Description: Property of a covering map. In order to make the covering property more manageable, we define here the set 𝑆(𝑘) of all even coverings of an open set 𝑘 in the range. Then the covering property states that every point has a neighborhood which has an even covering. (Contributed by Mario Carneiro, 13-Feb-2015.)

Hypotheses

Ref	Expression
cvmcov.1	⊢ 𝑆 = (𝑘 ∈ 𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ (∪ 𝑠 = (◡𝐹 “ 𝑘) ∧ ∀𝑢 ∈ 𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢 ∩ 𝑣) = ∅ ∧ (𝐹 ↾ 𝑢) ∈ ((𝐶 ↾t 𝑢)Homeo(𝐽 ↾t 𝑘))))})
cvmcov.2	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
cvmcov	⊢ ((𝐹 ∈ (𝐶 CovMap 𝐽) ∧ 𝑃 ∈ 𝑋) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝑆‘𝑥) ≠ ∅))

Distinct variable groups:   𝑘,𝑠,𝑢,𝑣,𝑥,𝐶   𝑘,𝐹,𝑠,𝑢,𝑣,𝑥   𝑃,𝑘,𝑥   𝑘,𝐽,𝑠,𝑢,𝑣,𝑥   𝑥,𝑆   𝑥,𝑋

Allowed substitution hints:   𝑃(𝑣,𝑢,𝑠)   𝑆(𝑣,𝑢,𝑘,𝑠)   𝑋(𝑣,𝑢,𝑘,𝑠)

Proof of Theorem cvmcov

Step	Hyp	Ref	Expression
1		cvmcov.1	. . . . 5 ⊢ 𝑆 = (𝑘 ∈ 𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ (∪ 𝑠 = (◡𝐹 “ 𝑘) ∧ ∀𝑢 ∈ 𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢 ∩ 𝑣) = ∅ ∧ (𝐹 ↾ 𝑢) ∈ ((𝐶 ↾t 𝑢)Homeo(𝐽 ↾t 𝑘))))})
2		cvmcov.2	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
3	1, 2	iscvm 35314	. . . 4 ⊢ (𝐹 ∈ (𝐶 CovMap 𝐽) ↔ ((𝐶 ∈ Top ∧ 𝐽 ∈ Top ∧ 𝐹 ∈ (𝐶 Cn 𝐽)) ∧ ∀𝑥 ∈ 𝑋 ∃𝑘 ∈ 𝐽 (𝑥 ∈ 𝑘 ∧ (𝑆‘𝑘) ≠ ∅)))
4	3	simprbi 496	. . 3 ⊢ (𝐹 ∈ (𝐶 CovMap 𝐽) → ∀𝑥 ∈ 𝑋 ∃𝑘 ∈ 𝐽 (𝑥 ∈ 𝑘 ∧ (𝑆‘𝑘) ≠ ∅))
5		eleq1 2821	. . . . . 6 ⊢ (𝑥 = 𝑃 → (𝑥 ∈ 𝑘 ↔ 𝑃 ∈ 𝑘))
6	5	anbi1d 631	. . . . 5 ⊢ (𝑥 = 𝑃 → ((𝑥 ∈ 𝑘 ∧ (𝑆‘𝑘) ≠ ∅) ↔ (𝑃 ∈ 𝑘 ∧ (𝑆‘𝑘) ≠ ∅)))
7	6	rexbidv 3158	. . . 4 ⊢ (𝑥 = 𝑃 → (∃𝑘 ∈ 𝐽 (𝑥 ∈ 𝑘 ∧ (𝑆‘𝑘) ≠ ∅) ↔ ∃𝑘 ∈ 𝐽 (𝑃 ∈ 𝑘 ∧ (𝑆‘𝑘) ≠ ∅)))
8	7	rspcv 3570	. . 3 ⊢ (𝑃 ∈ 𝑋 → (∀𝑥 ∈ 𝑋 ∃𝑘 ∈ 𝐽 (𝑥 ∈ 𝑘 ∧ (𝑆‘𝑘) ≠ ∅) → ∃𝑘 ∈ 𝐽 (𝑃 ∈ 𝑘 ∧ (𝑆‘𝑘) ≠ ∅)))
9	4, 8	mpan9 506	. 2 ⊢ ((𝐹 ∈ (𝐶 CovMap 𝐽) ∧ 𝑃 ∈ 𝑋) → ∃𝑘 ∈ 𝐽 (𝑃 ∈ 𝑘 ∧ (𝑆‘𝑘) ≠ ∅))
10		nfv 1915	. . . 4 ⊢ Ⅎ𝑘 𝑃 ∈ 𝑥
11		nfmpt1 5194	. . . . . . 7 ⊢ Ⅎ𝑘(𝑘 ∈ 𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ (∪ 𝑠 = (◡𝐹 “ 𝑘) ∧ ∀𝑢 ∈ 𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢 ∩ 𝑣) = ∅ ∧ (𝐹 ↾ 𝑢) ∈ ((𝐶 ↾t 𝑢)Homeo(𝐽 ↾t 𝑘))))})
12	1, 11	nfcxfr 2894	. . . . . 6 ⊢ Ⅎ𝑘𝑆
13		nfcv 2896	. . . . . 6 ⊢ Ⅎ𝑘𝑥
14	12, 13	nffv 6841	. . . . 5 ⊢ Ⅎ𝑘(𝑆‘𝑥)
15		nfcv 2896	. . . . 5 ⊢ Ⅎ𝑘∅
16	14, 15	nfne 3031	. . . 4 ⊢ Ⅎ𝑘(𝑆‘𝑥) ≠ ∅
17	10, 16	nfan 1900	. . 3 ⊢ Ⅎ𝑘(𝑃 ∈ 𝑥 ∧ (𝑆‘𝑥) ≠ ∅)
18		nfv 1915	. . 3 ⊢ Ⅎ𝑥(𝑃 ∈ 𝑘 ∧ (𝑆‘𝑘) ≠ ∅)
19		eleq2w 2817	. . . 4 ⊢ (𝑥 = 𝑘 → (𝑃 ∈ 𝑥 ↔ 𝑃 ∈ 𝑘))
20		fveq2 6831	. . . . 5 ⊢ (𝑥 = 𝑘 → (𝑆‘𝑥) = (𝑆‘𝑘))
21	20	neeq1d 2989	. . . 4 ⊢ (𝑥 = 𝑘 → ((𝑆‘𝑥) ≠ ∅ ↔ (𝑆‘𝑘) ≠ ∅))
22	19, 21	anbi12d 632	. . 3 ⊢ (𝑥 = 𝑘 → ((𝑃 ∈ 𝑥 ∧ (𝑆‘𝑥) ≠ ∅) ↔ (𝑃 ∈ 𝑘 ∧ (𝑆‘𝑘) ≠ ∅)))
23	17, 18, 22	cbvrexw 3277	. 2 ⊢ (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝑆‘𝑥) ≠ ∅) ↔ ∃𝑘 ∈ 𝐽 (𝑃 ∈ 𝑘 ∧ (𝑆‘𝑘) ≠ ∅))
24	9, 23	sylibr 234	1 ⊢ ((𝐹 ∈ (𝐶 CovMap 𝐽) ∧ 𝑃 ∈ 𝑋) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝑆‘𝑥) ≠ ∅))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   ≠ wne 2930  ∀wral 3049  ∃wrex 3058  {crab 3397   ∖ cdif 3896   ∩ cin 3898  ∅c0 4284  𝒫 cpw 4551  {csn 4577  ∪ cuni 4860   ↦ cmpt 5176  ^◡ccnv 5620   ↾ cres 5623   “ cima 5624  ‘cfv 6489  (class class class)co 7355   ↾_t crest 17334  Topctop 22818   Cn ccn 23149  Homeochmeo 23678   CovMap ccvm 35310

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-cvm 35311

This theorem is referenced by:  cvmcov2  35330  cvmopnlem  35333  cvmfolem  35334  cvmliftmolem2  35337  cvmliftlem15  35353  cvmlift2lem10  35367  cvmlift3lem8  35381