![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > letrp1 | Structured version Visualization version GIF version |
Description: A transitive property of 'less than or equal' and plus 1. (Contributed by NM, 5-Aug-2005.) |
Ref | Expression |
---|---|
letrp1 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ (𝐵 + 1)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltp1 11067 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 < (𝐵 + 1)) | |
2 | 1 | adantl 467 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐵 < (𝐵 + 1)) |
3 | peano2re 10415 | . . . . . 6 ⊢ (𝐵 ∈ ℝ → (𝐵 + 1) ∈ ℝ) | |
4 | 3 | ancli 538 | . . . . 5 ⊢ (𝐵 ∈ ℝ → (𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ)) |
5 | lelttr 10334 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < (𝐵 + 1)) → 𝐴 < (𝐵 + 1))) | |
6 | 5 | 3expb 1113 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ)) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < (𝐵 + 1)) → 𝐴 < (𝐵 + 1))) |
7 | 4, 6 | sylan2 580 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < (𝐵 + 1)) → 𝐴 < (𝐵 + 1))) |
8 | 2, 7 | mpan2d 674 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 → 𝐴 < (𝐵 + 1))) |
9 | 8 | 3impia 1109 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐴 < (𝐵 + 1)) |
10 | ltle 10332 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ) → (𝐴 < (𝐵 + 1) → 𝐴 ≤ (𝐵 + 1))) | |
11 | 3, 10 | sylan2 580 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < (𝐵 + 1) → 𝐴 ≤ (𝐵 + 1))) |
12 | 11 | 3adant3 1126 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (𝐴 < (𝐵 + 1) → 𝐴 ≤ (𝐵 + 1))) |
13 | 9, 12 | mpd 15 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ (𝐵 + 1)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 382 ∧ w3a 1071 ∈ wcel 2145 class class class wbr 4787 (class class class)co 6796 ℝcr 10141 1c1 10143 + caddc 10145 < clt 10280 ≤ cle 10281 |
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-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-sep 4916 ax-nul 4924 ax-pow 4975 ax-pr 5035 ax-un 7100 ax-resscn 10199 ax-1cn 10200 ax-icn 10201 ax-addcl 10202 ax-addrcl 10203 ax-mulcl 10204 ax-mulrcl 10205 ax-mulcom 10206 ax-addass 10207 ax-mulass 10208 ax-distr 10209 ax-i2m1 10210 ax-1ne0 10211 ax-1rid 10212 ax-rnegex 10213 ax-rrecex 10214 ax-cnre 10215 ax-pre-lttri 10216 ax-pre-lttrn 10217 ax-pre-ltadd 10218 ax-pre-mulgt0 10219 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3or 1072 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-ne 2944 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-nul 4064 df-if 4227 df-pw 4300 df-sn 4318 df-pr 4320 df-op 4324 df-uni 4576 df-br 4788 df-opab 4848 df-mpt 4865 df-id 5158 df-po 5171 df-so 5172 df-xp 5256 df-rel 5257 df-cnv 5258 df-co 5259 df-dm 5260 df-rn 5261 df-res 5262 df-ima 5263 df-iota 5993 df-fun 6032 df-fn 6033 df-f 6034 df-f1 6035 df-fo 6036 df-f1o 6037 df-fv 6038 df-riota 6757 df-ov 6799 df-oprab 6800 df-mpt2 6801 df-er 7900 df-en 8114 df-dom 8115 df-sdom 8116 df-pnf 10282 df-mnf 10283 df-xr 10284 df-ltxr 10285 df-le 10286 df-sub 10474 df-neg 10475 |
This theorem is referenced by: peano2uz 11948 clwwlkinwwlk 27196 jm2.27dlem2 38103 stoweidlem20 40751 |
Copyright terms: Public domain | W3C validator |