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

Theorem metss 23118
Description: Two ways of saying that metric 𝐷 generates a finer topology than metric 𝐶. (Contributed by Mario Carneiro, 12-Nov-2013.) (Revised by Mario Carneiro, 24-Aug-2015.)
Hypotheses
Ref Expression
metequiv.3 𝐽 = (MetOpen‘𝐶)
metequiv.4 𝐾 = (MetOpen‘𝐷)
Assertion
Ref Expression
metss ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (𝐽𝐾 ↔ ∀𝑥𝑋𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
Distinct variable groups:   𝑠,𝑟,𝑥,𝐶   𝐽,𝑟,𝑠,𝑥   𝐾,𝑟,𝑠,𝑥   𝐷,𝑟,𝑠,𝑥   𝑋,𝑟,𝑠,𝑥

Proof of Theorem metss
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 metequiv.3 . . . . 5 𝐽 = (MetOpen‘𝐶)
21mopnval 23048 . . . 4 (𝐶 ∈ (∞Met‘𝑋) → 𝐽 = (topGen‘ran (ball‘𝐶)))
32adantr 483 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → 𝐽 = (topGen‘ran (ball‘𝐶)))
4 metequiv.4 . . . . 5 𝐾 = (MetOpen‘𝐷)
54mopnval 23048 . . . 4 (𝐷 ∈ (∞Met‘𝑋) → 𝐾 = (topGen‘ran (ball‘𝐷)))
65adantl 484 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → 𝐾 = (topGen‘ran (ball‘𝐷)))
73, 6sseq12d 4000 . 2 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (𝐽𝐾 ↔ (topGen‘ran (ball‘𝐶)) ⊆ (topGen‘ran (ball‘𝐷))))
8 blbas 23040 . . 3 (𝐶 ∈ (∞Met‘𝑋) → ran (ball‘𝐶) ∈ TopBases)
9 unirnbl 23030 . . . . 5 (𝐶 ∈ (∞Met‘𝑋) → ran (ball‘𝐶) = 𝑋)
109adantr 483 . . . 4 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ran (ball‘𝐶) = 𝑋)
11 unirnbl 23030 . . . . 5 (𝐷 ∈ (∞Met‘𝑋) → ran (ball‘𝐷) = 𝑋)
1211adantl 484 . . . 4 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ran (ball‘𝐷) = 𝑋)
1310, 12eqtr4d 2859 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ran (ball‘𝐶) = ran (ball‘𝐷))
14 tgss2 21595 . . 3 ((ran (ball‘𝐶) ∈ TopBases ∧ ran (ball‘𝐶) = ran (ball‘𝐷)) → ((topGen‘ran (ball‘𝐶)) ⊆ (topGen‘ran (ball‘𝐷)) ↔ ∀𝑥 ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦))))
158, 13, 14syl2an2r 683 . 2 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ((topGen‘ran (ball‘𝐶)) ⊆ (topGen‘ran (ball‘𝐷)) ↔ ∀𝑥 ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦))))
1610raleqdv 3415 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥 ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑥𝑋𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦))))
17 blssex 23037 . . . . . . . 8 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑥𝑋) → (∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦) ↔ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
1817adantll 712 . . . . . . 7 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦) ↔ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
1918imbi2d 343 . . . . . 6 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → ((𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ (𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
2019ralbidv 3197 . . . . 5 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
21 rpxr 12399 . . . . . . . . . 10 (𝑟 ∈ ℝ+𝑟 ∈ ℝ*)
22 blelrn 23027 . . . . . . . . . 10 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥𝑋𝑟 ∈ ℝ*) → (𝑥(ball‘𝐶)𝑟) ∈ ran (ball‘𝐶))
2321, 22syl3an3 1161 . . . . . . . . 9 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥𝑋𝑟 ∈ ℝ+) → (𝑥(ball‘𝐶)𝑟) ∈ ran (ball‘𝐶))
24 blcntr 23023 . . . . . . . . 9 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥𝑋𝑟 ∈ ℝ+) → 𝑥 ∈ (𝑥(ball‘𝐶)𝑟))
25 eleq2 2901 . . . . . . . . . . . 12 (𝑦 = (𝑥(ball‘𝐶)𝑟) → (𝑥𝑦𝑥 ∈ (𝑥(ball‘𝐶)𝑟)))
26 sseq2 3993 . . . . . . . . . . . . 13 (𝑦 = (𝑥(ball‘𝐶)𝑟) → ((𝑥(ball‘𝐷)𝑠) ⊆ 𝑦 ↔ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
2726rexbidv 3297 . . . . . . . . . . . 12 (𝑦 = (𝑥(ball‘𝐶)𝑟) → (∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦 ↔ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
2825, 27imbi12d 347 . . . . . . . . . . 11 (𝑦 = (𝑥(ball‘𝐶)𝑟) → ((𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) ↔ (𝑥 ∈ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))))
2928rspcv 3618 . . . . . . . . . 10 ((𝑥(ball‘𝐶)𝑟) ∈ ran (ball‘𝐶) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → (𝑥 ∈ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))))
3029com23 86 . . . . . . . . 9 ((𝑥(ball‘𝐶)𝑟) ∈ ran (ball‘𝐶) → (𝑥 ∈ (𝑥(ball‘𝐶)𝑟) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))))
3123, 24, 30sylc 65 . . . . . . . 8 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥𝑋𝑟 ∈ ℝ+) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
3231ad4ant134 1170 . . . . . . 7 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ 𝑟 ∈ ℝ+) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
3332ralrimdva 3189 . . . . . 6 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → ∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
34 blss 23035 . . . . . . . . . . . 12 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥𝑦) → ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦)
35343expb 1116 . . . . . . . . . . 11 ((𝐶 ∈ (∞Met‘𝑋) ∧ (𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥𝑦)) → ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦)
3635ad4ant14 750 . . . . . . . . . 10 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ (𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥𝑦)) → ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦)
37 r19.29 3254 . . . . . . . . . . . 12 ((∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑟 ∈ ℝ+ (∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦))
38 sstr 3975 . . . . . . . . . . . . . . . 16 (((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
3938expcom 416 . . . . . . . . . . . . . . 15 ((𝑥(ball‘𝐶)𝑟) ⊆ 𝑦 → ((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
4039reximdv 3273 . . . . . . . . . . . . . 14 ((𝑥(ball‘𝐶)𝑟) ⊆ 𝑦 → (∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
4140impcom 410 . . . . . . . . . . . . 13 ((∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
4241rexlimivw 3282 . . . . . . . . . . . 12 (∃𝑟 ∈ ℝ+ (∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
4337, 42syl 17 . . . . . . . . . . 11 ((∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
4443ex 415 . . . . . . . . . 10 (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → (∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
4536, 44syl5com 31 . . . . . . . . 9 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ (𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥𝑦)) → (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
4645expr 459 . . . . . . . 8 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ 𝑦 ∈ ran (ball‘𝐶)) → (𝑥𝑦 → (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
4746com23 86 . . . . . . 7 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ 𝑦 ∈ ran (ball‘𝐶)) → (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → (𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
4847ralrimdva 3189 . . . . . 6 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
4933, 48impbid 214 . . . . 5 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) ↔ ∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
5020, 49bitrd 281 . . . 4 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
5150ralbidva 3196 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥𝑋𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑥𝑋𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
5216, 51bitrd 281 . 2 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥 ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑥𝑋𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
537, 15, 523bitrd 307 1 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (𝐽𝐾 ↔ ∀𝑥𝑋𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1083   = wceq 1537  wcel 2114  wral 3138  wrex 3139  wss 3936   cuni 4838  ran crn 5556  cfv 6355  (class class class)co 7156  *cxr 10674  +crp 12390  topGenctg 16711  ∞Metcxmet 20530  ballcbl 20532  MetOpencmopn 20535  TopBasesctb 21553
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-cnex 10593  ax-resscn 10594  ax-1cn 10595  ax-icn 10596  ax-addcl 10597  ax-addrcl 10598  ax-mulcl 10599  ax-mulrcl 10600  ax-mulcom 10601  ax-addass 10602  ax-mulass 10603  ax-distr 10604  ax-i2m1 10605  ax-1ne0 10606  ax-1rid 10607  ax-rnegex 10608  ax-rrecex 10609  ax-cnre 10610  ax-pre-lttri 10611  ax-pre-lttrn 10612  ax-pre-ltadd 10613  ax-pre-mulgt0 10614  ax-pre-sup 10615
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7581  df-1st 7689  df-2nd 7690  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-er 8289  df-map 8408  df-en 8510  df-dom 8511  df-sdom 8512  df-sup 8906  df-inf 8907  df-pnf 10677  df-mnf 10678  df-xr 10679  df-ltxr 10680  df-le 10681  df-sub 10872  df-neg 10873  df-div 11298  df-nn 11639  df-2 11701  df-n0 11899  df-z 11983  df-uz 12245  df-q 12350  df-rp 12391  df-xneg 12508  df-xadd 12509  df-xmul 12510  df-topgen 16717  df-psmet 20537  df-xmet 20538  df-bl 20540  df-mopn 20541  df-bases 21554
This theorem is referenced by:  metequiv  23119  metss2  23122
  Copyright terms: Public domain W3C validator