Theorem 1tonninf 10802

Description: The mapping of one into ℕ_∞ is a sequence which is a one followed by zeroes. (Contributed by Jim Kingdon, 17-Jul-2022.)

Hypotheses

Ref	Expression
fxnn0nninf.g	⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
fxnn0nninf.f	⊢ 𝐹 = (𝑛 ∈ ω ↦ (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)))
fxnn0nninf.i	⊢ 𝐼 = ((𝐹 ∘ ◡𝐺) ∪ {⟨+∞, (ω × {1o})⟩})

Assertion

Ref	Expression
1tonninf	⊢ (𝐼‘1) = (𝑥 ∈ ω ↦ if(𝑥 = ∅, 1o, ∅))

Distinct variable groups:   𝑖,𝑛   𝑥,𝑖

Allowed substitution hints:   𝐹(𝑥,𝑖,𝑛)   𝐺(𝑥,𝑖,𝑛)   𝐼(𝑥,𝑖,𝑛)

Proof of Theorem 1tonninf

Step	Hyp	Ref	Expression
1		fxnn0nninf.i	. . . . 5 ⊢ 𝐼 = ((𝐹 ∘ ◡𝐺) ∪ {⟨+∞, (ω × {1o})⟩})
2	1	fveq1i 5670	. . . 4 ⊢ (𝐼‘1) = (((𝐹 ∘ ◡𝐺) ∪ {⟨+∞, (ω × {1o})⟩})‘1)
3		1nn0 9511	. . . . . 6 ⊢ 1 ∈ ℕ0
4		nn0xnn0 9566	. . . . . 6 ⊢ (1 ∈ ℕ0 → 1 ∈ ℕ0*)
5	3, 4	ax-mp 5	. . . . 5 ⊢ 1 ∈ ℕ0*
6		nn0nepnf 9570	. . . . . . 7 ⊢ (1 ∈ ℕ0 → 1 ≠ +∞)
7	3, 6	ax-mp 5	. . . . . 6 ⊢ 1 ≠ +∞
8	7	necomi 2497	. . . . 5 ⊢ +∞ ≠ 1
9		fvunsng 5877	. . . . 5 ⊢ ((1 ∈ ℕ0* ∧ +∞ ≠ 1) → (((𝐹 ∘ ◡𝐺) ∪ {⟨+∞, (ω × {1o})⟩})‘1) = ((𝐹 ∘ ◡𝐺)‘1))
10	5, 8, 9	mp2an 426	. . . 4 ⊢ (((𝐹 ∘ ◡𝐺) ∪ {⟨+∞, (ω × {1o})⟩})‘1) = ((𝐹 ∘ ◡𝐺)‘1)
11		fxnn0nninf.g	. . . . . . . 8 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
12	11	frechashgf1o 10789	. . . . . . 7 ⊢ 𝐺:ω–1-1-onto→ℕ0
13		f1ocnv 5626	. . . . . . 7 ⊢ (𝐺:ω–1-1-onto→ℕ0 → ◡𝐺:ℕ0–1-1-onto→ω)
14	12, 13	ax-mp 5	. . . . . 6 ⊢ ◡𝐺:ℕ0–1-1-onto→ω
15		f1of 5613	. . . . . 6 ⊢ (◡𝐺:ℕ0–1-1-onto→ω → ◡𝐺:ℕ0⟶ω)
16	14, 15	ax-mp 5	. . . . 5 ⊢ ◡𝐺:ℕ0⟶ω
17		fvco3 5747	. . . . 5 ⊢ ((◡𝐺:ℕ0⟶ω ∧ 1 ∈ ℕ0) → ((𝐹 ∘ ◡𝐺)‘1) = (𝐹‘(◡𝐺‘1)))
18	16, 3, 17	mp2an 426	. . . 4 ⊢ ((𝐹 ∘ ◡𝐺)‘1) = (𝐹‘(◡𝐺‘1))
19	2, 10, 18	3eqtri 2257	. . 3 ⊢ (𝐼‘1) = (𝐹‘(◡𝐺‘1))
20		df-1o 6646	. . . . . . 7 ⊢ 1o = suc ∅
21	20	fveq2i 5672	. . . . . 6 ⊢ (𝐺‘1o) = (𝐺‘suc ∅)
22		0zd 9588	. . . . . . . . 9 ⊢ (⊤ → 0 ∈ ℤ)
23		peano1 4715	. . . . . . . . . 10 ⊢ ∅ ∈ ω
24	23	a1i 9	. . . . . . . . 9 ⊢ (⊤ → ∅ ∈ ω)
25	22, 11, 24	frec2uzsucd 10762	. . . . . . . 8 ⊢ (⊤ → (𝐺‘suc ∅) = ((𝐺‘∅) + 1))
26	25	mptru 1407	. . . . . . 7 ⊢ (𝐺‘suc ∅) = ((𝐺‘∅) + 1)
27	22, 11	frec2uz0d 10760	. . . . . . . . 9 ⊢ (⊤ → (𝐺‘∅) = 0)
28	27	mptru 1407	. . . . . . . 8 ⊢ (𝐺‘∅) = 0
29	28	oveq1i 6059	. . . . . . 7 ⊢ ((𝐺‘∅) + 1) = (0 + 1)
30	26, 29	eqtri 2253	. . . . . 6 ⊢ (𝐺‘suc ∅) = (0 + 1)
31		0p1e1 9350	. . . . . 6 ⊢ (0 + 1) = 1
32	21, 30, 31	3eqtri 2257	. . . . 5 ⊢ (𝐺‘1o) = 1
33		1onn 6752	. . . . . 6 ⊢ 1o ∈ ω
34		f1ocnvfv 5951	. . . . . 6 ⊢ ((𝐺:ω–1-1-onto→ℕ0 ∧ 1o ∈ ω) → ((𝐺‘1o) = 1 → (◡𝐺‘1) = 1o))
35	12, 33, 34	mp2an 426	. . . . 5 ⊢ ((𝐺‘1o) = 1 → (◡𝐺‘1) = 1o)
36	32, 35	ax-mp 5	. . . 4 ⊢ (◡𝐺‘1) = 1o
37	36	fveq2i 5672	. . 3 ⊢ (𝐹‘(◡𝐺‘1)) = (𝐹‘1o)
38		eleq2 2296	. . . . . . 7 ⊢ (𝑛 = 1o → (𝑖 ∈ 𝑛 ↔ 𝑖 ∈ 1o))
39	38	ifbid 3643	. . . . . 6 ⊢ (𝑛 = 1o → if(𝑖 ∈ 𝑛, 1o, ∅) = if(𝑖 ∈ 1o, 1o, ∅))
40	39	mpteq2dv 4200	. . . . 5 ⊢ (𝑛 = 1o → (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) = (𝑖 ∈ ω ↦ if(𝑖 ∈ 1o, 1o, ∅)))
41		fxnn0nninf.f	. . . . 5 ⊢ 𝐹 = (𝑛 ∈ ω ↦ (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)))
42		omex 4714	. . . . . 6 ⊢ ω ∈ V
43	42	mptex 5911	. . . . 5 ⊢ (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) ∈ V
44	40, 41, 43	fvmpt3i 5756	. . . 4 ⊢ (1o ∈ ω → (𝐹‘1o) = (𝑖 ∈ ω ↦ if(𝑖 ∈ 1o, 1o, ∅)))
45	33, 44	ax-mp 5	. . 3 ⊢ (𝐹‘1o) = (𝑖 ∈ ω ↦ if(𝑖 ∈ 1o, 1o, ∅))
46	19, 37, 45	3eqtri 2257	. 2 ⊢ (𝐼‘1) = (𝑖 ∈ ω ↦ if(𝑖 ∈ 1o, 1o, ∅))
47		el1o 6669	. . . 4 ⊢ (𝑖 ∈ 1o ↔ 𝑖 = ∅)
48		ifbi 3642	. . . 4 ⊢ ((𝑖 ∈ 1o ↔ 𝑖 = ∅) → if(𝑖 ∈ 1o, 1o, ∅) = if(𝑖 = ∅, 1o, ∅))
49	47, 48	ax-mp 5	. . 3 ⊢ if(𝑖 ∈ 1o, 1o, ∅) = if(𝑖 = ∅, 1o, ∅)
50	49	mpteq2i 4196	. 2 ⊢ (𝑖 ∈ ω ↦ if(𝑖 ∈ 1o, 1o, ∅)) = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, ∅))
51		eqeq1 2239	. . . 4 ⊢ (𝑖 = 𝑥 → (𝑖 = ∅ ↔ 𝑥 = ∅))
52	51	ifbid 3643	. . 3 ⊢ (𝑖 = 𝑥 → if(𝑖 = ∅, 1o, ∅) = if(𝑥 = ∅, 1o, ∅))
53	52	cbvmptv 4205	. 2 ⊢ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, ∅)) = (𝑥 ∈ ω ↦ if(𝑥 = ∅, 1o, ∅))
54	46, 50, 53	3eqtri 2257	1 ⊢ (𝐼‘1) = (𝑥 ∈ ω ↦ if(𝑥 = ∅, 1o, ∅))

