| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iccss2 | Structured version Visualization version GIF version | ||
| Description: Condition for a closed interval to be a subset of another closed interval. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 28-Apr-2015.) |
| Ref | Expression |
|---|---|
| iccss2 | ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,]𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-icc 13268 | . . . . . 6 ⊢ [,] = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)}) | |
| 2 | 1 | elixx3g 13274 | . . . . 5 ⊢ (𝐶 ∈ (𝐴[,]𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
| 3 | 2 | simplbi 497 | . . . 4 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*)) |
| 4 | 3 | adantr 480 | . . 3 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*)) |
| 5 | 4 | simp1d 1142 | . 2 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → 𝐴 ∈ ℝ*) |
| 6 | 4 | simp2d 1143 | . 2 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → 𝐵 ∈ ℝ*) |
| 7 | 2 | simprbi 496 | . . . 4 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) |
| 8 | 7 | adantr 480 | . . 3 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) |
| 9 | 8 | simpld 494 | . 2 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → 𝐴 ≤ 𝐶) |
| 10 | 1 | elixx3g 13274 | . . . . 5 ⊢ (𝐷 ∈ (𝐴[,]𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐷 ∈ ℝ*) ∧ (𝐴 ≤ 𝐷 ∧ 𝐷 ≤ 𝐵))) |
| 11 | 10 | simprbi 496 | . . . 4 ⊢ (𝐷 ∈ (𝐴[,]𝐵) → (𝐴 ≤ 𝐷 ∧ 𝐷 ≤ 𝐵)) |
| 12 | 11 | simprd 495 | . . 3 ⊢ (𝐷 ∈ (𝐴[,]𝐵) → 𝐷 ≤ 𝐵) |
| 13 | 12 | adantl 481 | . 2 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → 𝐷 ≤ 𝐵) |
| 14 | xrletr 13072 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐶 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → ((𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝑤) → 𝐴 ≤ 𝑤)) | |
| 15 | xrletr 13072 | . . 3 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐷 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝑤 ≤ 𝐷 ∧ 𝐷 ≤ 𝐵) → 𝑤 ≤ 𝐵)) | |
| 16 | 1, 1, 14, 15 | ixxss12 13281 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐴 ≤ 𝐶 ∧ 𝐷 ≤ 𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,]𝐵)) |
| 17 | 5, 6, 9, 13, 16 | syl22anc 838 | 1 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,]𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 ∈ wcel 2113 ⊆ wss 3901 class class class wbr 5098 (class class class)co 7358 ℝ*cxr 11165 ≤ cle 11167 [,]cicc 13264 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-pre-lttri 11100 ax-pre-lttrn 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-po 5532 df-so 5533 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-icc 13268 |
| This theorem is referenced by: ordtresticc 23167 iccconn 24775 icccvx 24904 oprpiece1res1 24905 oprpiece1res2 24906 pcoass 24980 dvlip 25954 c1liplem1 25957 dvgt0lem1 25963 ftc2ditglem 26008 ttgcontlem1 28957 unitssxrge0 34057 xrge0iifhmeo 34093 |
| Copyright terms: Public domain | W3C validator |