| 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 13555 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴[,]𝐵) = {𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)}) | |
| 2 | 1 | eqeq1d 2765 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴[,]𝐵) = ∅ ↔ {𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)} = ∅)) |
| 3 | df-ne 2960 | . . . . . 6 ⊢ ({𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)} ≠ ∅ ↔ ¬ {𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)} = ∅) | |
| 4 | rabn0 4342 | . . . . . 6 ⊢ ({𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)} ≠ ∅ ↔ ∃𝑥 ∈ ℝ* (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)) | |
| 5 | 3, 4 | bitr3i 280 | . . . . 5 ⊢ (¬ {𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)} = ∅ ↔ ∃𝑥 ∈ ℝ* (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)) |
| 6 | xrletr 13327 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ* ∧ 𝑥 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵) → 𝐴 ≤ 𝐵)) | |
| 7 | 6 | 3com23 1144 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑥 ∈ ℝ*) → ((𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵) → 𝐴 ≤ 𝐵)) |
| 8 | 7 | 3expa 1136 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝑥 ∈ ℝ*) → ((𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵) → 𝐴 ≤ 𝐵)) |
| 9 | 8 | rexlimdva 3167 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (∃𝑥 ∈ ℝ* (𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵) → 𝐴 ≤ 𝐵)) |
| 10 | simp2 1155 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ*) | |
| 11 | simp3 1156 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ 𝐵) | |
| 12 | xrleid 13320 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℝ* → 𝐵 ≤ 𝐵) | |
| 13 | 12 | 3ad2ant2 1152 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐵 ≤ 𝐵) |
| 14 | breq2 5112 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → (𝐴 ≤ 𝑥 ↔ 𝐴 ≤ 𝐵)) | |
| 15 | breq1 5111 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → (𝑥 ≤ 𝐵 ↔ 𝐵 ≤ 𝐵)) | |
| 16 | 14, 15 | anbi12d 644 | . . . . . . . . 9 ⊢ (𝑥 = 𝐵 → ((𝐴 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵) ↔ (𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐵))) |
| 17 | 16 | rspcev 3580 | . . . . . . . 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 11413 | . . . 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 1570 ∈ wcel 2147 ≠ wne 2959 ∃wrex 3090 {crab 3416 ∅c0 4281 class class class wbr 5108 (class class class)co 7451 ℝ*cxr 11381 < clt 11382 ≤ cle 11383 [,]cicc 13519 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-pre-lttri 11313 ax-pre-lttrn 11314 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-icc 13523 |
| This theorem is used by: iccntr 25196 icccmp 25200 cniccbdd 25837 iccvolcl 25943 itgioo 26191 c1lip1 26372 pserulm 26806 iccdifprioo 46801 cncfiooicc 47177 ibliooicc 47254 voliccico 47282 vonicc 47968 |
| Copyright terms: Public domain | W3C validator |