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 9964 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
2 | rexr 9964 | . . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
3 | elicc1 12090 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) | |
4 | 1, 2, 3 | syl2an 493 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
5 | mnfxr 9975 | . . . . . . . 8 ⊢ -∞ ∈ ℝ* | |
6 | 5 | a1i 11 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ ∈ ℝ*) |
7 | 1 | ad2antrr 758 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐴 ∈ ℝ*) |
8 | simpr1 1060 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ∈ ℝ*) | |
9 | mnflt 11833 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → -∞ < 𝐴) | |
10 | 9 | ad2antrr 758 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ < 𝐴) |
11 | simpr2 1061 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐴 ≤ 𝐶) | |
12 | 6, 7, 8, 10, 11 | xrltletrd 11868 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ < 𝐶) |
13 | 2 | ad2antlr 759 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐵 ∈ ℝ*) |
14 | pnfxr 9971 | . . . . . . . 8 ⊢ +∞ ∈ ℝ* | |
15 | 14 | a1i 11 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → +∞ ∈ ℝ*) |
16 | simpr3 1062 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ≤ 𝐵) | |
17 | ltpnf 11830 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ → 𝐵 < +∞) | |
18 | 17 | ad2antlr 759 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐵 < +∞) |
19 | 8, 13, 15, 16, 18 | xrlelttrd 11867 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 < +∞) |
20 | xrrebnd 11873 | . . . . . . 7 ⊢ (𝐶 ∈ ℝ* → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞))) | |
21 | 8, 20 | syl 17 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞))) |
22 | 12, 19, 21 | mpbir2and 959 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ∈ ℝ) |
23 | 22, 11, 16 | 3jca 1235 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) → (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) |
24 | 23 | ex 449 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) → (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
25 | rexr 9964 | . . . 4 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℝ*) | |
26 | 25 | 3anim1i 1241 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) → (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) |
27 | 24, 26 | impbid1 214 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
28 | 4, 27 | bitrd 267 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 ∈ wcel 1977 class class class wbr 4583 (class class class)co 6549 ℝcr 9814 +∞cpnf 9950 -∞cmnf 9951 ℝ*cxr 9952 < clt 9953 ≤ cle 9954 [,]cicc 12049 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-pre-lttri 9889 ax-pre-lttrn 9890 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-po 4959 df-so 4960 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-icc 12053 |
This theorem is referenced by: elicc2i 12110 iccssre 12126 iccsupr 12137 iccneg 12164 iccsplit 12176 iccshftr 12177 iccshftl 12179 iccdil 12181 icccntr 12183 iccf1o 12187 supicc 12191 icco1 14119 iccntr 22432 icccmplem1 22433 icccmplem2 22434 icccmplem3 22435 reconnlem1 22437 reconnlem2 22438 cnmpt2pc 22535 icoopnst 22546 iocopnst 22547 cnheiborlem 22561 ivthlem2 23028 ivthlem3 23029 ivthicc 23034 evthicc2 23036 ovolficc 23044 ovolicc1 23091 ovolicc2lem2 23093 ovolicc2lem5 23096 ovolicopnf 23099 dyadmaxlem 23171 opnmbllem 23175 volsup2 23179 volcn 23180 mbfi1fseqlem6 23293 itgspliticc 23409 itgsplitioo 23410 ditgcl 23428 ditgswap 23429 ditgsplitlem 23430 ditgsplit 23431 dvlip 23560 dvlip2 23562 dveq0 23567 dvgt0lem1 23569 dvivthlem1 23575 dvne0 23578 dvcnvrelem1 23584 dvcnvrelem2 23585 dvcnvre 23586 dvfsumlem2 23594 ftc1lem1 23602 ftc1lem2 23603 ftc1a 23604 ftc1lem4 23606 ftc2 23611 ftc2ditglem 23612 itgsubstlem 23615 pserulm 23980 loglesqrt 24299 log2tlbnd 24472 ppisval 24630 chtleppi 24735 fsumvma2 24739 chpchtsum 24744 chpub 24745 rplogsumlem2 24974 chpdifbndlem1 25042 pntibndlem2a 25079 pntibndlem2 25080 pntlemj 25092 pntlem3 25098 pntleml 25100 rescon 30482 cvmliftlem10 30530 opnmbllem0 32615 ftc2nc 32664 areacirclem2 32671 areacirclem4 32673 areacirc 32675 isbnd3 32753 isbnd3b 32754 prdsbnd 32762 iccbnd 32809 eliccd 38573 eliccre 38575 iccshift 38591 iccsuble 38592 limcicciooub 38704 icccncfext 38773 itgsubsticc 38868 iblcncfioo 38870 itgiccshift 38872 itgperiod 38873 itgsbtaddcnst 38874 fourierdlem42 39042 fourierdlem54 39053 fourierdlem63 39062 fourierdlem65 39064 fourierdlem74 39073 fourierdlem75 39074 fourierdlem82 39081 fourierdlem93 39092 fourierdlem101 39100 fourierdlem104 39103 fourierdlem111 39110 |
Copyright terms: Public domain | W3C validator |