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 13336

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 4282	. . . 4 ⊢ (𝐶 ∈ (𝐴(,)𝐵) → (𝐴(,)𝐵) ≠ ∅)
2	1	adantr 480	. . 3 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ≠ ∅)
3		ndmioo 13289	. . . 4 ⊢ (¬ (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴(,)𝐵) = ∅)
4	3	necon1ai 2960	. . 3 ⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*))
5	2, 4	syl 17	. 2 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*))
6		eliooord 13322	. . . 4 ⊢ (𝐶 ∈ (𝐴(,)𝐵) → (𝐴 < 𝐶 ∧ 𝐶 < 𝐵))
7	6	adantr 480	. . 3 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐴 < 𝐶 ∧ 𝐶 < 𝐵))
8	7	simpld 494	. 2 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → 𝐴 < 𝐶)
9		eliooord 13322	. . . 4 ⊢ (𝐷 ∈ (𝐴(,)𝐵) → (𝐴 < 𝐷 ∧ 𝐷 < 𝐵))
10	9	adantl 481	. . 3 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐴 < 𝐷 ∧ 𝐷 < 𝐵))
11	10	simprd 495	. 2 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → 𝐷 < 𝐵)
12		iccssioo 13332	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 < 𝐶 ∧ 𝐷 < 𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴(,)𝐵))
13	5, 8, 11, 12	syl12anc 837	1 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴(,)𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2114 ≠ wne 2933 ⊆ wss 3890 ∅c0 4274 class class class wbr 5086 (class class class)co 7358 ℝ^*cxr 11166 < clt 11167 (,)cioo 13262 [,]cicc 13265

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-cnex 11083 ax-resscn 11084 ax-pre-lttri 11101 ax-pre-lttrn 11102

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5517 df-po 5530 df-so 5531 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-er 8634 df-en 8885 df-dom 8886 df-sdom 8887 df-pnf 11169 df-mnf 11170 df-xr 11171 df-ltxr 11172 df-le 11173 df-ioo 13266 df-icc 13269

This theorem is referenced by: dvivthlem1 25954 dvivthlem2 25955 amgmlem 26940 ioosconn 35435 aks4d1p1p5 42506 amgmwlem 50235

W3C validator