| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dmgmaddnn0 | Structured version Visualization version GIF version | ||
| Description: If 𝐴 is not a nonpositive integer and 𝑁 is a nonnegative integer, then 𝐴 + 𝑁 is also not a nonpositive integer. (Contributed by Mario Carneiro, 6-Jul-2017.) |
| Ref | Expression |
|---|---|
| dmgmn0.a | ⊢ (𝜑 → 𝐴 ∈ (ℂ ∖ (ℤ ∖ ℕ))) |
| dmgmaddnn0.n | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| Ref | Expression |
|---|---|
| dmgmaddnn0 | ⊢ (𝜑 → (𝐴 + 𝑁) ∈ (ℂ ∖ (ℤ ∖ ℕ))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dmgmn0.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ (ℂ ∖ (ℤ ∖ ℕ))) | |
| 2 | 1 | eldifad 3925 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 3 | dmgmaddnn0.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 4 | 3 | nn0cnd 12567 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
| 5 | 2, 4 | addcld 11228 | . 2 ⊢ (𝜑 → (𝐴 + 𝑁) ∈ ℂ) |
| 6 | eldmgm 27152 | . . . . 5 ⊢ (𝐴 ∈ (ℂ ∖ (ℤ ∖ ℕ)) ↔ (𝐴 ∈ ℂ ∧ ¬ -𝐴 ∈ ℕ0)) | |
| 7 | 1, 6 | sylib 221 | . . . 4 ⊢ (𝜑 → (𝐴 ∈ ℂ ∧ ¬ -𝐴 ∈ ℕ0)) |
| 8 | 7 | simprd 500 | . . 3 ⊢ (𝜑 → ¬ -𝐴 ∈ ℕ0) |
| 9 | 2, 4 | negdi2d 11583 | . . . . . . 7 ⊢ (𝜑 → -(𝐴 + 𝑁) = (-𝐴 − 𝑁)) |
| 10 | 9 | oveq1d 7426 | . . . . . 6 ⊢ (𝜑 → (-(𝐴 + 𝑁) + 𝑁) = ((-𝐴 − 𝑁) + 𝑁)) |
| 11 | 2 | negcld 11556 | . . . . . . 7 ⊢ (𝜑 → -𝐴 ∈ ℂ) |
| 12 | 11, 4 | npcand 11573 | . . . . . 6 ⊢ (𝜑 → ((-𝐴 − 𝑁) + 𝑁) = -𝐴) |
| 13 | 10, 12 | eqtrd 2804 | . . . . 5 ⊢ (𝜑 → (-(𝐴 + 𝑁) + 𝑁) = -𝐴) |
| 14 | 13 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ -(𝐴 + 𝑁) ∈ ℕ0) → (-(𝐴 + 𝑁) + 𝑁) = -𝐴) |
| 15 | simpr 489 | . . . . 5 ⊢ ((𝜑 ∧ -(𝐴 + 𝑁) ∈ ℕ0) → -(𝐴 + 𝑁) ∈ ℕ0) | |
| 16 | 3 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ -(𝐴 + 𝑁) ∈ ℕ0) → 𝑁 ∈ ℕ0) |
| 17 | 15, 16 | nn0addcld 12569 | . . . 4 ⊢ ((𝜑 ∧ -(𝐴 + 𝑁) ∈ ℕ0) → (-(𝐴 + 𝑁) + 𝑁) ∈ ℕ0) |
| 18 | 14, 17 | eqeltrrd 2870 | . . 3 ⊢ ((𝜑 ∧ -(𝐴 + 𝑁) ∈ ℕ0) → -𝐴 ∈ ℕ0) |
| 19 | 8, 18 | mtand 827 | . 2 ⊢ (𝜑 → ¬ -(𝐴 + 𝑁) ∈ ℕ0) |
| 20 | eldmgm 27152 | . 2 ⊢ ((𝐴 + 𝑁) ∈ (ℂ ∖ (ℤ ∖ ℕ)) ↔ ((𝐴 + 𝑁) ∈ ℂ ∧ ¬ -(𝐴 + 𝑁) ∈ ℕ0)) | |
| 21 | 5, 19, 20 | sylanbrc 594 | 1 ⊢ (𝜑 → (𝐴 + 𝑁) ∈ (ℂ ∖ (ℤ ∖ ℕ))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∖ cdif 3910 (class class class)co 7411 ℂcc 11098 + caddc 11103 − cmin 11441 -cneg 11442 ℕcn 12233 ℕ0cn0 12504 ℤcz 12591 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-n0 12505 df-z 12592 |
| This theorem is referenced by: lgamcvg2 27185 gamp1 27188 |
| Copyright terms: Public domain | W3C validator |