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

Theorem metss 24498
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 24428 . . . 4 (𝐶 ∈ (∞Met‘𝑋) → 𝐽 = (topGen‘ran (ball‘𝐶)))
32adantr 481 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → 𝐽 = (topGen‘ran (ball‘𝐶)))
4 metequiv.4 . . . . 5 𝐾 = (MetOpen‘𝐷)
54mopnval 24428 . . . 4 (𝐷 ∈ (∞Met‘𝑋) → 𝐾 = (topGen‘ran (ball‘𝐷)))
65adantl 482 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → 𝐾 = (topGen‘ran (ball‘𝐷)))
73, 6sseq12d 3955 . 2 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (𝐽𝐾 ↔ (topGen‘ran (ball‘𝐶)) ⊆ (topGen‘ran (ball‘𝐷))))
8 blbas 24420 . . 3 (𝐶 ∈ (∞Met‘𝑋) → ran (ball‘𝐶) ∈ TopBases)
9 unirnbl 24410 . . . . 5 (𝐶 ∈ (∞Met‘𝑋) → ran (ball‘𝐶) = 𝑋)
109adantr 481 . . . 4 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ran (ball‘𝐶) = 𝑋)
11 unirnbl 24410 . . . . 5 (𝐷 ∈ (∞Met‘𝑋) → ran (ball‘𝐷) = 𝑋)
1211adantl 482 . . . 4 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ran (ball‘𝐷) = 𝑋)
1310, 12eqtr4d 2778 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ran (ball‘𝐶) = ran (ball‘𝐷))
14 tgss2 22977 . . 3 ((ran (ball‘𝐶) ∈ TopBases ∧ ran (ball‘𝐶) = ran (ball‘𝐷)) → ((topGen‘ran (ball‘𝐶)) ⊆ (topGen‘ran (ball‘𝐷)) ↔ ∀𝑥 ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦))))
158, 13, 14syl2an2r 691 . 2 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ((topGen‘ran (ball‘𝐶)) ⊆ (topGen‘ran (ball‘𝐷)) ↔ ∀𝑥 ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦))))
1610raleqdv 3298 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥 ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑥𝑋𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦))))
17 blssex 24417 . . . . . . . 8 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑥𝑋) → (∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦) ↔ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
1817adantll 720 . . . . . . 7 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦) ↔ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
1918imbi2d 341 . . . . . 6 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → ((𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ (𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
2019ralbidv 3163 . . . . 5 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
21 rpxr 12950 . . . . . . . . . 10 (𝑟 ∈ ℝ+𝑟 ∈ ℝ*)
22 blelrn 24407 . . . . . . . . . 10 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥𝑋𝑟 ∈ ℝ*) → (𝑥(ball‘𝐶)𝑟) ∈ ran (ball‘𝐶))
2321, 22syl3an3 1171 . . . . . . . . 9 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥𝑋𝑟 ∈ ℝ+) → (𝑥(ball‘𝐶)𝑟) ∈ ran (ball‘𝐶))
24 blcntr 24403 . . . . . . . . 9 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥𝑋𝑟 ∈ ℝ+) → 𝑥 ∈ (𝑥(ball‘𝐶)𝑟))
25 eleq2 2829 . . . . . . . . . . . 12 (𝑦 = (𝑥(ball‘𝐶)𝑟) → (𝑥𝑦𝑥 ∈ (𝑥(ball‘𝐶)𝑟)))
26 sseq2 3948 . . . . . . . . . . . . 13 (𝑦 = (𝑥(ball‘𝐶)𝑟) → ((𝑥(ball‘𝐷)𝑠) ⊆ 𝑦 ↔ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
2726rexbidv 3164 . . . . . . . . . . . 12 (𝑦 = (𝑥(ball‘𝐶)𝑟) → (∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦 ↔ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
2825, 27imbi12d 345 . . . . . . . . . . 11 (𝑦 = (𝑥(ball‘𝐶)𝑟) → ((𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) ↔ (𝑥 ∈ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))))
2928rspcv 3563 . . . . . . . . . 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 1181 . . . . . . 7 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ 𝑟 ∈ ℝ+) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
3332ralrimdva 3140 . . . . . 6 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → ∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
34 blss 24415 . . . . . . . . . . . 12 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥𝑦) → ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦)
35343expb 1126 . . . . . . . . . . 11 ((𝐶 ∈ (∞Met‘𝑋) ∧ (𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥𝑦)) → ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦)
3635ad4ant14 758 . . . . . . . . . 10 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ (𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥𝑦)) → ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦)
37 r19.29 3103 . . . . . . . . . . . 12 ((∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑟 ∈ ℝ+ (∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦))
38 sstr 3930 . . . . . . . . . . . . . . . 16 (((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
3938expcom 414 . . . . . . . . . . . . . . 15 ((𝑥(ball‘𝐶)𝑟) ⊆ 𝑦 → ((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
4039reximdv 3155 . . . . . . . . . . . . . 14 ((𝑥(ball‘𝐶)𝑟) ⊆ 𝑦 → (∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
4140impcom 408 . . . . . . . . . . . . 13 ((∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
4241rexlimivw 3137 . . . . . . . . . . . 12 (∃𝑟 ∈ ℝ+ (∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
4337, 42syl 17 . . . . . . . . . . 11 ((∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
4443ex 413 . . . . . . . . . 10 (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → (∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
4536, 44syl5com 31 . . . . . . . . 9 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ (𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥𝑦)) → (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
4645expr 457 . . . . . . . 8 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ 𝑦 ∈ ran (ball‘𝐶)) → (𝑥𝑦 → (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
4746com23 86 . . . . . . 7 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ 𝑦 ∈ ran (ball‘𝐶)) → (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → (𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
4847ralrimdva 3140 . . . . . 6 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
4933, 48impbid 213 . . . . 5 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) ↔ ∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
5020, 49bitrd 280 . . . 4 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
5150ralbidva 3161 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥𝑋𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑥𝑋𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
5216, 51bitrd 280 . 2 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥 ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑥𝑋𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
537, 15, 523bitrd 306 1 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (𝐽𝐾 ↔ ∀𝑥𝑋𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1092   = wceq 1547  wcel 2119  wral 3054  wrex 3064  wss 3890   cuni 4845  ran crn 5626  cfv 6492  (class class class)co 7363  *cxr 11176  +crp 12940  topGenctg 17398  ∞Metcxmet 21339  ballcbl 21341  MetOpencmopn 21344  TopBasesctb 22935
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-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-iun 4930  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-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-bases 22936
This theorem is referenced by:  metequiv  24499  metss2  24502
  Copyright terms: Public domain W3C validator