Syntax hints:   → wi 4   ↔ wb 105   = wceq 1398  ⊤wtru 1399   ∈ wcel 2203   ≠ wne 2412   ∪ cun 3208  ∅c0 3507  ifcif 3619  {csn 3688  ⟨cop 3691   ↦ cmpt 4170  suc csuc 4485  ωcom 4711   × cxp 4746  ^◡ccnv 4747   ∘ ccom 4752  ⟶wf 5347  –1-1-onto→wf1o 5350  ‘cfv 5351  (class class class)co 6049  freccfrec 6620  1_oc1o 6639  0cc0 8126  1c1 8127   + caddc 8129  +∞cpnf 8304  ℕ₀cn0 9495  ℕ₀^*cxnn0 9562  ℤcz 9576

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709  ax-cnex 8217  ax-resscn 8218  ax-1cn 8219  ax-1re 8220  ax-icn 8221  ax-addcl 8222  ax-addrcl 8223  ax-mulcl 8224  ax-addcom 8226  ax-addass 8228  ax-distr 8230  ax-i2m1 8231  ax-0lt1 8232  ax-0id 8234  ax-rnegex 8235  ax-cnre 8237  ax-pre-ltirr 8238  ax-pre-ltwlin 8239  ax-pre-lttrn 8240  ax-pre-ltadd 8242

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-if 3620  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-id 4413  df-iord 4486  df-on 4488  df-ilim 4489  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-recs 6535  df-frec 6621  df-1o 6646  df-pnf 8309  df-mnf 8310  df-xr 8311  df-ltxr 8312  df-le 8313  df-sub 8445  df-neg 8446  df-inn 9237  df-n0 9496  df-xnn0 9563  df-z 9577  df-uz 9853

This theorem is referenced by: (None)