| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > xnn0lenn0nn0 | 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 9528 | . . 3 ⊢ (𝑀 ∈ ℕ0* ↔ (𝑀 ∈ ℕ0 ∨ 𝑀 = +∞)) | |
| 2 | 2a1 25 | . . . 4 ⊢ (𝑀 ∈ ℕ0 → (𝑁 ∈ ℕ0 → (𝑀 ≤ 𝑁 → 𝑀 ∈ ℕ0))) | |
| 3 | breq1 4096 | . . . . . . 7 ⊢ (𝑀 = +∞ → (𝑀 ≤ 𝑁 ↔ +∞ ≤ 𝑁)) | |
| 4 | 3 | adantr 276 | . . . . . 6 ⊢ ((𝑀 = +∞ ∧ 𝑁 ∈ ℕ0) → (𝑀 ≤ 𝑁 ↔ +∞ ≤ 𝑁)) |
| 5 | nn0re 9470 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
| 6 | 5 | rexrd 8288 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ*) |
| 7 | xgepnf 10112 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℝ* → (+∞ ≤ 𝑁 ↔ 𝑁 = +∞)) | |
| 8 | 6, 7 | syl 14 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (+∞ ≤ 𝑁 ↔ 𝑁 = +∞)) |
| 9 | pnfnre 8280 | . . . . . . . . 9 ⊢ +∞ ∉ ℝ | |
| 10 | eleq1 2294 | . . . . . . . . . . 11 ⊢ (𝑁 = +∞ → (𝑁 ∈ ℕ0 ↔ +∞ ∈ ℕ0)) | |
| 11 | nn0re 9470 | . . . . . . . . . . . 12 ⊢ (+∞ ∈ ℕ0 → +∞ ∈ ℝ) | |
| 12 | elnelall 2510 | . . . . . . . . . . . 12 ⊢ (+∞ ∈ ℝ → (+∞ ∉ ℝ → 𝑀 ∈ ℕ0)) | |
| 13 | 11, 12 | syl 14 | . . . . . . . . . . 11 ⊢ (+∞ ∈ ℕ0 → (+∞ ∉ ℝ → 𝑀 ∈ ℕ0)) |
| 14 | 10, 13 | biimtrdi 163 | . . . . . . . . . 10 ⊢ (𝑁 = +∞ → (𝑁 ∈ ℕ0 → (+∞ ∉ ℝ → 𝑀 ∈ ℕ0))) |
| 15 | 14 | com13 80 | . . . . . . . . 9 ⊢ (+∞ ∉ ℝ → (𝑁 ∈ ℕ0 → (𝑁 = +∞ → 𝑀 ∈ ℕ0))) |
| 16 | 9, 15 | ax-mp 5 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (𝑁 = +∞ → 𝑀 ∈ ℕ0)) |
| 17 | 8, 16 | sylbid 150 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (+∞ ≤ 𝑁 → 𝑀 ∈ ℕ0)) |
| 18 | 17 | adantl 277 | . . . . . 6 ⊢ ((𝑀 = +∞ ∧ 𝑁 ∈ ℕ0) → (+∞ ≤ 𝑁 → 𝑀 ∈ ℕ0)) |
| 19 | 4, 18 | sylbid 150 | . . . . 5 ⊢ ((𝑀 = +∞ ∧ 𝑁 ∈ ℕ0) → (𝑀 ≤ 𝑁 → 𝑀 ∈ ℕ0)) |
| 20 | 19 | ex 115 | . . . 4 ⊢ (𝑀 = +∞ → (𝑁 ∈ ℕ0 → (𝑀 ≤ 𝑁 → 𝑀 ∈ ℕ0))) |
| 21 | 2, 20 | jaoi 724 | . . 3 ⊢ ((𝑀 ∈ ℕ0 ∨ 𝑀 = +∞) → (𝑁 ∈ ℕ0 → (𝑀 ≤ 𝑁 → 𝑀 ∈ ℕ0))) |
| 22 | 1, 21 | sylbi 121 | . 2 ⊢ (𝑀 ∈ ℕ0* → (𝑁 ∈ ℕ0 → (𝑀 ≤ 𝑁 → 𝑀 ∈ ℕ0))) |
| 23 | 22 | 3imp 1220 | 1 ⊢ ((𝑀 ∈ ℕ0* ∧ 𝑁 ∈ ℕ0 ∧ 𝑀 ≤ 𝑁) → 𝑀 ∈ ℕ0) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 ∉ wnel 2498 class class class wbr 4093 ℝcr 8091 +∞cpnf 8270 ℝ*cxr 8272 ≤ cle 8274 ℕ0cn0 9461 ℕ0*cxnn0 9526 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8183 ax-resscn 8184 ax-1re 8186 ax-addrcl 8189 ax-rnegex 8201 ax-pre-ltirr 8204 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-rab 2520 df-v 2805 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-br 4094 df-opab 4156 df-xp 4737 df-cnv 4739 df-pnf 8275 df-mnf 8276 df-xr 8277 df-ltxr 8278 df-le 8279 df-inn 9203 df-n0 9462 df-xnn0 9527 |
| This theorem is referenced by: xnn0le2is012 10162 |
| Copyright terms: Public domain | W3C validator |