| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > letrp1 | 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 9118 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 < (𝐵 + 1)) | |
| 2 | 1 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐵 < (𝐵 + 1)) |
| 3 | peano2re 8409 | . . . . . 6 ⊢ (𝐵 ∈ ℝ → (𝐵 + 1) ∈ ℝ) | |
| 4 | 3 | ancli 323 | . . . . 5 ⊢ (𝐵 ∈ ℝ → (𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ)) |
| 5 | lelttr 8362 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < (𝐵 + 1)) → 𝐴 < (𝐵 + 1))) | |
| 6 | 5 | 3expb 1231 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ)) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < (𝐵 + 1)) → 𝐴 < (𝐵 + 1))) |
| 7 | 4, 6 | sylan2 286 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < (𝐵 + 1)) → 𝐴 < (𝐵 + 1))) |
| 8 | 2, 7 | mpan2d 428 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 → 𝐴 < (𝐵 + 1))) |
| 9 | 8 | 3impia 1227 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐴 < (𝐵 + 1)) |
| 10 | ltle 8361 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ) → (𝐴 < (𝐵 + 1) → 𝐴 ≤ (𝐵 + 1))) | |
| 11 | 3, 10 | sylan2 286 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < (𝐵 + 1) → 𝐴 ≤ (𝐵 + 1))) |
| 12 | 11 | 3adant3 1044 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (𝐴 < (𝐵 + 1) → 𝐴 ≤ (𝐵 + 1))) |
| 13 | 9, 12 | mpd 13 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ (𝐵 + 1)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 ∈ wcel 2203 class class class wbr 4109 (class class class)co 6050 ℝcr 8126 1c1 8128 + caddc 8130 < clt 8308 ≤ cle 8309 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-addcom 8227 ax-addass 8229 ax-i2m1 8232 ax-0lt1 8233 ax-0id 8235 ax-rnegex 8236 ax-pre-ltirr 8239 ax-pre-ltwlin 8240 ax-pre-lttrn 8241 ax-pre-ltadd 8243 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-rab 2529 df-v 2815 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-br 4110 df-opab 4172 df-xp 4755 df-cnv 4757 df-iota 5312 df-fv 5360 df-ov 6053 df-pnf 8310 df-mnf 8311 df-xr 8312 df-ltxr 8313 df-le 8314 |
| This theorem is referenced by: peano2uz 9915 |
| Copyright terms: Public domain | W3C validator |