| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fxnn0nninf | GIF version | ||
| Description: A function from ℕ0* into ℕ∞. (Contributed by Jim Kingdon, 16-Jul-2022.) TODO: use infnninf 7323 instead of infnninfOLD 7324. More generally, this theorem and most theorems in this section could use an extended 𝐺 defined by 𝐺 = (frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ∪ 〈ω, +∞〉) and 𝐹 = (𝑛 ∈ suc ω ↦ (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) as in nnnninf2 7326. |
| Ref | Expression |
|---|---|
| fxnn0nninf.g | ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) |
| fxnn0nninf.f | ⊢ 𝐹 = (𝑛 ∈ ω ↦ (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) |
| fxnn0nninf.i | ⊢ 𝐼 = ((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉}) |
| Ref | Expression |
|---|---|
| fxnn0nninf | ⊢ 𝐼:ℕ0*⟶ℕ∞ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fxnn0nninf.g | . . . . . 6 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) | |
| 2 | fxnn0nninf.f | . . . . . 6 ⊢ 𝐹 = (𝑛 ∈ ω ↦ (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) | |
| 3 | 1, 2 | fnn0nninf 10701 | . . . . 5 ⊢ (𝐹 ∘ ◡𝐺):ℕ0⟶ℕ∞ |
| 4 | pnfex 8233 | . . . . . . . 8 ⊢ +∞ ∈ V | |
| 5 | omex 4691 | . . . . . . . . 9 ⊢ ω ∈ V | |
| 6 | 1oex 6590 | . . . . . . . . . 10 ⊢ 1o ∈ V | |
| 7 | 6 | snex 4275 | . . . . . . . . 9 ⊢ {1o} ∈ V |
| 8 | 5, 7 | xpex 4842 | . . . . . . . 8 ⊢ (ω × {1o}) ∈ V |
| 9 | 4, 8 | f1osn 5625 | . . . . . . 7 ⊢ {〈+∞, (ω × {1o})〉}:{+∞}–1-1-onto→{(ω × {1o})} |
| 10 | f1of 5583 | . . . . . . 7 ⊢ ({〈+∞, (ω × {1o})〉}:{+∞}–1-1-onto→{(ω × {1o})} → {〈+∞, (ω × {1o})〉}:{+∞}⟶{(ω × {1o})}) | |
| 11 | 9, 10 | ax-mp 5 | . . . . . 6 ⊢ {〈+∞, (ω × {1o})〉}:{+∞}⟶{(ω × {1o})} |
| 12 | infnninfOLD 7324 | . . . . . . 7 ⊢ (ω × {1o}) ∈ ℕ∞ | |
| 13 | snssi 3817 | . . . . . . 7 ⊢ ((ω × {1o}) ∈ ℕ∞ → {(ω × {1o})} ⊆ ℕ∞) | |
| 14 | 12, 13 | ax-mp 5 | . . . . . 6 ⊢ {(ω × {1o})} ⊆ ℕ∞ |
| 15 | fss 5494 | . . . . . 6 ⊢ (({〈+∞, (ω × {1o})〉}:{+∞}⟶{(ω × {1o})} ∧ {(ω × {1o})} ⊆ ℕ∞) → {〈+∞, (ω × {1o})〉}:{+∞}⟶ℕ∞) | |
| 16 | 11, 14, 15 | mp2an 426 | . . . . 5 ⊢ {〈+∞, (ω × {1o})〉}:{+∞}⟶ℕ∞ |
| 17 | 3, 16 | pm3.2i 272 | . . . 4 ⊢ ((𝐹 ∘ ◡𝐺):ℕ0⟶ℕ∞ ∧ {〈+∞, (ω × {1o})〉}:{+∞}⟶ℕ∞) |
| 18 | disj 3543 | . . . . 5 ⊢ ((ℕ0 ∩ {+∞}) = ∅ ↔ ∀𝑥 ∈ ℕ0 ¬ 𝑥 ∈ {+∞}) | |
| 19 | nn0nepnf 9473 | . . . . . . 7 ⊢ (𝑥 ∈ ℕ0 → 𝑥 ≠ +∞) | |
| 20 | 19 | neneqd 2423 | . . . . . 6 ⊢ (𝑥 ∈ ℕ0 → ¬ 𝑥 = +∞) |
| 21 | elsni 3687 | . . . . . 6 ⊢ (𝑥 ∈ {+∞} → 𝑥 = +∞) | |
| 22 | 20, 21 | nsyl 633 | . . . . 5 ⊢ (𝑥 ∈ ℕ0 → ¬ 𝑥 ∈ {+∞}) |
| 23 | 18, 22 | mprgbir 2590 | . . . 4 ⊢ (ℕ0 ∩ {+∞}) = ∅ |
| 24 | fun2 5509 | . . . 4 ⊢ ((((𝐹 ∘ ◡𝐺):ℕ0⟶ℕ∞ ∧ {〈+∞, (ω × {1o})〉}:{+∞}⟶ℕ∞) ∧ (ℕ0 ∩ {+∞}) = ∅) → ((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉}):(ℕ0 ∪ {+∞})⟶ℕ∞) | |
| 25 | 17, 23, 24 | mp2an 426 | . . 3 ⊢ ((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉}):(ℕ0 ∪ {+∞})⟶ℕ∞ |
| 26 | fxnn0nninf.i | . . . 4 ⊢ 𝐼 = ((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉}) | |
| 27 | 26 | feq1i 5475 | . . 3 ⊢ (𝐼:(ℕ0 ∪ {+∞})⟶ℕ∞ ↔ ((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉}):(ℕ0 ∪ {+∞})⟶ℕ∞) |
| 28 | 25, 27 | mpbir 146 | . 2 ⊢ 𝐼:(ℕ0 ∪ {+∞})⟶ℕ∞ |
| 29 | df-xnn0 9466 | . . 3 ⊢ ℕ0* = (ℕ0 ∪ {+∞}) | |
| 30 | 29 | feq2i 5476 | . 2 ⊢ (𝐼:ℕ0*⟶ℕ∞ ↔ 𝐼:(ℕ0 ∪ {+∞})⟶ℕ∞) |
| 31 | 28, 30 | mpbir 146 | 1 ⊢ 𝐼:ℕ0*⟶ℕ∞ |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 ∧ wa 104 = wceq 1397 ∈ wcel 2202 ∪ cun 3198 ∩ cin 3199 ⊆ wss 3200 ∅c0 3494 ifcif 3605 {csn 3669 〈cop 3672 ↦ cmpt 4150 ωcom 4688 × cxp 4723 ◡ccnv 4724 ∘ ccom 4729 ⟶wf 5322 –1-1-onto→wf1o 5325 (class class class)co 6018 freccfrec 6556 1oc1o 6575 ℕ∞xnninf 7318 0cc0 8032 1c1 8033 + caddc 8035 +∞cpnf 8211 ℕ0cn0 9402 ℕ0*cxnn0 9465 ℤcz 9479 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-recs 6471 df-frec 6557 df-1o 6582 df-2o 6583 df-map 6819 df-nninf 7319 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-inn 9144 df-n0 9403 df-xnn0 9466 df-z 9480 df-uz 9756 |
| This theorem is referenced by: nninfctlemfo 12616 |
| Copyright terms: Public domain | W3C validator |