| 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 5630 | . . . 4 ⊢ (𝐼‘0) = (((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉})‘0) |
| 3 | 0xnn0 9446 | . . . . 5 ⊢ 0 ∈ ℕ0* | |
| 4 | 0nn0 9392 | . . . . . . 7 ⊢ 0 ∈ ℕ0 | |
| 5 | nn0nepnf 9448 | . . . . . . 7 ⊢ (0 ∈ ℕ0 → 0 ≠ +∞) | |
| 6 | 4, 5 | ax-mp 5 | . . . . . 6 ⊢ 0 ≠ +∞ |
| 7 | 6 | necomi 2485 | . . . . 5 ⊢ +∞ ≠ 0 |
| 8 | fvunsng 5837 | . . . . 5 ⊢ ((0 ∈ ℕ0* ∧ +∞ ≠ 0) → (((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉})‘0) = ((𝐹 ∘ ◡𝐺)‘0)) | |
| 9 | 3, 7, 8 | mp2an 426 | . . . 4 ⊢ (((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉})‘0) = ((𝐹 ∘ ◡𝐺)‘0) |
| 10 | fxnn0nninf.g | . . . . . . . 8 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) | |
| 11 | 10 | frechashgf1o 10658 | . . . . . . 7 ⊢ 𝐺:ω–1-1-onto→ℕ0 |
| 12 | f1ocnv 5587 | . . . . . . 7 ⊢ (𝐺:ω–1-1-onto→ℕ0 → ◡𝐺:ℕ0–1-1-onto→ω) | |
| 13 | 11, 12 | ax-mp 5 | . . . . . 6 ⊢ ◡𝐺:ℕ0–1-1-onto→ω |
| 14 | f1of 5574 | . . . . . 6 ⊢ (◡𝐺:ℕ0–1-1-onto→ω → ◡𝐺:ℕ0⟶ω) | |
| 15 | 13, 14 | ax-mp 5 | . . . . 5 ⊢ ◡𝐺:ℕ0⟶ω |
| 16 | fvco3 5707 | . . . . 5 ⊢ ((◡𝐺:ℕ0⟶ω ∧ 0 ∈ ℕ0) → ((𝐹 ∘ ◡𝐺)‘0) = (𝐹‘(◡𝐺‘0))) | |
| 17 | 15, 4, 16 | mp2an 426 | . . . 4 ⊢ ((𝐹 ∘ ◡𝐺)‘0) = (𝐹‘(◡𝐺‘0)) |
| 18 | 2, 9, 17 | 3eqtri 2254 | . . 3 ⊢ (𝐼‘0) = (𝐹‘(◡𝐺‘0)) |
| 19 | 0zd 9466 | . . . . . . 7 ⊢ (⊤ → 0 ∈ ℤ) | |
| 20 | 19, 10 | frec2uz0d 10629 | . . . . . 6 ⊢ (⊤ → (𝐺‘∅) = 0) |
| 21 | 20 | mptru 1404 | . . . . 5 ⊢ (𝐺‘∅) = 0 |
| 22 | peano1 4686 | . . . . . 6 ⊢ ∅ ∈ ω | |
| 23 | f1ocnvfv 5909 | . . . . . 6 ⊢ ((𝐺:ω–1-1-onto→ℕ0 ∧ ∅ ∈ ω) → ((𝐺‘∅) = 0 → (◡𝐺‘0) = ∅)) | |
| 24 | 11, 22, 23 | mp2an 426 | . . . . 5 ⊢ ((𝐺‘∅) = 0 → (◡𝐺‘0) = ∅) |
| 25 | 21, 24 | ax-mp 5 | . . . 4 ⊢ (◡𝐺‘0) = ∅ |
| 26 | 25 | fveq2i 5632 | . . 3 ⊢ (𝐹‘(◡𝐺‘0)) = (𝐹‘∅) |
| 27 | eleq2 2293 | . . . . . . 7 ⊢ (𝑛 = ∅ → (𝑖 ∈ 𝑛 ↔ 𝑖 ∈ ∅)) | |
| 28 | 27 | ifbid 3624 | . . . . . 6 ⊢ (𝑛 = ∅ → if(𝑖 ∈ 𝑛, 1o, ∅) = if(𝑖 ∈ ∅, 1o, ∅)) |
| 29 | 28 | mpteq2dv 4175 | . . . . 5 ⊢ (𝑛 = ∅ → (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) = (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅))) |
| 30 | fxnn0nninf.f | . . . . 5 ⊢ 𝐹 = (𝑛 ∈ ω ↦ (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) | |
| 31 | omex 4685 | . . . . . 6 ⊢ ω ∈ V | |
| 32 | 31 | mptex 5869 | . . . . 5 ⊢ (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) ∈ V |
| 33 | 29, 30, 32 | fvmpt3i 5716 | . . . 4 ⊢ (∅ ∈ ω → (𝐹‘∅) = (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅))) |
| 34 | 22, 33 | ax-mp 5 | . . 3 ⊢ (𝐹‘∅) = (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅)) |
| 35 | 18, 26, 34 | 3eqtri 2254 | . 2 ⊢ (𝐼‘0) = (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅)) |
| 36 | noel 3495 | . . . 4 ⊢ ¬ 𝑖 ∈ ∅ | |
| 37 | 36 | iffalsei 3611 | . . 3 ⊢ if(𝑖 ∈ ∅, 1o, ∅) = ∅ |
| 38 | 37 | mpteq2i 4171 | . 2 ⊢ (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅)) = (𝑖 ∈ ω ↦ ∅) |
| 39 | eqidd 2230 | . . 3 ⊢ (𝑖 = 𝑥 → ∅ = ∅) | |
| 40 | 39 | cbvmptv 4180 | . 2 ⊢ (𝑖 ∈ ω ↦ ∅) = (𝑥 ∈ ω ↦ ∅) |
| 41 | 35, 38, 40 | 3eqtri 2254 | 1 ⊢ (𝐼‘0) = (𝑥 ∈ ω ↦ ∅) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ⊤wtru 1396 ∈ wcel 2200 ≠ wne 2400 ∪ cun 3195 ∅c0 3491 ifcif 3602 {csn 3666 〈cop 3669 ↦ cmpt 4145 ωcom 4682 × cxp 4717 ◡ccnv 4718 ∘ ccom 4723 ⟶wf 5314 –1-1-onto→wf1o 5317 ‘cfv 5318 (class class class)co 6007 freccfrec 6542 1oc1o 6561 0cc0 8007 1c1 8008 + caddc 8010 +∞cpnf 8186 ℕ0cn0 9377 ℕ0*cxnn0 9440 ℤcz 9454 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 ax-cnex 8098 ax-resscn 8099 ax-1cn 8100 ax-1re 8101 ax-icn 8102 ax-addcl 8103 ax-addrcl 8104 ax-mulcl 8105 ax-addcom 8107 ax-addass 8109 ax-distr 8111 ax-i2m1 8112 ax-0lt1 8113 ax-0id 8115 ax-rnegex 8116 ax-cnre 8118 ax-pre-ltirr 8119 ax-pre-ltwlin 8120 ax-pre-lttrn 8121 ax-pre-ltadd 8123 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-iord 4457 df-on 4459 df-ilim 4460 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-recs 6457 df-frec 6543 df-pnf 8191 df-mnf 8192 df-xr 8193 df-ltxr 8194 df-le 8195 df-sub 8327 df-neg 8328 df-inn 9119 df-n0 9378 df-xnn0 9441 df-z 9455 df-uz 9731 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |