Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sstotbnd3 Structured version   Visualization version   GIF version

Theorem sstotbnd3 35214
Description: Use a net that is not necessarily finite, but for which only finitely many balls meet the subset. (Contributed by Mario Carneiro, 14-Sep-2015.)
Hypothesis
Ref Expression
sstotbnd.2 𝑁 = (𝑀 ↾ (𝑌 × 𝑌))
Assertion
Ref Expression
sstotbnd3 ((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) → (𝑁 ∈ (TotBnd‘𝑌) ↔ ∀𝑑 ∈ ℝ+𝑣 ∈ 𝒫 𝑋(𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)))
Distinct variable groups:   𝑣,𝑑,𝑥,𝑀   𝑋,𝑑,𝑣,𝑥   𝑁,𝑑,𝑣,𝑥   𝑌,𝑑,𝑣,𝑥

Proof of Theorem sstotbnd3
Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sstotbnd.2 . . . 4 𝑁 = (𝑀 ↾ (𝑌 × 𝑌))
21sstotbnd2 35212 . . 3 ((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) → (𝑁 ∈ (TotBnd‘𝑌) ↔ ∀𝑑 ∈ ℝ+𝑣 ∈ (𝒫 𝑋 ∩ Fin)𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑)))
3 elin 3897 . . . . . . . . 9 (𝑣 ∈ (𝒫 𝑋 ∩ Fin) ↔ (𝑣 ∈ 𝒫 𝑋𝑣 ∈ Fin))
4 rabfi 8727 . . . . . . . . . 10 (𝑣 ∈ Fin → {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)
54anim2i 619 . . . . . . . . 9 ((𝑣 ∈ 𝒫 𝑋𝑣 ∈ Fin) → (𝑣 ∈ 𝒫 𝑋 ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin))
63, 5sylbi 220 . . . . . . . 8 (𝑣 ∈ (𝒫 𝑋 ∩ Fin) → (𝑣 ∈ 𝒫 𝑋 ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin))
76anim2i 619 . . . . . . 7 ((𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ 𝑣 ∈ (𝒫 𝑋 ∩ Fin)) → (𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ (𝑣 ∈ 𝒫 𝑋 ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)))
87ancoms 462 . . . . . 6 ((𝑣 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑)) → (𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ (𝑣 ∈ 𝒫 𝑋 ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)))
9 an12 644 . . . . . 6 ((𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ (𝑣 ∈ 𝒫 𝑋 ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)) ↔ (𝑣 ∈ 𝒫 𝑋 ∧ (𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)))
108, 9sylib 221 . . . . 5 ((𝑣 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑)) → (𝑣 ∈ 𝒫 𝑋 ∧ (𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)))
1110reximi2 3207 . . . 4 (∃𝑣 ∈ (𝒫 𝑋 ∩ Fin)𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) → ∃𝑣 ∈ 𝒫 𝑋(𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin))
1211ralimi 3128 . . 3 (∀𝑑 ∈ ℝ+𝑣 ∈ (𝒫 𝑋 ∩ Fin)𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) → ∀𝑑 ∈ ℝ+𝑣 ∈ 𝒫 𝑋(𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin))
132, 12syl6bi 256 . 2 ((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) → (𝑁 ∈ (TotBnd‘𝑌) → ∀𝑑 ∈ ℝ+𝑣 ∈ 𝒫 𝑋(𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)))
14 ssrab2 4007 . . . . . . . 8 {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ⊆ 𝑣
15 elpwi 4506 . . . . . . . . 9 (𝑣 ∈ 𝒫 𝑋𝑣𝑋)
1615ad2antlr 726 . . . . . . . 8 ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) ∧ 𝑣 ∈ 𝒫 𝑋) ∧ (𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)) → 𝑣𝑋)
1714, 16sstrid 3926 . . . . . . 7 ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) ∧ 𝑣 ∈ 𝒫 𝑋) ∧ (𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)) → {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ⊆ 𝑋)
18 simprr 772 . . . . . . 7 ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) ∧ 𝑣 ∈ 𝒫 𝑋) ∧ (𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)) → {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)
19 elfpw 8810 . . . . . . 7 ({𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ (𝒫 𝑋 ∩ Fin) ↔ ({𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ⊆ 𝑋 ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin))
2017, 18, 19sylanbrc 586 . . . . . 6 ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) ∧ 𝑣 ∈ 𝒫 𝑋) ∧ (𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)) → {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ (𝒫 𝑋 ∩ Fin))
21 ssel2 3910 . . . . . . . . . . . 12 ((𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ 𝑧𝑌) → 𝑧 𝑥𝑣 (𝑥(ball‘𝑀)𝑑))
22 eliun 4885 . . . . . . . . . . . 12 (𝑧 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ↔ ∃𝑥𝑣 𝑧 ∈ (𝑥(ball‘𝑀)𝑑))
2321, 22sylib 221 . . . . . . . . . . 11 ((𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ 𝑧𝑌) → ∃𝑥𝑣 𝑧 ∈ (𝑥(ball‘𝑀)𝑑))
24 inelcm 4372 . . . . . . . . . . . . . . 15 ((𝑧 ∈ (𝑥(ball‘𝑀)𝑑) ∧ 𝑧𝑌) → ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅)
2524expcom 417 . . . . . . . . . . . . . 14 (𝑧𝑌 → (𝑧 ∈ (𝑥(ball‘𝑀)𝑑) → ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅))
2625ancrd 555 . . . . . . . . . . . . 13 (𝑧𝑌 → (𝑧 ∈ (𝑥(ball‘𝑀)𝑑) → (((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅ ∧ 𝑧 ∈ (𝑥(ball‘𝑀)𝑑))))
2726reximdv 3232 . . . . . . . . . . . 12 (𝑧𝑌 → (∃𝑥𝑣 𝑧 ∈ (𝑥(ball‘𝑀)𝑑) → ∃𝑥𝑣 (((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅ ∧ 𝑧 ∈ (𝑥(ball‘𝑀)𝑑))))
2827impcom 411 . . . . . . . . . . 11 ((∃𝑥𝑣 𝑧 ∈ (𝑥(ball‘𝑀)𝑑) ∧ 𝑧𝑌) → ∃𝑥𝑣 (((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅ ∧ 𝑧 ∈ (𝑥(ball‘𝑀)𝑑)))
2923, 28sylancom 591 . . . . . . . . . 10 ((𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ 𝑧𝑌) → ∃𝑥𝑣 (((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅ ∧ 𝑧 ∈ (𝑥(ball‘𝑀)𝑑)))
30 eliun 4885 . . . . . . . . . . 11 (𝑧 𝑦 ∈ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} (𝑦(ball‘𝑀)𝑑) ↔ ∃𝑦 ∈ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅}𝑧 ∈ (𝑦(ball‘𝑀)𝑑))
31 oveq1 7142 . . . . . . . . . . . . 13 (𝑦 = 𝑥 → (𝑦(ball‘𝑀)𝑑) = (𝑥(ball‘𝑀)𝑑))
3231eleq2d 2875 . . . . . . . . . . . 12 (𝑦 = 𝑥 → (𝑧 ∈ (𝑦(ball‘𝑀)𝑑) ↔ 𝑧 ∈ (𝑥(ball‘𝑀)𝑑)))
3332rexrab2 3641 . . . . . . . . . . 11 (∃𝑦 ∈ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅}𝑧 ∈ (𝑦(ball‘𝑀)𝑑) ↔ ∃𝑥𝑣 (((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅ ∧ 𝑧 ∈ (𝑥(ball‘𝑀)𝑑)))
3430, 33bitri 278 . . . . . . . . . 10 (𝑧 𝑦 ∈ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} (𝑦(ball‘𝑀)𝑑) ↔ ∃𝑥𝑣 (((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅ ∧ 𝑧 ∈ (𝑥(ball‘𝑀)𝑑)))
3529, 34sylibr 237 . . . . . . . . 9 ((𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ 𝑧𝑌) → 𝑧 𝑦 ∈ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} (𝑦(ball‘𝑀)𝑑))
3635ex 416 . . . . . . . 8 (𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) → (𝑧𝑌𝑧 𝑦 ∈ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} (𝑦(ball‘𝑀)𝑑)))
3736ssrdv 3921 . . . . . . 7 (𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) → 𝑌 𝑦 ∈ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} (𝑦(ball‘𝑀)𝑑))
3837ad2antrl 727 . . . . . 6 ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) ∧ 𝑣 ∈ 𝒫 𝑋) ∧ (𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)) → 𝑌 𝑦 ∈ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} (𝑦(ball‘𝑀)𝑑))
39 iuneq1 4897 . . . . . . . 8 (𝑤 = {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} → 𝑦𝑤 (𝑦(ball‘𝑀)𝑑) = 𝑦 ∈ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} (𝑦(ball‘𝑀)𝑑))
4039sseq2d 3947 . . . . . . 7 (𝑤 = {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} → (𝑌 𝑦𝑤 (𝑦(ball‘𝑀)𝑑) ↔ 𝑌 𝑦 ∈ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} (𝑦(ball‘𝑀)𝑑)))
4140rspcev 3571 . . . . . 6 (({𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑌 𝑦 ∈ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} (𝑦(ball‘𝑀)𝑑)) → ∃𝑤 ∈ (𝒫 𝑋 ∩ Fin)𝑌 𝑦𝑤 (𝑦(ball‘𝑀)𝑑))
4220, 38, 41syl2anc 587 . . . . 5 ((((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) ∧ 𝑣 ∈ 𝒫 𝑋) ∧ (𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)) → ∃𝑤 ∈ (𝒫 𝑋 ∩ Fin)𝑌 𝑦𝑤 (𝑦(ball‘𝑀)𝑑))
4342rexlimdva2 3246 . . . 4 ((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) → (∃𝑣 ∈ 𝒫 𝑋(𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin) → ∃𝑤 ∈ (𝒫 𝑋 ∩ Fin)𝑌 𝑦𝑤 (𝑦(ball‘𝑀)𝑑)))
4443ralimdv 3145 . . 3 ((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) → (∀𝑑 ∈ ℝ+𝑣 ∈ 𝒫 𝑋(𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin) → ∀𝑑 ∈ ℝ+𝑤 ∈ (𝒫 𝑋 ∩ Fin)𝑌 𝑦𝑤 (𝑦(ball‘𝑀)𝑑)))
451sstotbnd2 35212 . . 3 ((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) → (𝑁 ∈ (TotBnd‘𝑌) ↔ ∀𝑑 ∈ ℝ+𝑤 ∈ (𝒫 𝑋 ∩ Fin)𝑌 𝑦𝑤 (𝑦(ball‘𝑀)𝑑)))
4644, 45sylibrd 262 . 2 ((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) → (∀𝑑 ∈ ℝ+𝑣 ∈ 𝒫 𝑋(𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin) → 𝑁 ∈ (TotBnd‘𝑌)))
4713, 46impbid 215 1 ((𝑀 ∈ (Met‘𝑋) ∧ 𝑌𝑋) → (𝑁 ∈ (TotBnd‘𝑌) ↔ ∀𝑑 ∈ ℝ+𝑣 ∈ 𝒫 𝑋(𝑌 𝑥𝑣 (𝑥(ball‘𝑀)𝑑) ∧ {𝑥𝑣 ∣ ((𝑥(ball‘𝑀)𝑑) ∩ 𝑌) ≠ ∅} ∈ Fin)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2111  wne 2987  wral 3106  wrex 3107  {crab 3110  cin 3880  wss 3881  c0 4243  𝒫 cpw 4497   ciun 4881   × cxp 5517  cres 5521  cfv 6324  (class class class)co 7135  Fincfn 8492  +crp 12377  Metcmet 20077  ballcbl 20078  TotBndctotbnd 35204
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 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-er 8272  df-map 8391  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-div 11287  df-2 11688  df-rp 12378  df-xneg 12495  df-xadd 12496  df-xmul 12497  df-psmet 20083  df-xmet 20084  df-met 20085  df-bl 20086  df-totbnd 35206
This theorem is referenced by:  cntotbnd  35234
  Copyright terms: Public domain W3C validator