| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iccssioo2 | Structured version Visualization version GIF version | ||
| Description: Condition for a closed interval to be a subset of an open interval. (Contributed by Mario Carneiro, 20-Feb-2015.) |
| Ref | Expression |
|---|---|
| iccssioo2 | ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴(,)𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ne0i 4290 | . . . 4 ⊢ (𝐶 ∈ (𝐴(,)𝐵) → (𝐴(,)𝐵) ≠ ∅) | |
| 2 | 1 | adantr 486 | . . 3 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ≠ ∅) |
| 3 | ndmioo 13527 | . . . 4 ⊢ (¬ (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴(,)𝐵) = ∅) | |
| 4 | 3 | necon1ai 2986 | . . 3 ⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) |
| 5 | 2, 4 | syl 18 | . 2 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) |
| 6 | eliooord 13560 | . . . 4 ⊢ (𝐶 ∈ (𝐴(,)𝐵) → (𝐴 < 𝐶 ∧ 𝐶 < 𝐵)) | |
| 7 | 6 | adantr 486 | . . 3 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐴 < 𝐶 ∧ 𝐶 < 𝐵)) |
| 8 | 7 | simpld 500 | . 2 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → 𝐴 < 𝐶) |
| 9 | eliooord 13560 | . . . 4 ⊢ (𝐷 ∈ (𝐴(,)𝐵) → (𝐴 < 𝐷 ∧ 𝐷 < 𝐵)) | |
| 10 | 9 | adantl 487 | . . 3 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐴 < 𝐷 ∧ 𝐷 < 𝐵)) |
| 11 | 10 | simprd 501 | . 2 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → 𝐷 < 𝐵) |
| 12 | iccssioo 13570 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐴 < 𝐶 ∧ 𝐷 < 𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴(,)𝐵)) | |
| 13 | 5, 8, 11, 12 | syl12anc 850 | 1 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴(,)𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2147 ≠ wne 2959 ⊆ wss 3900 ∅c0 4281 class class class wbr 5106 (class class class)co 7440 ℝ*cxr 11366 < clt 11367 (,)cioo 13500 [,]cicc 13503 |
| 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 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-pre-lttri 11298 ax-pre-lttrn 11299 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 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-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-ov 7443 df-oprab 7444 df-mpo 7445 df-1st 8022 df-2nd 8023 df-er 8742 df-en 8999 df-dom 9000 df-sdom 9001 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-ioo 13504 df-icc 13507 |
| This theorem is used by: dvivthlem1 26355 dvivthlem2 26356 amgmlem 27344 ioosconn 36178 aks4d1p1p5 43316 amgmwlem 51265 |
| Copyright terms: Public domain | W3C validator |