| 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 9582 | . . 3 ⊢ (𝑀 ∈ ℕ0* ↔ (𝑀 ∈ ℕ0 ∨ 𝑀 = +∞)) | |
| 2 | 2a1 25 | . . . 4 ⊢ (𝑀 ∈ ℕ0 → (𝑁 ∈ ℕ0 → (𝑀 ≤ 𝑁 → 𝑀 ∈ ℕ0))) | |
| 3 | breq1 4117 | . . . . . . 7 ⊢ (𝑀 = +∞ → (𝑀 ≤ 𝑁 ↔ +∞ ≤ 𝑁)) | |
| 4 | 3 | adantr 276 | . . . . . 6 ⊢ ((𝑀 = +∞ ∧ 𝑁 ∈ ℕ0) → (𝑀 ≤ 𝑁 ↔ +∞ ≤ 𝑁)) |
| 5 | nn0re 9522 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
| 6 | 5 | rexrd 8339 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ*) |
| 7 | xgepnf 10168 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℝ* → (+∞ ≤ 𝑁 ↔ 𝑁 = +∞)) | |
| 8 | 6, 7 | syl 14 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (+∞ ≤ 𝑁 ↔ 𝑁 = +∞)) |
| 9 | pnfnre 8331 | . . . . . . . . 9 ⊢ +∞ ∉ ℝ | |
| 10 | eleq1 2297 | . . . . . . . . . . 11 ⊢ (𝑁 = +∞ → (𝑁 ∈ ℕ0 ↔ +∞ ∈ ℕ0)) | |
| 11 | nn0re 9522 | . . . . . . . . . . . 12 ⊢ (+∞ ∈ ℕ0 → +∞ ∈ ℝ) | |
| 12 | elnelall 2521 | . . . . . . . . . . . 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 2205 ∉ wnel 2509 class class class wbr 4114 ℝcr 8142 +∞cpnf 8321 ℝ*cxr 8323 ≤ cle 8325 ℕ0cn0 9513 ℕ0*cxnn0 9580 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-1re 8237 ax-addrcl 8240 ax-rnegex 8252 ax-pre-ltirr 8255 |
| 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 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-rab 2531 df-v 2817 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-br 4115 df-opab 4177 df-xp 4760 df-cnv 4762 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-inn 9255 df-n0 9514 df-xnn0 9581 |
| This theorem is referenced by: xnn0le2is012 10218 |
| Copyright terms: Public domain | W3C validator |