![]() |
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 11208 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
2 | elico1 13314 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴[,)𝐵) ↔ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵))) | |
3 | 1, 2 | sylan 581 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴[,)𝐵) ↔ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵))) |
4 | mnfxr 11219 | . . . . . . . 8 ⊢ -∞ ∈ ℝ* | |
5 | 4 | a1i 11 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → -∞ ∈ ℝ*) |
6 | 1 | ad2antrr 725 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐴 ∈ ℝ*) |
7 | simpr1 1195 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐶 ∈ ℝ*) | |
8 | mnflt 13051 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → -∞ < 𝐴) | |
9 | 8 | ad2antrr 725 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → -∞ < 𝐴) |
10 | simpr2 1196 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐴 ≤ 𝐶) | |
11 | 5, 6, 7, 9, 10 | xrltletrd 13087 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → -∞ < 𝐶) |
12 | simplr 768 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐵 ∈ ℝ*) | |
13 | pnfxr 11216 | . . . . . . . 8 ⊢ +∞ ∈ ℝ* | |
14 | 13 | a1i 11 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → +∞ ∈ ℝ*) |
15 | simpr3 1197 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐶 < 𝐵) | |
16 | pnfge 13058 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ* → 𝐵 ≤ +∞) | |
17 | 16 | ad2antlr 726 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐵 ≤ +∞) |
18 | 7, 12, 14, 15, 17 | xrltletrd 13087 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐶 < +∞) |
19 | xrrebnd 13094 | . . . . . . 7 ⊢ (𝐶 ∈ ℝ* → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞))) | |
20 | 7, 19 | syl 17 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞))) |
21 | 11, 18, 20 | mpbir2and 712 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → 𝐶 ∈ ℝ) |
22 | 21, 10, 15 | 3jca 1129 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) → (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) |
23 | 22 | ex 414 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → ((𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵) → (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵))) |
24 | rexr 11208 | . . . 4 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℝ*) | |
25 | 24 | 3anim1i 1153 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵) → (𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)) |
26 | 23, 25 | impbid1 224 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → ((𝐶 ∈ ℝ* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵))) |
27 | 3, 26 | bitrd 279 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴[,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 ∈ wcel 2107 class class class wbr 5110 (class class class)co 7362 ℝcr 11057 +∞cpnf 11193 -∞cmnf 11194 ℝ*cxr 11195 < clt 11196 ≤ cle 11197 [,)cico 13273 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2708 ax-sep 5261 ax-nul 5268 ax-pow 5325 ax-pr 5389 ax-un 7677 ax-cnex 11114 ax-resscn 11115 ax-pre-lttri 11132 ax-pre-lttrn 11133 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3066 df-rex 3075 df-rab 3411 df-v 3450 df-sbc 3745 df-csb 3861 df-dif 3918 df-un 3920 df-in 3922 df-ss 3932 df-nul 4288 df-if 4492 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-br 5111 df-opab 5173 df-mpt 5194 df-id 5536 df-po 5550 df-so 5551 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6453 df-fun 6503 df-fn 6504 df-f 6505 df-f1 6506 df-fo 6507 df-f1o 6508 df-fv 6509 df-ov 7365 df-oprab 7366 df-mpo 7367 df-er 8655 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11198 df-mnf 11199 df-xr 11200 df-ltxr 11201 df-le 11202 df-ico 13277 |
This theorem is referenced by: icossre 13352 elicopnf 13369 icoshft 13397 modelico 13793 muladdmodid 13823 icodiamlt 15327 fprodge0 15883 fprodge1 15885 rge0srg 20884 metustexhalf 23928 cnbl0 24153 icoopnst 24318 iocopnst 24319 icopnfcnv 24321 icopnfhmeo 24322 iccpnfcnv 24323 psercnlem2 25799 psercnlem1 25800 psercn 25801 abelth 25816 cosq34lt1 25899 tanord1 25909 tanord 25910 efopnlem1 26027 logtayl 26031 rlimcnp 26331 rlimcnp2 26332 dchrvmasumlem2 26862 dchrvmasumiflem1 26865 pntlemb 26961 pnt 26978 ubico 31720 xrge0slmod 32180 voliune 32868 volfiniune 32869 dya2icoseg 32917 sibfinima 32979 relowlpssretop 35864 tan2h 36099 itg2addnclem2 36159 binomcxplemdvbinom 42707 binomcxplemcvg 42708 binomcxplemnotnn0 42710 limciccioolb 43936 fourierdlem32 44454 fourierdlem43 44465 fourierdlem63 44484 fourierdlem79 44500 fouriersw 44546 expnegico01 46673 dignnld 46763 eenglngeehlnmlem1 46897 i0oii 47026 sepfsepc 47034 |
Copyright terms: Public domain | W3C validator |