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 5422 | . . . 4 ⊢ (𝐼‘0) = (((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉})‘0) |
3 | 0xnn0 9046 | . . . . 5 ⊢ 0 ∈ ℕ0* | |
4 | 0nn0 8992 | . . . . . . 7 ⊢ 0 ∈ ℕ0 | |
5 | nn0nepnf 9048 | . . . . . . 7 ⊢ (0 ∈ ℕ0 → 0 ≠ +∞) | |
6 | 4, 5 | ax-mp 5 | . . . . . 6 ⊢ 0 ≠ +∞ |
7 | 6 | necomi 2393 | . . . . 5 ⊢ +∞ ≠ 0 |
8 | fvunsng 5614 | . . . . 5 ⊢ ((0 ∈ ℕ0* ∧ +∞ ≠ 0) → (((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉})‘0) = ((𝐹 ∘ ◡𝐺)‘0)) | |
9 | 3, 7, 8 | mp2an 422 | . . . 4 ⊢ (((𝐹 ∘ ◡𝐺) ∪ {〈+∞, (ω × {1o})〉})‘0) = ((𝐹 ∘ ◡𝐺)‘0) |
10 | fxnn0nninf.g | . . . . . . . 8 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) | |
11 | 10 | frechashgf1o 10201 | . . . . . . 7 ⊢ 𝐺:ω–1-1-onto→ℕ0 |
12 | f1ocnv 5380 | . . . . . . 7 ⊢ (𝐺:ω–1-1-onto→ℕ0 → ◡𝐺:ℕ0–1-1-onto→ω) | |
13 | 11, 12 | ax-mp 5 | . . . . . 6 ⊢ ◡𝐺:ℕ0–1-1-onto→ω |
14 | f1of 5367 | . . . . . 6 ⊢ (◡𝐺:ℕ0–1-1-onto→ω → ◡𝐺:ℕ0⟶ω) | |
15 | 13, 14 | ax-mp 5 | . . . . 5 ⊢ ◡𝐺:ℕ0⟶ω |
16 | fvco3 5492 | . . . . 5 ⊢ ((◡𝐺:ℕ0⟶ω ∧ 0 ∈ ℕ0) → ((𝐹 ∘ ◡𝐺)‘0) = (𝐹‘(◡𝐺‘0))) | |
17 | 15, 4, 16 | mp2an 422 | . . . 4 ⊢ ((𝐹 ∘ ◡𝐺)‘0) = (𝐹‘(◡𝐺‘0)) |
18 | 2, 9, 17 | 3eqtri 2164 | . . 3 ⊢ (𝐼‘0) = (𝐹‘(◡𝐺‘0)) |
19 | 0zd 9066 | . . . . . . 7 ⊢ (⊤ → 0 ∈ ℤ) | |
20 | 19, 10 | frec2uz0d 10172 | . . . . . 6 ⊢ (⊤ → (𝐺‘∅) = 0) |
21 | 20 | mptru 1340 | . . . . 5 ⊢ (𝐺‘∅) = 0 |
22 | peano1 4508 | . . . . . 6 ⊢ ∅ ∈ ω | |
23 | f1ocnvfv 5680 | . . . . . 6 ⊢ ((𝐺:ω–1-1-onto→ℕ0 ∧ ∅ ∈ ω) → ((𝐺‘∅) = 0 → (◡𝐺‘0) = ∅)) | |
24 | 11, 22, 23 | mp2an 422 | . . . . 5 ⊢ ((𝐺‘∅) = 0 → (◡𝐺‘0) = ∅) |
25 | 21, 24 | ax-mp 5 | . . . 4 ⊢ (◡𝐺‘0) = ∅ |
26 | 25 | fveq2i 5424 | . . 3 ⊢ (𝐹‘(◡𝐺‘0)) = (𝐹‘∅) |
27 | eleq2 2203 | . . . . . . 7 ⊢ (𝑛 = ∅ → (𝑖 ∈ 𝑛 ↔ 𝑖 ∈ ∅)) | |
28 | 27 | ifbid 3493 | . . . . . 6 ⊢ (𝑛 = ∅ → if(𝑖 ∈ 𝑛, 1o, ∅) = if(𝑖 ∈ ∅, 1o, ∅)) |
29 | 28 | mpteq2dv 4019 | . . . . 5 ⊢ (𝑛 = ∅ → (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) = (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅))) |
30 | fxnn0nninf.f | . . . . 5 ⊢ 𝐹 = (𝑛 ∈ ω ↦ (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) | |
31 | omex 4507 | . . . . . 6 ⊢ ω ∈ V | |
32 | 31 | mptex 5646 | . . . . 5 ⊢ (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) ∈ V |
33 | 29, 30, 32 | fvmpt3i 5501 | . . . 4 ⊢ (∅ ∈ ω → (𝐹‘∅) = (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅))) |
34 | 22, 33 | ax-mp 5 | . . 3 ⊢ (𝐹‘∅) = (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅)) |
35 | 18, 26, 34 | 3eqtri 2164 | . 2 ⊢ (𝐼‘0) = (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅)) |
36 | noel 3367 | . . . 4 ⊢ ¬ 𝑖 ∈ ∅ | |
37 | 36 | iffalsei 3483 | . . 3 ⊢ if(𝑖 ∈ ∅, 1o, ∅) = ∅ |
38 | 37 | mpteq2i 4015 | . 2 ⊢ (𝑖 ∈ ω ↦ if(𝑖 ∈ ∅, 1o, ∅)) = (𝑖 ∈ ω ↦ ∅) |
39 | eqidd 2140 | . . 3 ⊢ (𝑖 = 𝑥 → ∅ = ∅) | |
40 | 39 | cbvmptv 4024 | . 2 ⊢ (𝑖 ∈ ω ↦ ∅) = (𝑥 ∈ ω ↦ ∅) |
41 | 35, 38, 40 | 3eqtri 2164 | 1 ⊢ (𝐼‘0) = (𝑥 ∈ ω ↦ ∅) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1331 ⊤wtru 1332 ∈ wcel 1480 ≠ wne 2308 ∪ cun 3069 ∅c0 3363 ifcif 3474 {csn 3527 〈cop 3530 ↦ cmpt 3989 ωcom 4504 × cxp 4537 ◡ccnv 4538 ∘ ccom 4543 ⟶wf 5119 –1-1-onto→wf1o 5122 ‘cfv 5123 (class class class)co 5774 freccfrec 6287 1oc1o 6306 0cc0 7620 1c1 7621 + caddc 7623 +∞cpnf 7797 ℕ0cn0 8977 ℕ0*cxnn0 9040 ℤcz 9054 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-coll 4043 ax-sep 4046 ax-nul 4054 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-iinf 4502 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-addcom 7720 ax-addass 7722 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-0id 7728 ax-rnegex 7729 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-ltadd 7736 |
This theorem depends on definitions: df-bi 116 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-nul 3364 df-if 3475 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-tr 4027 df-id 4215 df-iord 4288 df-on 4290 df-ilim 4291 df-suc 4293 df-iom 4505 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-recs 6202 df-frec 6288 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-inn 8721 df-n0 8978 df-xnn0 9041 df-z 9055 df-uz 9327 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |