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

Theorem bnd2lem 38549
Description: Lemma for equivbnd2 38550 and similar theorems. (Contributed by Jeff Madsen, 16-Sep-2015.)
Hypothesis
Ref Expression
bnd2lem.1 𝐷 = (𝑀 ↾ (𝑌 × 𝑌))
Assertion
Ref Expression
bnd2lem ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → 𝑌𝑋)

Proof of Theorem bnd2lem
StepHypRef Expression
1 bnd2lem.1 . . . . . 6 𝐷 = (𝑀 ↾ (𝑌 × 𝑌))
2 resss 5998 . . . . . 6 (𝑀 ↾ (𝑌 × 𝑌)) ⊆ 𝑀
31, 2eqsstri 3980 . . . . 5 𝐷𝑀
4 dmss 5890 . . . . 5 (𝐷𝑀 → dom 𝐷 ⊆ dom 𝑀)
53, 4mp1i 14 . . . 4 ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → dom 𝐷 ⊆ dom 𝑀)
6 bndmet 38539 . . . . . 6 (𝐷 ∈ (Bnd‘𝑌) → 𝐷 ∈ (Met‘𝑌))
7 metf 24562 . . . . . 6 (𝐷 ∈ (Met‘𝑌) → 𝐷:(𝑌 × 𝑌)⟶ℝ)
8 fdm 6716 . . . . . 6 (𝐷:(𝑌 × 𝑌)⟶ℝ → dom 𝐷 = (𝑌 × 𝑌))
96, 7, 83syl 19 . . . . 5 (𝐷 ∈ (Bnd‘𝑌) → dom 𝐷 = (𝑌 × 𝑌))
109adantl 487 . . . 4 ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → dom 𝐷 = (𝑌 × 𝑌))
11 metf 24562 . . . . . 6 (𝑀 ∈ (Met‘𝑋) → 𝑀:(𝑋 × 𝑋)⟶ℝ)
1211fdmd 6717 . . . . 5 (𝑀 ∈ (Met‘𝑋) → dom 𝑀 = (𝑋 × 𝑋))
1312adantr 486 . . . 4 ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → dom 𝑀 = (𝑋 × 𝑋))
145, 10, 133sstr3d 3988 . . 3 ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋))
15 dmss 5890 . . 3 ((𝑌 × 𝑌) ⊆ (𝑋 × 𝑋) → dom (𝑌 × 𝑌) ⊆ dom (𝑋 × 𝑋))
1614, 15syl 18 . 2 ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → dom (𝑌 × 𝑌) ⊆ dom (𝑋 × 𝑋))
17 dmxpid 5918 . 2 dom (𝑌 × 𝑌) = 𝑌
18 dmxpid 5918 . 2 dom (𝑋 × 𝑋) = 𝑋
1916, 17, 183sstr3g 3986 1 ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → 𝑌𝑋)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wss 3902   × cxp 5657  dom cdm 5659  cres 5661  wf 6533  cfv 6537  cr 11127  Metcmet 21577  Bndcbnd 38525
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-cnex 11184  ax-resscn 11185
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-map 8832  df-met 21585  df-bnd 38537
This theorem is used by:  equivbnd2  38550  prdsbnd2  38553  cntotbnd  38554  cnpwstotbnd  38555
  Copyright terms: Public domain W3C validator