| 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 38929 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 6004 | . . . . . 6 ⊢ (𝑀 ↾ (𝑌 × 𝑌)) ⊆ 𝑀 | |
| 3 | 1, 2 | eqsstri 3959 | . . . . 5 ⊢ 𝐷 ⊆ 𝑀 |
| 4 | dmss 5892 | . . . . 5 ⊢ (𝐷 ⊆ 𝑀 → dom 𝐷 ⊆ dom 𝑀) | |
| 5 | 3, 4 | mp1i 14 | . . . 4 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → dom 𝐷 ⊆ dom 𝑀) |
| 6 | bndmet 38918 | . . . . . 6 ⊢ (𝐷 ∈ (Bnd‘𝑌) → 𝐷 ∈ (Met‘𝑌)) | |
| 7 | metf 24682 | . . . . . 6 ⊢ (𝐷 ∈ (Met‘𝑌) → 𝐷:(𝑌 × 𝑌)⟶ℝ) | |
| 8 | fdm 6744 | . . . . . 6 ⊢ (𝐷:(𝑌 × 𝑌)⟶ℝ → dom 𝐷 = (𝑌 × 𝑌)) | |
| 9 | 6, 7, 8 | 3syl 19 | . . . . 5 ⊢ (𝐷 ∈ (Bnd‘𝑌) → dom 𝐷 = (𝑌 × 𝑌)) |
| 10 | 9 | adantl 487 | . . . 4 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → dom 𝐷 = (𝑌 × 𝑌)) |
| 11 | metf 24682 | . . . . . 6 ⊢ (𝑀 ∈ (Met‘𝑋) → 𝑀:(𝑋 × 𝑋)⟶ℝ) | |
| 12 | 11 | fdmd 6745 | . . . . 5 ⊢ (𝑀 ∈ (Met‘𝑋) → dom 𝑀 = (𝑋 × 𝑋)) |
| 13 | 12 | adantr 486 | . . . 4 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → dom 𝑀 = (𝑋 × 𝑋)) |
| 14 | 5, 10, 13 | 3sstr3d 3967 | . . 3 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋)) |
| 15 | dmss 5892 | . . 3 ⊢ ((𝑌 × 𝑌) ⊆ (𝑋 × 𝑋) → dom (𝑌 × 𝑌) ⊆ dom (𝑋 × 𝑋)) | |
| 16 | 14, 15 | syl 18 | . 2 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → dom (𝑌 × 𝑌) ⊆ dom (𝑋 × 𝑋)) |
| 17 | dmxpid 5920 | . 2 ⊢ dom (𝑌 × 𝑌) = 𝑌 | |
| 18 | dmxpid 5920 | . 2 ⊢ dom (𝑋 × 𝑋) = 𝑋 | |
| 19 | 16, 17, 18 | 3sstr3g 3965 | 1 ⊢ ((𝑀 ∈ (Met‘𝑋) ∧ 𝐷 ∈ (Bnd‘𝑌)) → 𝑌 ⊆ 𝑋) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 × cxp 5654 dom cdm 5656 ↾ cres 5658 ⟶wf 6557 ‘cfv 6561 ℝcr 11229 Metcmet 21697 Bndcbnd 38904 |
| 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 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-cnex 11286 ax-resscn 11287 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 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 4839 df-uni 4871 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-fv 6569 df-ov 7449 df-oprab 7450 df-mpo 7451 df-map 8880 df-met 21705 df-bnd 38916 |
| This theorem is used by: equivbnd2 38929 prdsbnd2 38932 cntotbnd 38933 cnpwstotbnd 38934 |
| Copyright terms: Public domain | W3C validator |