| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rpnegap | GIF version | ||
| Description: Either a real apart from zero or its negation is a positive real, but not both. (Contributed by Jim Kingdon, 23-Mar-2020.) |
| Ref | Expression |
|---|---|
| rpnegap | ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (𝐴 ∈ ℝ+ ⊻ -𝐴 ∈ ℝ+)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0re 8276 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
| 2 | reapltxor 8865 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 # 0 ↔ (𝐴 < 0 ⊻ 0 < 𝐴))) | |
| 3 | 1, 2 | mpan2 425 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (𝐴 # 0 ↔ (𝐴 < 0 ⊻ 0 < 𝐴))) |
| 4 | xorcom 1433 | . . . . . 6 ⊢ ((𝐴 < 0 ⊻ 0 < 𝐴) ↔ (0 < 𝐴 ⊻ 𝐴 < 0)) | |
| 5 | 3, 4 | bitrdi 196 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 # 0 ↔ (0 < 𝐴 ⊻ 𝐴 < 0))) |
| 6 | 5 | pm5.32i 454 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) ↔ (𝐴 ∈ ℝ ∧ (0 < 𝐴 ⊻ 𝐴 < 0))) |
| 7 | anxordi 1445 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (0 < 𝐴 ⊻ 𝐴 < 0)) ↔ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) ⊻ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) | |
| 8 | 6, 7 | bitri 184 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) ↔ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) ⊻ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) |
| 9 | 8 | biimpi 120 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → ((𝐴 ∈ ℝ ∧ 0 < 𝐴) ⊻ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) |
| 10 | elrp 9991 | . . . 4 ⊢ (𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 0 < 𝐴)) | |
| 11 | 10 | a1i 9 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 0 < 𝐴))) |
| 12 | elrp 9991 | . . . . . 6 ⊢ (-𝐴 ∈ ℝ+ ↔ (-𝐴 ∈ ℝ ∧ 0 < -𝐴)) | |
| 13 | renegcl 8536 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 14 | 13 | biantrurd 305 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (0 < -𝐴 ↔ (-𝐴 ∈ ℝ ∧ 0 < -𝐴))) |
| 15 | 12, 14 | bitr4id 199 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (-𝐴 ∈ ℝ+ ↔ 0 < -𝐴)) |
| 16 | lt0neg1 8744 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 < 0 ↔ 0 < -𝐴)) | |
| 17 | ibar 301 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 < 0 ↔ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) | |
| 18 | 15, 16, 17 | 3bitr2d 216 | . . . 4 ⊢ (𝐴 ∈ ℝ → (-𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) |
| 19 | 18 | adantr 276 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (-𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) |
| 20 | 11, 19 | xorbi12d 1427 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → ((𝐴 ∈ ℝ+ ⊻ -𝐴 ∈ ℝ+) ↔ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) ⊻ (𝐴 ∈ ℝ ∧ 𝐴 < 0)))) |
| 21 | 9, 20 | mpbird 167 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (𝐴 ∈ ℝ+ ⊻ -𝐴 ∈ ℝ+)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ⊻ wxo 1420 ∈ wcel 2205 class class class wbr 4111 ℝcr 8128 0cc0 8129 < clt 8310 -cneg 8447 # cap 8857 ℝ+crp 9989 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-cnex 8220 ax-resscn 8221 ax-1cn 8222 ax-1re 8223 ax-icn 8224 ax-addcl 8225 ax-addrcl 8226 ax-mulcl 8227 ax-mulrcl 8228 ax-addcom 8229 ax-mulcom 8230 ax-addass 8231 ax-mulass 8232 ax-distr 8233 ax-i2m1 8234 ax-0lt1 8235 ax-1rid 8236 ax-0id 8237 ax-rnegex 8238 ax-precex 8239 ax-cnre 8240 ax-pre-ltirr 8241 ax-pre-ltwlin 8242 ax-pre-lttrn 8243 ax-pre-apti 8244 ax-pre-ltadd 8245 ax-pre-mulgt0 8246 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-xor 1421 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3045 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-br 4112 df-opab 4174 df-id 4416 df-po 4419 df-iso 4420 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-iota 5314 df-fun 5356 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-pnf 8312 df-mnf 8313 df-ltxr 8315 df-sub 8448 df-neg 8449 df-reap 8851 df-ap 8858 df-rp 9990 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |