| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elico2 | Structured version Visualization version GIF version | ||
| Description: Membership in a closed-below, open-above real interval. (Contributed by Paul Chapman, 21-Jan-2008.) (Revised by Mario Carneiro, 14-Jun-2014.) |
| Ref | Expression |
|---|---|
| elico2 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴[,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rexr 11169 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 2 | elico1 13295 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴[,)𝐵) ↔ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵))) | |
| 3 | 1, 2 | sylan 580 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴[,)𝐵) ↔ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵))) |
| 4 | mnfxr 11180 | . . . . . . . 8 ⊢ -∞ ∈ ℝ* | |
| 5 | 4 | a1i 11 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → -∞ ∈ ℝ*) |
| 6 | 1 | ad2antrr 726 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐴 ∈ ℝ*) |
| 7 | simpr1 1195 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐶 ∈ ℝ*) | |
| 8 | mnflt 13028 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → -∞ < 𝐴) | |
| 9 | 8 | ad2antrr 726 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → -∞ < 𝐴) |
| 10 | simpr2 1196 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐴 ≤ 𝐶) | |
| 11 | 5, 6, 7, 9, 10 | xrltletrd 13066 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → -∞ < 𝐶) |
| 12 | simplr 768 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐵 ∈ ℝ*) | |
| 13 | pnfxr 11177 | . . . . . . . 8 ⊢ +∞ ∈ ℝ* | |
| 14 | 13 | a1i 11 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → +∞ ∈ ℝ*) |
| 15 | simpr3 1197 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐶 < 𝐵) | |
| 16 | pnfge 13035 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ* → 𝐵 ≤ +∞) | |
| 17 | 16 | ad2antlr 727 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐵 ≤ +∞) |
| 18 | 7, 12, 14, 15, 17 | xrltletrd 13066 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐶 < +∞) |
| 19 | xrrebnd 13074 | . . . . . . 7 ⊢ (𝐶 ∈ ℝ* → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞))) | |
| 20 | 7, 19 | syl 17 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞))) |
| 21 | 11, 18, 20 | mpbir2and 713 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐶 ∈ ℝ) |
| 22 | 21, 10, 15 | 3jca 1128 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) |
| 23 | 22 | ex 412 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → ((𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵) → (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵))) |
| 24 | rexr 11169 | . . . 4 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℝ*) | |
| 25 | 24 | 3anim1i 1152 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵) → (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) |
| 26 | 23, 25 | impbid1 225 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → ((𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵))) |
| 27 | 3, 26 | bitrd 279 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴[,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 ∈ wcel 2113 class class class wbr 5095 (class class class)co 7355 ℝcr 11016 +∞cpnf 11154 -∞cmnf 11155 ℝ*cxr 11156 < clt 11157 ≤ cle 11158 [,)cico 13254 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11073 ax-resscn 11074 ax-pre-lttri 11091 ax-pre-lttrn 11092 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5516 df-po 5529 df-so 5530 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-ov 7358 df-oprab 7359 df-mpo 7360 df-er 8631 df-en 8880 df-dom 8881 df-sdom 8882 df-pnf 11159 df-mnf 11160 df-xr 11161 df-ltxr 11162 df-le 11163 df-ico 13258 |
| This theorem is referenced by: icossre 13335 elicopnf 13352 icoshft 13380 modelico 13792 muladdmodid 13824 icodiamlt 15352 fprodge0 15907 fprodge1 15909 rge0srg 21384 metustexhalf 24491 cnbl0 24708 icoopnst 24883 iocopnst 24884 icopnfcnv 24887 icopnfhmeo 24888 iccpnfcnv 24889 psercnlem2 26381 psercnlem1 26382 psercn 26383 abelth 26398 cosq34lt1 26483 tanord1 26493 tanord 26494 efopnlem1 26612 logtayl 26616 rlimcnp 26922 rlimcnp2 26923 dchrvmasumlem2 27456 dchrvmasumiflem1 27459 pntlemb 27555 pnt 27572 ubico 32783 xrge0slmod 33357 voliune 34314 volfiniune 34315 dya2icoseg 34362 sibfinima 34424 relowlpssretop 37481 tan2h 37725 itg2addnclem2 37785 binomcxplemdvbinom 44510 binomcxplemcvg 44511 binomcxplemnotnn0 44513 limciccioolb 45783 fourierdlem32 46299 fourierdlem43 46310 fourierdlem63 46329 fourierdlem79 46345 fouriersw 46391 expnegico01 48680 dignnld 48765 eenglngeehlnmlem1 48899 i0oii 49081 sepfsepc 49089 |
| Copyright terms: Public domain | W3C validator |