iccssioo2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > iccssioo2		Structured version Visualization version GIF version

Theorem iccssioo2 13367

Description: Condition for a closed interval to be a subset of an open interval. (Contributed by Mario Carneiro, 20-Feb-2015.)

**Assertion**
Ref	Expression
iccssioo2	⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴(,)𝐵))

**Proof of Theorem iccssioo2**
Step	Hyp	Ref	Expression
1		ne0i 4272	. . . 4 ⊢ (𝐶 ∈ (𝐴(,)𝐵) → (𝐴(,)𝐵) ≠ ∅)
2	1	adantr 482	. . 3 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ≠ ∅)
3		ndmioo 13320	. . . 4 ⊢ (¬ (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴(,)𝐵) = ∅)
4	3	necon1ai 2963	. . 3 ⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*))
5	2, 4	syl 17	. 2 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*))
6		eliooord 13353	. . . 4 ⊢ (𝐶 ∈ (𝐴(,)𝐵) → (𝐴 < 𝐶 ∧ 𝐶 < 𝐵))
7	6	adantr 482	. . 3 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐴 < 𝐶 ∧ 𝐶 < 𝐵))
8	7	simpld 496	. 2 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → 𝐴 < 𝐶)
9		eliooord 13353	. . . 4 ⊢ (𝐷 ∈ (𝐴(,)𝐵) → (𝐴 < 𝐷 ∧ 𝐷 < 𝐵))
10	9	adantl 483	. . 3 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐴 < 𝐷 ∧ 𝐷 < 𝐵))
11	10	simprd 497	. 2 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → 𝐷 < 𝐵)
12		iccssioo 13363	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 < 𝐶 ∧ 𝐷 < 𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴(,)𝐵))
13	5, 8, 11, 12	syl12anc 843	1 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴(,)𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 ∈ wcel 2121 ≠ wne 2936 ⊆ wss 3885 ∅c0 4264 class class class wbr 5075 (class class class)co 7360 ℝ^*cxr 11173 < clt 11174 (,)cioo 13293 [,]cicc 13296

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-cnex 11089 ax-resscn 11090 ax-pre-lttri 11107 ax-pre-lttrn 11108

This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-id 5516 df-po 5529 df-so 5530 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-ov 7363 df-oprab 7364 df-mpo 7365 df-1st 7935 df-2nd 7936 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-ioo 13297 df-icc 13300

This theorem is referenced by: dvivthlem1 25997 dvivthlem2 25998 amgmlem 26975 ioosconn 35490 aks4d1p1p5 42575 amgmwlem 50306

W3C validator