![]() |
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 7959 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
2 | reapltxor 8548 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 # 0 ↔ (𝐴 < 0 ⊻ 0 < 𝐴))) | |
3 | 1, 2 | mpan2 425 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (𝐴 # 0 ↔ (𝐴 < 0 ⊻ 0 < 𝐴))) |
4 | xorcom 1388 | . . . . . 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 1400 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (0 < 𝐴 ⊻ 𝐴 < 0)) ↔ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) ⊻ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) | |
8 | 6, 7 | bitri 184 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) ↔ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) ⊻ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) |
9 | 8 | biimpi 120 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → ((𝐴 ∈ ℝ ∧ 0 < 𝐴) ⊻ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) |
10 | elrp 9657 | . . . 4 ⊢ (𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 0 < 𝐴)) | |
11 | 10 | a1i 9 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 0 < 𝐴))) |
12 | elrp 9657 | . . . . . 6 ⊢ (-𝐴 ∈ ℝ+ ↔ (-𝐴 ∈ ℝ ∧ 0 < -𝐴)) | |
13 | renegcl 8220 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
14 | 13 | biantrurd 305 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (0 < -𝐴 ↔ (-𝐴 ∈ ℝ ∧ 0 < -𝐴))) |
15 | 12, 14 | bitr4id 199 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (-𝐴 ∈ ℝ+ ↔ 0 < -𝐴)) |
16 | lt0neg1 8427 | . . . . 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 1382 | . 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 1375 ∈ wcel 2148 class class class wbr 4005 ℝcr 7812 0cc0 7813 < clt 7994 -cneg 8131 # cap 8540 ℝ+crp 9655 |
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 4123 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-cnex 7904 ax-resscn 7905 ax-1cn 7906 ax-1re 7907 ax-icn 7908 ax-addcl 7909 ax-addrcl 7910 ax-mulcl 7911 ax-mulrcl 7912 ax-addcom 7913 ax-mulcom 7914 ax-addass 7915 ax-mulass 7916 ax-distr 7917 ax-i2m1 7918 ax-0lt1 7919 ax-1rid 7920 ax-0id 7921 ax-rnegex 7922 ax-precex 7923 ax-cnre 7924 ax-pre-ltirr 7925 ax-pre-ltwlin 7926 ax-pre-lttrn 7927 ax-pre-apti 7928 ax-pre-ltadd 7929 ax-pre-mulgt0 7930 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-xor 1376 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 2741 df-sbc 2965 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-br 4006 df-opab 4067 df-id 4295 df-po 4298 df-iso 4299 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-iota 5180 df-fun 5220 df-fv 5226 df-riota 5833 df-ov 5880 df-oprab 5881 df-mpo 5882 df-pnf 7996 df-mnf 7997 df-ltxr 7999 df-sub 8132 df-neg 8133 df-reap 8534 df-ap 8541 df-rp 9656 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |