![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > iccneg | 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 8208 | . . . . 5 ⊢ (𝐶 ∈ ℝ → -𝐶 ∈ ℝ) | |
2 | ax-1 6 | . . . . 5 ⊢ (𝐶 ∈ ℝ → (-𝐶 ∈ ℝ → 𝐶 ∈ ℝ)) | |
3 | 1, 2 | impbid2 143 | . . . 4 ⊢ (𝐶 ∈ ℝ → (𝐶 ∈ ℝ ↔ -𝐶 ∈ ℝ)) |
4 | 3 | 3ad2ant3 1020 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ ℝ ↔ -𝐶 ∈ ℝ)) |
5 | ancom 266 | . . . 4 ⊢ ((𝐶 ≤ 𝐵 ∧ 𝐴 ≤ 𝐶) ↔ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) | |
6 | leneg 8412 | . . . . . . 7 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ≤ 𝐵 ↔ -𝐵 ≤ -𝐶)) | |
7 | 6 | ancoms 268 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ≤ 𝐵 ↔ -𝐵 ≤ -𝐶)) |
8 | 7 | 3adant1 1015 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ≤ 𝐵 ↔ -𝐵 ≤ -𝐶)) |
9 | leneg 8412 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐶 ↔ -𝐶 ≤ -𝐴)) | |
10 | 9 | 3adant2 1016 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐶 ↔ -𝐶 ≤ -𝐴)) |
11 | 8, 10 | anbi12d 473 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 ≤ 𝐵 ∧ 𝐴 ≤ 𝐶) ↔ (-𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) |
12 | 5, 11 | bitr3id 194 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) ↔ (-𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) |
13 | 4, 12 | anbi12d 473 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 ∈ ℝ ∧ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) ↔ (-𝐶 ∈ ℝ ∧ (-𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴)))) |
14 | elicc2 9925 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) | |
15 | 14 | 3adant3 1017 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
16 | 3anass 982 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) ↔ (𝐶 ∈ ℝ ∧ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) | |
17 | 15, 16 | bitrdi 196 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))) |
18 | renegcl 8208 | . . . . 5 ⊢ (𝐵 ∈ ℝ → -𝐵 ∈ ℝ) | |
19 | renegcl 8208 | . . . . 5 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
20 | elicc2 9925 | . . . . 5 ⊢ ((-𝐵 ∈ ℝ ∧ -𝐴 ∈ ℝ) → (-𝐶 ∈ (-𝐵[,]-𝐴) ↔ (-𝐶 ∈ ℝ ∧ -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) | |
21 | 18, 19, 20 | syl2anr 290 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (-𝐶 ∈ (-𝐵[,]-𝐴) ↔ (-𝐶 ∈ ℝ ∧ -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) |
22 | 21 | 3adant3 1017 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (-𝐶 ∈ (-𝐵[,]-𝐴) ↔ (-𝐶 ∈ ℝ ∧ -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) |
23 | 3anass 982 | . . 3 ⊢ ((-𝐶 ∈ ℝ ∧ -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴) ↔ (-𝐶 ∈ ℝ ∧ (-𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) | |
24 | 22, 23 | bitrdi 196 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (-𝐶 ∈ (-𝐵[,]-𝐴) ↔ (-𝐶 ∈ ℝ ∧ (-𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴)))) |
25 | 13, 17, 24 | 3bitr4d 220 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ -𝐶 ∈ (-𝐵[,]-𝐴))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 978 ∈ wcel 2148 class class class wbr 4000 (class class class)co 5869 ℝcr 7801 ≤ cle 7983 -cneg 8119 [,]cicc 9878 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4118 ax-pow 4171 ax-pr 4206 ax-un 4430 ax-setind 4533 ax-cnex 7893 ax-resscn 7894 ax-1cn 7895 ax-1re 7896 ax-icn 7897 ax-addcl 7898 ax-addrcl 7899 ax-mulcl 7900 ax-addcom 7902 ax-addass 7904 ax-distr 7906 ax-i2m1 7907 ax-0id 7910 ax-rnegex 7911 ax-cnre 7913 ax-pre-ltirr 7914 ax-pre-ltwlin 7915 ax-pre-lttrn 7916 ax-pre-ltadd 7918 |
This theorem depends on definitions: df-bi 117 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2739 df-sbc 2963 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-uni 3808 df-br 4001 df-opab 4062 df-id 4290 df-po 4293 df-iso 4294 df-xp 4629 df-rel 4630 df-cnv 4631 df-co 4632 df-dm 4633 df-iota 5174 df-fun 5214 df-fv 5220 df-riota 5825 df-ov 5872 df-oprab 5873 df-mpo 5874 df-pnf 7984 df-mnf 7985 df-xr 7986 df-ltxr 7987 df-le 7988 df-sub 8120 df-neg 8121 df-icc 9882 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |