| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iccneg | Structured version Visualization version GIF version | ||
| Description: Membership in a negated closed real interval. (Contributed by Paul Chapman, 26-Nov-2007.) |
| Ref | Expression |
|---|---|
| iccneg | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ -𝐶 ∈ ( -𝐵[,] -𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | renegcl 11634 | . . . . 5 ⊢ (𝐶 ∈ ℝ → -𝐶 ∈ ℝ) | |
| 2 | ax-1 6 | . . . . 5 ⊢ (𝐶 ∈ ℝ → ( -𝐶 ∈ ℝ → 𝐶 ∈ ℝ)) | |
| 3 | 1, 2 | impbid2 229 | . . . 4 ⊢ (𝐶 ∈ ℝ → (𝐶 ∈ ℝ ↔ -𝐶 ∈ ℝ)) |
| 4 | 3 | 3ad2ant3 1153 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ ℝ ↔ -𝐶 ∈ ℝ)) |
| 5 | ancom 466 | . . . 4 ⊢ ((𝐶 ≤ 𝐵 ∧ 𝐴 ≤ 𝐶) ↔ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) | |
| 6 | leneg 11832 | . . . . . . 7 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ≤ 𝐵 ↔ -𝐵 ≤ -𝐶)) | |
| 7 | 6 | ancoms 464 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ≤ 𝐵 ↔ -𝐵 ≤ -𝐶)) |
| 8 | 7 | 3adant1 1148 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ≤ 𝐵 ↔ -𝐵 ≤ -𝐶)) |
| 9 | leneg 11832 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐶 ↔ -𝐶 ≤ -𝐴)) | |
| 10 | 9 | 3adant2 1149 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐶 ↔ -𝐶 ≤ -𝐴)) |
| 11 | 8, 10 | anbi12d 644 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 ≤ 𝐵 ∧ 𝐴 ≤ 𝐶) ↔ ( -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) |
| 12 | 5, 11 | bitr3id 288 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) ↔ ( -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) |
| 13 | 4, 12 | anbi12d 644 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 ∈ ℝ ∧ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) ↔ ( -𝐶 ∈ ℝ ∧ ( -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴)))) |
| 14 | elicc2 13555 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) | |
| 15 | 14 | 3adant3 1150 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
| 16 | 3anass 1111 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) ↔ (𝐶 ∈ ℝ ∧ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) | |
| 17 | 15, 16 | bitrdi 290 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))) |
| 18 | renegcl 11634 | . . . . 5 ⊢ (𝐵 ∈ ℝ → -𝐵 ∈ ℝ) | |
| 19 | renegcl 11634 | . . . . 5 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 20 | elicc2 13555 | . . . . 5 ⊢ (( -𝐵 ∈ ℝ ∧ -𝐴 ∈ ℝ) → ( -𝐶 ∈ ( -𝐵[,] -𝐴) ↔ ( -𝐶 ∈ ℝ ∧ -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) | |
| 21 | 18, 19, 20 | syl2anr 609 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ( -𝐶 ∈ ( -𝐵[,] -𝐴) ↔ ( -𝐶 ∈ ℝ ∧ -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) |
| 22 | 21 | 3adant3 1150 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ( -𝐶 ∈ ( -𝐵[,] -𝐴) ↔ ( -𝐶 ∈ ℝ ∧ -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) |
| 23 | 3anass 1111 | . . 3 ⊢ (( -𝐶 ∈ ℝ ∧ -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴) ↔ ( -𝐶 ∈ ℝ ∧ ( -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) | |
| 24 | 22, 23 | bitrdi 290 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ( -𝐶 ∈ ( -𝐵[,] -𝐴) ↔ ( -𝐶 ∈ ℝ ∧ ( -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴)))) |
| 25 | 13, 17, 24 | 3bitr4d 314 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ -𝐶 ∈ ( -𝐵[,] -𝐴))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2146 class class class wbr 5106 (class class class)co 7430 ℝcr 11212 ≤ cle 11357 -cneg 11555 [,]cicc 13492 |
| 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 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 ax-cnex 11269 ax-resscn 11270 ax-1cn 11271 ax-icn 11272 ax-addcl 11273 ax-addrcl 11274 ax-mulcl 11275 ax-mulrcl 11276 ax-mulcom 11277 ax-addass 11278 ax-mulass 11279 ax-distr 11280 ax-i2m1 11281 ax-1ne0 11282 ax-1rid 11283 ax-rnegex 11284 ax-rrecex 11285 ax-cnre 11286 ax-pre-lttri 11287 ax-pre-lttrn 11288 ax-pre-ltadd 11289 |
| 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 2101 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-reu 3370 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 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-er 8731 df-en 8988 df-dom 8989 df-sdom 8990 df-pnf 11358 df-mnf 11359 df-xr 11360 df-ltxr 11361 df-le 11362 df-sub 11556 df-neg 11557 df-icc 13496 |
| This theorem is used by: xrhmeo 25282 dvivth 26345 |
| Copyright terms: Public domain | W3C validator |