| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > iccss2 | 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 10130 | . . . . . 6 ⊢ [,] = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)}) | |
| 2 | 1 | elixx3g 10136 | . . . . 5 ⊢ (𝐶 ∈ (𝐴[,]𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
| 3 | 2 | simplbi 274 | . . . 4 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*)) |
| 4 | 3 | adantr 276 | . . 3 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*)) |
| 5 | 4 | simp1d 1035 | . 2 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → 𝐴 ∈ ℝ*) |
| 6 | 4 | simp2d 1036 | . 2 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → 𝐵 ∈ ℝ*) |
| 7 | 2 | simprbi 275 | . . . 4 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) |
| 8 | 7 | adantr 276 | . . 3 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) |
| 9 | 8 | simpld 112 | . 2 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → 𝐴 ≤ 𝐶) |
| 10 | 1 | elixx3g 10136 | . . . . 5 ⊢ (𝐷 ∈ (𝐴[,]𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐷 ∈ ℝ*) ∧ (𝐴 ≤ 𝐷 ∧ 𝐷 ≤ 𝐵))) |
| 11 | 10 | simprbi 275 | . . . 4 ⊢ (𝐷 ∈ (𝐴[,]𝐵) → (𝐴 ≤ 𝐷 ∧ 𝐷 ≤ 𝐵)) |
| 12 | 11 | simprd 114 | . . 3 ⊢ (𝐷 ∈ (𝐴[,]𝐵) → 𝐷 ≤ 𝐵) |
| 13 | 12 | adantl 277 | . 2 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → 𝐷 ≤ 𝐵) |
| 14 | xrletr 10043 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐶 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → ((𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝑤) → 𝐴 ≤ 𝑤)) | |
| 15 | xrletr 10043 | . . 3 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐷 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝑤 ≤ 𝐷 ∧ 𝐷 ≤ 𝐵) → 𝑤 ≤ 𝐵)) | |
| 16 | 1, 1, 14, 15 | ixxss12 10141 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐴 ≤ 𝐶 ∧ 𝐷 ≤ 𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,]𝐵)) |
| 17 | 5, 6, 9, 13, 16 | syl22anc 1274 | 1 ⊢ ((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,]𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1004 ∈ wcel 2202 ⊆ wss 3200 class class class wbr 4088 (class class class)co 6018 ℝ*cxr 8213 ≤ cle 8215 [,]cicc 10126 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-id 4390 df-po 4393 df-iso 4394 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-iota 5286 df-fun 5328 df-fv 5334 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-icc 10130 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |