![]() |
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 13498 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) = (𝐴[,]𝐵)) | |
2 | 1 | eleq2d 2815 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → (𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ 𝐶 ∈ (𝐴[,]𝐵))) |
3 | 2 | biimpar 476 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴[,]𝐵)) → 𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵})) |
4 | elun 4149 | . . . . . 6 ⊢ (𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 ∈ {𝐴, 𝐵})) | |
5 | elprg 4654 | . . . . . . 7 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → (𝐶 ∈ {𝐴, 𝐵} ↔ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵))) | |
6 | 5 | orbi2d 913 | . . . . . 6 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → ((𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 ∈ {𝐴, 𝐵}) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)))) |
7 | 4, 6 | bitrid 282 | . . . . 5 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → (𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)))) |
8 | 7 | adantl 480 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴[,]𝐵)) → (𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)))) |
9 | 3, 8 | mpbid 231 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴[,]𝐵)) → (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵))) |
10 | 3orass 1087 | . . . 4 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐴 ∨ 𝐶 = 𝐵) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵))) | |
11 | 3orcoma 1090 | . . . 4 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐴 ∨ 𝐶 = 𝐵) ↔ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵)) | |
12 | 10, 11 | bitr3i 276 | . . 3 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)) ↔ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵)) |
13 | 9, 12 | sylib 217 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴[,]𝐵)) → (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵)) |
14 | lbicc2 13481 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵)) | |
15 | 14 | adantr 479 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐴) → 𝐴 ∈ (𝐴[,]𝐵)) |
16 | eleq1 2817 | . . . . 5 ⊢ (𝐶 = 𝐴 → (𝐶 ∈ (𝐴[,]𝐵) ↔ 𝐴 ∈ (𝐴[,]𝐵))) | |
17 | 16 | adantl 480 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐴) → (𝐶 ∈ (𝐴[,]𝐵) ↔ 𝐴 ∈ (𝐴[,]𝐵))) |
18 | 15, 17 | mpbird 256 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐴) → 𝐶 ∈ (𝐴[,]𝐵)) |
19 | ioossicc 13450 | . . . . 5 ⊢ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵) | |
20 | 19 | sseli 3978 | . . . 4 ⊢ (𝐶 ∈ (𝐴(,)𝐵) → 𝐶 ∈ (𝐴[,]𝐵)) |
21 | 20 | adantl 480 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴(,)𝐵)) → 𝐶 ∈ (𝐴[,]𝐵)) |
22 | ubicc2 13482 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ (𝐴[,]𝐵)) | |
23 | 22 | adantr 479 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐵) → 𝐵 ∈ (𝐴[,]𝐵)) |
24 | eleq1 2817 | . . . . 5 ⊢ (𝐶 = 𝐵 → (𝐶 ∈ (𝐴[,]𝐵) ↔ 𝐵 ∈ (𝐴[,]𝐵))) | |
25 | 24 | adantl 480 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐵) → (𝐶 ∈ (𝐴[,]𝐵) ↔ 𝐵 ∈ (𝐴[,]𝐵))) |
26 | 23, 25 | mpbird 256 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐵) → 𝐶 ∈ (𝐴[,]𝐵)) |
27 | 18, 21, 26 | 3jaodan 1427 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵)) → 𝐶 ∈ (𝐴[,]𝐵)) |
28 | 13, 27 | impbida 799 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 845 ∨ w3o 1083 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ∪ cun 3947 {cpr 4634 class class class wbr 5152 (class class class)co 7426 ℝ*cxr 11285 ≤ cle 11287 (,)cioo 13364 [,]cicc 13367 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-cnex 11202 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 ax-pre-mulgt0 11223 ax-pre-sup 11224 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-iun 5002 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-om 7877 df-1st 7999 df-2nd 8000 df-frecs 8293 df-wrecs 8324 df-recs 8398 df-rdg 8437 df-er 8731 df-en 8971 df-dom 8972 df-sdom 8973 df-sup 9473 df-inf 9474 df-pnf 11288 df-mnf 11289 df-xr 11290 df-ltxr 11291 df-le 11292 df-sub 11484 df-neg 11485 df-div 11910 df-nn 12251 df-n0 12511 df-z 12597 df-uz 12861 df-q 12971 df-ioo 13368 df-ico 13370 df-icc 13371 |
This theorem is referenced by: elxrge02 32676 |
Copyright terms: Public domain | W3C validator |