![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > elicc2 | Structured version Visualization version GIF version |
Description: Membership in a closed real interval. (Contributed by Paul Chapman, 21-Sep-2007.) (Revised by Mario Carneiro, 14-Jun-2014.) |
Ref | Expression |
---|---|
elicc2 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rexr 11336 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
2 | rexr 11336 | . . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
3 | elicc1 13451 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) | |
4 | 1, 2, 3 | syl2an 595 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
5 | mnfxr 11347 | . . . . . . . 8 ⊢ -∞ ∈ ℝ* | |
6 | 5 | a1i 11 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ ∈ ℝ*) |
7 | 1 | ad2antrr 725 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐴 ∈ ℝ*) |
8 | simpr1 1194 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ∈ ℝ*) | |
9 | mnflt 13186 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → -∞ < 𝐴) | |
10 | 9 | ad2antrr 725 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ < 𝐴) |
11 | simpr2 1195 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐴 ≤ 𝐶) | |
12 | 6, 7, 8, 10, 11 | xrltletrd 13223 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ < 𝐶) |
13 | 2 | ad2antlr 726 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐵 ∈ ℝ*) |
14 | pnfxr 11344 | . . . . . . . 8 ⊢ +∞ ∈ ℝ* | |
15 | 14 | a1i 11 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → +∞ ∈ ℝ*) |
16 | simpr3 1196 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ≤ 𝐵) | |
17 | ltpnf 13183 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ → 𝐵 < +∞) | |
18 | 17 | ad2antlr 726 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐵 < +∞) |
19 | 8, 13, 15, 16, 18 | xrlelttrd 13222 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 < +∞) |
20 | xrrebnd 13230 | . . . . . . 7 ⊢ (𝐶 ∈ ℝ* → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞))) | |
21 | 8, 20 | syl 17 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞))) |
22 | 12, 19, 21 | mpbir2and 712 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ∈ ℝ) |
23 | 22, 11, 16 | 3jca 1128 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) |
24 | 23 | ex 412 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) → (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
25 | rexr 11336 | . . . 4 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℝ*) | |
26 | 25 | 3anim1i 1152 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) → (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) |
27 | 24, 26 | impbid1 225 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
28 | 4, 27 | bitrd 279 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 ∈ wcel 2108 class class class wbr 5166 (class class class)co 7448 ℝcr 11183 +∞cpnf 11321 -∞cmnf 11322 ℝ*cxr 11323 < clt 11324 ≤ cle 11325 [,]cicc 13410 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-pre-lttri 11258 ax-pre-lttrn 11259 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-po 5607 df-so 5608 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-icc 13414 |
This theorem is referenced by: elicc2i 13473 iccssre 13489 iccsupr 13502 iccneg 13532 iccsplit 13545 iccshftr 13546 iccshftl 13548 iccdil 13550 icccntr 13552 iccf1o 13556 supicc 13561 icco1 15586 iccntr 24862 icccmplem1 24863 icccmplem2 24864 icccmplem3 24865 reconnlem1 24867 reconnlem2 24868 cnmpopc 24974 icoopnst 24988 iocopnst 24989 cnheiborlem 25005 ivthlem2 25506 ivthlem3 25507 ivthicc 25512 evthicc2 25514 ovolficc 25522 ovolicc1 25570 ovolicc2lem2 25572 ovolicc2lem5 25575 ovolicopnf 25578 dyadmaxlem 25651 opnmbllem 25655 volsup2 25659 volcn 25660 mbfi1fseqlem6 25775 itgspliticc 25892 itgsplitioo 25893 ditgcl 25913 ditgswap 25914 ditgsplitlem 25915 ditgsplit 25916 dvlip 26052 dvlip2 26054 dveq0 26059 dvgt0lem1 26061 dvivthlem1 26067 dvne0 26070 dvcnvrelem1 26076 dvcnvrelem2 26077 dvcnvre 26078 dvfsumlem2 26087 dvfsumlem2OLD 26088 ftc1lem1 26096 ftc1lem2 26097 ftc1a 26098 ftc1lem4 26100 ftc2 26105 ftc2ditglem 26106 itgsubstlem 26109 pserulm 26483 loglesqrt 26822 log2tlbnd 27006 ppisval 27165 chtleppi 27272 fsumvma2 27276 chpchtsum 27281 chpub 27282 rplogsumlem2 27547 chpdifbndlem1 27615 pntibndlem2a 27652 pntibndlem2 27653 pntlemj 27665 pntlem3 27671 pntleml 27673 resconn 35214 cvmliftlem10 35262 opnmbllem0 37616 ftc2nc 37662 areacirclem2 37669 areacirclem4 37671 areacirc 37673 isbnd3 37744 isbnd3b 37745 prdsbnd 37753 iccbnd 37800 intlewftc 42018 dvrelog2 42021 aks4d1p1p5 42032 eliccd 45422 eliccre 45423 iccshift 45436 iccsuble 45437 limcicciooub 45558 icccncfext 45808 itgsubsticc 45897 iblcncfioo 45899 itgiccshift 45901 itgperiod 45902 itgsbtaddcnst 45903 fourierdlem42 46070 fourierdlem54 46081 fourierdlem63 46090 fourierdlem65 46092 fourierdlem74 46101 fourierdlem75 46102 fourierdlem82 46109 fourierdlem93 46120 fourierdlem101 46128 fourierdlem104 46131 fourierdlem111 46138 reorelicc 48444 |
Copyright terms: Public domain | W3C validator |