![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > intfrac2 | Structured version Visualization version GIF version |
Description: Decompose a real into integer and fractional parts. TODO - should we replace this with intfrac 12979? (Contributed by NM, 16-Aug-2008.) |
Ref | Expression |
---|---|
intfrac2.1 | ⊢ 𝑍 = (⌊‘𝐴) |
intfrac2.2 | ⊢ 𝐹 = (𝐴 − 𝑍) |
Ref | Expression |
---|---|
intfrac2 | ⊢ (𝐴 ∈ ℝ → (0 ≤ 𝐹 ∧ 𝐹 < 1 ∧ 𝐴 = (𝑍 + 𝐹))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fracge0 12899 | . . 3 ⊢ (𝐴 ∈ ℝ → 0 ≤ (𝐴 − (⌊‘𝐴))) | |
2 | intfrac2.2 | . . . 4 ⊢ 𝐹 = (𝐴 − 𝑍) | |
3 | intfrac2.1 | . . . . 5 ⊢ 𝑍 = (⌊‘𝐴) | |
4 | 3 | oveq2i 6915 | . . . 4 ⊢ (𝐴 − 𝑍) = (𝐴 − (⌊‘𝐴)) |
5 | 2, 4 | eqtri 2848 | . . 3 ⊢ 𝐹 = (𝐴 − (⌊‘𝐴)) |
6 | 1, 5 | syl6breqr 4914 | . 2 ⊢ (𝐴 ∈ ℝ → 0 ≤ 𝐹) |
7 | fraclt1 12897 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝐴 − (⌊‘𝐴)) < 1) | |
8 | 5, 7 | syl5eqbr 4907 | . 2 ⊢ (𝐴 ∈ ℝ → 𝐹 < 1) |
9 | 2 | oveq2i 6915 | . . 3 ⊢ (𝑍 + 𝐹) = (𝑍 + (𝐴 − 𝑍)) |
10 | flcl 12890 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ∈ ℤ) | |
11 | 3, 10 | syl5eqel 2909 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝑍 ∈ ℤ) |
12 | 11 | zcnd 11810 | . . . 4 ⊢ (𝐴 ∈ ℝ → 𝑍 ∈ ℂ) |
13 | recn 10341 | . . . 4 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
14 | 12, 13 | pncan3d 10715 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝑍 + (𝐴 − 𝑍)) = 𝐴) |
15 | 9, 14 | syl5req 2873 | . 2 ⊢ (𝐴 ∈ ℝ → 𝐴 = (𝑍 + 𝐹)) |
16 | 6, 8, 15 | 3jca 1164 | 1 ⊢ (𝐴 ∈ ℝ → (0 ≤ 𝐹 ∧ 𝐹 < 1 ∧ 𝐴 = (𝑍 + 𝐹))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1113 = wceq 1658 ∈ wcel 2166 class class class wbr 4872 ‘cfv 6122 (class class class)co 6904 ℝcr 10250 0cc0 10251 1c1 10252 + caddc 10254 < clt 10390 ≤ cle 10391 − cmin 10584 ℤcz 11703 ⌊cfl 12885 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1896 ax-4 1910 ax-5 2011 ax-6 2077 ax-7 2114 ax-8 2168 ax-9 2175 ax-10 2194 ax-11 2209 ax-12 2222 ax-13 2390 ax-ext 2802 ax-sep 5004 ax-nul 5012 ax-pow 5064 ax-pr 5126 ax-un 7208 ax-cnex 10307 ax-resscn 10308 ax-1cn 10309 ax-icn 10310 ax-addcl 10311 ax-addrcl 10312 ax-mulcl 10313 ax-mulrcl 10314 ax-mulcom 10315 ax-addass 10316 ax-mulass 10317 ax-distr 10318 ax-i2m1 10319 ax-1ne0 10320 ax-1rid 10321 ax-rnegex 10322 ax-rrecex 10323 ax-cnre 10324 ax-pre-lttri 10325 ax-pre-lttrn 10326 ax-pre-ltadd 10327 ax-pre-mulgt0 10328 ax-pre-sup 10329 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 881 df-3or 1114 df-3an 1115 df-tru 1662 df-ex 1881 df-nf 1885 df-sb 2070 df-mo 2604 df-eu 2639 df-clab 2811 df-cleq 2817 df-clel 2820 df-nfc 2957 df-ne 2999 df-nel 3102 df-ral 3121 df-rex 3122 df-reu 3123 df-rmo 3124 df-rab 3125 df-v 3415 df-sbc 3662 df-csb 3757 df-dif 3800 df-un 3802 df-in 3804 df-ss 3811 df-pss 3813 df-nul 4144 df-if 4306 df-pw 4379 df-sn 4397 df-pr 4399 df-tp 4401 df-op 4403 df-uni 4658 df-iun 4741 df-br 4873 df-opab 4935 df-mpt 4952 df-tr 4975 df-id 5249 df-eprel 5254 df-po 5262 df-so 5263 df-fr 5300 df-we 5302 df-xp 5347 df-rel 5348 df-cnv 5349 df-co 5350 df-dm 5351 df-rn 5352 df-res 5353 df-ima 5354 df-pred 5919 df-ord 5965 df-on 5966 df-lim 5967 df-suc 5968 df-iota 6085 df-fun 6124 df-fn 6125 df-f 6126 df-f1 6127 df-fo 6128 df-f1o 6129 df-fv 6130 df-riota 6865 df-ov 6907 df-oprab 6908 df-mpt2 6909 df-om 7326 df-wrecs 7671 df-recs 7733 df-rdg 7771 df-er 8008 df-en 8222 df-dom 8223 df-sdom 8224 df-sup 8616 df-inf 8617 df-pnf 10392 df-mnf 10393 df-xr 10394 df-ltxr 10395 df-le 10396 df-sub 10586 df-neg 10587 df-nn 11350 df-n0 11618 df-z 11704 df-uz 11968 df-fl 12887 |
This theorem is referenced by: intfracq 12952 fldiv 12953 |
Copyright terms: Public domain | W3C validator |