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 7236 | . . . . 5 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (ℤ≥‘(𝑀 + 𝐾)) = (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾))) | |
2 | 1 | eleq2d 2823 | . . . 4 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾)) ↔ 𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)))) |
3 | fveq2 6717 | . . . . 5 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (ℤ≥‘𝑀) = (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) | |
4 | 3 | eleq2d 2823 | . . . 4 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → ((𝑁 − 𝐾) ∈ (ℤ≥‘𝑀) ↔ (𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)))) |
5 | 2, 4 | imbi12d 348 | . . 3 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → ((𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀)) ↔ (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))))) |
6 | oveq2 7221 | . . . . . 6 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾) = (if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))) | |
7 | 6 | fveq2d 6721 | . . . . 5 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) = (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0)))) |
8 | 7 | eleq2d 2823 | . . . 4 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) ↔ 𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))))) |
9 | oveq2 7221 | . . . . 5 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (𝑁 − 𝐾) = (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0))) | |
10 | 9 | eleq1d 2822 | . . . 4 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → ((𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)) ↔ (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)))) |
11 | 8, 10 | imbi12d 348 | . . 3 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → ((𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) ↔ (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))) → (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))))) |
12 | 0z 12187 | . . . . 5 ⊢ 0 ∈ ℤ | |
13 | 12 | elimel 4508 | . . . 4 ⊢ if(𝑀 ∈ ℤ, 𝑀, 0) ∈ ℤ |
14 | 12 | elimel 4508 | . . . 4 ⊢ if(𝐾 ∈ ℤ, 𝐾, 0) ∈ ℤ |
15 | 13, 14 | eluzsubi 12468 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))) → (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) |
16 | 5, 11, 15 | dedth2h 4498 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀))) |
17 | 16 | 3impia 1119 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾))) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1089 = wceq 1543 ∈ wcel 2110 ifcif 4439 ‘cfv 6380 (class class class)co 7213 0cc0 10729 + caddc 10732 − cmin 11062 ℤcz 12176 ℤ≥cuz 12438 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-sep 5192 ax-nul 5199 ax-pow 5258 ax-pr 5322 ax-un 7523 ax-cnex 10785 ax-resscn 10786 ax-1cn 10787 ax-icn 10788 ax-addcl 10789 ax-addrcl 10790 ax-mulcl 10791 ax-mulrcl 10792 ax-mulcom 10793 ax-addass 10794 ax-mulass 10795 ax-distr 10796 ax-i2m1 10797 ax-1ne0 10798 ax-1rid 10799 ax-rnegex 10800 ax-rrecex 10801 ax-cnre 10802 ax-pre-lttri 10803 ax-pre-lttrn 10804 ax-pre-ltadd 10805 ax-pre-mulgt0 10806 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rab 3070 df-v 3410 df-sbc 3695 df-csb 3812 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-pss 3885 df-nul 4238 df-if 4440 df-pw 4515 df-sn 4542 df-pr 4544 df-tp 4546 df-op 4548 df-uni 4820 df-iun 4906 df-br 5054 df-opab 5116 df-mpt 5136 df-tr 5162 df-id 5455 df-eprel 5460 df-po 5468 df-so 5469 df-fr 5509 df-we 5511 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-rn 5562 df-res 5563 df-ima 5564 df-pred 6160 df-ord 6216 df-on 6217 df-lim 6218 df-suc 6219 df-iota 6338 df-fun 6382 df-fn 6383 df-f 6384 df-f1 6385 df-fo 6386 df-f1o 6387 df-fv 6388 df-riota 7170 df-ov 7216 df-oprab 7217 df-mpo 7218 df-om 7645 df-wrecs 8047 df-recs 8108 df-rdg 8146 df-er 8391 df-en 8627 df-dom 8628 df-sdom 8629 df-pnf 10869 df-mnf 10870 df-xr 10871 df-ltxr 10872 df-le 10873 df-sub 11064 df-neg 11065 df-nn 11831 df-n0 12091 df-z 12177 df-uz 12439 |
This theorem is referenced by: fzoss2 13270 expmulnbnd 13802 shftuz 14632 climshftlem 15135 isumshft 15403 efgredleme 19133 uniioombllem3 24482 ulmshftlem 25281 ulmshft 25282 revpfxsfxrev 32790 caushft 35656 uzmptshftfval 41637 stoweidlem14 43230 nnsum4primeseven 44925 nnsum4primesevenALTV 44926 |
Copyright terms: Public domain | W3C validator |