![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > lensymd | Structured version Visualization version GIF version |
Description: 'Less than or equal to' implies 'not less than'. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
Ref | Expression |
---|---|
ltd.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
ltd.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
lensymd.3 | ⊢ (𝜑 → 𝐴 ≤ 𝐵) |
Ref | Expression |
---|---|
lensymd | ⊢ (𝜑 → ¬ 𝐵 < 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lensymd.3 | . 2 ⊢ (𝜑 → 𝐴 ≤ 𝐵) | |
2 | ltd.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
3 | ltd.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
4 | 2, 3 | lenltd 10385 | . 2 ⊢ (𝜑 → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
5 | 1, 4 | mpbid 222 | 1 ⊢ (𝜑 → ¬ 𝐵 < 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2145 class class class wbr 4786 ℝcr 10137 < clt 10276 ≤ cle 10277 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-sep 4915 ax-nul 4923 ax-pr 5034 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ral 3066 df-rex 3067 df-rab 3070 df-v 3353 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-nul 4064 df-if 4226 df-sn 4317 df-pr 4319 df-op 4323 df-br 4787 df-opab 4847 df-xp 5255 df-cnv 5257 df-xr 10280 df-le 10282 |
This theorem is referenced by: lbinf 11178 prodge0rd 12140 infmrp1 12379 addmodlteq 12953 ccatalpha 13575 lcmgcdlem 15527 nmoleub2lem3 23134 pntlem3 25519 unblimceq0lem 32834 mblfinlem2 33780 imo72b2 39001 climisp 40496 stoweidlem52 40786 fourierdlem10 40851 fourierdlem12 40853 fourierdlem20 40861 fourierdlem50 40890 fourierdlem54 40894 fourierdlem103 40943 fouriersw 40965 etransclem35 41003 etransc 41017 |
Copyright terms: Public domain | W3C validator |