| 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 7661 | . . 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 13397 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑤 ∈ (𝐴𝑂𝐵) ↔ (𝑤 ∈ ℝ* ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵))) |
| 18 | ixx.2 | . . . . 5 ⊢ 𝑃 = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑇𝑧 ∧ 𝑧𝑈𝑦)}) | |
| 19 | 18 | elixx1 13397 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑤 ∈ (𝐴𝑃𝐵) ↔ (𝑤 ∈ ℝ* ∧ 𝐴𝑇𝑤 ∧ 𝑤𝑈𝐵))) |
| 20 | 16, 17, 19 | 3imtr4d 297 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑤 ∈ (𝐴𝑂𝐵) → 𝑤 ∈ (𝐴𝑃𝐵))) |
| 21 | 2, 20 | mpcom 39 | . 2 ⊢ (𝑤 ∈ (𝐴𝑂𝐵) → 𝑤 ∈ (𝐴𝑃𝐵)) |
| 22 | 21 | ssriv 3942 | 1 ⊢ (𝐴𝑂𝐵) ⊆ (𝐴𝑃𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 {crab 3418 ⊆ wss 3906 class class class wbr 5111 (class class class)co 7419 ∈ cmpo 7421 ℝ*cxr 11257 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-iota 6496 df-fun 6542 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-xr 11262 |
| This theorem is used by: ioossicc 13476 icossicc 13479 iocssicc 13480 ioossico 13481 dvloglem 26864 ioossioc 46266 |
| Copyright terms: Public domain | W3C validator |