| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ap0gt0 | GIF version | ||
| Description: A nonnegative number is apart from zero if and only if it is positive. (Contributed by Jim Kingdon, 11-Aug-2021.) |
| Ref | Expression |
|---|---|
| ap0gt0 | ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (𝐴 # 0 ↔ 0 < 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0red 8135 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 0 ∈ ℝ) | |
| 2 | reaplt 8723 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 # 0 ↔ (𝐴 < 0 ∨ 0 < 𝐴))) | |
| 3 | 1, 2 | syldan 282 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (𝐴 # 0 ↔ (𝐴 < 0 ∨ 0 < 𝐴))) |
| 4 | simpr 110 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 0 ≤ 𝐴) | |
| 5 | simpl 109 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 𝐴 ∈ ℝ) | |
| 6 | 1, 5 | lenltd 8252 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (0 ≤ 𝐴 ↔ ¬ 𝐴 < 0)) |
| 7 | 4, 6 | mpbid 147 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ¬ 𝐴 < 0) |
| 8 | biorf 749 | . . 3 ⊢ (¬ 𝐴 < 0 → (0 < 𝐴 ↔ (𝐴 < 0 ∨ 0 < 𝐴))) | |
| 9 | 7, 8 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (0 < 𝐴 ↔ (𝐴 < 0 ∨ 0 < 𝐴))) |
| 10 | 3, 9 | bitr4d 191 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (𝐴 # 0 ↔ 0 < 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 713 ∈ wcel 2200 class class class wbr 4082 ℝcr 7986 0cc0 7987 < clt 8169 ≤ cle 8170 # cap 8716 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 ax-un 4521 ax-setind 4626 ax-cnex 8078 ax-resscn 8079 ax-1cn 8080 ax-1re 8081 ax-icn 8082 ax-addcl 8083 ax-addrcl 8084 ax-mulcl 8085 ax-mulrcl 8086 ax-addcom 8087 ax-mulcom 8088 ax-addass 8089 ax-mulass 8090 ax-distr 8091 ax-i2m1 8092 ax-0lt1 8093 ax-1rid 8094 ax-0id 8095 ax-rnegex 8096 ax-precex 8097 ax-cnre 8098 ax-pre-ltirr 8099 ax-pre-lttrn 8101 ax-pre-apti 8102 ax-pre-ltadd 8103 ax-pre-mulgt0 8104 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-br 4083 df-opab 4145 df-id 4381 df-xp 4722 df-rel 4723 df-cnv 4724 df-co 4725 df-dm 4726 df-iota 5274 df-fun 5316 df-fv 5322 df-riota 5947 df-ov 5997 df-oprab 5998 df-mpo 5999 df-pnf 8171 df-mnf 8172 df-xr 8173 df-ltxr 8174 df-le 8175 df-sub 8307 df-neg 8308 df-reap 8710 df-ap 8717 |
| This theorem is referenced by: ap0gt0d 8776 fihashneq0 11003 mul0inf 11738 |
| Copyright terms: Public domain | W3C validator |