| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > icc0 | Structured version Visualization version GIF version | ||
| Description: An empty closed interval of extended reals. (Contributed by FL, 30-May-2014.) |
| Ref | Expression |
|---|---|
| icc0 | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴[,]𝐵) = ∅ ↔ 𝐵 < 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iccval 13520 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴[,]𝐵) = {𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)}) | |
| 2 | 1 | eqeq1d 2762 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴[,]𝐵) = ∅ ↔ {𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)} = ∅)) |
| 3 | df-ne 2956 | . . . . . 6 ⊢ ({𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)} ≠ ∅ ↔ ¬ {𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)} = ∅) | |
| 4 | rabn0 4338 | . . . . . 6 ⊢ ({𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)} ≠ ∅ ↔ ∃𝑥 ∈ ℝ* (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)) | |
| 5 | 3, 4 | bitr3i 280 | . . . . 5 ⊢ (¬ {𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)} = ∅ ↔ ∃𝑥 ∈ ℝ* (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)) |
| 6 | xrletr 13292 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ* ∧ 𝑥 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵) → 𝐴 ≤ 𝐵)) | |
| 7 | 6 | 3com23 1144 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑥 ∈ ℝ*) → ((𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵) → 𝐴 ≤ 𝐵)) |
| 8 | 7 | 3expa 1136 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝑥 ∈ ℝ*) → ((𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵) → 𝐴 ≤ 𝐵)) |
| 9 | 8 | rexlimdva 3163 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (∃𝑥 ∈ ℝ* (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵) → 𝐴 ≤ 𝐵)) |
| 10 | simp2 1155 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ*) | |
| 11 | simp3 1156 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ 𝐵) | |
| 12 | xrleid 13285 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℝ* → 𝐵 ≤ 𝐵) | |
| 13 | 12 | 3ad2ant2 1152 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐵 ≤ 𝐵) |
| 14 | breq2 5106 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → (𝐴 ≤ 𝑥 ↔ 𝐴 ≤ 𝐵)) | |
| 15 | breq1 5105 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → (𝑥 ≤ 𝐵 ↔ 𝐵 ≤ 𝐵)) | |
| 16 | 14, 15 | anbi12d 644 | . . . . . . . . 9 ⊢ (𝑥 = 𝐵 → ((𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵) ↔ (𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐵))) |
| 17 | 16 | rspcev 3576 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℝ* ∧ (𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐵)) → ∃𝑥 ∈ ℝ* (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)) |
| 18 | 10, 11, 13, 17 | syl12anc 850 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → ∃𝑥 ∈ ℝ* (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)) |
| 19 | 18 | 3expia 1139 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 ≤ 𝐵 → ∃𝑥 ∈ ℝ* (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵))) |
| 20 | 9, 19 | impbid 215 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (∃𝑥 ∈ ℝ* (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵) ↔ 𝐴 ≤ 𝐵)) |
| 21 | 5, 20 | bitrid 286 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (¬ {𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)} = ∅ ↔ 𝐴 ≤ 𝐵)) |
| 22 | xrlenlt 11379 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) | |
| 23 | 21, 22 | bitrd 282 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (¬ {𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)} = ∅ ↔ ¬ 𝐵 < 𝐴)) |
| 24 | 23 | con4bid 320 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ({𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)} = ∅ ↔ 𝐵 < 𝐴)) |
| 25 | 2, 24 | bitrd 282 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴[,]𝐵) = ∅ ↔ 𝐵 < 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∃wrex 3086 {crab 3412 ∅c0 4277 class class class wbr 5102 (class class class)co 7422 ℝ*cxr 11347 < clt 11348 ≤ cle 11349 [,]cicc 13484 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7753 ax-cnex 11261 ax-resscn 11262 ax-pre-lttri 11279 ax-pre-lttrn 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-po 5558 df-so 5559 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6496 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-ov 7425 df-oprab 7426 df-mpo 7427 df-er 8722 df-en 8979 df-dom 8980 df-sdom 8981 df-pnf 11350 df-mnf 11351 df-xr 11352 df-ltxr 11353 df-le 11354 df-icc 13488 |
| This theorem is used by: iccntr 25148 icccmp 25152 cniccbdd 25789 iccvolcl 25895 itgioo 26143 c1lip1 26324 pserulm 26756 iccdifprioo 46635 cncfiooicc 47011 ibliooicc 47088 voliccico 47116 vonicc 47802 |
| Copyright terms: Public domain | W3C validator |