| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nnnninf2 | GIF version | ||
| Description: Canonical embedding of suc ω into ℕ∞. (Contributed by BJ, 10-Aug-2024.) |
| Ref | Expression |
|---|---|
| nnnninf2 | ⊢ (𝑁 ∈ suc ω → (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑁, 1o, ∅)) ∈ ℕ∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elsuci 4439 | . 2 ⊢ (𝑁 ∈ suc ω → (𝑁 ∈ ω ∨ 𝑁 = ω)) | |
| 2 | nnnninf 7201 | . . 3 ⊢ (𝑁 ∈ ω → (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑁, 1o, ∅)) ∈ ℕ∞) | |
| 3 | iftrue 3567 | . . . . . . 7 ⊢ (𝑖 ∈ ω → if(𝑖 ∈ ω, 1o, ∅) = 1o) | |
| 4 | 3 | eqcomd 2202 | . . . . . 6 ⊢ (𝑖 ∈ ω → 1o = if(𝑖 ∈ ω, 1o, ∅)) |
| 5 | eleq2 2260 | . . . . . . . 8 ⊢ (𝑁 = ω → (𝑖 ∈ 𝑁 ↔ 𝑖 ∈ ω)) | |
| 6 | 5 | ifbid 3583 | . . . . . . 7 ⊢ (𝑁 = ω → if(𝑖 ∈ 𝑁, 1o, ∅) = if(𝑖 ∈ ω, 1o, ∅)) |
| 7 | 6 | eqcomd 2202 | . . . . . 6 ⊢ (𝑁 = ω → if(𝑖 ∈ ω, 1o, ∅) = if(𝑖 ∈ 𝑁, 1o, ∅)) |
| 8 | 4, 7 | sylan9eqr 2251 | . . . . 5 ⊢ ((𝑁 = ω ∧ 𝑖 ∈ ω) → 1o = if(𝑖 ∈ 𝑁, 1o, ∅)) |
| 9 | 8 | mpteq2dva 4124 | . . . 4 ⊢ (𝑁 = ω → (𝑖 ∈ ω ↦ 1o) = (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑁, 1o, ∅))) |
| 10 | infnninf 7199 | . . . 4 ⊢ (𝑖 ∈ ω ↦ 1o) ∈ ℕ∞ | |
| 11 | 9, 10 | eqeltrrdi 2288 | . . 3 ⊢ (𝑁 = ω → (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑁, 1o, ∅)) ∈ ℕ∞) |
| 12 | 2, 11 | jaoi 717 | . 2 ⊢ ((𝑁 ∈ ω ∨ 𝑁 = ω) → (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑁, 1o, ∅)) ∈ ℕ∞) |
| 13 | 1, 12 | syl 14 | 1 ⊢ (𝑁 ∈ suc ω → (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑁, 1o, ∅)) ∈ ℕ∞) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∨ wo 709 = wceq 1364 ∈ wcel 2167 ∅c0 3451 ifcif 3562 ↦ cmpt 4095 suc csuc 4401 ωcom 4627 1oc1o 6476 ℕ∞xnninf 7194 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-nul 4160 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-iinf 4625 |
| This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-ral 2480 df-rex 2481 df-rab 2484 df-v 2765 df-sbc 2990 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-if 3563 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-br 4035 df-opab 4096 df-mpt 4097 df-tr 4133 df-id 4329 df-iord 4402 df-on 4404 df-suc 4407 df-iom 4628 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-fv 5267 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1o 6483 df-2o 6484 df-map 6718 df-nninf 7195 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |