Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > flqzadd | GIF version |
Description: An integer can be moved in and out of the floor of a sum. (Contributed by Jim Kingdon, 10-Oct-2021.) |
Ref | Expression |
---|---|
flqzadd | ⊢ ((𝑁 ∈ ℤ ∧ 𝐴 ∈ ℚ) → (⌊‘(𝑁 + 𝐴)) = (𝑁 + (⌊‘𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | flqaddz 10038 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) → (⌊‘(𝐴 + 𝑁)) = ((⌊‘𝐴) + 𝑁)) | |
2 | qcn 9394 | . . . . 5 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℂ) | |
3 | zcn 9027 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
4 | addcom 7867 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝐴 + 𝑁) = (𝑁 + 𝐴)) | |
5 | 2, 3, 4 | syl2an 287 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) → (𝐴 + 𝑁) = (𝑁 + 𝐴)) |
6 | 5 | fveq2d 5393 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) → (⌊‘(𝐴 + 𝑁)) = (⌊‘(𝑁 + 𝐴))) |
7 | flqcl 10014 | . . . . 5 ⊢ (𝐴 ∈ ℚ → (⌊‘𝐴) ∈ ℤ) | |
8 | 7 | zcnd 9142 | . . . 4 ⊢ (𝐴 ∈ ℚ → (⌊‘𝐴) ∈ ℂ) |
9 | addcom 7867 | . . . 4 ⊢ (((⌊‘𝐴) ∈ ℂ ∧ 𝑁 ∈ ℂ) → ((⌊‘𝐴) + 𝑁) = (𝑁 + (⌊‘𝐴))) | |
10 | 8, 3, 9 | syl2an 287 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) → ((⌊‘𝐴) + 𝑁) = (𝑁 + (⌊‘𝐴))) |
11 | 1, 6, 10 | 3eqtr3d 2158 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℤ) → (⌊‘(𝑁 + 𝐴)) = (𝑁 + (⌊‘𝐴))) |
12 | 11 | ancoms 266 | 1 ⊢ ((𝑁 ∈ ℤ ∧ 𝐴 ∈ ℚ) → (⌊‘(𝑁 + 𝐴)) = (𝑁 + (⌊‘𝐴))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1316 ∈ wcel 1465 ‘cfv 5093 (class class class)co 5742 ℂcc 7586 + caddc 7591 ℤcz 9022 ℚcq 9379 ⌊cfl 10009 |
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 588 ax-in2 589 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-13 1476 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-sep 4016 ax-pow 4068 ax-pr 4101 ax-un 4325 ax-setind 4422 ax-cnex 7679 ax-resscn 7680 ax-1cn 7681 ax-1re 7682 ax-icn 7683 ax-addcl 7684 ax-addrcl 7685 ax-mulcl 7686 ax-mulrcl 7687 ax-addcom 7688 ax-mulcom 7689 ax-addass 7690 ax-mulass 7691 ax-distr 7692 ax-i2m1 7693 ax-0lt1 7694 ax-1rid 7695 ax-0id 7696 ax-rnegex 7697 ax-precex 7698 ax-cnre 7699 ax-pre-ltirr 7700 ax-pre-ltwlin 7701 ax-pre-lttrn 7702 ax-pre-apti 7703 ax-pre-ltadd 7704 ax-pre-mulgt0 7705 ax-pre-mulext 7706 ax-arch 7707 |
This theorem depends on definitions: df-bi 116 df-3or 948 df-3an 949 df-tru 1319 df-fal 1322 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ne 2286 df-nel 2381 df-ral 2398 df-rex 2399 df-reu 2400 df-rmo 2401 df-rab 2402 df-v 2662 df-sbc 2883 df-csb 2976 df-dif 3043 df-un 3045 df-in 3047 df-ss 3054 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-int 3742 df-iun 3785 df-br 3900 df-opab 3960 df-mpt 3961 df-id 4185 df-po 4188 df-iso 4189 df-xp 4515 df-rel 4516 df-cnv 4517 df-co 4518 df-dm 4519 df-rn 4520 df-res 4521 df-ima 4522 df-iota 5058 df-fun 5095 df-fn 5096 df-f 5097 df-fv 5101 df-riota 5698 df-ov 5745 df-oprab 5746 df-mpo 5747 df-1st 6006 df-2nd 6007 df-pnf 7770 df-mnf 7771 df-xr 7772 df-ltxr 7773 df-le 7774 df-sub 7903 df-neg 7904 df-reap 8305 df-ap 8312 df-div 8401 df-inn 8689 df-n0 8946 df-z 9023 df-q 9380 df-rp 9410 df-fl 10011 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |