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

Theorem caublcls 25276
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 2736 . 2 (ℤ𝐴) = (ℤ𝐴)
2 caubl.2 . . . 4 (𝜑𝐷 ∈ (∞Met‘𝑋))
323ad2ant1 1134 . . 3 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝐷 ∈ (∞Met‘𝑋))
4 caublcls.6 . . . 4 𝐽 = (MetOpen‘𝐷)
54mopntopon 24404 . . 3 (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋))
63, 5syl 17 . 2 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝐽 ∈ (TopOn‘𝑋))
7 simp3 1139 . . 3 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝐴 ∈ ℕ)
87nnzd 12550 . 2 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝐴 ∈ ℤ)
9 simp2 1138 . 2 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (1st𝐹)(⇝𝑡𝐽)𝑃)
10 2fveq3 6845 . . . . . . . 8 (𝑟 = 𝐴 → ((ball‘𝐷)‘(𝐹𝑟)) = ((ball‘𝐷)‘(𝐹𝐴)))
1110sseq1d 3953 . . . . . . 7 (𝑟 = 𝐴 → (((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) ↔ ((ball‘𝐷)‘(𝐹𝐴)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
1211imbi2d 340 . . . . . 6 (𝑟 = 𝐴 → (((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))) ↔ ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
13 2fveq3 6845 . . . . . . . 8 (𝑟 = 𝑘 → ((ball‘𝐷)‘(𝐹𝑟)) = ((ball‘𝐷)‘(𝐹𝑘)))
1413sseq1d 3953 . . . . . . 7 (𝑟 = 𝑘 → (((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) ↔ ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
1514imbi2d 340 . . . . . 6 (𝑟 = 𝑘 → (((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))) ↔ ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
16 2fveq3 6845 . . . . . . . 8 (𝑟 = (𝑘 + 1) → ((ball‘𝐷)‘(𝐹𝑟)) = ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))))
1716sseq1d 3953 . . . . . . 7 (𝑟 = (𝑘 + 1) → (((ball‘𝐷)‘(𝐹𝑟)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) ↔ ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
1817imbi2d 340 . . . . . 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 12868 . . . . . . . . . . 11 ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ𝐴)) → 𝑘 ∈ ℕ)
23 fvoveq1 7390 . . . . . . . . . . . . . 14 (𝑛 = 𝑘 → (𝐹‘(𝑛 + 1)) = (𝐹‘(𝑘 + 1)))
2423fveq2d 6844 . . . . . . . . . . . . 13 (𝑛 = 𝑘 → ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) = ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))))
25 2fveq3 6845 . . . . . . . . . . . . 13 (𝑛 = 𝑘 → ((ball‘𝐷)‘(𝐹𝑛)) = ((ball‘𝐷)‘(𝐹𝑘)))
2624, 25sseq12d 3955 . . . . . . . . . . . 12 (𝑛 = 𝑘 → (((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑛)) ↔ ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘))))
2726rspccva 3563 . . . . . . . . . . 11 ((∀𝑛 ∈ ℕ ((ball‘𝐷)‘(𝐹‘(𝑛 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑛)) ∧ 𝑘 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘)))
2821, 22, 27syl2an 597 . . . . . . . . . 10 ((𝜑 ∧ (𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ𝐴))) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘)))
2928anassrs 467 . . . . . . . . 9 (((𝜑𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘)))
30 sstr2 3928 . . . . . . . . 9 (((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝑘)) → (((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
3129, 30syl 17 . . . . . . . 8 (((𝜑𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
3231expcom 413 . . . . . . 7 (𝑘 ∈ (ℤ𝐴) → ((𝜑𝐴 ∈ ℕ) → (((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
3332a2d 29 . . . . . 6 (𝑘 ∈ (ℤ𝐴) → (((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))) → ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹‘(𝑘 + 1))) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))))
3412, 15, 18, 15, 20, 33uzind4 12856 . . . . 5 (𝑘 ∈ (ℤ𝐴) → ((𝜑𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴))))
3534impcom 407 . . . 4 (((𝜑𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))
36353adantl2 1169 . . 3 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹𝑘)) ⊆ ((ball‘𝐷)‘(𝐹𝐴)))
373adantr 480 . . . . 5 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → 𝐷 ∈ (∞Met‘𝑋))
38 simpl1 1193 . . . . . . . 8 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → 𝜑)
39 caubl.3 . . . . . . . 8 (𝜑𝐹:ℕ⟶(𝑋 × ℝ+))
4038, 39syl 17 . . . . . . 7 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → 𝐹:ℕ⟶(𝑋 × ℝ+))
41223ad2antl3 1189 . . . . . . 7 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → 𝑘 ∈ ℕ)
4240, 41ffvelcdmd 7037 . . . . . 6 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (𝐹𝑘) ∈ (𝑋 × ℝ+))
43 xp1st 7974 . . . . . 6 ((𝐹𝑘) ∈ (𝑋 × ℝ+) → (1st ‘(𝐹𝑘)) ∈ 𝑋)
4442, 43syl 17 . . . . 5 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (1st ‘(𝐹𝑘)) ∈ 𝑋)
45 xp2nd 7975 . . . . . 6 ((𝐹𝑘) ∈ (𝑋 × ℝ+) → (2nd ‘(𝐹𝑘)) ∈ ℝ+)
4642, 45syl 17 . . . . 5 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (2nd ‘(𝐹𝑘)) ∈ ℝ+)
47 blcntr 24378 . . . . 5 ((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝐹𝑘)) ∈ 𝑋 ∧ (2nd ‘(𝐹𝑘)) ∈ ℝ+) → (1st ‘(𝐹𝑘)) ∈ ((1st ‘(𝐹𝑘))(ball‘𝐷)(2nd ‘(𝐹𝑘))))
4837, 44, 46, 47syl3anc 1374 . . . 4 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (1st ‘(𝐹𝑘)) ∈ ((1st ‘(𝐹𝑘))(ball‘𝐷)(2nd ‘(𝐹𝑘))))
49 fvco3 6939 . . . . 5 ((𝐹:ℕ⟶(𝑋 × ℝ+) ∧ 𝑘 ∈ ℕ) → ((1st𝐹)‘𝑘) = (1st ‘(𝐹𝑘)))
5040, 41, 49syl2anc 585 . . . 4 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((1st𝐹)‘𝑘) = (1st ‘(𝐹𝑘)))
51 1st2nd2 7981 . . . . . . 7 ((𝐹𝑘) ∈ (𝑋 × ℝ+) → (𝐹𝑘) = ⟨(1st ‘(𝐹𝑘)), (2nd ‘(𝐹𝑘))⟩)
5242, 51syl 17 . . . . . 6 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → (𝐹𝑘) = ⟨(1st ‘(𝐹𝑘)), (2nd ‘(𝐹𝑘))⟩)
5352fveq2d 6844 . . . . 5 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹𝑘)) = ((ball‘𝐷)‘⟨(1st ‘(𝐹𝑘)), (2nd ‘(𝐹𝑘))⟩))
54 df-ov 7370 . . . . 5 ((1st ‘(𝐹𝑘))(ball‘𝐷)(2nd ‘(𝐹𝑘))) = ((ball‘𝐷)‘⟨(1st ‘(𝐹𝑘)), (2nd ‘(𝐹𝑘))⟩)
5553, 54eqtr4di 2789 . . . 4 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((ball‘𝐷)‘(𝐹𝑘)) = ((1st ‘(𝐹𝑘))(ball‘𝐷)(2nd ‘(𝐹𝑘))))
5648, 50, 553eltr4d 2851 . . 3 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((1st𝐹)‘𝑘) ∈ ((ball‘𝐷)‘(𝐹𝑘)))
5736, 56sseldd 3922 . 2 (((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) ∧ 𝑘 ∈ (ℤ𝐴)) → ((1st𝐹)‘𝑘) ∈ ((ball‘𝐷)‘(𝐹𝐴)))
5839ffvelcdmda 7036 . . . . . . 7 ((𝜑𝐴 ∈ ℕ) → (𝐹𝐴) ∈ (𝑋 × ℝ+))
59583adant2 1132 . . . . . 6 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (𝐹𝐴) ∈ (𝑋 × ℝ+))
60 1st2nd2 7981 . . . . . 6 ((𝐹𝐴) ∈ (𝑋 × ℝ+) → (𝐹𝐴) = ⟨(1st ‘(𝐹𝐴)), (2nd ‘(𝐹𝐴))⟩)
6159, 60syl 17 . . . . 5 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (𝐹𝐴) = ⟨(1st ‘(𝐹𝐴)), (2nd ‘(𝐹𝐴))⟩)
6261fveq2d 6844 . . . 4 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) = ((ball‘𝐷)‘⟨(1st ‘(𝐹𝐴)), (2nd ‘(𝐹𝐴))⟩))
63 df-ov 7370 . . . 4 ((1st ‘(𝐹𝐴))(ball‘𝐷)(2nd ‘(𝐹𝐴))) = ((ball‘𝐷)‘⟨(1st ‘(𝐹𝐴)), (2nd ‘(𝐹𝐴))⟩)
6462, 63eqtr4di 2789 . . 3 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) = ((1st ‘(𝐹𝐴))(ball‘𝐷)(2nd ‘(𝐹𝐴))))
65 xp1st 7974 . . . . 5 ((𝐹𝐴) ∈ (𝑋 × ℝ+) → (1st ‘(𝐹𝐴)) ∈ 𝑋)
6659, 65syl 17 . . . 4 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (1st ‘(𝐹𝐴)) ∈ 𝑋)
67 xp2nd 7975 . . . . . 6 ((𝐹𝐴) ∈ (𝑋 × ℝ+) → (2nd ‘(𝐹𝐴)) ∈ ℝ+)
6859, 67syl 17 . . . . 5 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (2nd ‘(𝐹𝐴)) ∈ ℝ+)
6968rpxrd 12987 . . . 4 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → (2nd ‘(𝐹𝐴)) ∈ ℝ*)
70 blssm 24383 . . . 4 ((𝐷 ∈ (∞Met‘𝑋) ∧ (1st ‘(𝐹𝐴)) ∈ 𝑋 ∧ (2nd ‘(𝐹𝐴)) ∈ ℝ*) → ((1st ‘(𝐹𝐴))(ball‘𝐷)(2nd ‘(𝐹𝐴))) ⊆ 𝑋)
713, 66, 69, 70syl3anc 1374 . . 3 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → ((1st ‘(𝐹𝐴))(ball‘𝐷)(2nd ‘(𝐹𝐴))) ⊆ 𝑋)
7264, 71eqsstrd 3956 . 2 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → ((ball‘𝐷)‘(𝐹𝐴)) ⊆ 𝑋)
731, 6, 8, 9, 57, 72lmcls 23267 1 ((𝜑 ∧ (1st𝐹)(⇝𝑡𝐽)𝑃𝐴 ∈ ℕ) → 𝑃 ∈ ((cls‘𝐽)‘((ball‘𝐷)‘(𝐹𝐴))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3051  wss 3889  cop 4573   class class class wbr 5085   × cxp 5629  ccom 5635  wf 6494  cfv 6498  (class class class)co 7367  1st c1st 7940  2nd c2nd 7941  1c1 11039   + caddc 11041  *cxr 11178  cn 12174  cz 12524  cuz 12788  +crp 12942  ∞Metcxmet 21337  ballcbl 21339  MetOpencmopn 21342  TopOnctopon 22875  clsccl 22983  𝑡clm 23191
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115  ax-pre-sup 11116
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-iin 4936  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-er 8643  df-map 8775  df-pm 8776  df-en 8894  df-dom 8895  df-sdom 8896  df-sup 9355  df-inf 9356  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-div 11808  df-nn 12175  df-2 12244  df-n0 12438  df-z 12525  df-uz 12789  df-q 12899  df-rp 12943  df-xneg 13063  df-xadd 13064  df-xmul 13065  df-topgen 17406  df-psmet 21344  df-xmet 21345  df-bl 21347  df-mopn 21348  df-top 22859  df-topon 22876  df-bases 22911  df-cld 22984  df-ntr 22985  df-cls 22986  df-lm 23194
This theorem is referenced by:  bcthlem3  25293  heiborlem8  38139
  Copyright terms: Public domain W3C validator