![]() |
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 8047 | . . . . 5 ⊢ (𝐶 ∈ ℝ → -𝐶 ∈ ℝ) | |
2 | ax-1 6 | . . . . 5 ⊢ (𝐶 ∈ ℝ → (-𝐶 ∈ ℝ → 𝐶 ∈ ℝ)) | |
3 | 1, 2 | impbid2 142 | . . . 4 ⊢ (𝐶 ∈ ℝ → (𝐶 ∈ ℝ ↔ -𝐶 ∈ ℝ)) |
4 | 3 | 3ad2ant3 1005 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ ℝ ↔ -𝐶 ∈ ℝ)) |
5 | ancom 264 | . . . 4 ⊢ ((𝐶 ≤ 𝐵 ∧ 𝐴 ≤ 𝐶) ↔ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) | |
6 | leneg 8251 | . . . . . . 7 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ≤ 𝐵 ↔ -𝐵 ≤ -𝐶)) | |
7 | 6 | ancoms 266 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ≤ 𝐵 ↔ -𝐵 ≤ -𝐶)) |
8 | 7 | 3adant1 1000 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ≤ 𝐵 ↔ -𝐵 ≤ -𝐶)) |
9 | leneg 8251 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐶 ↔ -𝐶 ≤ -𝐴)) | |
10 | 9 | 3adant2 1001 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 ≤ 𝐶 ↔ -𝐶 ≤ -𝐴)) |
11 | 8, 10 | anbi12d 465 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 ≤ 𝐵 ∧ 𝐴 ≤ 𝐶) ↔ (-𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) |
12 | 5, 11 | bitr3id 193 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) ↔ (-𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) |
13 | 4, 12 | anbi12d 465 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 ∈ ℝ ∧ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)) ↔ (-𝐶 ∈ ℝ ∧ (-𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴)))) |
14 | elicc2 9751 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) | |
15 | 14 | 3adant3 1002 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) |
16 | 3anass 967 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵) ↔ (𝐶 ∈ ℝ ∧ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))) | |
17 | 15, 16 | syl6bb 195 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))) |
18 | renegcl 8047 | . . . . 5 ⊢ (𝐵 ∈ ℝ → -𝐵 ∈ ℝ) | |
19 | renegcl 8047 | . . . . 5 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
20 | elicc2 9751 | . . . . 5 ⊢ ((-𝐵 ∈ ℝ ∧ -𝐴 ∈ ℝ) → (-𝐶 ∈ (-𝐵[,]-𝐴) ↔ (-𝐶 ∈ ℝ ∧ -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) | |
21 | 18, 19, 20 | syl2anr 288 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (-𝐶 ∈ (-𝐵[,]-𝐴) ↔ (-𝐶 ∈ ℝ ∧ -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) |
22 | 21 | 3adant3 1002 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (-𝐶 ∈ (-𝐵[,]-𝐴) ↔ (-𝐶 ∈ ℝ ∧ -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) |
23 | 3anass 967 | . . 3 ⊢ ((-𝐶 ∈ ℝ ∧ -𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴) ↔ (-𝐶 ∈ ℝ ∧ (-𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴))) | |
24 | 22, 23 | syl6bb 195 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (-𝐶 ∈ (-𝐵[,]-𝐴) ↔ (-𝐶 ∈ ℝ ∧ (-𝐵 ≤ -𝐶 ∧ -𝐶 ≤ -𝐴)))) |
25 | 13, 17, 24 | 3bitr4d 219 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ -𝐶 ∈ (-𝐵[,]-𝐴))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 963 ∈ wcel 1481 class class class wbr 3937 (class class class)co 5782 ℝcr 7643 ≤ cle 7825 -cneg 7958 [,]cicc 9704 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-13 1492 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 ax-pr 4139 ax-un 4363 ax-setind 4460 ax-cnex 7735 ax-resscn 7736 ax-1cn 7737 ax-1re 7738 ax-icn 7739 ax-addcl 7740 ax-addrcl 7741 ax-mulcl 7742 ax-addcom 7744 ax-addass 7746 ax-distr 7748 ax-i2m1 7749 ax-0id 7752 ax-rnegex 7753 ax-cnre 7755 ax-pre-ltirr 7756 ax-pre-ltwlin 7757 ax-pre-lttrn 7758 ax-pre-ltadd 7760 |
This theorem depends on definitions: df-bi 116 df-3or 964 df-3an 965 df-tru 1335 df-fal 1338 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-nel 2405 df-ral 2422 df-rex 2423 df-reu 2424 df-rab 2426 df-v 2691 df-sbc 2914 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-br 3938 df-opab 3998 df-id 4223 df-po 4226 df-iso 4227 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-iota 5096 df-fun 5133 df-fv 5139 df-riota 5738 df-ov 5785 df-oprab 5786 df-mpo 5787 df-pnf 7826 df-mnf 7827 df-xr 7828 df-ltxr 7829 df-le 7830 df-sub 7959 df-neg 7960 df-icc 9708 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |