| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > iccdifprioo | Structured version Visualization version GIF version | ||
| Description: An open interval is the closed interval without the bounds. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
| Ref | Expression |
|---|---|
| iccdifprioo | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = (𝐴(,)𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prunioo 13429 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) = (𝐴[,]𝐵)) | |
| 2 | 1 | eqcomd 2747 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → (𝐴[,]𝐵) = ((𝐴(,)𝐵) ∪ {𝐴, 𝐵})) |
| 3 | 2 | difeq1d 4059 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = (((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ∖ {𝐴, 𝐵})) |
| 4 | difun2 4412 | . . . . 5 ⊢ (((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ∖ {𝐴, 𝐵}) = ((𝐴(,)𝐵) ∖ {𝐴, 𝐵}) | |
| 5 | iooinlbub 45960 | . . . . . 6 ⊢ ((𝐴(,)𝐵) ∩ {𝐴, 𝐵}) = ∅ | |
| 6 | disj3 4385 | . . . . . 6 ⊢ (((𝐴(,)𝐵) ∩ {𝐴, 𝐵}) = ∅ ↔ (𝐴(,)𝐵) = ((𝐴(,)𝐵) ∖ {𝐴, 𝐵})) | |
| 7 | 5, 6 | mpbi 232 | . . . . 5 ⊢ (𝐴(,)𝐵) = ((𝐴(,)𝐵) ∖ {𝐴, 𝐵}) |
| 8 | 4, 7 | eqtr4i 2767 | . . . 4 ⊢ (((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ∖ {𝐴, 𝐵}) = (𝐴(,)𝐵) |
| 9 | 3, 8 | eqtrdi 2792 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = (𝐴(,)𝐵)) |
| 10 | 9 | 3expa 1125 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = (𝐴(,)𝐵)) |
| 11 | difssd 4070 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) ⊆ (𝐴[,]𝐵)) | |
| 12 | simpr 486 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ¬ 𝐴 ≤ 𝐵) | |
| 13 | xrlenlt 11205 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) | |
| 14 | 13 | adantr 482 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
| 15 | 12, 14 | mtbid 326 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ¬ ¬ 𝐵 < 𝐴) |
| 16 | 15 | notnotrd 133 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → 𝐵 < 𝐴) |
| 17 | icc0 13341 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴[,]𝐵) = ∅ ↔ 𝐵 < 𝐴)) | |
| 18 | 17 | adantr 482 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) = ∅ ↔ 𝐵 < 𝐴)) |
| 19 | 16, 18 | mpbird 259 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → (𝐴[,]𝐵) = ∅) |
| 20 | 11, 19 | sseqtrd 3953 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) ⊆ ∅) |
| 21 | ss0 4333 | . . . 4 ⊢ (((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) ⊆ ∅ → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = ∅) | |
| 22 | 20, 21 | syl 17 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = ∅) |
| 23 | simplr 775 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ*) | |
| 24 | simpll 773 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → 𝐴 ∈ ℝ*) | |
| 25 | 23, 24, 16 | xrltled 13096 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → 𝐵 ≤ 𝐴) |
| 26 | ioo0 13318 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴)) | |
| 27 | 26 | adantr 482 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴)) |
| 28 | 25, 27 | mpbird 259 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → (𝐴(,)𝐵) = ∅) |
| 29 | 22, 28 | eqtr4d 2779 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = (𝐴(,)𝐵)) |
| 30 | 10, 29 | pm2.61dan 819 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = (𝐴(,)𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ∖ cdif 3882 ∪ cun 3883 ∩ cin 3884 ⊆ wss 3885 ∅c0 4264 {cpr 4560 class class class wbr 5075 (class class class)co 7360 ℝ*cxr 11173 < clt 11174 ≤ cle 11175 (,)cioo 13293 [,]cicc 13296 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 ax-pre-sup 11111 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-sup 9349 df-inf 9350 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-div 11803 df-nn 12170 df-n0 12433 df-z 12520 df-uz 12784 df-q 12894 df-ioo 13297 df-ico 13299 df-icc 13300 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |