| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ixxssixx | Structured version Visualization version GIF version | ||
| Description: An interval is a subset of its closure. (Contributed by Paul Chapman, 18-Oct-2007.) (Revised by Mario Carneiro, 3-Nov-2013.) |
| Ref | Expression |
|---|---|
| ixx.1 | ⊢ 𝑂 = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑅𝑧 ∧ 𝑧𝑆𝑦)}) |
| ixx.2 | ⊢ 𝑃 = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑇𝑧 ∧ 𝑧𝑈𝑦)}) |
| ixx.3 | ⊢ ((𝐴 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → (𝐴𝑅𝑤 → 𝐴𝑇𝑤)) |
| ixx.4 | ⊢ ((𝑤 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑤𝑆𝐵 → 𝑤𝑈𝐵)) |
| Ref | Expression |
|---|---|
| ixxssixx | ⊢ (𝐴𝑂𝐵) ⊆ (𝐴𝑃𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ixx.1 | . . . 4 ⊢ 𝑂 = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑅𝑧 ∧ 𝑧𝑆𝑦)}) | |
| 2 | 1 | elmpocl 7694 | . . 3 ⊢ (𝑤 ∈ (𝐴𝑂𝐵) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) |
| 3 | simp1 1154 | . . . . . 6 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → 𝑤 ∈ ℝ*) | |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝑤 ∈ ℝ* ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → 𝑤 ∈ ℝ*)) |
| 5 | simpl 488 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → 𝐴 ∈ ℝ*) | |
| 6 | 3simpa 1166 | . . . . . 6 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → (𝑤 ∈ ℝ* ∧ 𝐴𝑅𝑤)) | |
| 7 | ixx.3 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → (𝐴𝑅𝑤 → 𝐴𝑇𝑤)) | |
| 8 | 7 | expimpd 459 | . . . . . 6 ⊢ (𝐴 ∈ ℝ* → ((𝑤 ∈ ℝ* ∧ 𝐴𝑅𝑤) → 𝐴𝑇𝑤)) |
| 9 | 5, 6, 8 | syl2im 41 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝑤 ∈ ℝ* ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → 𝐴𝑇𝑤)) |
| 10 | simpr 490 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → 𝐵 ∈ ℝ*) | |
| 11 | 3simpb 1167 | . . . . . 6 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → (𝑤 ∈ ℝ* ∧ 𝑤𝑆𝐵)) | |
| 12 | ixx.4 | . . . . . . . 8 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑤𝑆𝐵 → 𝑤𝑈𝐵)) | |
| 13 | 12 | ancoms 464 | . . . . . . 7 ⊢ ((𝐵 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → (𝑤𝑆𝐵 → 𝑤𝑈𝐵)) |
| 14 | 13 | expimpd 459 | . . . . . 6 ⊢ (𝐵 ∈ ℝ* → ((𝑤 ∈ ℝ* ∧ 𝑤𝑆𝐵) → 𝑤𝑈𝐵)) |
| 15 | 10, 11, 14 | syl2im 41 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝑤 ∈ ℝ* ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → 𝑤𝑈𝐵)) |
| 16 | 4, 9, 15 | 3jcad 1147 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝑤 ∈ ℝ* ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → (𝑤 ∈ ℝ* ∧ 𝐴𝑇𝑤 ∧ 𝑤𝑈𝐵))) |
| 17 | 1 | elixx1 13525 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑤 ∈ (𝐴𝑂𝐵) ↔ (𝑤 ∈ ℝ* ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵))) |
| 18 | ixx.2 | . . . . 5 ⊢ 𝑃 = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑇𝑧 ∧ 𝑧𝑈𝑦)}) | |
| 19 | 18 | elixx1 13525 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑤 ∈ (𝐴𝑃𝐵) ↔ (𝑤 ∈ ℝ* ∧ 𝐴𝑇𝑤 ∧ 𝑤𝑈𝐵))) |
| 20 | 16, 17, 19 | 3imtr4d 297 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑤 ∈ (𝐴𝑂𝐵) → 𝑤 ∈ (𝐴𝑃𝐵))) |
| 21 | 2, 20 | mpcom 39 | . 2 ⊢ (𝑤 ∈ (𝐴𝑂𝐵) → 𝑤 ∈ (𝐴𝑃𝐵)) |
| 22 | 21 | ssriv 3917 | 1 ⊢ (𝐴𝑂𝐵) ⊆ (𝐴𝑃𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 {crab 3416 ⊆ wss 3900 class class class wbr 5108 (class class class)co 7451 ∈ cmpo 7453 ℝ*cxr 11381 |
| 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-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 |
| 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 4841 df-uni 4873 df-br 5109 df-opab 5174 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-iota 6520 df-fun 6568 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-xr 11386 |
| This theorem is used by: ioossicc 13604 icossicc 13607 iocssicc 13608 ioossico 13609 dvloglem 27033 ioossioc 46777 |
| Copyright terms: Public domain | W3C validator |