| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > iooneg | GIF version | ||
| Description: Membership in a negated open real interval. (Contributed by Paul Chapman, 26-Nov-2007.) |
| Ref | Expression |
|---|---|
| iooneg | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴(,)𝐵) ↔ -𝐶 ∈ (-𝐵(,)-𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltneg 7457 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐶 ↔ -𝐶 < -𝐴)) | |
| 2 | 1 | 3adant2 923 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐶 ↔ -𝐶 < -𝐴)) |
| 3 | ltneg 7457 | . . . . . 6 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 < 𝐵 ↔ -𝐵 < -𝐶)) | |
| 4 | 3 | ancoms 255 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 < 𝐵 ↔ -𝐵 < -𝐶)) |
| 5 | 4 | 3adant1 922 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 < 𝐵 ↔ -𝐵 < -𝐶)) |
| 6 | 2, 5 | anbi12d 442 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐶 ∧ 𝐶 < 𝐵) ↔ (-𝐶 < -𝐴 ∧ -𝐵 < -𝐶))) |
| 7 | ancom 253 | . . 3 ⊢ ((-𝐶 < -𝐴 ∧ -𝐵 < -𝐶) ↔ (-𝐵 < -𝐶 ∧ -𝐶 < -𝐴)) | |
| 8 | 6, 7 | syl6bb 185 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐶 ∧ 𝐶 < 𝐵) ↔ (-𝐵 < -𝐶 ∧ -𝐶 < -𝐴))) |
| 9 | rexr 7071 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 10 | rexr 7071 | . . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
| 11 | rexr 7071 | . . 3 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℝ*) | |
| 12 | elioo5 8802 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) | |
| 13 | 9, 10, 11, 12 | syl3an 1177 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) |
| 14 | renegcl 7272 | . . . 4 ⊢ (𝐵 ∈ ℝ → -𝐵 ∈ ℝ) | |
| 15 | renegcl 7272 | . . . 4 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 16 | renegcl 7272 | . . . 4 ⊢ (𝐶 ∈ ℝ → -𝐶 ∈ ℝ) | |
| 17 | rexr 7071 | . . . . 5 ⊢ (-𝐵 ∈ ℝ → -𝐵 ∈ ℝ*) | |
| 18 | rexr 7071 | . . . . 5 ⊢ (-𝐴 ∈ ℝ → -𝐴 ∈ ℝ*) | |
| 19 | rexr 7071 | . . . . 5 ⊢ (-𝐶 ∈ ℝ → -𝐶 ∈ ℝ*) | |
| 20 | elioo5 8802 | . . . . 5 ⊢ ((-𝐵 ∈ ℝ* ∧ -𝐴 ∈ ℝ* ∧ -𝐶 ∈ ℝ*) → (-𝐶 ∈ (-𝐵(,)-𝐴) ↔ (-𝐵 < -𝐶 ∧ -𝐶 < -𝐴))) | |
| 21 | 17, 18, 19, 20 | syl3an 1177 | . . . 4 ⊢ ((-𝐵 ∈ ℝ ∧ -𝐴 ∈ ℝ ∧ -𝐶 ∈ ℝ) → (-𝐶 ∈ (-𝐵(,)-𝐴) ↔ (-𝐵 < -𝐶 ∧ -𝐶 < -𝐴))) |
| 22 | 14, 15, 16, 21 | syl3an 1177 | . . 3 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (-𝐶 ∈ (-𝐵(,)-𝐴) ↔ (-𝐵 < -𝐶 ∧ -𝐶 < -𝐴))) |
| 23 | 22 | 3com12 1108 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (-𝐶 ∈ (-𝐵(,)-𝐴) ↔ (-𝐵 < -𝐶 ∧ -𝐶 < -𝐴))) |
| 24 | 8, 13, 23 | 3bitr4d 209 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴(,)𝐵) ↔ -𝐶 ∈ (-𝐵(,)-𝐴))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 97 ↔ wb 98 ∧ w3a 885 ∈ wcel 1393 class class class wbr 3764 (class class class)co 5512 ℝcr 6888 ℝ*cxr 7059 < clt 7060 -cneg 7183 (,)cioo 8757 |
| This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-13 1404 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-sep 3875 ax-pow 3927 ax-pr 3944 ax-un 4170 ax-setind 4262 ax-cnex 6975 ax-resscn 6976 ax-1cn 6977 ax-1re 6978 ax-icn 6979 ax-addcl 6980 ax-addrcl 6981 ax-mulcl 6982 ax-addcom 6984 ax-addass 6986 ax-distr 6988 ax-i2m1 6989 ax-0id 6992 ax-rnegex 6993 ax-cnre 6995 ax-pre-ltadd 7000 |
| This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-nel 2207 df-ral 2311 df-rex 2312 df-reu 2313 df-rab 2315 df-v 2559 df-sbc 2765 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-br 3765 df-opab 3819 df-id 4030 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-iota 4867 df-fun 4904 df-fv 4910 df-riota 5468 df-ov 5515 df-oprab 5516 df-mpt2 5517 df-pnf 7062 df-mnf 7063 df-xr 7064 df-ltxr 7065 df-sub 7184 df-neg 7185 df-ioo 8761 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |