| 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 8642 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐶 ↔ -𝐶 < -𝐴)) | |
| 2 | 1 | 3adant2 1042 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐶 ↔ -𝐶 < -𝐴)) |
| 3 | ltneg 8642 | . . . . . 6 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 < 𝐵 ↔ -𝐵 < -𝐶)) | |
| 4 | 3 | ancoms 268 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 < 𝐵 ↔ -𝐵 < -𝐶)) |
| 5 | 4 | 3adant1 1041 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 < 𝐵 ↔ -𝐵 < -𝐶)) |
| 6 | 2, 5 | anbi12d 473 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐶 ∧ 𝐶 < 𝐵) ↔ (-𝐶 < -𝐴 ∧ -𝐵 < -𝐶))) |
| 7 | ancom 266 | . . 3 ⊢ ((-𝐶 < -𝐴 ∧ -𝐵 < -𝐶) ↔ (-𝐵 < -𝐶 ∧ -𝐶 < -𝐴)) | |
| 8 | 6, 7 | bitrdi 196 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐶 ∧ 𝐶 < 𝐵) ↔ (-𝐵 < -𝐶 ∧ -𝐶 < -𝐴))) |
| 9 | rexr 8225 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 10 | rexr 8225 | . . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
| 11 | rexr 8225 | . . 3 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℝ*) | |
| 12 | elioo5 10168 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) | |
| 13 | 9, 10, 11, 12 | syl3an 1315 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) |
| 14 | renegcl 8440 | . . . 4 ⊢ (𝐵 ∈ ℝ → -𝐵 ∈ ℝ) | |
| 15 | renegcl 8440 | . . . 4 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 16 | renegcl 8440 | . . . 4 ⊢ (𝐶 ∈ ℝ → -𝐶 ∈ ℝ) | |
| 17 | rexr 8225 | . . . . 5 ⊢ (-𝐵 ∈ ℝ → -𝐵 ∈ ℝ*) | |
| 18 | rexr 8225 | . . . . 5 ⊢ (-𝐴 ∈ ℝ → -𝐴 ∈ ℝ*) | |
| 19 | rexr 8225 | . . . . 5 ⊢ (-𝐶 ∈ ℝ → -𝐶 ∈ ℝ*) | |
| 20 | elioo5 10168 | . . . . 5 ⊢ ((-𝐵 ∈ ℝ* ∧ -𝐴 ∈ ℝ* ∧ -𝐶 ∈ ℝ*) → (-𝐶 ∈ (-𝐵(,)-𝐴) ↔ (-𝐵 < -𝐶 ∧ -𝐶 < -𝐴))) | |
| 21 | 17, 18, 19, 20 | syl3an 1315 | . . . 4 ⊢ ((-𝐵 ∈ ℝ ∧ -𝐴 ∈ ℝ ∧ -𝐶 ∈ ℝ) → (-𝐶 ∈ (-𝐵(,)-𝐴) ↔ (-𝐵 < -𝐶 ∧ -𝐶 < -𝐴))) |
| 22 | 14, 15, 16, 21 | syl3an 1315 | . . 3 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (-𝐶 ∈ (-𝐵(,)-𝐴) ↔ (-𝐵 < -𝐶 ∧ -𝐶 < -𝐴))) |
| 23 | 22 | 3com12 1233 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (-𝐶 ∈ (-𝐵(,)-𝐴) ↔ (-𝐵 < -𝐶 ∧ -𝐶 < -𝐴))) |
| 24 | 8, 13, 23 | 3bitr4d 220 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴(,)𝐵) ↔ -𝐶 ∈ (-𝐵(,)-𝐴))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1004 ∈ wcel 2202 class class class wbr 4088 (class class class)co 6018 ℝcr 8031 ℝ*cxr 8213 < clt 8214 -cneg 8351 (,)cioo 10123 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-distr 8136 ax-i2m1 8137 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-iota 5286 df-fun 5328 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-sub 8352 df-neg 8353 df-ioo 10127 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |