![]() |
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 7790 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
2 | reapltxor 8375 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 # 0 ↔ (𝐴 < 0 ⊻ 0 < 𝐴))) | |
3 | 1, 2 | mpan2 422 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (𝐴 # 0 ↔ (𝐴 < 0 ⊻ 0 < 𝐴))) |
4 | xorcom 1367 | . . . . . 6 ⊢ ((𝐴 < 0 ⊻ 0 < 𝐴) ↔ (0 < 𝐴 ⊻ 𝐴 < 0)) | |
5 | 3, 4 | syl6bb 195 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 # 0 ↔ (0 < 𝐴 ⊻ 𝐴 < 0))) |
6 | 5 | pm5.32i 450 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) ↔ (𝐴 ∈ ℝ ∧ (0 < 𝐴 ⊻ 𝐴 < 0))) |
7 | anxordi 1379 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (0 < 𝐴 ⊻ 𝐴 < 0)) ↔ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) ⊻ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) | |
8 | 6, 7 | bitri 183 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) ↔ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) ⊻ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) |
9 | 8 | biimpi 119 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → ((𝐴 ∈ ℝ ∧ 0 < 𝐴) ⊻ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) |
10 | elrp 9472 | . . . 4 ⊢ (𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 0 < 𝐴)) | |
11 | 10 | a1i 9 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 0 < 𝐴))) |
12 | elrp 9472 | . . . . . 6 ⊢ (-𝐴 ∈ ℝ+ ↔ (-𝐴 ∈ ℝ ∧ 0 < -𝐴)) | |
13 | renegcl 8047 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
14 | 13 | biantrurd 303 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (0 < -𝐴 ↔ (-𝐴 ∈ ℝ ∧ 0 < -𝐴))) |
15 | 12, 14 | bitr4id 198 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (-𝐴 ∈ ℝ+ ↔ 0 < -𝐴)) |
16 | lt0neg1 8254 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 < 0 ↔ 0 < -𝐴)) | |
17 | ibar 299 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 < 0 ↔ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) | |
18 | 15, 16, 17 | 3bitr2d 215 | . . . 4 ⊢ (𝐴 ∈ ℝ → (-𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) |
19 | 18 | adantr 274 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (-𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 𝐴 < 0))) |
20 | 11, 19 | xorbi12d 1361 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → ((𝐴 ∈ ℝ+ ⊻ -𝐴 ∈ ℝ+) ↔ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) ⊻ (𝐴 ∈ ℝ ∧ 𝐴 < 0)))) |
21 | 9, 20 | mpbird 166 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (𝐴 ∈ ℝ+ ⊻ -𝐴 ∈ ℝ+)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ⊻ wxo 1354 ∈ wcel 1481 class class class wbr 3937 ℝcr 7643 0cc0 7644 < clt 7824 -cneg 7958 # cap 8367 ℝ+crp 9470 |
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-mulrcl 7743 ax-addcom 7744 ax-mulcom 7745 ax-addass 7746 ax-mulass 7747 ax-distr 7748 ax-i2m1 7749 ax-0lt1 7750 ax-1rid 7751 ax-0id 7752 ax-rnegex 7753 ax-precex 7754 ax-cnre 7755 ax-pre-ltirr 7756 ax-pre-ltwlin 7757 ax-pre-lttrn 7758 ax-pre-apti 7759 ax-pre-ltadd 7760 ax-pre-mulgt0 7761 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-fal 1338 df-xor 1355 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-ltxr 7829 df-sub 7959 df-neg 7960 df-reap 8361 df-ap 8368 df-rp 9471 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |