| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 0tonninf | GIF version | ||
| Description: The mapping of zero into ℕ∞ is the sequence of all zeroes. (Contributed by Jim Kingdon, 17-Jul-2022.) |
| Ref | Expression |
|---|---|
| fxnn0nninf.g | ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) |
| fxnn0nninf.f | ⊢ 𝐹 = (𝑛 ∈ ω ↦ (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) |
| fxnn0nninf.i | ⊢ 𝐼 = ((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉}) |
| Ref | Expression |
|---|---|
| 0tonninf | ⊢ (𝐼‘0) = (𝑥 ∈ ω ↦ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fxnn0nninf.i | . . . . 5 ⊢ 𝐼 = ((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉}) | |
| 2 | 1 | fveq1i 5696 | . . . 4 ⊢ (𝐼‘0) = (((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉})‘0) |
| 3 | 0xnn0 9638 | . . . . 5 ⊢ 0 ∈ ℕ0* | |
| 4 | 0nn0 9580 | . . . . . . 7 ⊢ 0 ∈ ℕ0 | |
| 5 | nn0nepnf 9640 | . . . . . . 7 ⊢ (0 ∈ ℕ0 → 0 ≠ +∞) | |
| 6 | 4, 5 | ax-mp 5 | . . . . . 6 ⊢ 0 ≠ +∞ |
| 7 | 6 | necomi 2505 | . . . . 5 ⊢ +∞ ≠ 0 |
| 8 | fvunsng 5909 | . . . . 5 ⊢ ((0 ∈ ℕ0* ∧ +∞ ≠ 0) → (((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉})‘0) = ((𝐹 ∘ ◡𝐺)‘0)) | |
| 9 | 3, 7, 8 | mp2an 430 | . . . 4 ⊢ (((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉})‘0) = ((𝐹 ∘ ◡𝐺)‘0) |
| 10 | fxnn0nninf.g | . . . . . . . 8 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) | |
| 11 | 10 | frechashgf1o 10867 | . . . . . . 7 ⊢ 𝐺:ω–1-1-onto→ℕ0 |
| 12 | f1ocnv 5652 | . . . . . . 7 ⊢ (𝐺:ω–1-1-onto→ℕ0 → ◡𝐺:ℕ0–1-1-onto→ω) | |
| 13 | 11, 12 | ax-mp 5 | . . . . . 6 ⊢ ◡𝐺:ℕ0–1-1-onto→ω |
| 14 | f1of 5639 | . . . . . 6 ⊢ (◡𝐺:ℕ0–1-1-onto→ω → ◡𝐺:ℕ0⟶ω) | |
| 15 | 13, 14 | ax-mp 5 | . . . . 5 ⊢ ◡𝐺:ℕ0⟶ω |
| 16 | fvco3 5776 | . . . . 5 ⊢ ((◡𝐺:ℕ0⟶ω ∧ 0 ∈ ℕ0) → ((𝐹 ∘ ◡𝐺)‘0) = (𝐹‘(◡𝐺‘0))) | |
| 17 | 15, 4, 16 | mp2an 430 | . . . 4 ⊢ ((𝐹 ∘ ◡𝐺)‘0) = (𝐹‘(◡𝐺‘0)) |
| 18 | 2, 9, 17 | 3eqtri 2263 | . . 3 ⊢ (𝐼‘0) = (𝐹‘(◡𝐺‘0)) |
| 19 | 0zd 9658 | . . . . . . 7 ⊢ (⊤ → 0 ∈ ℤ) | |
| 20 | 19, 10 | frec2uz0d 10838 | . . . . . 6 ⊢ (⊤ → (𝐺‘∅) = 0) |
| 21 | 20 | mptru 1411 | . . . . 5 ⊢ (𝐺‘∅) = 0 |
| 22 | peano1 4741 | . . . . . 6 ⊢ ∅ ∈ ω | |
| 23 | f1ocnvfv 5985 | . . . . . 6 ⊢ ((𝐺:ω–1-1-onto→ℕ0 ∧ ∅ ∈ ω) → ((𝐺‘∅) = 0 → (◡𝐺‘0) = ∅)) | |
| 24 | 11, 22, 23 | mp2an 430 | . . . . 5 ⊢ ((𝐺‘∅) = 0 → (◡𝐺‘0) = ∅) |
| 25 | 21, 24 | ax-mp 5 | . . . 4 ⊢ (◡𝐺‘0) = ∅ |
| 26 | 25 | fveq2i 5698 | . . 3 ⊢ (𝐹‘(◡𝐺‘0)) = (𝐹‘∅) |
| 27 | eleq2 2302 | . . . . . . 7 ⊢ (𝑛 = ∅ → (𝑖 ∈ 𝑛 ↔ 𝑖 ∈ ∅)) | |
| 28 | 27 | ifbid 3662 | . . . . . 6 ⊢ (𝑛 = ∅ → if(𝑖 ∈ 𝑛, 1o, ∅) = if(𝑖 ∈ ∅, 1o, ∅)) |
| 29 | 28 | mpteq2dv 4222 | . . . . 5 ⊢ (𝑛 = ∅ → (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) = (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅))) |
| 30 | fxnn0nninf.f | . . . . 5 ⊢ 𝐹 = (𝑛 ∈ ω ↦ (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) | |
| 31 | omex 4740 | . . . . . 6 ⊢ ω ∈ V | |
| 32 | 31 | mptex 5943 | . . . . 5 ⊢ (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) ∈ V |
| 33 | 29, 30, 32 | fvmpt3i 5785 | . . . 4 ⊢ (∅ ∈ ω → (𝐹‘∅) = (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅))) |
| 34 | 22, 33 | ax-mp 5 | . . 3 ⊢ (𝐹‘∅) = (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅)) |
| 35 | 18, 26, 34 | 3eqtri 2263 | . 2 ⊢ (𝐼‘0) = (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅)) |
| 36 | noel 3525 | . . . 4 ⊢ ¬ 𝑖 ∈ ∅ | |
| 37 | 36 | iffalsei 3649 | . . 3 ⊢ if(𝑖 ∈ ∅, 1o, ∅) = ∅ |
| 38 | 37 | mpteq2i 4218 | . 2 ⊢ (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅)) = (𝑖 ∈ ω ↦ ∅) |
| 39 | eqidd 2239 | . . 3 ⊢ (𝑖 = 𝑥 → ∅ = ∅) | |
| 40 | 39 | cbvmptv 4227 | . 2 ⊢ (𝑖 ∈ ω ↦ ∅) = (𝑥 ∈ ω ↦ ∅) |
| 41 | 35, 38, 40 | 3eqtri 2263 | 1 ⊢ (𝐼‘0) = (𝑥 ∈ ω ↦ ∅) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ⊤wtru 1403 ∈ wcel 2209 ≠ wne 2420 ∪ cun 3218 ∅c0 3520 ifcif 3638 {csn 3709 〈cop 3712 ↦ cmpt 4192 ωcom 4737 × cxp 4772 ◡ccnv 4773 ∘ ccom 4778 ⟶wf 5373 –1-1-onto→wf1o 5376 ‘cfv 5377 (class class class)co 6085 freccfrec 6661 1oc1o 6680 0cc0 8179 1c1 8180 + caddc 8182 +∞cpnf 8357 ℕ0cn0 9565 ℕ0*cxnn0 9632 ℤcz 9646 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-ltadd 8295 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-recs 6576 df-frec 6662 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-inn 9306 df-n0 9566 df-xnn0 9633 df-z 9647 df-uz 9924 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |