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 11571 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 < (𝐴 + 1)) | |
2 | recn 10718 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
3 | ax-1cn 10686 | . . . . . 6 ⊢ 1 ∈ ℂ | |
4 | addcom 10917 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 1 ∈ ℂ) → (𝐴 + 1) = (1 + 𝐴)) | |
5 | 2, 3, 4 | sylancl 589 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 + 1) = (1 + 𝐴)) |
6 | 1, 5 | breqtrd 5066 | . . . 4 ⊢ (𝐴 ∈ ℝ → 𝐴 < (1 + 𝐴)) |
7 | 6 | adantr 484 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 𝐴 < (1 + 𝐴)) |
8 | 2 | adantr 484 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 𝐴 ∈ ℂ) |
9 | 1re 10732 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
10 | readdcl 10711 | . . . . . . 7 ⊢ ((1 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (1 + 𝐴) ∈ ℝ) | |
11 | 9, 10 | mpan 690 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (1 + 𝐴) ∈ ℝ) |
12 | 11 | adantr 484 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (1 + 𝐴) ∈ ℝ) |
13 | 12 | recnd 10760 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (1 + 𝐴) ∈ ℂ) |
14 | 0lt1 11253 | . . . . . . 7 ⊢ 0 < 1 | |
15 | addgtge0 11219 | . . . . . . 7 ⊢ (((1 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (0 < 1 ∧ 0 ≤ 𝐴)) → 0 < (1 + 𝐴)) | |
16 | 14, 15 | mpanr1 703 | . . . . . 6 ⊢ (((1 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ 0 ≤ 𝐴) → 0 < (1 + 𝐴)) |
17 | 9, 16 | mpanl1 700 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 0 < (1 + 𝐴)) |
18 | 17 | gt0ne0d 11295 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (1 + 𝐴) ≠ 0) |
19 | 8, 13, 18 | divcan1d 11508 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ((𝐴 / (1 + 𝐴)) · (1 + 𝐴)) = 𝐴) |
20 | 11 | recnd 10760 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (1 + 𝐴) ∈ ℂ) |
21 | 20 | mulid2d 10750 | . . . 4 ⊢ (𝐴 ∈ ℝ → (1 · (1 + 𝐴)) = (1 + 𝐴)) |
22 | 21 | adantr 484 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (1 · (1 + 𝐴)) = (1 + 𝐴)) |
23 | 7, 19, 22 | 3brtr4d 5072 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ((𝐴 / (1 + 𝐴)) · (1 + 𝐴)) < (1 · (1 + 𝐴))) |
24 | simpl 486 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 𝐴 ∈ ℝ) | |
25 | 24, 12, 18 | redivcld 11559 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (𝐴 / (1 + 𝐴)) ∈ ℝ) |
26 | ltmul1 11581 | . . . 4 ⊢ (((𝐴 / (1 + 𝐴)) ∈ ℝ ∧ 1 ∈ ℝ ∧ ((1 + 𝐴) ∈ ℝ ∧ 0 < (1 + 𝐴))) → ((𝐴 / (1 + 𝐴)) < 1 ↔ ((𝐴 / (1 + 𝐴)) · (1 + 𝐴)) < (1 · (1 + 𝐴)))) | |
27 | 9, 26 | mp3an2 1450 | . . 3 ⊢ (((𝐴 / (1 + 𝐴)) ∈ ℝ ∧ ((1 + 𝐴) ∈ ℝ ∧ 0 < (1 + 𝐴))) → ((𝐴 / (1 + 𝐴)) < 1 ↔ ((𝐴 / (1 + 𝐴)) · (1 + 𝐴)) < (1 · (1 + 𝐴)))) |
28 | 25, 12, 17, 27 | syl12anc 836 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → ((𝐴 / (1 + 𝐴)) < 1 ↔ ((𝐴 / (1 + 𝐴)) · (1 + 𝐴)) < (1 · (1 + 𝐴)))) |
29 | 23, 28 | mpbird 260 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (𝐴 / (1 + 𝐴)) < 1) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1542 ∈ wcel 2114 class class class wbr 5040 (class class class)co 7183 ℂcc 10626 ℝcr 10627 0cc0 10628 1c1 10629 + caddc 10631 · cmul 10633 < clt 10766 ≤ cle 10767 / cdiv 11388 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2711 ax-sep 5177 ax-nul 5184 ax-pow 5242 ax-pr 5306 ax-un 7492 ax-resscn 10685 ax-1cn 10686 ax-icn 10687 ax-addcl 10688 ax-addrcl 10689 ax-mulcl 10690 ax-mulrcl 10691 ax-mulcom 10692 ax-addass 10693 ax-mulass 10694 ax-distr 10695 ax-i2m1 10696 ax-1ne0 10697 ax-1rid 10698 ax-rnegex 10699 ax-rrecex 10700 ax-cnre 10701 ax-pre-lttri 10702 ax-pre-lttrn 10703 ax-pre-ltadd 10704 ax-pre-mulgt0 10705 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2541 df-eu 2571 df-clab 2718 df-cleq 2731 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-reu 3061 df-rmo 3062 df-rab 3063 df-v 3402 df-sbc 3686 df-csb 3801 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4222 df-if 4425 df-pw 4500 df-sn 4527 df-pr 4529 df-op 4533 df-uni 4807 df-br 5041 df-opab 5103 df-mpt 5121 df-id 5439 df-po 5452 df-so 5453 df-xp 5541 df-rel 5542 df-cnv 5543 df-co 5544 df-dm 5545 df-rn 5546 df-res 5547 df-ima 5548 df-iota 6308 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7140 df-ov 7186 df-oprab 7187 df-mpo 7188 df-er 8333 df-en 8569 df-dom 8570 df-sdom 8571 df-pnf 10768 df-mnf 10769 df-xr 10770 df-ltxr 10771 df-le 10772 df-sub 10963 df-neg 10964 df-div 11389 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |