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 13073

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 10952	. . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ^*)
2		rexr 10952	. . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ^*)
3		elicc1 13052	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ^ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
4	1, 2, 3	syl2an 595	. 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
5		mnfxr 10963	. . . . . . . 8 ⊢ -∞ ∈ ℝ^*
6	5	a1i 11	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ ∈ ℝ^*)
7	1	ad2antrr 722	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐴 ∈ ℝ^*)
8		simpr1 1192	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ∈ ℝ^*)
9		mnflt 12788	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ → -∞ < 𝐴)
10	9	ad2antrr 722	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ < 𝐴)
11		simpr2 1193	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐴 ≤ 𝐶)
12	6, 7, 8, 10, 11	xrltletrd 12824	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ < 𝐶)
13	2	ad2antlr 723	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐵 ∈ ℝ^*)
14		pnfxr 10960	. . . . . . . 8 ⊢ +∞ ∈ ℝ^*
15	14	a1i 11	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → +∞ ∈ ℝ^*)
16		simpr3 1194	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ≤ 𝐵)
17		ltpnf 12785	. . . . . . . 8 ⊢ (𝐵 ∈ ℝ → 𝐵 < +∞)
18	17	ad2antlr 723	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐵 < +∞)
19	8, 13, 15, 16, 18	xrlelttrd 12823	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 < +∞)
20		xrrebnd 12831	. . . . . . 7 ⊢ (𝐶 ∈ ℝ^* → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞)))
21	8, 20	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞)))
22	12, 19, 21	mpbir2and 709	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ∈ ℝ)
23	22, 11, 16	3jca 1126	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))
24	23	ex 412	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) → (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
25		rexr 10952	. . . 4 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℝ^*)
26	25	3anim1i 1150	. . 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 395 ∧ w3a 1085 ∈ wcel 2108 class class class wbr 5070 (class class class)co 7255 ℝcr 10801 +∞cpnf 10937 -∞cmnf 10938 ℝ^*cxr 10939 < clt 10940 ≤ cle 10941 [,]cicc 13011

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-pre-lttri 10876 ax-pre-lttrn 10877

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-po 5494 df-so 5495 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-icc 13015

This theorem is referenced by: elicc2i 13074 iccssre 13090 iccsupr 13103 iccneg 13133 iccsplit 13146 iccshftr 13147 iccshftl 13149 iccdil 13151 icccntr 13153 iccf1o 13157 supicc 13162 icco1 15177 iccntr 23890 icccmplem1 23891 icccmplem2 23892 icccmplem3 23893 reconnlem1 23895 reconnlem2 23896 cnmpopc 23997 icoopnst 24008 iocopnst 24009 cnheiborlem 24023 ivthlem2 24521 ivthlem3 24522 ivthicc 24527 evthicc2 24529 ovolficc 24537 ovolicc1 24585 ovolicc2lem2 24587 ovolicc2lem5 24590 ovolicopnf 24593 dyadmaxlem 24666 opnmbllem 24670 volsup2 24674 volcn 24675 mbfi1fseqlem6 24790 itgspliticc 24906 itgsplitioo 24907 ditgcl 24927 ditgswap 24928 ditgsplitlem 24929 ditgsplit 24930 dvlip 25062 dvlip2 25064 dveq0 25069 dvgt0lem1 25071 dvivthlem1 25077 dvne0 25080 dvcnvrelem1 25086 dvcnvrelem2 25087 dvcnvre 25088 dvfsumlem2 25096 ftc1lem1 25104 ftc1lem2 25105 ftc1a 25106 ftc1lem4 25108 ftc2 25113 ftc2ditglem 25114 itgsubstlem 25117 pserulm 25486 loglesqrt 25816 log2tlbnd 26000 ppisval 26158 chtleppi 26263 fsumvma2 26267 chpchtsum 26272 chpub 26273 rplogsumlem2 26538 chpdifbndlem1 26606 pntibndlem2a 26643 pntibndlem2 26644 pntlemj 26656 pntlem3 26662 pntleml 26664 resconn 33108 cvmliftlem10 33156 opnmbllem0 35740 ftc2nc 35786 areacirclem2 35793 areacirclem4 35795 areacirc 35797 isbnd3 35869 isbnd3b 35870 prdsbnd 35878 iccbnd 35925 intlewftc 39997 dvrelog2 40000 aks4d1p1p5 40011 eliccd 42932 eliccre 42933 iccshift 42946 iccsuble 42947 limcicciooub 43068 icccncfext 43318 itgsubsticc 43407 iblcncfioo 43409 itgiccshift 43411 itgperiod 43412 itgsbtaddcnst 43413 fourierdlem42 43580 fourierdlem54 43591 fourierdlem63 43600 fourierdlem65 43602 fourierdlem74 43611 fourierdlem75 43612 fourierdlem82 43619 fourierdlem93 43630 fourierdlem101 43638 fourierdlem104 43641 fourierdlem111 43648 reorelicc 45944

W3C validator