![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > eluzsub | Structured version Visualization version GIF version |
Description: Membership in an earlier upper set of integers. (Contributed by Jeff Madsen, 2-Sep-2009.) |
Ref | Expression |
---|---|
eluzsub | ⊢ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾))) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvoveq1 7039 | . . . . 5 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (ℤ≥‘(𝑀 + 𝐾)) = (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾))) | |
2 | 1 | eleq2d 2868 | . . . 4 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾)) ↔ 𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)))) |
3 | fveq2 6538 | . . . . 5 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (ℤ≥‘𝑀) = (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) | |
4 | 3 | eleq2d 2868 | . . . 4 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → ((𝑁 − 𝐾) ∈ (ℤ≥‘𝑀) ↔ (𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)))) |
5 | 2, 4 | imbi12d 346 | . . 3 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → ((𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀)) ↔ (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))))) |
6 | oveq2 7024 | . . . . . 6 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾) = (if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))) | |
7 | 6 | fveq2d 6542 | . . . . 5 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) = (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0)))) |
8 | 7 | eleq2d 2868 | . . . 4 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) ↔ 𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))))) |
9 | oveq2 7024 | . . . . 5 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (𝑁 − 𝐾) = (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0))) | |
10 | 9 | eleq1d 2867 | . . . 4 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → ((𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)) ↔ (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)))) |
11 | 8, 10 | imbi12d 346 | . . 3 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → ((𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) ↔ (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))) → (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))))) |
12 | 0z 11840 | . . . . 5 ⊢ 0 ∈ ℤ | |
13 | 12 | elimel 4448 | . . . 4 ⊢ if(𝑀 ∈ ℤ, 𝑀, 0) ∈ ℤ |
14 | 12 | elimel 4448 | . . . 4 ⊢ if(𝐾 ∈ ℤ, 𝐾, 0) ∈ ℤ |
15 | 13, 14 | eluzsubi 12121 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))) → (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) |
16 | 5, 11, 15 | dedth2h 4438 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀))) |
17 | 16 | 3impia 1110 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾))) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1080 = wceq 1522 ∈ wcel 2081 ifcif 4381 ‘cfv 6225 (class class class)co 7016 0cc0 10383 + caddc 10386 − cmin 10717 ℤcz 11829 ℤ≥cuz 12093 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1777 ax-4 1791 ax-5 1888 ax-6 1947 ax-7 1992 ax-8 2083 ax-9 2091 ax-10 2112 ax-11 2126 ax-12 2141 ax-13 2344 ax-ext 2769 ax-sep 5094 ax-nul 5101 ax-pow 5157 ax-pr 5221 ax-un 7319 ax-cnex 10439 ax-resscn 10440 ax-1cn 10441 ax-icn 10442 ax-addcl 10443 ax-addrcl 10444 ax-mulcl 10445 ax-mulrcl 10446 ax-mulcom 10447 ax-addass 10448 ax-mulass 10449 ax-distr 10450 ax-i2m1 10451 ax-1ne0 10452 ax-1rid 10453 ax-rnegex 10454 ax-rrecex 10455 ax-cnre 10456 ax-pre-lttri 10457 ax-pre-lttrn 10458 ax-pre-ltadd 10459 ax-pre-mulgt0 10460 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 843 df-3or 1081 df-3an 1082 df-tru 1525 df-ex 1762 df-nf 1766 df-sb 2043 df-mo 2576 df-eu 2612 df-clab 2776 df-cleq 2788 df-clel 2863 df-nfc 2935 df-ne 2985 df-nel 3091 df-ral 3110 df-rex 3111 df-reu 3112 df-rab 3114 df-v 3439 df-sbc 3707 df-csb 3812 df-dif 3862 df-un 3864 df-in 3866 df-ss 3874 df-pss 3876 df-nul 4212 df-if 4382 df-pw 4455 df-sn 4473 df-pr 4475 df-tp 4477 df-op 4479 df-uni 4746 df-iun 4827 df-br 4963 df-opab 5025 df-mpt 5042 df-tr 5064 df-id 5348 df-eprel 5353 df-po 5362 df-so 5363 df-fr 5402 df-we 5404 df-xp 5449 df-rel 5450 df-cnv 5451 df-co 5452 df-dm 5453 df-rn 5454 df-res 5455 df-ima 5456 df-pred 6023 df-ord 6069 df-on 6070 df-lim 6071 df-suc 6072 df-iota 6189 df-fun 6227 df-fn 6228 df-f 6229 df-f1 6230 df-fo 6231 df-f1o 6232 df-fv 6233 df-riota 6977 df-ov 7019 df-oprab 7020 df-mpo 7021 df-om 7437 df-wrecs 7798 df-recs 7860 df-rdg 7898 df-er 8139 df-en 8358 df-dom 8359 df-sdom 8360 df-pnf 10523 df-mnf 10524 df-xr 10525 df-ltxr 10526 df-le 10527 df-sub 10719 df-neg 10720 df-nn 11487 df-n0 11746 df-z 11830 df-uz 12094 |
This theorem is referenced by: fzoss2 12915 expmulnbnd 13446 shftuz 14262 climshftlem 14765 isumshft 15027 efgredleme 18596 uniioombllem3 23869 ulmshftlem 24660 ulmshft 24661 caushft 34568 uzmptshftfval 40216 stoweidlem14 41841 nnsum4primeseven 43447 nnsum4primesevenALTV 43448 |
Copyright terms: Public domain | W3C validator |