Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iccss | 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, 20-Feb-2015.) |
Ref | Expression |
---|---|
iccss | ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐴 ≤ 𝐶 ∧ 𝐷 ≤ 𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,]𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rexr 11071 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
2 | rexr 11071 | . . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
3 | 1, 2 | anim12i 614 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) |
4 | df-icc 13136 | . . 3 ⊢ [,] = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)}) | |
5 | xrletr 12942 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐶 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → ((𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝑤) → 𝐴 ≤ 𝑤)) | |
6 | xrletr 12942 | . . 3 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐷 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝑤 ≤ 𝐷 ∧ 𝐷 ≤ 𝐵) → 𝑤 ≤ 𝐵)) | |
7 | 4, 4, 5, 6 | ixxss12 13149 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐴 ≤ 𝐶 ∧ 𝐷 ≤ 𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,]𝐵)) |
8 | 3, 7 | sylan 581 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐴 ≤ 𝐶 ∧ 𝐷 ≤ 𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,]𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 ∈ wcel 2104 ⊆ wss 3892 class class class wbr 5081 (class class class)co 7307 ℝcr 10920 ℝ*cxr 11058 ≤ cle 11060 [,]cicc 13132 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 ax-cnex 10977 ax-resscn 10978 ax-pre-lttri 10995 ax-pre-lttrn 10996 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rab 3333 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-iun 4933 df-br 5082 df-opab 5144 df-mpt 5165 df-id 5500 df-po 5514 df-so 5515 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-ov 7310 df-oprab 7311 df-mpo 7312 df-1st 7863 df-2nd 7864 df-er 8529 df-en 8765 df-dom 8766 df-sdom 8767 df-pnf 11061 df-mnf 11062 df-xr 11063 df-ltxr 11064 df-le 11065 df-icc 13136 |
This theorem is referenced by: xrhmeo 24158 lebnumii 24178 pcoval1 24225 pcoval2 24228 ivthicc 24671 dyaddisjlem 24808 volsup2 24818 volcn 24819 mbfi1fseqlem5 24933 dvcvx 25233 dvfsumle 25234 dvfsumabs 25236 harmonicbnd3 26206 ppisval 26302 chtwordi 26354 ppiwordi 26360 chpub 26417 cvmliftlem2 33297 fourierdlem76 43952 fourierdlem103 43979 fourierdlem104 43980 fourierdlem107 43983 fourierdlem112 43988 salexct3 44110 salgensscntex 44112 icccldii 46456 sepfsepc 46465 |
Copyright terms: Public domain | W3C validator |