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

Theorem caublcls 25301
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 2740 . 2 (ℤ𝐴) = (ℤ𝐴)
2 caubl.2 . . . 4 (𝜑𝐷 ∈ (∞Met‘𝑋))
323ad2ant1 1139 . . 3 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝐷 ∈ (∞Met‘𝑋))
4 caublcls.6 . . . 4 𝐽 = (MetOpen‘𝐷)
54mopntopon 24429 . . 3 (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋))
63, 5syl 17 . 2 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝐽 ∈ (TopOn‘𝑋))
7 simp3 1144 . . 3 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝐴 ∈ ℕ)
87nnzd 12548 . 2 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝐴 ∈ ℤ)
9 simp2 1143 . 2 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (1st𝐹)(⇝𝑡𝐽)𝑃)
10 2fveq3 6839 . . . . . . . 8 (𝑟 = 𝐴 → ((ball‘𝐷)‘(𝐹𝑟)) = ((ball‘𝐷)‘(𝐹𝐴)))
1110sseq1d 3953 . . . . . . 7 (𝑟 = 𝐴 → (((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) ↔ ((ball‘𝐷)‘(𝐹𝐴)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
1211imbi2d 341 . . . . . 6 (𝑟 = 𝐴 → (((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))) ↔ ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
13 2fveq3 6839 . . . . . . . 8 (𝑟 = 𝑘 → ((ball‘𝐷)‘(𝐹𝑟)) = ((ball‘𝐷)‘(𝐹𝑘)))
1413sseq1d 3953 . . . . . . 7 (𝑟 = 𝑘 → (((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) ↔ ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
1514imbi2d 341 . . . . . 6 (𝑟 = 𝑘 → (((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))) ↔ ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
16 2fveq3 6839 . . . . . . . 8 (𝑟 = (𝑘 + 1) → ((ball‘𝐷)‘(𝐹𝑟)) = ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))))
1716sseq1d 3953 . . . . . . 7 (𝑟 = (𝑘 + 1) → (((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) ↔ ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
1817imbi2d 341 . . . . . 6 (𝑟 = (𝑘 + 1) → (((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))) ↔ ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
19 ssid 3944 . . . . . . 7 ((ball‘𝐷)‘(𝐹𝐴)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))
20192a1i 12 . . . . . 6 (𝐴 ∈ ℤ → ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
21 caubl.4 . . . . . . . . . . 11 (𝜑 → ∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑛)))
22 eluznn 12866 . . . . . . . . . . 11 ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ𝐴)) → 𝑘 ∈ ℕ)
23 fvoveq1 7386 . . . . . . . . . . . . . 14 (𝑛 = 𝑘 → (𝐹‘(𝑛 + 1)) = (𝐹‘(𝑘 + 1)))
2423fveq2d 6838 . . . . . . . . . . . . 13 (𝑛 = 𝑘 → ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) = ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))))
25 2fveq3 6839 . . . . . . . . . . . . 13 (𝑛 = 𝑘 → ((ball‘𝐷)‘(𝐹𝑛)) = ((ball‘𝐷)‘(𝐹𝑘)))
2624, 25sseq12d 3955 . . . . . . . . . . . 12 (𝑛 = 𝑘 → (((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑛)) ↔ ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘))))
2726rspccva 3566 . . . . . . . . . . 11 ((∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑛)) ∧ 𝑘 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘)))
2821, 22, 27syl2an 602 . . . . . . . . . 10 ((𝜑 ∧ (𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ𝐴))) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘)))
2928anassrs 468 . . . . . . . . 9 (((𝜑𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘)))
30 sstr2 3929 . . . . . . . . 9 (((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘)) → (((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
3129, 30syl 17 . . . . . . . 8 (((𝜑𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
3231expcom 414 . . . . . . 7 (𝑘 ∈ (ℤ𝐴) → ((𝜑𝐴 ∈ ℕ) → (((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
3332a2d 29 . . . . . 6 (𝑘 ∈ (ℤ𝐴) → (((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))) → ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
3412, 15, 18, 15, 20, 33uzind4 12854 . . . . 5 (𝑘 ∈ (ℤ𝐴) → ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
3534impcom 408 . . . 4 (((𝜑𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))
36353adantl2 1174 . . 3 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))
373adantr 481 . . . . 5 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → 𝐷 ∈ (∞Met‘𝑋))
38 simpl1 1198 . . . . . . . 8 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → 𝜑)
39 caubl.3 . . . . . . . 8 (𝜑𝐹:ℕ⟶(𝑋 × ℝ+))
4038, 39syl 17 . . . . . . 7 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → 𝐹:ℕ⟶(𝑋 × ℝ+))
41223ad2antl3 1194 . . . . . . 7 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → 𝑘 ∈ ℕ)
4240, 41ffvelcdmd 7033 . . . . . 6 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (𝐹𝑘) ∈ (𝑋 × ℝ+))
43 xp1st 7970 . . . . . 6 ((𝐹𝑘) ∈ (𝑋 × ℝ+) → (1st ‘(𝐹𝑘)) ∈ 𝑋)
4442, 43syl 17 . . . . 5 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (1st ‘(𝐹𝑘)) ∈ 𝑋)
45 xp2nd 7971 . . . . . 6 ((𝐹𝑘) ∈ (𝑋 × ℝ+) → (2nd ‘(𝐹𝑘)) ∈ ℝ+)
4642, 45syl 17 . . . . 5 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (2nd ‘(𝐹𝑘)) ∈ ℝ+)
47 blcntr 24403 . . . . 5 ((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝐹𝑘)) ∈ 𝑋 ∧ (2nd ‘(𝐹𝑘)) ∈ ℝ+) → (1st ‘(𝐹𝑘)) ∈ ((1st ‘(𝐹𝑘))(ball‘𝐷)(2nd ‘(𝐹𝑘))))
4837, 44, 46, 47syl3anc 1379 . . . 4 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (1st ‘(𝐹𝑘)) ∈ ((1st ‘(𝐹𝑘))(ball‘𝐷)(2nd ‘(𝐹𝑘))))
49 fvco3 6934 . . . . 5 ((𝐹:ℕ⟶(𝑋 × ℝ+) ∧ 𝑘 ∈ ℕ) → ((1st𝐹)‘𝑘) = (1st ‘(𝐹𝑘)))
5040, 41, 49syl2anc 590 . . . 4 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((1st𝐹)‘𝑘) = (1st ‘(𝐹𝑘)))
51 1st2nd2 7977 . . . . . . 7 ((𝐹𝑘) ∈ (𝑋 × ℝ+) → (𝐹𝑘) = ⟨(1st ‘(𝐹𝑘)), (2nd ‘(𝐹𝑘))⟩)
5242, 51syl 17 . . . . . 6 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (𝐹𝑘) = ⟨(1st ‘(𝐹𝑘)), (2nd ‘(𝐹𝑘))⟩)
5352fveq2d 6838 . . . . 5 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹𝑘)) = ((ball‘𝐷)‘⟨(1st ‘(𝐹𝑘)), (2nd ‘(𝐹𝑘))⟩))
54 df-ov 7366 . . . . 5 ((1st ‘(𝐹𝑘))(ball‘𝐷)(2nd ‘(𝐹𝑘))) = ((ball‘𝐷)‘⟨(1st ‘(𝐹𝑘)), (2nd ‘(𝐹𝑘))⟩)
5553, 54eqtr4di 2793 . . . 4 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹𝑘)) = ((1st ‘(𝐹𝑘))(ball‘𝐷)(2nd ‘(𝐹𝑘))))
5648, 50, 553eltr4d 2855 . . 3 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((1st𝐹)‘𝑘) ∈ ((ball‘𝐷)‘(𝐹𝑘)))
5736, 56sseldd 3923 . 2 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((1st𝐹)‘𝑘) ∈ ((ball‘𝐷)‘(𝐹𝐴)))
5839ffvelcdmda 7032 . . . . . . 7 ((𝜑𝐴 ∈ ℕ) → (𝐹𝐴) ∈ (𝑋 × ℝ+))
59583adant2 1137 . . . . . 6 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (𝐹𝐴) ∈ (𝑋 × ℝ+))
60 1st2nd2 7977 . . . . . 6 ((𝐹𝐴) ∈ (𝑋 × ℝ+) → (𝐹𝐴) = ⟨(1st ‘(𝐹𝐴)), (2nd ‘(𝐹𝐴))⟩)
6159, 60syl 17 . . . . 5 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (𝐹𝐴) = ⟨(1st ‘(𝐹𝐴)), (2nd ‘(𝐹𝐴))⟩)
6261fveq2d 6838 . . . 4 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) = ((ball‘𝐷)‘⟨(1st ‘(𝐹𝐴)), (2nd ‘(𝐹𝐴))⟩))
63 df-ov 7366 . . . 4 ((1st ‘(𝐹𝐴))(ball‘𝐷)(2nd ‘(𝐹𝐴))) = ((ball‘𝐷)‘⟨(1st ‘(𝐹𝐴)), (2nd ‘(𝐹𝐴))⟩)
6462, 63eqtr4di 2793 . . 3 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) = ((1st ‘(𝐹𝐴))(ball‘𝐷)(2nd ‘(𝐹𝐴))))
65 xp1st 7970 . . . . 5 ((𝐹𝐴) ∈ (𝑋 × ℝ+) → (1st ‘(𝐹𝐴)) ∈ 𝑋)
6659, 65syl 17 . . . 4 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (1st ‘(𝐹𝐴)) ∈ 𝑋)
67 xp2nd 7971 . . . . . 6 ((𝐹𝐴) ∈ (𝑋 × ℝ+) → (2nd ‘(𝐹𝐴)) ∈ ℝ+)
6859, 67syl 17 . . . . 5 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (2nd ‘(𝐹𝐴)) ∈ ℝ+)
6968rpxrd 12985 . . . 4 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (2nd ‘(𝐹𝐴)) ∈ ℝ*)
70 blssm 24408 . . . 4 ((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝐹𝐴)) ∈ 𝑋 ∧ (2nd ‘(𝐹𝐴)) ∈ ℝ*) → ((1st ‘(𝐹𝐴))(ball‘𝐷)(2nd ‘(𝐹𝐴))) ⊆ 𝑋)
713, 66, 69, 70syl3anc 1379 . . 3 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → ((1st ‘(𝐹𝐴))(ball‘𝐷)(2nd ‘(𝐹𝐴))) ⊆ 𝑋)
7264, 71eqsstrd 3956 . 2 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) ⊆ 𝑋)
731, 6, 8, 9, 57, 72lmcls 23292 1 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝑃 ∈ ((cls‘𝐽)‘((ball‘𝐷)‘(𝐹𝐴))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1092   = wceq 1547  wcel 2119  wral 3054  wss 3890  cop 4568   class class class wbr 5079   × cxp 5623  ccom 5629  wf 6488  cfv 6492  (class class class)co 7363  1st c1st 7936  2nd c2nd 7937  1c1 11037   + caddc 11039  *cxr 11176  cn 12172  cz 12522  cuz 12786  +crp 12940  ∞Metcxmet 21339  ballcbl 21341  MetOpencmopn 21344  TopOnctopon 22900  clsccl 23008  𝑡clm 23216
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685  ax-cnex 11092  ax-resscn 11093  ax-1cn 11094  ax-icn 11095  ax-addcl 11096  ax-addrcl 11097  ax-mulcl 11098  ax-mulrcl 11099  ax-mulcom 11100  ax-addass 11101  ax-mulass 11102  ax-distr 11103  ax-i2m1 11104  ax-1ne0 11105  ax-1rid 11106  ax-rnegex 11107  ax-rrecex 11108  ax-cnre 11109  ax-pre-lttri 11110  ax-pre-lttrn 11111  ax-pre-ltadd 11112  ax-pre-mulgt0 11113  ax-pre-sup 11114
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-nel 3040  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-int 4885  df-iun 4930  df-iin 4931  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366  df-oprab 7367  df-mpo 7368  df-om 7814  df-1st 7938  df-2nd 7939  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-rdg 8346  df-er 8640  df-map 8772  df-pm 8773  df-en 8891  df-dom 8892  df-sdom 8893  df-sup 9352  df-inf 9353  df-pnf 11179  df-mnf 11180  df-xr 11181  df-ltxr 11182  df-le 11183  df-sub 11377  df-neg 11378  df-div 11806  df-nn 12173  df-2 12242  df-n0 12436  df-z 12523  df-uz 12787  df-q 12897  df-rp 12941  df-xneg 13061  df-xadd 13062  df-xmul 13063  df-topgen 17404  df-psmet 21346  df-xmet 21347  df-bl 21349  df-mopn 21350  df-top 22884  df-topon 22901  df-bases 22936  df-cld 23009  df-ntr 23010  df-cls 23011  df-lm 23219
This theorem is referenced by:  bcthlem3  25318  heiborlem8  38192
  Copyright terms: Public domain W3C validator