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 8760 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 < (𝐵 + 1)) | |
2 | 1 | adantl 275 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐵 < (𝐵 + 1)) |
3 | peano2re 8055 | . . . . . 6 ⊢ (𝐵 ∈ ℝ → (𝐵 + 1) ∈ ℝ) | |
4 | 3 | ancli 321 | . . . . 5 ⊢ (𝐵 ∈ ℝ → (𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ)) |
5 | lelttr 8008 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < (𝐵 + 1)) → 𝐴 < (𝐵 + 1))) | |
6 | 5 | 3expb 1199 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ)) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < (𝐵 + 1)) → 𝐴 < (𝐵 + 1))) |
7 | 4, 6 | sylan2 284 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < (𝐵 + 1)) → 𝐴 < (𝐵 + 1))) |
8 | 2, 7 | mpan2d 426 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 → 𝐴 < (𝐵 + 1))) |
9 | 8 | 3impia 1195 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐴 < (𝐵 + 1)) |
10 | ltle 8007 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ) → (𝐴 < (𝐵 + 1) → 𝐴 ≤ (𝐵 + 1))) | |
11 | 3, 10 | sylan2 284 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < (𝐵 + 1) → 𝐴 ≤ (𝐵 + 1))) |
12 | 11 | 3adant3 1012 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (𝐴 < (𝐵 + 1) → 𝐴 ≤ (𝐵 + 1))) |
13 | 9, 12 | mpd 13 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ (𝐵 + 1)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 973 ∈ wcel 2141 class class class wbr 3989 (class class class)co 5853 ℝcr 7773 1c1 7775 + caddc 7777 < clt 7954 ≤ cle 7955 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pow 4160 ax-pr 4194 ax-un 4418 ax-setind 4521 ax-cnex 7865 ax-resscn 7866 ax-1cn 7867 ax-1re 7868 ax-icn 7869 ax-addcl 7870 ax-addrcl 7871 ax-mulcl 7872 ax-addcom 7874 ax-addass 7876 ax-i2m1 7879 ax-0lt1 7880 ax-0id 7882 ax-rnegex 7883 ax-pre-ltirr 7886 ax-pre-ltwlin 7887 ax-pre-lttrn 7888 ax-pre-ltadd 7890 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-rab 2457 df-v 2732 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-br 3990 df-opab 4051 df-xp 4617 df-cnv 4619 df-iota 5160 df-fv 5206 df-ov 5856 df-pnf 7956 df-mnf 7957 df-xr 7958 df-ltxr 7959 df-le 7960 |
This theorem is referenced by: peano2uz 9542 |
Copyright terms: Public domain | W3C validator |