![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > eluzsubOLD | Structured version Visualization version GIF version |
Description: Obsolete version of eluzsub 12852 as of 7-Feb-2025. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
eluzsubOLD | ⊢ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾))) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvoveq1 7432 | . . . . 5 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (ℤ≥‘(𝑀 + 𝐾)) = (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾))) | |
2 | 1 | eleq2d 2820 | . . . 4 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾)) ↔ 𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)))) |
3 | fveq2 6892 | . . . . 5 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (ℤ≥‘𝑀) = (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) | |
4 | 3 | eleq2d 2820 | . . . 4 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → ((𝑁 − 𝐾) ∈ (ℤ≥‘𝑀) ↔ (𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)))) |
5 | 2, 4 | imbi12d 345 | . . 3 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → ((𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀)) ↔ (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))))) |
6 | oveq2 7417 | . . . . . 6 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾) = (if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))) | |
7 | 6 | fveq2d 6896 | . . . . 5 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) = (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0)))) |
8 | 7 | eleq2d 2820 | . . . 4 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) ↔ 𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))))) |
9 | oveq2 7417 | . . . . 5 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → (𝑁 − 𝐾) = (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0))) | |
10 | 9 | eleq1d 2819 | . . . 4 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → ((𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)) ↔ (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)))) |
11 | 8, 10 | imbi12d 345 | . . 3 ⊢ (𝐾 = if(𝐾 ∈ ℤ, 𝐾, 0) → ((𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) ↔ (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))) → (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))))) |
12 | 0z 12569 | . . . . 5 ⊢ 0 ∈ ℤ | |
13 | 12 | elimel 4598 | . . . 4 ⊢ if(𝑀 ∈ ℤ, 𝑀, 0) ∈ ℤ |
14 | 12 | elimel 4598 | . . . 4 ⊢ if(𝐾 ∈ ℤ, 𝐾, 0) ∈ ℤ |
15 | 13, 14 | eluzsubi 12855 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘(if(𝑀 ∈ ℤ, 𝑀, 0) + if(𝐾 ∈ ℤ, 𝐾, 0))) → (𝑁 − if(𝐾 ∈ ℤ, 𝐾, 0)) ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) |
16 | 5, 11, 15 | dedth2h 4588 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾)) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀))) |
17 | 16 | 3impia 1118 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑁 ∈ (ℤ≥‘(𝑀 + 𝐾))) → (𝑁 − 𝐾) ∈ (ℤ≥‘𝑀)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ifcif 4529 ‘cfv 6544 (class class class)co 7409 0cc0 11110 + caddc 11113 − cmin 11444 ℤcz 12558 ℤ≥cuz 12822 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-n0 12473 df-z 12559 df-uz 12823 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |