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

Theorem equivcmet 25693
Description: If two metrics are strongly equivalent, one is complete iff the other is. Unlike equivcau 25676, metss2 24886, this theorem does not have a one-directional form - it is possible for a metric 𝐶 that is strongly finer than the complete metric 𝐷 to be incomplete and vice versa. Consider 𝐷 = the metric on ℝ induced by the usual homeomorphism from (0, 1) against the usual metric 𝐶 on ℝ and against the discrete metric 𝐸 on ℝ. Then both 𝐶 and 𝐸 are complete but 𝐷 is not, and 𝐶 is strongly finer than 𝐷, which is strongly finer than 𝐸. (Contributed by Mario Carneiro, 15-Sep-2015.)
Hypotheses
Ref Expression
equivcmet.1 (𝜑 → 𝐶 ∈ (Met‘𝑋))
equivcmet.2 (𝜑 → 𝐷 ∈ (Met‘𝑋))
equivcmet.3 (𝜑 → 𝑅 ∈ ℝ+)
equivcmet.4 (𝜑 → 𝑆 ∈ ℝ+)
equivcmet.5 ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝐶𝑦) ≤ (𝑅 · (𝑥𝐷𝑦)))
equivcmet.6 ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝐷𝑦) ≤ (𝑆 · (𝑥𝐶𝑦)))
Assertion
Ref Expression
equivcmet (𝜑 → (𝐶 ∈ (CMet‘𝑋) ↔ 𝐷 ∈ (CMet‘𝑋)))
Distinct variable groups:   𝑥,𝑦,𝐶   𝑥,𝐷,𝑦   𝜑,𝑥,𝑦   𝑥,𝑅,𝑦   𝑥,𝑋,𝑦   𝑥,𝑆,𝑦

Proof of Theorem equivcmet
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 equivcmet.1 . . . 4 (𝜑 → 𝐶 ∈ (Met‘𝑋))
2 equivcmet.2 . . . 4 (𝜑 → 𝐷 ∈ (Met‘𝑋))
31, 22thd 268 . . 3 (𝜑 → (𝐶 ∈ (Met‘𝑋) ↔ 𝐷 ∈ (Met‘𝑋)))
4 equivcmet.4 . . . . . 6 (𝜑 → 𝑆 ∈ ℝ+)
5 equivcmet.6 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝐷𝑦) ≤ (𝑆 · (𝑥𝐶𝑦)))
62, 1, 4, 5equivcfil 25675 . . . . 5 (𝜑 → (CauFil‘𝐶) ⊆ (CauFil‘𝐷))
7 equivcmet.3 . . . . . 6 (𝜑 → 𝑅 ∈ ℝ+)
8 equivcmet.5 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝐶𝑦) ≤ (𝑅 · (𝑥𝐷𝑦)))
91, 2, 7, 8equivcfil 25675 . . . . 5 (𝜑 → (CauFil‘𝐷) ⊆ (CauFil‘𝐶))
106, 9eqssd 3930 . . . 4 (𝜑 → (CauFil‘𝐶) = (CauFil‘𝐷))
11 eqid 2763 . . . . . . . 8 (MetOpen‘𝐶) = (MetOpen‘𝐶)
12 eqid 2763 . . . . . . . 8 (MetOpen‘𝐷) = (MetOpen‘𝐷)
1311, 12, 1, 2, 7, 8metss2 24886 . . . . . . 7 (𝜑 → (MetOpen‘𝐶) ⊆ (MetOpen‘𝐷))
1412, 11, 2, 1, 4, 5metss2 24886 . . . . . . 7 (𝜑 → (MetOpen‘𝐷) ⊆ (MetOpen‘𝐶))
1513, 14eqssd 3930 . . . . . 6 (𝜑 → (MetOpen‘𝐶) = (MetOpen‘𝐷))
1615oveq1d 7466 . . . . 5 (𝜑 → ((MetOpen‘𝐶) fLim 𝑓) = ((MetOpen‘𝐷) fLim 𝑓))
1716neeq1d 3018 . . . 4 (𝜑 → (((MetOpen‘𝐶) fLim 𝑓) ≠ ∅ ↔ ((MetOpen‘𝐷) fLim 𝑓) ≠ ∅))
1810, 17raleqbidv 3338 . . 3 (𝜑 → (∀𝑓 ∈ (CauFil‘𝐶)((MetOpen‘𝐶) fLim 𝑓) ≠ ∅ ↔ ∀𝑓 ∈ (CauFil‘𝐷)((MetOpen‘𝐷) fLim 𝑓) ≠ ∅))
193, 18anbi12d 644 . 2 (𝜑 → ((𝐶 ∈ (Met‘𝑋) ∧ ∀𝑓 ∈ (CauFil‘𝐶)((MetOpen‘𝐶) fLim 𝑓) ≠ ∅) ↔ (𝐷 ∈ (Met‘𝑋) ∧ ∀𝑓 ∈ (CauFil‘𝐷)((MetOpen‘𝐷) fLim 𝑓) ≠ ∅)))
2011iscmet 25660 . 2 (𝐶 ∈ (CMet‘𝑋) ↔ (𝐶 ∈ (Met‘𝑋) ∧ ∀𝑓 ∈ (CauFil‘𝐶)((MetOpen‘𝐶) fLim 𝑓) ≠ ∅))
2112iscmet 25660 . 2 (𝐷 ∈ (CMet‘𝑋) ↔ (𝐷 ∈ (Met‘𝑋) ∧ ∀𝑓 ∈ (CauFil‘𝐷)((MetOpen‘𝐷) fLim 𝑓) ≠ ∅))
2219, 20, 213bitr4g 317 1 (𝜑 → (𝐶 ∈ (CMet‘𝑋) ↔ 𝐷 ∈ (CMet‘𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∅c0 4281   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451   · cmul 11244   ≤ cle 11383  ℝ+crp 13160  Metcmet 21715  MetOpencmopn 21719   fLim cflim 24308  CauFilccfil 25628  CMetccmet 25630
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316  ax-pre-sup 11317
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-sup 9471  df-inf 9472  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-div 12014  df-nn 12376  df-2 12445  df-n0 12647  df-z 12734  df-uz 13006  df-q 13116  df-rp 13161  df-xneg 13281  df-xadd 13282  df-xmul 13283  df-ico 13522  df-topgen 17664  df-psmet 21721  df-xmet 21722  df-met 21723  df-bl 21724  df-mopn 21725  df-fbas 21726  df-bases 23319  df-fil 24220  df-cfil 25631  df-cmet 25633
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator