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 10183 | . 2 ⊢ (𝜑 → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
5 | 1, 4 | mpbid 222 | 1 ⊢ (𝜑 → ¬ 𝐵 < 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 1990 class class class wbr 4653 ℝcr 9935 < clt 10074 ≤ cle 10075 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-br 4654 df-opab 4713 df-xp 5120 df-cnv 5122 df-xr 10078 df-le 10080 |
This theorem is referenced by: lbinf 10976 infmrp1 12174 addmodlteq 12745 ccatalpha 13375 lcmgcdlem 15319 nmoleub2lem3 22915 pntlem3 25298 unblimceq0lem 32497 mblfinlem2 33447 imo72b2 38475 climisp 39978 stoweidlem52 40269 fourierdlem10 40334 fourierdlem12 40336 fourierdlem20 40344 fourierdlem50 40373 fourierdlem54 40377 fourierdlem103 40426 fouriersw 40448 etransclem35 40486 etransc 40500 |
Copyright terms: Public domain | W3C validator |