| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > gt0ne0d | GIF version | ||
| Description: Positive implies nonzero. (Contributed by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| gt0ne0d.1 | ⊢ (𝜑 → 0 < 𝐴) |
| Ref | Expression |
|---|---|
| gt0ne0d | ⊢ (𝜑 → 𝐴 ≠ 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0re 8327 | . 2 ⊢ 0 ∈ ℝ | |
| 2 | gt0ne0d.1 | . 2 ⊢ (𝜑 → 0 < 𝐴) | |
| 3 | ltne 8411 | . 2 ⊢ ((0 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 ≠ 0) | |
| 4 | 1, 2, 3 | sylancr 418 | 1 ⊢ (𝜑 → 𝐴 ≠ 0) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2209 ≠ wne 2420 class class class wbr 4130 ℝcr 8179 0cc0 8180 < clt 8361 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8271 ax-resscn 8272 ax-1re 8274 ax-addrcl 8277 ax-rnegex 8289 ax-pre-ltirr 8292 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4131 df-opab 4193 df-xp 4780 df-pnf 8363 df-mnf 8364 df-ltxr 8366 |
| This theorem is used by: sup3exmid 9290 modqval 10775 modqvalr 10776 modqcl 10777 flqpmodeq 10778 modq0 10780 modqge0 10783 modqlt 10784 modqdiffl 10786 modqdifz 10787 modqvalp1 10794 modqid 10800 modqcyc 10810 modqadd1 10812 modqmuladd 10817 modqmuladdnn0 10819 modqmul1 10828 modqdi 10843 modqsubdir 10844 ennnfonelemp1 13348 dichmul0orlem5 16879 dichmul0orlem6 16880 |
| Copyright terms: Public domain | W3C validator |