Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  bcth3 Structured version   Visualization version   GIF version

Theorem bcth3 24031
 Description: Baire's Category Theorem, version 3: The intersection of countably many dense open sets is dense. (Contributed by Mario Carneiro, 10-Jan-2014.)
Hypothesis
Ref Expression
bcth.2 𝐽 = (MetOpen‘𝐷)
Assertion
Ref Expression
bcth3 ((𝐷 ∈ (CMet‘𝑋) ∧ 𝑀:ℕ⟶𝐽 ∧ ∀𝑘 ∈ ℕ ((cls‘𝐽)‘(𝑀𝑘)) = 𝑋) → ((cls‘𝐽)‘ ran 𝑀) = 𝑋)
Distinct variable groups:   𝐷,𝑘   𝑘,𝐽   𝑘,𝑀   𝑘,𝑋

Proof of Theorem bcth3
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 cmetmet 23986 . . . . 5 (𝐷 ∈ (CMet‘𝑋) → 𝐷 ∈ (Met‘𝑋))
2 metxmet 23036 . . . . 5 (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
31, 2syl 17 . . . 4 (𝐷 ∈ (CMet‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
4 bcth.2 . . . . . . . . . 10 𝐽 = (MetOpen‘𝐷)
54mopntop 23142 . . . . . . . . 9 (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ Top)
65ad2antrr 725 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → 𝐽 ∈ Top)
7 ffvelrn 6840 . . . . . . . . . 10 ((𝑀:ℕ⟶𝐽𝑘 ∈ ℕ) → (𝑀𝑘) ∈ 𝐽)
8 elssuni 4830 . . . . . . . . . 10 ((𝑀𝑘) ∈ 𝐽 → (𝑀𝑘) ⊆ 𝐽)
97, 8syl 17 . . . . . . . . 9 ((𝑀:ℕ⟶𝐽𝑘 ∈ ℕ) → (𝑀𝑘) ⊆ 𝐽)
109adantll 713 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → (𝑀𝑘) ⊆ 𝐽)
11 eqid 2758 . . . . . . . . 9 𝐽 = 𝐽
1211clsval2 21750 . . . . . . . 8 ((𝐽 ∈ Top ∧ (𝑀𝑘) ⊆ 𝐽) → ((cls‘𝐽)‘(𝑀𝑘)) = ( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘)))))
136, 10, 12syl2anc 587 . . . . . . 7 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → ((cls‘𝐽)‘(𝑀𝑘)) = ( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘)))))
144mopnuni 23143 . . . . . . . 8 (𝐷 ∈ (∞Met‘𝑋) → 𝑋 = 𝐽)
1514ad2antrr 725 . . . . . . 7 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → 𝑋 = 𝐽)
1613, 15eqeq12d 2774 . . . . . 6 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → (((cls‘𝐽)‘(𝑀𝑘)) = 𝑋 ↔ ( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘)))) = 𝐽))
17 difeq2 4022 . . . . . . . 8 (( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘)))) = 𝐽 → ( 𝐽 ∖ ( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))))) = ( 𝐽 𝐽))
18 difid 4269 . . . . . . . 8 ( 𝐽 𝐽) = ∅
1917, 18eqtrdi 2809 . . . . . . 7 (( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘)))) = 𝐽 → ( 𝐽 ∖ ( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))))) = ∅)
20 difss 4037 . . . . . . . . . . . 12 ( 𝐽 ∖ (𝑀𝑘)) ⊆ 𝐽
2111ntropn 21749 . . . . . . . . . . . 12 ((𝐽 ∈ Top ∧ ( 𝐽 ∖ (𝑀𝑘)) ⊆ 𝐽) → ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))) ∈ 𝐽)
226, 20, 21sylancl 589 . . . . . . . . . . 11 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))) ∈ 𝐽)
23 elssuni 4830 . . . . . . . . . . 11 (((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))) ∈ 𝐽 → ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))) ⊆ 𝐽)
2422, 23syl 17 . . . . . . . . . 10 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))) ⊆ 𝐽)
25 dfss4 4163 . . . . . . . . . 10 (((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))) ⊆ 𝐽 ↔ ( 𝐽 ∖ ( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))))) = ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))))
2624, 25sylib 221 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → ( 𝐽 ∖ ( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))))) = ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))))
27 id 22 . . . . . . . . . . . 12 (𝑘 ∈ ℕ → 𝑘 ∈ ℕ)
28 elfvdm 6690 . . . . . . . . . . . . . 14 (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met)
29 difexg 5197 . . . . . . . . . . . . . 14 (𝑋 ∈ dom ∞Met → (𝑋 ∖ (𝑀𝑘)) ∈ V)
3028, 29syl 17 . . . . . . . . . . . . 13 (𝐷 ∈ (∞Met‘𝑋) → (𝑋 ∖ (𝑀𝑘)) ∈ V)
3130adantr 484 . . . . . . . . . . . 12 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → (𝑋 ∖ (𝑀𝑘)) ∈ V)
32 fveq2 6658 . . . . . . . . . . . . . 14 (𝑥 = 𝑘 → (𝑀𝑥) = (𝑀𝑘))
3332difeq2d 4028 . . . . . . . . . . . . 13 (𝑥 = 𝑘 → (𝑋 ∖ (𝑀𝑥)) = (𝑋 ∖ (𝑀𝑘)))
34 eqid 2758 . . . . . . . . . . . . 13 (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))) = (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))
3533, 34fvmptg 6757 . . . . . . . . . . . 12 ((𝑘 ∈ ℕ ∧ (𝑋 ∖ (𝑀𝑘)) ∈ V) → ((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘) = (𝑋 ∖ (𝑀𝑘)))
3627, 31, 35syl2anr 599 . . . . . . . . . . 11 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → ((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘) = (𝑋 ∖ (𝑀𝑘)))
3715difeq1d 4027 . . . . . . . . . . 11 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → (𝑋 ∖ (𝑀𝑘)) = ( 𝐽 ∖ (𝑀𝑘)))
3836, 37eqtrd 2793 . . . . . . . . . 10 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → ((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘) = ( 𝐽 ∖ (𝑀𝑘)))
3938fveq2d 6662 . . . . . . . . 9 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) = ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))))
4026, 39eqtr4d 2796 . . . . . . . 8 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → ( 𝐽 ∖ ( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))))) = ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)))
4140eqeq1d 2760 . . . . . . 7 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → (( 𝐽 ∖ ( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘))))) = ∅ ↔ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) = ∅))
4219, 41syl5ib 247 . . . . . 6 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → (( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ∖ (𝑀𝑘)))) = 𝐽 → ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) = ∅))
4316, 42sylbid 243 . . . . 5 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → (((cls‘𝐽)‘(𝑀𝑘)) = 𝑋 → ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) = ∅))
4443ralimdva 3108 . . . 4 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → (∀𝑘 ∈ ℕ ((cls‘𝐽)‘(𝑀𝑘)) = 𝑋 → ∀𝑘 ∈ ℕ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) = ∅))
453, 44sylan 583 . . 3 ((𝐷 ∈ (CMet‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → (∀𝑘 ∈ ℕ ((cls‘𝐽)‘(𝑀𝑘)) = 𝑋 → ∀𝑘 ∈ ℕ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) = ∅))
46 ffvelrn 6840 . . . . . . . . 9 ((𝑀:ℕ⟶𝐽𝑥 ∈ ℕ) → (𝑀𝑥) ∈ 𝐽)
4714difeq1d 4027 . . . . . . . . . . 11 (𝐷 ∈ (∞Met‘𝑋) → (𝑋 ∖ (𝑀𝑥)) = ( 𝐽 ∖ (𝑀𝑥)))
4847adantr 484 . . . . . . . . . 10 ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑀𝑥) ∈ 𝐽) → (𝑋 ∖ (𝑀𝑥)) = ( 𝐽 ∖ (𝑀𝑥)))
4911opncld 21733 . . . . . . . . . . 11 ((𝐽 ∈ Top ∧ (𝑀𝑥) ∈ 𝐽) → ( 𝐽 ∖ (𝑀𝑥)) ∈ (Clsd‘𝐽))
505, 49sylan 583 . . . . . . . . . 10 ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑀𝑥) ∈ 𝐽) → ( 𝐽 ∖ (𝑀𝑥)) ∈ (Clsd‘𝐽))
5148, 50eqeltrd 2852 . . . . . . . . 9 ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑀𝑥) ∈ 𝐽) → (𝑋 ∖ (𝑀𝑥)) ∈ (Clsd‘𝐽))
5246, 51sylan2 595 . . . . . . . 8 ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑀:ℕ⟶𝐽𝑥 ∈ ℕ)) → (𝑋 ∖ (𝑀𝑥)) ∈ (Clsd‘𝐽))
5352anassrs 471 . . . . . . 7 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑥 ∈ ℕ) → (𝑋 ∖ (𝑀𝑥)) ∈ (Clsd‘𝐽))
5453ralrimiva 3113 . . . . . 6 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ∀𝑥 ∈ ℕ (𝑋 ∖ (𝑀𝑥)) ∈ (Clsd‘𝐽))
553, 54sylan 583 . . . . 5 ((𝐷 ∈ (CMet‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ∀𝑥 ∈ ℕ (𝑋 ∖ (𝑀𝑥)) ∈ (Clsd‘𝐽))
5634fmpt 6865 . . . . 5 (∀𝑥 ∈ ℕ (𝑋 ∖ (𝑀𝑥)) ∈ (Clsd‘𝐽) ↔ (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))):ℕ⟶(Clsd‘𝐽))
5755, 56sylib 221 . . . 4 ((𝐷 ∈ (CMet‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))):ℕ⟶(Clsd‘𝐽))
58 nne 2955 . . . . . . 7 (¬ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) ≠ ∅ ↔ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) = ∅)
5958ralbii 3097 . . . . . 6 (∀𝑘 ∈ ℕ ¬ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) ≠ ∅ ↔ ∀𝑘 ∈ ℕ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) = ∅)
60 ralnex 3163 . . . . . 6 (∀𝑘 ∈ ℕ ¬ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) ≠ ∅ ↔ ¬ ∃𝑘 ∈ ℕ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) ≠ ∅)
6159, 60bitr3i 280 . . . . 5 (∀𝑘 ∈ ℕ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) = ∅ ↔ ¬ ∃𝑘 ∈ ℕ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) ≠ ∅)
624bcth 24029 . . . . . . 7 ((𝐷 ∈ (CMet‘𝑋) ∧ (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))):ℕ⟶(Clsd‘𝐽) ∧ ((int‘𝐽)‘ ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))) ≠ ∅) → ∃𝑘 ∈ ℕ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) ≠ ∅)
63623expia 1118 . . . . . 6 ((𝐷 ∈ (CMet‘𝑋) ∧ (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))):ℕ⟶(Clsd‘𝐽)) → (((int‘𝐽)‘ ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))) ≠ ∅ → ∃𝑘 ∈ ℕ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) ≠ ∅))
6463necon1bd 2969 . . . . 5 ((𝐷 ∈ (CMet‘𝑋) ∧ (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))):ℕ⟶(Clsd‘𝐽)) → (¬ ∃𝑘 ∈ ℕ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) ≠ ∅ → ((int‘𝐽)‘ ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))) = ∅))
6561, 64syl5bi 245 . . . 4 ((𝐷 ∈ (CMet‘𝑋) ∧ (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))):ℕ⟶(Clsd‘𝐽)) → (∀𝑘 ∈ ℕ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) = ∅ → ((int‘𝐽)‘ ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))) = ∅))
6657, 65syldan 594 . . 3 ((𝐷 ∈ (CMet‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → (∀𝑘 ∈ ℕ ((int‘𝐽)‘((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘)) = ∅ → ((int‘𝐽)‘ ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))) = ∅))
67 difeq2 4022 . . . . 5 (((int‘𝐽)‘ ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))) = ∅ → ( 𝐽 ∖ ((int‘𝐽)‘ ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))))) = ( 𝐽 ∖ ∅))
68 difexg 5197 . . . . . . . . . . . . . . . 16 (𝑋 ∈ dom ∞Met → (𝑋 ∖ (𝑀𝑥)) ∈ V)
6928, 68syl 17 . . . . . . . . . . . . . . 15 (𝐷 ∈ (∞Met‘𝑋) → (𝑋 ∖ (𝑀𝑥)) ∈ V)
7069ad2antrr 725 . . . . . . . . . . . . . 14 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑥 ∈ ℕ) → (𝑋 ∖ (𝑀𝑥)) ∈ V)
7170ralrimiva 3113 . . . . . . . . . . . . 13 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ∀𝑥 ∈ ℕ (𝑋 ∖ (𝑀𝑥)) ∈ V)
7234fnmpt 6471 . . . . . . . . . . . . 13 (∀𝑥 ∈ ℕ (𝑋 ∖ (𝑀𝑥)) ∈ V → (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))) Fn ℕ)
73 fniunfv 6998 . . . . . . . . . . . . 13 ((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))) Fn ℕ → 𝑘 ∈ ℕ ((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘) = ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))))
7471, 72, 733syl 18 . . . . . . . . . . . 12 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → 𝑘 ∈ ℕ ((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘) = ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))))
7536iuneq2dv 4907 . . . . . . . . . . . . 13 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → 𝑘 ∈ ℕ ((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘) = 𝑘 ∈ ℕ (𝑋 ∖ (𝑀𝑘)))
7633cbviunv 4929 . . . . . . . . . . . . 13 𝑥 ∈ ℕ (𝑋 ∖ (𝑀𝑥)) = 𝑘 ∈ ℕ (𝑋 ∖ (𝑀𝑘))
7775, 76eqtr4di 2811 . . . . . . . . . . . 12 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → 𝑘 ∈ ℕ ((𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))‘𝑘) = 𝑥 ∈ ℕ (𝑋 ∖ (𝑀𝑥)))
7874, 77eqtr3d 2795 . . . . . . . . . . 11 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))) = 𝑥 ∈ ℕ (𝑋 ∖ (𝑀𝑥)))
79 iundif2 4961 . . . . . . . . . . 11 𝑥 ∈ ℕ (𝑋 ∖ (𝑀𝑥)) = (𝑋 𝑥 ∈ ℕ (𝑀𝑥))
8078, 79eqtrdi 2809 . . . . . . . . . 10 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))) = (𝑋 𝑥 ∈ ℕ (𝑀𝑥)))
81 ffn 6498 . . . . . . . . . . . . 13 (𝑀:ℕ⟶𝐽𝑀 Fn ℕ)
8281adantl 485 . . . . . . . . . . . 12 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → 𝑀 Fn ℕ)
83 fniinfv 6730 . . . . . . . . . . . 12 (𝑀 Fn ℕ → 𝑥 ∈ ℕ (𝑀𝑥) = ran 𝑀)
8482, 83syl 17 . . . . . . . . . . 11 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → 𝑥 ∈ ℕ (𝑀𝑥) = ran 𝑀)
8584difeq2d 4028 . . . . . . . . . 10 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → (𝑋 𝑥 ∈ ℕ (𝑀𝑥)) = (𝑋 ran 𝑀))
8614adantr 484 . . . . . . . . . . 11 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → 𝑋 = 𝐽)
8786difeq1d 4027 . . . . . . . . . 10 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → (𝑋 ran 𝑀) = ( 𝐽 ran 𝑀))
8880, 85, 873eqtrd 2797 . . . . . . . . 9 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))) = ( 𝐽 ran 𝑀))
8988fveq2d 6662 . . . . . . . 8 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ((int‘𝐽)‘ ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))) = ((int‘𝐽)‘( 𝐽 ran 𝑀)))
9089difeq2d 4028 . . . . . . 7 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ( 𝐽 ∖ ((int‘𝐽)‘ ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))))) = ( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ran 𝑀))))
915adantr 484 . . . . . . . 8 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → 𝐽 ∈ Top)
92 1nn 11685 . . . . . . . . 9 1 ∈ ℕ
93 biidd 265 . . . . . . . . . 10 (𝑘 = 1 → (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ran 𝑀 𝐽) ↔ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ran 𝑀 𝐽)))
94 fnfvelrn 6839 . . . . . . . . . . . . . 14 ((𝑀 Fn ℕ ∧ 𝑘 ∈ ℕ) → (𝑀𝑘) ∈ ran 𝑀)
9582, 94sylan 583 . . . . . . . . . . . . 13 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → (𝑀𝑘) ∈ ran 𝑀)
96 intss1 4853 . . . . . . . . . . . . 13 ((𝑀𝑘) ∈ ran 𝑀 ran 𝑀 ⊆ (𝑀𝑘))
9795, 96syl 17 . . . . . . . . . . . 12 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → ran 𝑀 ⊆ (𝑀𝑘))
9897, 10sstrd 3902 . . . . . . . . . . 11 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) ∧ 𝑘 ∈ ℕ) → ran 𝑀 𝐽)
9998expcom 417 . . . . . . . . . 10 (𝑘 ∈ ℕ → ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ran 𝑀 𝐽))
10093, 99vtoclga 3492 . . . . . . . . 9 (1 ∈ ℕ → ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ran 𝑀 𝐽))
10192, 100ax-mp 5 . . . . . . . 8 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ran 𝑀 𝐽)
10211clsval2 21750 . . . . . . . 8 ((𝐽 ∈ Top ∧ ran 𝑀 𝐽) → ((cls‘𝐽)‘ ran 𝑀) = ( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ran 𝑀))))
10391, 101, 102syl2anc 587 . . . . . . 7 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ((cls‘𝐽)‘ ran 𝑀) = ( 𝐽 ∖ ((int‘𝐽)‘( 𝐽 ran 𝑀))))
10490, 103eqtr4d 2796 . . . . . 6 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ( 𝐽 ∖ ((int‘𝐽)‘ ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))))) = ((cls‘𝐽)‘ ran 𝑀))
105 dif0 4271 . . . . . . 7 ( 𝐽 ∖ ∅) = 𝐽
106105, 86eqtr4id 2812 . . . . . 6 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → ( 𝐽 ∖ ∅) = 𝑋)
107104, 106eqeq12d 2774 . . . . 5 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → (( 𝐽 ∖ ((int‘𝐽)‘ ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥))))) = ( 𝐽 ∖ ∅) ↔ ((cls‘𝐽)‘ ran 𝑀) = 𝑋))
10867, 107syl5ib 247 . . . 4 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → (((int‘𝐽)‘ ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))) = ∅ → ((cls‘𝐽)‘ ran 𝑀) = 𝑋))
1093, 108sylan 583 . . 3 ((𝐷 ∈ (CMet‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → (((int‘𝐽)‘ ran (𝑥 ∈ ℕ ↦ (𝑋 ∖ (𝑀𝑥)))) = ∅ → ((cls‘𝐽)‘ ran 𝑀) = 𝑋))
11045, 66, 1093syld 60 . 2 ((𝐷 ∈ (CMet‘𝑋) ∧ 𝑀:ℕ⟶𝐽) → (∀𝑘 ∈ ℕ ((cls‘𝐽)‘(𝑀𝑘)) = 𝑋 → ((cls‘𝐽)‘ ran 𝑀) = 𝑋))
1111103impia 1114 1 ((𝐷 ∈ (CMet‘𝑋) ∧ 𝑀:ℕ⟶𝐽 ∧ ∀𝑘 ∈ ℕ ((cls‘𝐽)‘(𝑀𝑘)) = 𝑋) → ((cls‘𝐽)‘ ran 𝑀) = 𝑋)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111   ≠ wne 2951  ∀wral 3070  ∃wrex 3071  Vcvv 3409   ∖ cdif 3855   ⊆ wss 3858  ∅c0 4225  ∪ cuni 4798  ∩ cint 4838  ∪ ciun 4883  ∩ ciin 4884   ↦ cmpt 5112  dom cdm 5524  ran crn 5525   Fn wfn 6330  ⟶wf 6331  ‘cfv 6335  1c1 10576  ℕcn 11674  ∞Metcxmet 20151  Metcmet 20152  MetOpencmopn 20156  Topctop 21593  Clsdccld 21716  intcnt 21717  clsccl 21718  CMetccmet 23954 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-rep 5156  ax-sep 5169  ax-nul 5176  ax-pow 5234  ax-pr 5298  ax-un 7459  ax-inf2 9137  ax-dc 9906  ax-cnex 10631  ax-resscn 10632  ax-1cn 10633  ax-icn 10634  ax-addcl 10635  ax-addrcl 10636  ax-mulcl 10637  ax-mulrcl 10638  ax-mulcom 10639  ax-addass 10640  ax-mulass 10641  ax-distr 10642  ax-i2m1 10643  ax-1ne0 10644  ax-1rid 10645  ax-rnegex 10646  ax-rrecex 10647  ax-cnre 10648  ax-pre-lttri 10649  ax-pre-lttrn 10650  ax-pre-ltadd 10651  ax-pre-mulgt0 10652  ax-pre-sup 10653 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-nel 3056  df-ral 3075  df-rex 3076  df-reu 3077  df-rmo 3078  df-rab 3079  df-v 3411  df-sbc 3697  df-csb 3806  df-dif 3861  df-un 3863  df-in 3865  df-ss 3875  df-pss 3877  df-nul 4226  df-if 4421  df-pw 4496  df-sn 4523  df-pr 4525  df-tp 4527  df-op 4529  df-uni 4799  df-int 4839  df-iun 4885  df-iin 4886  df-br 5033  df-opab 5095  df-mpt 5113  df-tr 5139  df-id 5430  df-eprel 5435  df-po 5443  df-so 5444  df-fr 5483  df-we 5485  df-xp 5530  df-rel 5531  df-cnv 5532  df-co 5533  df-dm 5534  df-rn 5535  df-res 5536  df-ima 5537  df-pred 6126  df-ord 6172  df-on 6173  df-lim 6174  df-suc 6175  df-iota 6294  df-fun 6337  df-fn 6338  df-f 6339  df-f1 6340  df-fo 6341  df-f1o 6342  df-fv 6343  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-om 7580  df-1st 7693  df-2nd 7694  df-wrecs 7957  df-recs 8018  df-rdg 8056  df-1o 8112  df-er 8299  df-map 8418  df-pm 8419  df-en 8528  df-dom 8529  df-sdom 8530  df-sup 8939  df-inf 8940  df-pnf 10715  df-mnf 10716  df-xr 10717  df-ltxr 10718  df-le 10719  df-sub 10910  df-neg 10911  df-div 11336  df-nn 11675  df-2 11737  df-n0 11935  df-z 12021  df-uz 12283  df-q 12389  df-rp 12431  df-xneg 12548  df-xadd 12549  df-xmul 12550  df-ico 12785  df-rest 16754  df-topgen 16775  df-psmet 20158  df-xmet 20159  df-met 20160  df-bl 20161  df-mopn 20162  df-fbas 20163  df-fg 20164  df-top 21594  df-topon 21611  df-bases 21646  df-cld 21719  df-ntr 21720  df-cls 21721  df-nei 21798  df-lm 21929  df-fil 22546  df-fm 22638  df-flim 22639  df-flf 22640  df-cfil 23955  df-cau 23956  df-cmet 23957 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator