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 7278 | . . . . 5 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (ℤ≥‘(𝑀 + 𝐾)) = (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾))) | |
2 | 1 | eleq2d 2824 | . . . 4 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾)) ↔ 𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)))) |
3 | fveq2 6756 | . . . . 5 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (ℤ≥‘𝑀) = (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) | |
4 | 3 | eleq2d 2824 | . . . 4 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → ((𝑁 − 𝐾) ∈ (ℤ≥‘𝑀) ↔ (𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)))) |
5 | 2, 4 | imbi12d 344 | . . 3 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → ((𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀)) ↔ (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))))) |
6 | oveq2 7263 | . . . . . 6 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾) = (if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))) | |
7 | 6 | fveq2d 6760 | . . . . 5 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) = (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0)))) |
8 | 7 | eleq2d 2824 | . . . 4 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) ↔ 𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))))) |
9 | oveq2 7263 | . . . . 5 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (𝑁 − 𝐾) = (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0))) | |
10 | 9 | eleq1d 2823 | . . . 4 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → ((𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)) ↔ (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)))) |
11 | 8, 10 | imbi12d 344 | . . 3 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → ((𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) ↔ (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))) → (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))))) |
12 | 0z 12260 | . . . . 5 ⊢ 0 ∈ ℤ | |
13 | 12 | elimel 4525 | . . . 4 ⊢ if(𝑀 ∈ ℤ, 𝑀, 0) ∈ ℤ |
14 | 12 | elimel 4525 | . . . 4 ⊢ if(𝐾 ∈ ℤ, 𝐾, 0) ∈ ℤ |
15 | 13, 14 | eluzsubi 12541 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))) → (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) |
16 | 5, 11, 15 | dedth2h 4515 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀))) |
17 | 16 | 3impia 1115 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾))) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ifcif 4456 ‘cfv 6418 (class class class)co 7255 0cc0 10802 + caddc 10805 − cmin 11135 ℤcz 12249 ℤ≥cuz 12511 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-n0 12164 df-z 12250 df-uz 12512 |
This theorem is referenced by: fzoss2 13343 expmulnbnd 13878 shftuz 14708 climshftlem 15211 isumshft 15479 efgredleme 19264 uniioombllem3 24654 ulmshftlem 25453 ulmshft 25454 revpfxsfxrev 32977 caushft 35846 uzmptshftfval 41853 stoweidlem14 43445 nnsum4primeseven 45140 nnsum4primesevenALTV 45141 |
Copyright terms: Public domain | W3C validator |