iccssico2 - Metamath Proof Explorer

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

Theorem iccssico2 13348

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

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

Proof of Theorem iccssico2 Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ico 13279	. . . 4 ⊢ [,) = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
2	1	elmpocl1 7610	. . 3 ⊢ (𝐶 ∈ (𝐴[,)𝐵) → 𝐴 ∈ ℝ^*)
3	2	adantr 480	. 2 ⊢ ((𝐶 ∈ (𝐴[,)𝐵) ∧ 𝐷 ∈ (𝐴[,)𝐵)) → 𝐴 ∈ ℝ^*)
4	1	elmpocl2 7611	. . 3 ⊢ (𝐶 ∈ (𝐴[,)𝐵) → 𝐵 ∈ ℝ^*)
5	4	adantr 480	. 2 ⊢ ((𝐶 ∈ (𝐴[,)𝐵) ∧ 𝐷 ∈ (𝐴[,)𝐵)) → 𝐵 ∈ ℝ^*)
6	1	elixx3g 13286	. . . . 5 ⊢ (𝐶 ∈ (𝐴[,)𝐵) ↔ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)))
7	6	simprbi 497	. . . 4 ⊢ (𝐶 ∈ (𝐴[,)𝐵) → (𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵))
8	7	simpld 494	. . 3 ⊢ (𝐶 ∈ (𝐴[,)𝐵) → 𝐴 ≤ 𝐶)
9	8	adantr 480	. 2 ⊢ ((𝐶 ∈ (𝐴[,)𝐵) ∧ 𝐷 ∈ (𝐴[,)𝐵)) → 𝐴 ≤ 𝐶)
10	1	elixx3g 13286	. . . . 5 ⊢ (𝐷 ∈ (𝐴[,)𝐵) ↔ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐷 ∈ ℝ^*) ∧ (𝐴 ≤ 𝐷 ∧ 𝐷 < 𝐵)))
11	10	simprbi 497	. . . 4 ⊢ (𝐷 ∈ (𝐴[,)𝐵) → (𝐴 ≤ 𝐷 ∧ 𝐷 < 𝐵))
12	11	simprd 495	. . 3 ⊢ (𝐷 ∈ (𝐴[,)𝐵) → 𝐷 < 𝐵)
13	12	adantl 481	. 2 ⊢ ((𝐶 ∈ (𝐴[,)𝐵) ∧ 𝐷 ∈ (𝐴[,)𝐵)) → 𝐷 < 𝐵)
14		iccssico 13346	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 ≤ 𝐶 ∧ 𝐷 < 𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,)𝐵))
15	3, 5, 9, 13, 14	syl22anc 839	1 ⊢ ((𝐶 ∈ (𝐴[,)𝐵) ∧ 𝐷 ∈ (𝐴[,)𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,)𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 ∈ wcel 2114 {crab 3401 ⊆ wss 3903 class class class wbr 5100 (class class class)co 7368 ℝ^*cxr 11177 < clt 11178 ≤ cle 11179 [,)cico 13275 [,]cicc 13276

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 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-pre-lttri 11112 ax-pre-lttrn 11113

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 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-po 5540 df-so 5541 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-ico 13279 df-icc 13280

This theorem is referenced by: icopnfhmeo 24909

W3C validator