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

Theorem metss 23406
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 23336 . . . 4 (𝐶 ∈ (∞Met‘𝑋) → 𝐽 = (topGen‘ran (ball‘𝐶)))
32adantr 484 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → 𝐽 = (topGen‘ran (ball‘𝐶)))
4 metequiv.4 . . . . 5 𝐾 = (MetOpen‘𝐷)
54mopnval 23336 . . . 4 (𝐷 ∈ (∞Met‘𝑋) → 𝐾 = (topGen‘ran (ball‘𝐷)))
65adantl 485 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → 𝐾 = (topGen‘ran (ball‘𝐷)))
73, 6sseq12d 3934 . 2 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (𝐽𝐾 ↔ (topGen‘ran (ball‘𝐶)) ⊆ (topGen‘ran (ball‘𝐷))))
8 blbas 23328 . . 3 (𝐶 ∈ (∞Met‘𝑋) → ran (ball‘𝐶) ∈ TopBases)
9 unirnbl 23318 . . . . 5 (𝐶 ∈ (∞Met‘𝑋) → ran (ball‘𝐶) = 𝑋)
109adantr 484 . . . 4 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ran (ball‘𝐶) = 𝑋)
11 unirnbl 23318 . . . . 5 (𝐷 ∈ (∞Met‘𝑋) → ran (ball‘𝐷) = 𝑋)
1211adantl 485 . . . 4 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ran (ball‘𝐷) = 𝑋)
1310, 12eqtr4d 2780 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ran (ball‘𝐶) = ran (ball‘𝐷))
14 tgss2 21884 . . 3 ((ran (ball‘𝐶) ∈ TopBases ∧ ran (ball‘𝐶) = ran (ball‘𝐷)) → ((topGen‘ran (ball‘𝐶)) ⊆ (topGen‘ran (ball‘𝐷)) ↔ ∀𝑥 ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦))))
158, 13, 14syl2an2r 685 . 2 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → ((topGen‘ran (ball‘𝐶)) ⊆ (topGen‘ran (ball‘𝐷)) ↔ ∀𝑥 ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦))))
1610raleqdv 3325 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥 ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑥𝑋𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦))))
17 blssex 23325 . . . . . . . 8 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑥𝑋) → (∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦) ↔ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
1817adantll 714 . . . . . . 7 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦) ↔ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
1918imbi2d 344 . . . . . 6 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → ((𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ (𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
2019ralbidv 3118 . . . . 5 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
21 rpxr 12595 . . . . . . . . . 10 (𝑟 ∈ ℝ+𝑟 ∈ ℝ*)
22 blelrn 23315 . . . . . . . . . 10 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥𝑋𝑟 ∈ ℝ*) → (𝑥(ball‘𝐶)𝑟) ∈ ran (ball‘𝐶))
2321, 22syl3an3 1167 . . . . . . . . 9 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥𝑋𝑟 ∈ ℝ+) → (𝑥(ball‘𝐶)𝑟) ∈ ran (ball‘𝐶))
24 blcntr 23311 . . . . . . . . 9 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑥𝑋𝑟 ∈ ℝ+) → 𝑥 ∈ (𝑥(ball‘𝐶)𝑟))
25 eleq2 2826 . . . . . . . . . . . 12 (𝑦 = (𝑥(ball‘𝐶)𝑟) → (𝑥𝑦𝑥 ∈ (𝑥(ball‘𝐶)𝑟)))
26 sseq2 3927 . . . . . . . . . . . . 13 (𝑦 = (𝑥(ball‘𝐶)𝑟) → ((𝑥(ball‘𝐷)𝑠) ⊆ 𝑦 ↔ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
2726rexbidv 3216 . . . . . . . . . . . 12 (𝑦 = (𝑥(ball‘𝐶)𝑟) → (∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦 ↔ ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
2825, 27imbi12d 348 . . . . . . . . . . 11 (𝑦 = (𝑥(ball‘𝐶)𝑟) → ((𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) ↔ (𝑥 ∈ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟))))
2928rspcv 3532 . . . . . . . . . 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 1176 . . . . . . 7 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ 𝑟 ∈ ℝ+) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
3332ralrimdva 3110 . . . . . 6 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) → ∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
34 blss 23323 . . . . . . . . . . . 12 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥𝑦) → ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦)
35343expb 1122 . . . . . . . . . . 11 ((𝐶 ∈ (∞Met‘𝑋) ∧ (𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥𝑦)) → ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦)
3635ad4ant14 752 . . . . . . . . . 10 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ (𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥𝑦)) → ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦)
37 r19.29 3176 . . . . . . . . . . . 12 ((∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑟 ∈ ℝ+ (∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦))
38 sstr 3909 . . . . . . . . . . . . . . . 16 (((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
3938expcom 417 . . . . . . . . . . . . . . 15 ((𝑥(ball‘𝐶)𝑟) ⊆ 𝑦 → ((𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
4039reximdv 3192 . . . . . . . . . . . . . 14 ((𝑥(ball‘𝐶)𝑟) ⊆ 𝑦 → (∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
4140impcom 411 . . . . . . . . . . . . 13 ((∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
4241rexlimivw 3201 . . . . . . . . . . . 12 (∃𝑟 ∈ ℝ+ (∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
4337, 42syl 17 . . . . . . . . . . 11 ((∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) ∧ ∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)
4443ex 416 . . . . . . . . . 10 (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → (∃𝑟 ∈ ℝ+ (𝑥(ball‘𝐶)𝑟) ⊆ 𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
4536, 44syl5com 31 . . . . . . . . 9 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ (𝑦 ∈ ran (ball‘𝐶) ∧ 𝑥𝑦)) → (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦))
4645expr 460 . . . . . . . 8 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ 𝑦 ∈ ran (ball‘𝐶)) → (𝑥𝑦 → (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
4746com23 86 . . . . . . 7 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) ∧ 𝑦 ∈ ran (ball‘𝐶)) → (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → (𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
4847ralrimdva 3110 . . . . . 6 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟) → ∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦)))
4933, 48impbid 215 . . . . 5 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ 𝑦) ↔ ∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
5020, 49bitrd 282 . . . 4 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) ∧ 𝑥𝑋) → (∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
5150ralbidva 3117 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥𝑋𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑥𝑋𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
5216, 51bitrd 282 . 2 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (∀𝑥 ran (ball‘𝐶)∀𝑦 ∈ ran (ball‘𝐶)(𝑥𝑦 → ∃𝑧 ∈ ran (ball‘𝐷)(𝑥𝑧𝑧𝑦)) ↔ ∀𝑥𝑋𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
537, 15, 523bitrd 308 1 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝐷 ∈ (∞Met‘𝑋)) → (𝐽𝐾 ↔ ∀𝑥𝑋𝑟 ∈ ℝ+𝑠 ∈ ℝ+ (𝑥(ball‘𝐷)𝑠) ⊆ (𝑥(ball‘𝐶)𝑟)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  w3a 1089   = wceq 1543  wcel 2110  wral 3061  wrex 3062  wss 3866   cuni 4819  ran crn 5552  cfv 6380  (class class class)co 7213  *cxr 10866  +crp 12586  topGenctg 16942  ∞Metcxmet 20348  ballcbl 20350  MetOpencmopn 20353  TopBasesctb 21842
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pow 5258  ax-pr 5322  ax-un 7523  ax-cnex 10785  ax-resscn 10786  ax-1cn 10787  ax-icn 10788  ax-addcl 10789  ax-addrcl 10790  ax-mulcl 10791  ax-mulrcl 10792  ax-mulcom 10793  ax-addass 10794  ax-mulass 10795  ax-distr 10796  ax-i2m1 10797  ax-1ne0 10798  ax-1rid 10799  ax-rnegex 10800  ax-rrecex 10801  ax-cnre 10802  ax-pre-lttri 10803  ax-pre-lttrn 10804  ax-pre-ltadd 10805  ax-pre-mulgt0 10806  ax-pre-sup 10807
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-nel 3047  df-ral 3066  df-rex 3067  df-reu 3068  df-rmo 3069  df-rab 3070  df-v 3410  df-sbc 3695  df-csb 3812  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-pss 3885  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-tp 4546  df-op 4548  df-uni 4820  df-iun 4906  df-br 5054  df-opab 5116  df-mpt 5136  df-tr 5162  df-id 5455  df-eprel 5460  df-po 5468  df-so 5469  df-fr 5509  df-we 5511  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-rn 5562  df-res 5563  df-ima 5564  df-pred 6160  df-ord 6216  df-on 6217  df-lim 6218  df-suc 6219  df-iota 6338  df-fun 6382  df-fn 6383  df-f 6384  df-f1 6385  df-fo 6386  df-f1o 6387  df-fv 6388  df-riota 7170  df-ov 7216  df-oprab 7217  df-mpo 7218  df-om 7645  df-1st 7761  df-2nd 7762  df-wrecs 8047  df-recs 8108  df-rdg 8146  df-er 8391  df-map 8510  df-en 8627  df-dom 8628  df-sdom 8629  df-sup 9058  df-inf 9059  df-pnf 10869  df-mnf 10870  df-xr 10871  df-ltxr 10872  df-le 10873  df-sub 11064  df-neg 11065  df-div 11490  df-nn 11831  df-2 11893  df-n0 12091  df-z 12177  df-uz 12439  df-q 12545  df-rp 12587  df-xneg 12704  df-xadd 12705  df-xmul 12706  df-topgen 16948  df-psmet 20355  df-xmet 20356  df-bl 20358  df-mopn 20359  df-bases 21843
This theorem is referenced by:  metequiv  23407  metss2  23410
  Copyright terms: Public domain W3C validator