| 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 13478 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) = (𝐴[,]𝐵)) | |
| 2 | 1 | eqcomd 2767 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → (𝐴[,]𝐵) = ((𝐴(,)𝐵) ∪ {𝐴, 𝐵})) |
| 3 | 2 | difeq1d 4077 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = (((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ∖ {𝐴, 𝐵})) |
| 4 | difun2 4432 | . . . . 5 ⊢ (((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ∖ {𝐴, 𝐵}) = ((𝐴(,)𝐵) ∖ {𝐴, 𝐵}) | |
| 5 | iooinlbub 46037 | . . . . . 6 ⊢ ((𝐴(,)𝐵) ∩ {𝐴, 𝐵}) = ∅ | |
| 6 | disj3 4405 | . . . . . 6 ⊢ (((𝐴(,)𝐵) ∩ {𝐴, 𝐵}) = ∅ ↔ (𝐴(,)𝐵) = ((𝐴(,)𝐵) ∖ {𝐴, 𝐵})) | |
| 7 | 5, 6 | mpbi 232 | . . . . 5 ⊢ (𝐴(,)𝐵) = ((𝐴(,)𝐵) ∖ {𝐴, 𝐵}) |
| 8 | 4, 7 | eqtr4i 2787 | . . . 4 ⊢ (((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ∖ {𝐴, 𝐵}) = (𝐴(,)𝐵) |
| 9 | 3, 8 | eqtrdi 2812 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = (𝐴(,)𝐵)) |
| 10 | 9 | 3expa 1130 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = (𝐴(,)𝐵)) |
| 11 | difssd 4088 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) ⊆ (𝐴[,]𝐵)) | |
| 12 | simpr 488 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ¬ 𝐴 ≤ 𝐵) | |
| 13 | xrlenlt 11240 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) | |
| 14 | 13 | adantr 484 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
| 15 | 12, 14 | mtbid 326 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ¬ ¬ 𝐵 < 𝐴) |
| 16 | 15 | notnotrd 133 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → 𝐵 < 𝐴) |
| 17 | icc0 13390 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴[,]𝐵) = ∅ ↔ 𝐵 < 𝐴)) | |
| 18 | 17 | adantr 484 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) = ∅ ↔ 𝐵 < 𝐴)) |
| 19 | 16, 18 | mpbird 259 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → (𝐴[,]𝐵) = ∅) |
| 20 | 11, 19 | sseqtrd 3970 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) ⊆ ∅) |
| 21 | ss0 4353 | . . . 4 ⊢ (((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) ⊆ ∅ → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = ∅) | |
| 22 | 20, 21 | syl 17 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = ∅) |
| 23 | simplr 778 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ*) | |
| 24 | simpll 776 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → 𝐴 ∈ ℝ*) | |
| 25 | 23, 24, 16 | xrltled 13145 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → 𝐵 ≤ 𝐴) |
| 26 | ioo0 13367 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴)) | |
| 27 | 26 | adantr 484 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴)) |
| 28 | 25, 27 | mpbird 259 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → (𝐴(,)𝐵) = ∅) |
| 29 | 22, 28 | eqtr4d 2799 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐴 ≤ 𝐵) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = (𝐴(,)𝐵)) |
| 30 | 10, 29 | pm2.61dan 822 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴[,]𝐵) ∖ {𝐴, 𝐵}) = (𝐴(,)𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ∖ cdif 3899 ∪ cun 3900 ∩ cin 3901 ⊆ wss 3902 ∅c0 4283 {cpr 4581 class class class wbr 5097 (class class class)co 7390 ℝ*cxr 11208 < clt 11209 ≤ cle 11210 (,)cioo 13342 [,]cicc 13345 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7712 ax-cnex 11122 ax-resscn 11123 ax-1cn 11124 ax-icn 11125 ax-addcl 11126 ax-addrcl 11127 ax-mulcl 11128 ax-mulrcl 11129 ax-mulcom 11130 ax-addass 11131 ax-mulass 11132 ax-distr 11133 ax-i2m1 11134 ax-1ne0 11135 ax-1rid 11136 ax-rnegex 11137 ax-rrecex 11138 ax-cnre 11139 ax-pre-lttri 11140 ax-pre-lttrn 11141 ax-pre-ltadd 11142 ax-pre-mulgt0 11143 ax-pre-sup 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7841 df-1st 7964 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-er 8671 df-en 8921 df-dom 8922 df-sdom 8923 df-sup 9381 df-inf 9382 df-pnf 11211 df-mnf 11212 df-xr 11213 df-ltxr 11214 df-le 11215 df-sub 11409 df-neg 11410 df-div 11838 df-nn 12204 df-n0 12475 df-z 12562 df-uz 12833 df-q 12943 df-ioo 13346 df-ico 13348 df-icc 13349 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |