Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > recp1lt1 | Structured version Visualization version GIF version |
Description: Construct a number less than 1 from any nonnegative number. (Contributed by NM, 30-Dec-2005.) |
Ref | Expression |
---|---|
recp1lt1 | ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (𝐴 / (1 + 𝐴)) < 1) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltp1 11861 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 < (𝐴 + 1)) | |
2 | recn 11007 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
3 | ax-1cn 10975 | . . . . . 6 ⊢ 1 ∈ ℂ | |
4 | addcom 11207 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 1 ∈ ℂ) → (𝐴 + 1) = (1 + 𝐴)) | |
5 | 2, 3, 4 | sylancl 587 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 + 1) = (1 + 𝐴)) |
6 | 1, 5 | breqtrd 5107 | . . . 4 ⊢ (𝐴 ∈ ℝ → 𝐴 < (1 + 𝐴)) |
7 | 6 | adantr 482 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 𝐴 < (1 + 𝐴)) |
8 | 2 | adantr 482 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 𝐴 ∈ ℂ) |
9 | 1re 11021 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
10 | readdcl 11000 | . . . . . . 7 ⊢ ((1 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (1 + 𝐴) ∈ ℝ) | |
11 | 9, 10 | mpan 688 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (1 + 𝐴) ∈ ℝ) |
12 | 11 | adantr 482 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (1 + 𝐴) ∈ ℝ) |
13 | 12 | recnd 11049 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (1 + 𝐴) ∈ ℂ) |
14 | 0lt1 11543 | . . . . . . 7 ⊢ 0 < 1 | |
15 | addgtge0 11509 | . . . . . . 7 ⊢ (((1 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (0 < 1 ∧ 0 ≤ 𝐴)) → 0 < (1 + 𝐴)) | |
16 | 14, 15 | mpanr1 701 | . . . . . 6 ⊢ (((1 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ 0 ≤ 𝐴) → 0 < (1 + 𝐴)) |
17 | 9, 16 | mpanl1 698 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 0 < (1 + 𝐴)) |
18 | 17 | gt0ne0d 11585 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (1 + 𝐴) ≠ 0) |
19 | 8, 13, 18 | divcan1d 11798 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ((𝐴 / (1 + 𝐴)) · (1 + 𝐴)) = 𝐴) |
20 | 11 | recnd 11049 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (1 + 𝐴) ∈ ℂ) |
21 | 20 | mulid2d 11039 | . . . 4 ⊢ (𝐴 ∈ ℝ → (1 · (1 + 𝐴)) = (1 + 𝐴)) |
22 | 21 | adantr 482 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (1 · (1 + 𝐴)) = (1 + 𝐴)) |
23 | 7, 19, 22 | 3brtr4d 5113 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ((𝐴 / (1 + 𝐴)) · (1 + 𝐴)) < (1 · (1 + 𝐴))) |
24 | simpl 484 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 𝐴 ∈ ℝ) | |
25 | 24, 12, 18 | redivcld 11849 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (𝐴 / (1 + 𝐴)) ∈ ℝ) |
26 | ltmul1 11871 | . . . 4 ⊢ (((𝐴 / (1 + 𝐴)) ∈ ℝ ∧ 1 ∈ ℝ ∧ ((1 + 𝐴) ∈ ℝ ∧ 0 < (1 + 𝐴))) → ((𝐴 / (1 + 𝐴)) < 1 ↔ ((𝐴 / (1 + 𝐴)) · (1 + 𝐴)) < (1 · (1 + 𝐴)))) | |
27 | 9, 26 | mp3an2 1449 | . . 3 ⊢ (((𝐴 / (1 + 𝐴)) ∈ ℝ ∧ ((1 + 𝐴) ∈ ℝ ∧ 0 < (1 + 𝐴))) → ((𝐴 / (1 + 𝐴)) < 1 ↔ ((𝐴 / (1 + 𝐴)) · (1 + 𝐴)) < (1 · (1 + 𝐴)))) |
28 | 25, 12, 17, 27 | syl12anc 835 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ((𝐴 / (1 + 𝐴)) < 1 ↔ ((𝐴 / (1 + 𝐴)) · (1 + 𝐴)) < (1 · (1 + 𝐴)))) |
29 | 23, 28 | mpbird 257 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (𝐴 / (1 + 𝐴)) < 1) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1539 ∈ wcel 2104 class class class wbr 5081 (class class class)co 7307 ℂcc 10915 ℝcr 10916 0cc0 10917 1c1 10918 + caddc 10920 · cmul 10922 < clt 11055 ≤ cle 11056 / cdiv 11678 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 ax-resscn 10974 ax-1cn 10975 ax-icn 10976 ax-addcl 10977 ax-addrcl 10978 ax-mulcl 10979 ax-mulrcl 10980 ax-mulcom 10981 ax-addass 10982 ax-mulass 10983 ax-distr 10984 ax-i2m1 10985 ax-1ne0 10986 ax-1rid 10987 ax-rnegex 10988 ax-rrecex 10989 ax-cnre 10990 ax-pre-lttri 10991 ax-pre-lttrn 10992 ax-pre-ltadd 10993 ax-pre-mulgt0 10994 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3285 df-reu 3286 df-rab 3287 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-br 5082 df-opab 5144 df-mpt 5165 df-id 5500 df-po 5514 df-so 5515 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-riota 7264 df-ov 7310 df-oprab 7311 df-mpo 7312 df-er 8529 df-en 8765 df-dom 8766 df-sdom 8767 df-pnf 11057 df-mnf 11058 df-xr 11059 df-ltxr 11060 df-le 11061 df-sub 11253 df-neg 11254 df-div 11679 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |