0mnnnnn0 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > 0mnnnnn0		Structured version Visualization version GIF version

Theorem 0mnnnnn0 11923

Description: The result of subtracting a positive integer from 0 is not a nonnegative integer. (Contributed by Alexander van der Vekens, 19-Mar-2018.)

**Assertion**
Ref	Expression
0mnnnnn0	⊢ (𝑁 ∈ ℕ → (0 − 𝑁) ∉ ℕ₀)

**Proof of Theorem 0mnnnnn0**
Step	Hyp	Ref	Expression
1		0re 10637	. 2 ⊢ 0 ∈ ℝ
2		nnel 3132	. . 3 ⊢ (¬ (0 − 𝑁) ∉ ℕ₀ ↔ (0 − 𝑁) ∈ ℕ₀)
3		df-neg 10867	. . . . . 6 ⊢ -𝑁 = (0 − 𝑁)
4	3	eqcomi 2830	. . . . 5 ⊢ (0 − 𝑁) = -𝑁
5	4	eleq1i 2903	. . . 4 ⊢ ((0 − 𝑁) ∈ ℕ₀ ↔ -𝑁 ∈ ℕ₀)
6		nn0ge0 11916	. . . . 5 ⊢ (-𝑁 ∈ ℕ₀ → 0 ≤ -𝑁)
7		nnre 11639	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ)
8	7	le0neg1d 11205	. . . . . 6 ⊢ (𝑁 ∈ ℕ → (𝑁 ≤ 0 ↔ 0 ≤ -𝑁))
9		nngt0 11662	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → 0 < 𝑁)
10		0red 10638	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → 0 ∈ ℝ)
11	10, 7	ltnled 10781	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ → (0 < 𝑁 ↔ ¬ 𝑁 ≤ 0))
12		pm2.21 123	. . . . . . . 8 ⊢ (¬ 𝑁 ≤ 0 → (𝑁 ≤ 0 → ¬ 0 ∈ ℝ))
13	11, 12	syl6bi 255	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → (0 < 𝑁 → (𝑁 ≤ 0 → ¬ 0 ∈ ℝ)))
14	9, 13	mpd 15	. . . . . 6 ⊢ (𝑁 ∈ ℕ → (𝑁 ≤ 0 → ¬ 0 ∈ ℝ))
15	8, 14	sylbird 262	. . . . 5 ⊢ (𝑁 ∈ ℕ → (0 ≤ -𝑁 → ¬ 0 ∈ ℝ))
16	6, 15	syl5 34	. . . 4 ⊢ (𝑁 ∈ ℕ → (-𝑁 ∈ ℕ₀ → ¬ 0 ∈ ℝ))
17	5, 16	syl5bi 244	. . 3 ⊢ (𝑁 ∈ ℕ → ((0 − 𝑁) ∈ ℕ₀ → ¬ 0 ∈ ℝ))
18	2, 17	syl5bi 244	. 2 ⊢ (𝑁 ∈ ℕ → (¬ (0 − 𝑁) ∉ ℕ₀ → ¬ 0 ∈ ℝ))
19	1, 18	mt4i 118	1 ⊢ (𝑁 ∈ ℕ → (0 − 𝑁) ∉ ℕ₀)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2110 ∉ wnel 3123 class class class wbr 5058 (class class class)co 7150 ℝcr 10530 0cc0 10531 < clt 10669 ≤ cle 10670 − cmin 10864 -cneg 10865 ℕcn 11632 ℕ₀cn0 11891

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-n0 11892

This theorem is referenced by: 0nn0m1nnn0 32346

W3C validator