![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > eliccioo | Structured version Visualization version GIF version |
Description: Membership in a closed interval of extended reals versus the same open interval. (Contributed by Thierry Arnoux, 18-Dec-2016.) |
Ref | Expression |
---|---|
eliccioo | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prunioo 13407 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) = (𝐴[,]𝐵)) | |
2 | 1 | eleq2d 2820 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → (𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ 𝐶 ∈ (𝐴[,]𝐵))) |
3 | 2 | biimpar 479 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴[,]𝐵)) → 𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵})) |
4 | elun 4112 | . . . . . 6 ⊢ (𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 ∈ {𝐴, 𝐵})) | |
5 | elprg 4611 | . . . . . . 7 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → (𝐶 ∈ {𝐴, 𝐵} ↔ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵))) | |
6 | 5 | orbi2d 915 | . . . . . 6 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → ((𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 ∈ {𝐴, 𝐵}) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)))) |
7 | 4, 6 | bitrid 283 | . . . . 5 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → (𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)))) |
8 | 7 | adantl 483 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴[,]𝐵)) → (𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)))) |
9 | 3, 8 | mpbid 231 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴[,]𝐵)) → (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵))) |
10 | 3orass 1091 | . . . 4 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐴 ∨ 𝐶 = 𝐵) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵))) | |
11 | 3orcoma 1094 | . . . 4 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐴 ∨ 𝐶 = 𝐵) ↔ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵)) | |
12 | 10, 11 | bitr3i 277 | . . 3 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)) ↔ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵)) |
13 | 9, 12 | sylib 217 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴[,]𝐵)) → (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵)) |
14 | lbicc2 13390 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵)) | |
15 | 14 | adantr 482 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐴) → 𝐴 ∈ (𝐴[,]𝐵)) |
16 | eleq1 2822 | . . . . 5 ⊢ (𝐶 = 𝐴 → (𝐶 ∈ (𝐴[,]𝐵) ↔ 𝐴 ∈ (𝐴[,]𝐵))) | |
17 | 16 | adantl 483 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐴) → (𝐶 ∈ (𝐴[,]𝐵) ↔ 𝐴 ∈ (𝐴[,]𝐵))) |
18 | 15, 17 | mpbird 257 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐴) → 𝐶 ∈ (𝐴[,]𝐵)) |
19 | ioossicc 13359 | . . . . 5 ⊢ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵) | |
20 | 19 | sseli 3944 | . . . 4 ⊢ (𝐶 ∈ (𝐴(,)𝐵) → 𝐶 ∈ (𝐴[,]𝐵)) |
21 | 20 | adantl 483 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴(,)𝐵)) → 𝐶 ∈ (𝐴[,]𝐵)) |
22 | ubicc2 13391 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ (𝐴[,]𝐵)) | |
23 | 22 | adantr 482 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐵) → 𝐵 ∈ (𝐴[,]𝐵)) |
24 | eleq1 2822 | . . . . 5 ⊢ (𝐶 = 𝐵 → (𝐶 ∈ (𝐴[,]𝐵) ↔ 𝐵 ∈ (𝐴[,]𝐵))) | |
25 | 24 | adantl 483 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐵) → (𝐶 ∈ (𝐴[,]𝐵) ↔ 𝐵 ∈ (𝐴[,]𝐵))) |
26 | 23, 25 | mpbird 257 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐵) → 𝐶 ∈ (𝐴[,]𝐵)) |
27 | 18, 21, 26 | 3jaodan 1431 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵)) → 𝐶 ∈ (𝐴[,]𝐵)) |
28 | 13, 27 | impbida 800 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 846 ∨ w3o 1087 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∪ cun 3912 {cpr 4592 class class class wbr 5109 (class class class)co 7361 ℝ*cxr 11196 ≤ cle 11198 (,)cioo 13273 [,]cicc 13276 |
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 2704 ax-sep 5260 ax-nul 5267 ax-pow 5324 ax-pr 5388 ax-un 7676 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-pre-mulgt0 11136 ax-pre-sup 11137 |
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 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3352 df-reu 3353 df-rab 3407 df-v 3449 df-sbc 3744 df-csb 3860 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3933 df-nul 4287 df-if 4491 df-pw 4566 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4870 df-iun 4960 df-br 5110 df-opab 5172 df-mpt 5193 df-tr 5227 df-id 5535 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5592 df-we 5594 df-xp 5643 df-rel 5644 df-cnv 5645 df-co 5646 df-dm 5647 df-rn 5648 df-res 5649 df-ima 5650 df-pred 6257 df-ord 6324 df-on 6325 df-lim 6326 df-suc 6327 df-iota 6452 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7317 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7807 df-1st 7925 df-2nd 7926 df-frecs 8216 df-wrecs 8247 df-recs 8321 df-rdg 8360 df-er 8654 df-en 8890 df-dom 8891 df-sdom 8892 df-sup 9386 df-inf 9387 df-pnf 11199 df-mnf 11200 df-xr 11201 df-ltxr 11202 df-le 11203 df-sub 11395 df-neg 11396 df-div 11821 df-nn 12162 df-n0 12422 df-z 12508 df-uz 12772 df-q 12882 df-ioo 13277 df-ico 13279 df-icc 13280 |
This theorem is referenced by: elxrge02 31844 |
Copyright terms: Public domain | W3C validator |