Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elioc2 | Structured version Visualization version GIF version |
Description: Membership in an open-below, closed-above real interval. (Contributed by Paul Chapman, 30-Dec-2007.) (Revised by Mario Carneiro, 14-Jun-2014.) |
Ref | Expression |
---|---|
elioc2 | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴(,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rexr 10952 | . . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
2 | elioc1 13050 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴(,]𝐵) ↔ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵))) | |
3 | 1, 2 | sylan2 592 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴(,]𝐵) ↔ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵))) |
4 | mnfxr 10963 | . . . . . . . 8 ⊢ -∞ ∈ ℝ* | |
5 | 4 | a1i 11 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ ∈ ℝ*) |
6 | simpll 763 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐴 ∈ ℝ*) | |
7 | simpr1 1192 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ∈ ℝ*) | |
8 | mnfle 12799 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ* → -∞ ≤ 𝐴) | |
9 | 8 | ad2antrr 722 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ ≤ 𝐴) |
10 | simpr2 1193 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐴 < 𝐶) | |
11 | 5, 6, 7, 9, 10 | xrlelttrd 12823 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → -∞ < 𝐶) |
12 | 1 | ad2antlr 723 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐵 ∈ ℝ*) |
13 | pnfxr 10960 | . . . . . . . 8 ⊢ +∞ ∈ ℝ* | |
14 | 13 | a1i 11 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → +∞ ∈ ℝ*) |
15 | simpr3 1194 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ≤ 𝐵) | |
16 | ltpnf 12785 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ → 𝐵 < +∞) | |
17 | 16 | ad2antlr 723 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐵 < +∞) |
18 | 7, 12, 14, 15, 17 | xrlelttrd 12823 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 < +∞) |
19 | xrrebnd 12831 | . . . . . . 7 ⊢ (𝐶 ∈ ℝ* → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞))) | |
20 | 7, 19 | syl 17 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → (𝐶 ∈ ℝ ↔ (-∞ < 𝐶 ∧ 𝐶 < +∞))) |
21 | 11, 18, 20 | mpbir2and 709 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝐶 ∈ ℝ) |
22 | 21, 10, 15 | 3jca 1126 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) |
23 | 22 | ex 412 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) → ((𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵) → (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵))) |
24 | rexr 10952 | . . . 4 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℝ*) | |
25 | 24 | 3anim1i 1150 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵) → (𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) |
26 | 23, 25 | impbid1 224 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) → ((𝐶 ∈ ℝ* ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵))) |
27 | 3, 26 | 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 (,]cioc 13009 |
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-ioc 13013 |
This theorem is referenced by: iocssre 13088 ef01bndlem 15821 sin01bnd 15822 cos01bnd 15823 cos1bnd 15824 sinltx 15826 sin01gt0 15827 cos01gt0 15828 sin02gt0 15829 sincos1sgn 15830 sincos2sgn 15831 icoopnst 24008 iocopnst 24009 ismbf3d 24723 aaliou3lem2 25408 aaliou3lem3 25409 pilem2 25516 sinhalfpilem 25525 sincosq1lem 25559 coseq0negpitopi 25565 tangtx 25567 sincos4thpi 25575 efif1olem1 25603 efif1olem2 25604 efif1o 25607 efifo 25608 ellogrn 25620 logimclad 25633 ellogdm 25699 logdmnrp 25701 dvloglem 25708 dvlog2lem 25712 asinneg 25941 atans2 25986 ressatans 25989 abvcxp 26668 ostth2 26690 xrge0iifcv 31786 xrge0iifiso 31787 xrge0iifhom 31789 sinccvglem 33530 bj-pinftyccb 35319 bj-pinftynminfty 35325 dvasin 35788 areacirclem4 35795 gtnelioc 42919 limcicciooub 43068 fourierdlem4 43542 fourierdlem26 43564 fourierdlem33 43571 fourierdlem37 43575 fourierdlem65 43602 fourierdlem79 43616 fouriersw 43662 eenglngeehlnmlem1 45971 eenglngeehlnmlem2 45972 io1ii 46102 sepfsepc 46109 |
Copyright terms: Public domain | W3C validator |