| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eluzaddOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of eluzadd 12761 as of 7-Feb-2025. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| eluzaddOLD | ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐾 ∈ ℤ) → (𝑁 + 𝐾) ∈ (ℤ≥‘(𝑀 + 𝐾))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluzel2 12737 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 2 | fveq2 6822 | . . . . . . 7 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (ℤ≥‘𝑀) = (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) | |
| 3 | 2 | eleq2d 2817 | . . . . . 6 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (𝑁 ∈ (ℤ≥‘𝑀) ↔ 𝑁 ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)))) |
| 4 | fvoveq1 7369 | . . . . . . 7 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (ℤ≥‘(𝑀 + 𝐾)) = (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾))) | |
| 5 | 4 | eleq2d 2817 | . . . . . 6 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → ((𝑁 + 𝐾) ∈ (ℤ≥‘(𝑀 + 𝐾)) ↔ (𝑁 + 𝐾) ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)))) |
| 6 | 3, 5 | imbi12d 344 | . . . . 5 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → ((𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 𝐾) ∈ (ℤ≥‘(𝑀 + 𝐾))) ↔ (𝑁 ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)) → (𝑁 + 𝐾) ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾))))) |
| 7 | oveq2 7354 | . . . . . . 7 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (𝑁 + 𝐾) = (𝑁 + if(𝐾 ∈ ℤ, 𝐾, 0))) | |
| 8 | oveq2 7354 | . . . . . . . 8 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾) = (if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))) | |
| 9 | 8 | fveq2d 6826 | . . . . . . 7 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) = (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0)))) |
| 10 | 7, 9 | eleq12d 2825 | . . . . . 6 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → ((𝑁 + 𝐾) ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) ↔ (𝑁 + if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))))) |
| 11 | 10 | imbi2d 340 | . . . . 5 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → ((𝑁 ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)) → (𝑁 + 𝐾) ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾))) ↔ (𝑁 ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)) → (𝑁 + if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0)))))) |
| 12 | 0z 12479 | . . . . . . 7 ⊢ 0 ∈ ℤ | |
| 13 | 12 | elimel 4542 | . . . . . 6 ⊢ if(𝐾 ∈ ℤ, 𝐾, 0) ∈ ℤ |
| 14 | 13 | eluzaddi 12763 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)) → (𝑁 + if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0)))) |
| 15 | 6, 11, 14 | dedth2h 4532 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 𝐾) ∈ (ℤ≥‘(𝑀 + 𝐾)))) |
| 16 | 15 | com12 32 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 + 𝐾) ∈ (ℤ≥‘(𝑀 + 𝐾)))) |
| 17 | 1, 16 | mpand 695 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝐾 ∈ ℤ → (𝑁 + 𝐾) ∈ (ℤ≥‘(𝑀 + 𝐾)))) |
| 18 | 17 | imp 406 | 1 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐾 ∈ ℤ) → (𝑁 + 𝐾) ∈ (ℤ≥‘(𝑀 + 𝐾))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ifcif 4472 ‘cfv 6481 (class class class)co 7346 0cc0 11006 + caddc 11009 ℤcz 12468 ℤ≥cuz 12732 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-nn 12126 df-n0 12382 df-z 12469 df-uz 12733 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |