| Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnd2lem | Structured version Visualization version GIF version | ||
| Description: Lemma for equivbnd2 38694 and similar theorems. (Contributed by Jeff Madsen, 16-Sep-2015.) |
| Ref | Expression |
|---|---|
| bnd2lem.1 | ⊢ 𝐷 = (𝑀 ↾ (𝑌 × 𝑌)) |
| Ref | Expression |
|---|---|
| bnd2lem | ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → 𝑌 ⊆ 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnd2lem.1 | . . . . . 6 ⊢ 𝐷 = (𝑀 ↾ (𝑌 × 𝑌)) | |
| 2 | resss 5992 | . . . . . 6 ⊢ (𝑀 ↾ (𝑌 × 𝑌)) ⊆ 𝑀 | |
| 3 | 1, 2 | eqsstri 3977 | . . . . 5 ⊢ 𝐷 ⊆ 𝑀 |
| 4 | dmss 5884 | . . . . 5 ⊢ (𝐷 ⊆ 𝑀 → dom 𝐷 ⊆ dom 𝑀) | |
| 5 | 3, 4 | mp1i 14 | . . . 4 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → dom 𝐷 ⊆ dom 𝑀) |
| 6 | bndmet 38683 | . . . . . 6 ⊢ (𝐷 ∈ (Bnd‘𝑌) → 𝐷 ∈ (Met‘𝑌)) | |
| 7 | metf 24629 | . . . . . 6 ⊢ (𝐷 ∈ (Met‘𝑌) → 𝐷:(𝑌 × 𝑌)⟶ℝ) | |
| 8 | fdm 6711 | . . . . . 6 ⊢ (𝐷:(𝑌 × 𝑌)⟶ℝ → dom 𝐷 = (𝑌 × 𝑌)) | |
| 9 | 6, 7, 8 | 3syl 19 | . . . . 5 ⊢ (𝐷 ∈ (Bnd‘𝑌) → dom 𝐷 = (𝑌 × 𝑌)) |
| 10 | 9 | adantl 487 | . . . 4 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → dom 𝐷 = (𝑌 × 𝑌)) |
| 11 | metf 24629 | . . . . . 6 ⊢ (𝑀 ∈ (Met‘𝑋) → 𝑀:(𝑋 × 𝑋)⟶ℝ) | |
| 12 | 11 | fdmd 6712 | . . . . 5 ⊢ (𝑀 ∈ (Met‘𝑋) → dom 𝑀 = (𝑋 × 𝑋)) |
| 13 | 12 | adantr 486 | . . . 4 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → dom 𝑀 = (𝑋 × 𝑋)) |
| 14 | 5, 10, 13 | 3sstr3d 3985 | . . 3 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋)) |
| 15 | dmss 5884 | . . 3 ⊢ ((𝑌 × 𝑌) ⊆ (𝑋 × 𝑋) → dom (𝑌 × 𝑌) ⊆ dom (𝑋 × 𝑋)) | |
| 16 | 14, 15 | syl 18 | . 2 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → dom (𝑌 × 𝑌) ⊆ dom (𝑋 × 𝑋)) |
| 17 | dmxpid 5912 | . 2 ⊢ dom (𝑌 × 𝑌) = 𝑌 | |
| 18 | dmxpid 5912 | . 2 ⊢ dom (𝑋 × 𝑋) = 𝑋 | |
| 19 | 16, 17, 18 | 3sstr3g 3983 | 1 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → 𝑌 ⊆ 𝑋) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 × cxp 5649 dom cdm 5651 ↾ cres 5653 ⟶wf 6527 ‘cfv 6531 ℝcr 11180 Metcmet 21644 Bndcbnd 38669 |
| 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 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-fv 6539 df-ov 7415 df-oprab 7416 df-mpo 7417 df-map 8833 df-met 21652 df-bnd 38681 |
| This theorem is used by: equivbnd2 38694 prdsbnd2 38697 cntotbnd 38698 cnpwstotbnd 38699 |
| Copyright terms: Public domain | W3C validator |