elicc2 - Metamath Proof Explorer

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

Theorem elicc2 13371

Description: Membership in a closed real interval. (Contributed by Paul Chapman, 21-Sep-2007.) (Revised by Mario Carneiro, 14-Jun-2014.)

**Assertion**
Ref	Expression
elicc2	⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))

**Proof of Theorem elicc2**
Step	Hyp	Ref	Expression
1		rexr 11242	. . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ^*)
2		rexr 11242	. . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ^*)
3		elicc1 13350	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ^ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
4	1, 2, 3	syl2an 596	. 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
5		mnfxr 11253	. . . . . . . 8 ⊢ -∞ ∈ ℝ^*
6	5	a1i 11	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ ∈ ℝ^*)
7	1	ad2antrr 724	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐴 ∈ ℝ^*)
8		simpr1 1194	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ∈ ℝ^*)
9		mnflt 13085	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ → -∞ < 𝐴)
10	9	ad2antrr 724	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ < 𝐴)
11		simpr2 1195	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐴 ≤ 𝐶)
12	6, 7, 8, 10, 11	xrltletrd 13122	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ < 𝐶)
13	2	ad2antlr 725	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐵 ∈ ℝ^*)
14		pnfxr 11250	. . . . . . . 8 ⊢ +∞ ∈ ℝ^*
15	14	a1i 11	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → +∞ ∈ ℝ^*)
16		simpr3 1196	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ≤ 𝐵)
17		ltpnf 13082	. . . . . . . 8 ⊢ (𝐵 ∈ ℝ → 𝐵 < +∞)
18	17	ad2antlr 725	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐵 < +∞)
19	8, 13, 15, 16, 18	xrlelttrd 13121	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 < +∞)
20		xrrebnd 13129	. . . . . . 7 ⊢ (𝐶 ∈ ℝ^* → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞)))
21	8, 20	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞)))
22	12, 19, 21	mpbir2and 711	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ∈ ℝ)
23	22, 11, 16	3jca 1128	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))
24	23	ex 413	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) → (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
25		rexr 11242	. . . 4 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℝ^*)
26	25	3anim1i 1152	. . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) → (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))
27	24, 26	impbid1 224	. 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
28	4, 27	bitrd 278	1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 ∈ wcel 2106 class class class wbr 5141 (class class class)co 7393 ℝcr 11091 +∞cpnf 11227 -∞cmnf 11228 ℝ^*cxr 11229 < clt 11230 ≤ cle 11231 [,]cicc 13309

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7708 ax-cnex 11148 ax-resscn 11149 ax-pre-lttri 11166 ax-pre-lttrn 11167

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-op 4629 df-uni 4902 df-br 5142 df-opab 5204 df-mpt 5225 df-id 5567 df-po 5581 df-so 5582 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-f1 6537 df-fo 6538 df-f1o 6539 df-fv 6540 df-ov 7396 df-oprab 7397 df-mpo 7398 df-er 8686 df-en 8923 df-dom 8924 df-sdom 8925 df-pnf 11232 df-mnf 11233 df-xr 11234 df-ltxr 11235 df-le 11236 df-icc 13313

This theorem is referenced by: elicc2i 13372 iccssre 13388 iccsupr 13401 iccneg 13431 iccsplit 13444 iccshftr 13445 iccshftl 13447 iccdil 13449 icccntr 13451 iccf1o 13455 supicc 13460 icco1 15466 iccntr 24266 icccmplem1 24267 icccmplem2 24268 icccmplem3 24269 reconnlem1 24271 reconnlem2 24272 cnmpopc 24373 icoopnst 24384 iocopnst 24385 cnheiborlem 24399 ivthlem2 24898 ivthlem3 24899 ivthicc 24904 evthicc2 24906 ovolficc 24914 ovolicc1 24962 ovolicc2lem2 24964 ovolicc2lem5 24967 ovolicopnf 24970 dyadmaxlem 25043 opnmbllem 25047 volsup2 25051 volcn 25052 mbfi1fseqlem6 25167 itgspliticc 25283 itgsplitioo 25284 ditgcl 25304 ditgswap 25305 ditgsplitlem 25306 ditgsplit 25307 dvlip 25439 dvlip2 25441 dveq0 25446 dvgt0lem1 25448 dvivthlem1 25454 dvne0 25457 dvcnvrelem1 25463 dvcnvrelem2 25464 dvcnvre 25465 dvfsumlem2 25473 ftc1lem1 25481 ftc1lem2 25482 ftc1a 25483 ftc1lem4 25485 ftc2 25490 ftc2ditglem 25491 itgsubstlem 25494 pserulm 25863 loglesqrt 26193 log2tlbnd 26377 ppisval 26535 chtleppi 26640 fsumvma2 26644 chpchtsum 26649 chpub 26650 rplogsumlem2 26915 chpdifbndlem1 26983 pntibndlem2a 27020 pntibndlem2 27021 pntlemj 27033 pntlem3 27039 pntleml 27041 resconn 34066 cvmliftlem10 34114 opnmbllem0 36326 ftc2nc 36372 areacirclem2 36379 areacirclem4 36381 areacirc 36383 isbnd3 36455 isbnd3b 36456 prdsbnd 36464 iccbnd 36511 intlewftc 40729 dvrelog2 40732 aks4d1p1p5 40743 eliccd 43988 eliccre 43989 iccshift 44002 iccsuble 44003 limcicciooub 44124 icccncfext 44374 itgsubsticc 44463 iblcncfioo 44465 itgiccshift 44467 itgperiod 44468 itgsbtaddcnst 44469 fourierdlem42 44636 fourierdlem54 44647 fourierdlem63 44656 fourierdlem65 44658 fourierdlem74 44667 fourierdlem75 44668 fourierdlem82 44675 fourierdlem93 44686 fourierdlem101 44694 fourierdlem104 44697 fourierdlem111 44704 reorelicc 47042

W3C validator