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

Theorem caublcls 25340
Description: The convergent point of a sequence of nested balls is in the closures of any of the balls (i.e. it is in the intersection of the closures). Indeed, it is the only point in the intersection because a metric space is Hausdorff, but we don't prove this here. (Contributed by Mario Carneiro, 21-Jan-2014.) (Revised by Mario Carneiro, 1-May-2014.)
Hypotheses
Ref Expression
caubl.2 (𝜑𝐷 ∈ (∞Met‘𝑋))
caubl.3 (𝜑𝐹:ℕ⟶(𝑋 × ℝ+))
caubl.4 (𝜑 → ∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑛)))
caublcls.6 𝐽 = (MetOpen‘𝐷)
Assertion
Ref Expression
caublcls ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝑃 ∈ ((cls‘𝐽)‘((ball‘𝐷)‘(𝐹𝐴))))
Distinct variable groups:   𝐷,𝑛   𝑛,𝐹   𝑛,𝑋
Allowed substitution hints:   𝜑(𝑛)   𝐴(𝑛)   𝑃(𝑛)   𝐽(𝑛)

Proof of Theorem caublcls
Dummy variables 𝑘 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2752 . 2 (ℤ𝐴) = (ℤ𝐴)
2 caubl.2 . . . 4 (𝜑𝐷 ∈ (∞Met‘𝑋))
323ad2ant1 1142 . . 3 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝐷 ∈ (∞Met‘𝑋))
4 caublcls.6 . . . 4 𝐽 = (MetOpen‘𝐷)
54mopntopon 24468 . . 3 (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋))
63, 5syl 17 . 2 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝐽 ∈ (TopOn‘𝑋))
7 simp3 1147 . . 3 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝐴 ∈ ℕ)
87nnzd 12580 . 2 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝐴 ∈ ℤ)
9 simp2 1146 . 2 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (1st𝐹)(⇝𝑡𝐽)𝑃)
10 2fveq3 6857 . . . . . . . 8 (𝑟 = 𝐴 → ((ball‘𝐷)‘(𝐹𝑟)) = ((ball‘𝐷)‘(𝐹𝐴)))
1110sseq1d 3958 . . . . . . 7 (𝑟 = 𝐴 → (((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) ↔ ((ball‘𝐷)‘(𝐹𝐴)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
1211imbi2d 342 . . . . . 6 (𝑟 = 𝐴 → (((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))) ↔ ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
13 2fveq3 6857 . . . . . . . 8 (𝑟 = 𝑘 → ((ball‘𝐷)‘(𝐹𝑟)) = ((ball‘𝐷)‘(𝐹𝑘)))
1413sseq1d 3958 . . . . . . 7 (𝑟 = 𝑘 → (((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) ↔ ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
1514imbi2d 342 . . . . . 6 (𝑟 = 𝑘 → (((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))) ↔ ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
16 2fveq3 6857 . . . . . . . 8 (𝑟 = (𝑘 + 1) → ((ball‘𝐷)‘(𝐹𝑟)) = ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))))
1716sseq1d 3958 . . . . . . 7 (𝑟 = (𝑘 + 1) → (((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) ↔ ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
1817imbi2d 342 . . . . . 6 (𝑟 = (𝑘 + 1) → (((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))) ↔ ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
19 ssid 3949 . . . . . . 7 ((ball‘𝐷)‘(𝐹𝐴)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))
20192a1i 12 . . . . . 6 (𝐴 ∈ ℤ → ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
21 caubl.4 . . . . . . . . . . 11 (𝜑 → ∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑛)))
22 eluznn 12905 . . . . . . . . . . 11 ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ𝐴)) → 𝑘 ∈ ℕ)
23 fvoveq1 7404 . . . . . . . . . . . . . 14 (𝑛 = 𝑘 → (𝐹‘(𝑛 + 1)) = (𝐹‘(𝑘 + 1)))
2423fveq2d 6856 . . . . . . . . . . . . 13 (𝑛 = 𝑘 → ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) = ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))))
25 2fveq3 6857 . . . . . . . . . . . . 13 (𝑛 = 𝑘 → ((ball‘𝐷)‘(𝐹𝑛)) = ((ball‘𝐷)‘(𝐹𝑘)))
2624, 25sseq12d 3960 . . . . . . . . . . . 12 (𝑛 = 𝑘 → (((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑛)) ↔ ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘))))
2726rspccva 3571 . . . . . . . . . . 11 ((∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑛)) ∧ 𝑘 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘)))
2821, 22, 27syl2an 604 . . . . . . . . . 10 ((𝜑 ∧ (𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ𝐴))) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘)))
2928anassrs 470 . . . . . . . . 9 (((𝜑𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘)))
30 sstr2 3934 . . . . . . . . 9 (((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘)) → (((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
3129, 30syl 17 . . . . . . . 8 (((𝜑𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
3231expcom 416 . . . . . . 7 (𝑘 ∈ (ℤ𝐴) → ((𝜑𝐴 ∈ ℕ) → (((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
3332a2d 29 . . . . . 6 (𝑘 ∈ (ℤ𝐴) → (((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))) → ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
3412, 15, 18, 15, 20, 33uzind4 12893 . . . . 5 (𝑘 ∈ (ℤ𝐴) → ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
3534impcom 410 . . . 4 (((𝜑𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))
36353adantl2 1177 . . 3 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))
373adantr 483 . . . . 5 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → 𝐷 ∈ (∞Met‘𝑋))
38 simpl1 1201 . . . . . . . 8 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → 𝜑)
39 caubl.3 . . . . . . . 8 (𝜑𝐹:ℕ⟶(𝑋 × ℝ+))
4038, 39syl 17 . . . . . . 7 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → 𝐹:ℕ⟶(𝑋 × ℝ+))
41223ad2antl3 1197 . . . . . . 7 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → 𝑘 ∈ ℕ)
4240, 41ffvelcdmd 7051 . . . . . 6 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (𝐹𝑘) ∈ (𝑋 × ℝ+))
43 xp1st 7987 . . . . . 6 ((𝐹𝑘) ∈ (𝑋 × ℝ+) → (1st ‘(𝐹𝑘)) ∈ 𝑋)
4442, 43syl 17 . . . . 5 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (1st ‘(𝐹𝑘)) ∈ 𝑋)
45 xp2nd 7988 . . . . . 6 ((𝐹𝑘) ∈ (𝑋 × ℝ+) → (2nd ‘(𝐹𝑘)) ∈ ℝ+)
4642, 45syl 17 . . . . 5 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (2nd ‘(𝐹𝑘)) ∈ ℝ+)
47 blcntr 24442 . . . . 5 ((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝐹𝑘)) ∈ 𝑋 ∧ (2nd ‘(𝐹𝑘)) ∈ ℝ+) → (1st ‘(𝐹𝑘)) ∈ ((1st ‘(𝐹𝑘))(ball‘𝐷)(2nd ‘(𝐹𝑘))))
4837, 44, 46, 47syl3anc 1382 . . . 4 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (1st ‘(𝐹𝑘)) ∈ ((1st ‘(𝐹𝑘))(ball‘𝐷)(2nd ‘(𝐹𝑘))))
49 fvco3 6952 . . . . 5 ((𝐹:ℕ⟶(𝑋 × ℝ+) ∧ 𝑘 ∈ ℕ) → ((1st𝐹)‘𝑘) = (1st ‘(𝐹𝑘)))
5040, 41, 49syl2anc 592 . . . 4 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((1st𝐹)‘𝑘) = (1st ‘(𝐹𝑘)))
51 1st2nd2 7994 . . . . . . 7 ((𝐹𝑘) ∈ (𝑋 × ℝ+) → (𝐹𝑘) = ⟨(1st ‘(𝐹𝑘)), (2nd ‘(𝐹𝑘))⟩)
5242, 51syl 17 . . . . . 6 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (𝐹𝑘) = ⟨(1st ‘(𝐹𝑘)), (2nd ‘(𝐹𝑘))⟩)
5352fveq2d 6856 . . . . 5 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹𝑘)) = ((ball‘𝐷)‘⟨(1st ‘(𝐹𝑘)), (2nd ‘(𝐹𝑘))⟩))
54 df-ov 7384 . . . . 5 ((1st ‘(𝐹𝑘))(ball‘𝐷)(2nd ‘(𝐹𝑘))) = ((ball‘𝐷)‘⟨(1st ‘(𝐹𝑘)), (2nd ‘(𝐹𝑘))⟩)
5553, 54eqtr4di 2805 . . . 4 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹𝑘)) = ((1st ‘(𝐹𝑘))(ball‘𝐷)(2nd ‘(𝐹𝑘))))
5648, 50, 553eltr4d 2867 . . 3 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((1st𝐹)‘𝑘) ∈ ((ball‘𝐷)‘(𝐹𝑘)))
5736, 56sseldd 3928 . 2 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((1st𝐹)‘𝑘) ∈ ((ball‘𝐷)‘(𝐹𝐴)))
5839ffvelcdmda 7050 . . . . . . 7 ((𝜑𝐴 ∈ ℕ) → (𝐹𝐴) ∈ (𝑋 × ℝ+))
59583adant2 1140 . . . . . 6 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (𝐹𝐴) ∈ (𝑋 × ℝ+))
60 1st2nd2 7994 . . . . . 6 ((𝐹𝐴) ∈ (𝑋 × ℝ+) → (𝐹𝐴) = ⟨(1st ‘(𝐹𝐴)), (2nd ‘(𝐹𝐴))⟩)
6159, 60syl 17 . . . . 5 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (𝐹𝐴) = ⟨(1st ‘(𝐹𝐴)), (2nd ‘(𝐹𝐴))⟩)
6261fveq2d 6856 . . . 4 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) = ((ball‘𝐷)‘⟨(1st ‘(𝐹𝐴)), (2nd ‘(𝐹𝐴))⟩))
63 df-ov 7384 . . . 4 ((1st ‘(𝐹𝐴))(ball‘𝐷)(2nd ‘(𝐹𝐴))) = ((ball‘𝐷)‘⟨(1st ‘(𝐹𝐴)), (2nd ‘(𝐹𝐴))⟩)
6462, 63eqtr4di 2805 . . 3 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) = ((1st ‘(𝐹𝐴))(ball‘𝐷)(2nd ‘(𝐹𝐴))))
65 xp1st 7987 . . . . 5 ((𝐹𝐴) ∈ (𝑋 × ℝ+) → (1st ‘(𝐹𝐴)) ∈ 𝑋)
6659, 65syl 17 . . . 4 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (1st ‘(𝐹𝐴)) ∈ 𝑋)
67 xp2nd 7988 . . . . . 6 ((𝐹𝐴) ∈ (𝑋 × ℝ+) → (2nd ‘(𝐹𝐴)) ∈ ℝ+)
6859, 67syl 17 . . . . 5 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (2nd ‘(𝐹𝐴)) ∈ ℝ+)
6968rpxrd 13024 . . . 4 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (2nd ‘(𝐹𝐴)) ∈ ℝ*)
70 blssm 24447 . . . 4 ((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝐹𝐴)) ∈ 𝑋 ∧ (2nd ‘(𝐹𝐴)) ∈ ℝ*) → ((1st ‘(𝐹𝐴))(ball‘𝐷)(2nd ‘(𝐹𝐴))) ⊆ 𝑋)
713, 66, 69, 70syl3anc 1382 . . 3 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → ((1st ‘(𝐹𝐴))(ball‘𝐷)(2nd ‘(𝐹𝐴))) ⊆ 𝑋)
7264, 71eqsstrd 3961 . 2 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) ⊆ 𝑋)
731, 6, 8, 9, 57, 72lmcls 23331 1 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝑃 ∈ ((cls‘𝐽)‘((ball‘𝐷)‘(𝐹𝐴))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1095   = wceq 1550  wcel 2132  wral 3066  wss 3895  cop 4578   class class class wbr 5090   × cxp 5634  ccom 5640  wf 6502  cfv 6506  (class class class)co 7381  1st c1st 7953  2nd c2nd 7954  1c1 11060   + caddc 11062  *cxr 11201  cn 12196  cz 12554  cuz 12825  +crp 12979  ∞Metcxmet 21378  ballcbl 21380  MetOpencmopn 21383  TopOnctopon 22939  clsccl 23047  𝑡clm 23255
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-rep 5217  ax-sep 5236  ax-nul 5246  ax-pow 5312  ax-pr 5380  ax-un 7703  ax-cnex 11115  ax-resscn 11116  ax-1cn 11117  ax-icn 11118  ax-addcl 11119  ax-addrcl 11120  ax-mulcl 11121  ax-mulrcl 11122  ax-mulcom 11123  ax-addass 11124  ax-mulass 11125  ax-distr 11126  ax-i2m1 11127  ax-1ne0 11128  ax-1rid 11129  ax-rnegex 11130  ax-rrecex 11131  ax-cnre 11132  ax-pre-lttri 11133  ax-pre-lttrn 11134  ax-pre-ltadd 11135  ax-pre-mulgt0 11136  ax-pre-sup 11137
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3or 1096  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-nel 3052  df-ral 3067  df-rex 3077  df-rmo 3357  df-reu 3358  df-rab 3405  df-v 3446  df-sbc 3736  df-csb 3844  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-pss 3915  df-nul 4277  df-if 4471  df-pw 4547  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4856  df-int 4896  df-iun 4941  df-iin 4942  df-br 5091  df-opab 5153  df-mpt 5172  df-tr 5198  df-id 5531  df-eprel 5536  df-po 5544  df-so 5545  df-fr 5589  df-we 5591  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-pred 6273  df-ord 6334  df-on 6335  df-lim 6336  df-suc 6337  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-f1 6511  df-fo 6512  df-f1o 6513  df-fv 6514  df-riota 7338  df-ov 7384  df-oprab 7385  df-mpo 7386  df-om 7832  df-1st 7955  df-2nd 7956  df-frecs 8246  df-wrecs 8277  df-recs 8326  df-rdg 8365  df-er 8662  df-map 8794  df-pm 8795  df-en 8913  df-dom 8914  df-sdom 8915  df-sup 9374  df-inf 9375  df-pnf 11204  df-mnf 11205  df-xr 11206  df-ltxr 11207  df-le 11208  df-sub 11402  df-neg 11403  df-div 11831  df-nn 12197  df-2 12266  df-n0 12468  df-z 12555  df-uz 12826  df-q 12936  df-rp 12980  df-xneg 13100  df-xadd 13101  df-xmul 13102  df-topgen 17444  df-psmet 21385  df-xmet 21386  df-bl 21388  df-mopn 21389  df-top 22923  df-topon 22940  df-bases 22975  df-cld 23048  df-ntr 23049  df-cls 23050  df-lm 23258
This theorem is referenced by:  bcthlem3  25357  heiborlem8  38255
  Copyright terms: Public domain W3C validator