![]() |
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 13518 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) = (𝐴[,]𝐵)) | |
2 | 1 | eleq2d 2825 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → (𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ 𝐶 ∈ (𝐴[,]𝐵))) |
3 | 2 | biimpar 477 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴[,]𝐵)) → 𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵})) |
4 | elun 4163 | . . . . . 6 ⊢ (𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 ∈ {𝐴, 𝐵})) | |
5 | elprg 4653 | . . . . . . 7 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → (𝐶 ∈ {𝐴, 𝐵} ↔ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵))) | |
6 | 5 | orbi2d 915 | . . . . . 6 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → ((𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 ∈ {𝐴, 𝐵}) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)))) |
7 | 4, 6 | bitrid 283 | . . . . 5 ⊢ (𝐶 ∈ (𝐴[,]𝐵) → (𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)))) |
8 | 7 | adantl 481 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴[,]𝐵)) → (𝐶 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)))) |
9 | 3, 8 | mpbid 232 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴[,]𝐵)) → (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵))) |
10 | 3orass 1089 | . . . 4 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐴 ∨ 𝐶 = 𝐵) ↔ (𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵))) | |
11 | 3orcoma 1092 | . . . 4 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐴 ∨ 𝐶 = 𝐵) ↔ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵)) | |
12 | 10, 11 | bitr3i 277 | . . 3 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∨ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)) ↔ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵)) |
13 | 9, 12 | sylib 218 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴[,]𝐵)) → (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵)) |
14 | lbicc2 13501 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵)) | |
15 | 14 | adantr 480 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐴) → 𝐴 ∈ (𝐴[,]𝐵)) |
16 | eleq1 2827 | . . . . 5 ⊢ (𝐶 = 𝐴 → (𝐶 ∈ (𝐴[,]𝐵) ↔ 𝐴 ∈ (𝐴[,]𝐵))) | |
17 | 16 | adantl 481 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐴) → (𝐶 ∈ (𝐴[,]𝐵) ↔ 𝐴 ∈ (𝐴[,]𝐵))) |
18 | 15, 17 | mpbird 257 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐴) → 𝐶 ∈ (𝐴[,]𝐵)) |
19 | ioossicc 13470 | . . . . 5 ⊢ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵) | |
20 | 19 | sseli 3991 | . . . 4 ⊢ (𝐶 ∈ (𝐴(,)𝐵) → 𝐶 ∈ (𝐴[,]𝐵)) |
21 | 20 | adantl 481 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 ∈ (𝐴(,)𝐵)) → 𝐶 ∈ (𝐴[,]𝐵)) |
22 | ubicc2 13502 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ (𝐴[,]𝐵)) | |
23 | 22 | adantr 480 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐵) → 𝐵 ∈ (𝐴[,]𝐵)) |
24 | eleq1 2827 | . . . . 5 ⊢ (𝐶 = 𝐵 → (𝐶 ∈ (𝐴[,]𝐵) ↔ 𝐵 ∈ (𝐴[,]𝐵))) | |
25 | 24 | adantl 481 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐵) → (𝐶 ∈ (𝐴[,]𝐵) ↔ 𝐵 ∈ (𝐴[,]𝐵))) |
26 | 23, 25 | mpbird 257 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ 𝐶 = 𝐵) → 𝐶 ∈ (𝐴[,]𝐵)) |
27 | 18, 21, 26 | 3jaodan 1430 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) ∧ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵)) → 𝐶 ∈ (𝐴[,]𝐵)) |
28 | 13, 27 | impbida 801 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∨ w3o 1085 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ∪ cun 3961 {cpr 4633 class class class wbr 5148 (class class class)co 7431 ℝ*cxr 11292 ≤ cle 11294 (,)cioo 13384 [,]cicc 13387 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 ax-pre-sup 11231 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-sup 9480 df-inf 9481 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-div 11919 df-nn 12265 df-n0 12525 df-z 12612 df-uz 12877 df-q 12989 df-ioo 13388 df-ico 13390 df-icc 13391 |
This theorem is referenced by: elxrge02 32899 |
Copyright terms: Public domain | W3C validator |