![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > xnn0lenn0nn0 | Structured version Visualization version GIF version |
Description: An extended nonnegative integer which is less than or equal to a nonnegative integer is a nonnegative integer. (Contributed by AV, 24-Nov-2021.) |
Ref | Expression |
---|---|
xnn0lenn0nn0 | ⊢ ((𝑀 ∈ ℕ0* ∧ 𝑁 ∈ ℕ0 ∧ 𝑀 ≤ 𝑁) → 𝑀 ∈ ℕ0) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elxnn0 11721 | . . 3 ⊢ (𝑀 ∈ ℕ0* ↔ (𝑀 ∈ ℕ0 ∨ 𝑀 = +∞)) | |
2 | 2a1 28 | . . . 4 ⊢ (𝑀 ∈ ℕ0 → (𝑁 ∈ ℕ0 → (𝑀 ≤ 𝑁 → 𝑀 ∈ ℕ0))) | |
3 | breq1 4891 | . . . . . . 7 ⊢ (𝑀 = +∞ → (𝑀 ≤ 𝑁 ↔ +∞ ≤ 𝑁)) | |
4 | 3 | adantr 474 | . . . . . 6 ⊢ ((𝑀 = +∞ ∧ 𝑁 ∈ ℕ0) → (𝑀 ≤ 𝑁 ↔ +∞ ≤ 𝑁)) |
5 | nn0re 11657 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
6 | 5 | rexrd 10428 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ*) |
7 | xgepnf 12313 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℝ* → (+∞ ≤ 𝑁 ↔ 𝑁 = +∞)) | |
8 | 6, 7 | syl 17 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (+∞ ≤ 𝑁 ↔ 𝑁 = +∞)) |
9 | pnfnre 10420 | . . . . . . . . 9 ⊢ +∞ ∉ ℝ | |
10 | eleq1 2847 | . . . . . . . . . . 11 ⊢ (𝑁 = +∞ → (𝑁 ∈ ℕ0 ↔ +∞ ∈ ℕ0)) | |
11 | nn0re 11657 | . . . . . . . . . . . 12 ⊢ (+∞ ∈ ℕ0 → +∞ ∈ ℝ) | |
12 | elnelall 3088 | . . . . . . . . . . . 12 ⊢ (+∞ ∈ ℝ → (+∞ ∉ ℝ → 𝑀 ∈ ℕ0)) | |
13 | 11, 12 | syl 17 | . . . . . . . . . . 11 ⊢ (+∞ ∈ ℕ0 → (+∞ ∉ ℝ → 𝑀 ∈ ℕ0)) |
14 | 10, 13 | syl6bi 245 | . . . . . . . . . 10 ⊢ (𝑁 = +∞ → (𝑁 ∈ ℕ0 → (+∞ ∉ ℝ → 𝑀 ∈ ℕ0))) |
15 | 14 | com13 88 | . . . . . . . . 9 ⊢ (+∞ ∉ ℝ → (𝑁 ∈ ℕ0 → (𝑁 = +∞ → 𝑀 ∈ ℕ0))) |
16 | 9, 15 | ax-mp 5 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (𝑁 = +∞ → 𝑀 ∈ ℕ0)) |
17 | 8, 16 | sylbid 232 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (+∞ ≤ 𝑁 → 𝑀 ∈ ℕ0)) |
18 | 17 | adantl 475 | . . . . . 6 ⊢ ((𝑀 = +∞ ∧ 𝑁 ∈ ℕ0) → (+∞ ≤ 𝑁 → 𝑀 ∈ ℕ0)) |
19 | 4, 18 | sylbid 232 | . . . . 5 ⊢ ((𝑀 = +∞ ∧ 𝑁 ∈ ℕ0) → (𝑀 ≤ 𝑁 → 𝑀 ∈ ℕ0)) |
20 | 19 | ex 403 | . . . 4 ⊢ (𝑀 = +∞ → (𝑁 ∈ ℕ0 → (𝑀 ≤ 𝑁 → 𝑀 ∈ ℕ0))) |
21 | 2, 20 | jaoi 846 | . . 3 ⊢ ((𝑀 ∈ ℕ0 ∨ 𝑀 = +∞) → (𝑁 ∈ ℕ0 → (𝑀 ≤ 𝑁 → 𝑀 ∈ ℕ0))) |
22 | 1, 21 | sylbi 209 | . 2 ⊢ (𝑀 ∈ ℕ0* → (𝑁 ∈ ℕ0 → (𝑀 ≤ 𝑁 → 𝑀 ∈ ℕ0))) |
23 | 22 | 3imp 1098 | 1 ⊢ ((𝑀 ∈ ℕ0* ∧ 𝑁 ∈ ℕ0 ∧ 𝑀 ≤ 𝑁) → 𝑀 ∈ ℕ0) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∧ wa 386 ∨ wo 836 ∧ w3a 1071 = wceq 1601 ∈ wcel 2107 ∉ wnel 3075 class class class wbr 4888 ℝcr 10273 +∞cpnf 10410 ℝ*cxr 10412 ≤ cle 10414 ℕ0cn0 11647 ℕ0*cxnn0 11719 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-sep 5019 ax-nul 5027 ax-pow 5079 ax-pr 5140 ax-un 7228 ax-cnex 10330 ax-resscn 10331 ax-1cn 10332 ax-icn 10333 ax-addcl 10334 ax-addrcl 10335 ax-mulcl 10336 ax-mulrcl 10337 ax-i2m1 10342 ax-1ne0 10343 ax-rnegex 10345 ax-rrecex 10346 ax-cnre 10347 ax-pre-lttri 10348 ax-pre-lttrn 10349 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-nel 3076 df-ral 3095 df-rex 3096 df-reu 3097 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-uni 4674 df-iun 4757 df-br 4889 df-opab 4951 df-mpt 4968 df-tr 4990 df-id 5263 df-eprel 5268 df-po 5276 df-so 5277 df-fr 5316 df-we 5318 df-xp 5363 df-rel 5364 df-cnv 5365 df-co 5366 df-dm 5367 df-rn 5368 df-res 5369 df-ima 5370 df-pred 5935 df-ord 5981 df-on 5982 df-lim 5983 df-suc 5984 df-iota 6101 df-fun 6139 df-fn 6140 df-f 6141 df-f1 6142 df-fo 6143 df-f1o 6144 df-fv 6145 df-ov 6927 df-om 7346 df-wrecs 7691 df-recs 7753 df-rdg 7791 df-er 8028 df-en 8244 df-dom 8245 df-sdom 8246 df-pnf 10415 df-mnf 10416 df-xr 10417 df-ltxr 10418 df-le 10419 df-nn 11380 df-n0 11648 df-xnn0 11720 |
This theorem is referenced by: xnn0le2is012 12393 |
Copyright terms: Public domain | W3C validator |