Theorem peano3nninf 16284

Description: The successor function on ℕ_∞ is never zero. Half of Lemma 3.4 of [PradicBrown2022], p. 5. (Contributed by Jim Kingdon, 1-Aug-2022.)

Hypothesis

Ref	Expression
peano3nninf.s	⊢ 𝑆 = (𝑝 ∈ ℕ∞ ↦ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))))

Assertion

Ref	Expression
peano3nninf	⊢ (𝐴 ∈ ℕ∞ → (𝑆‘𝐴) ≠ (𝑥 ∈ ω ↦ ∅))

Distinct variable groups:   𝐴,𝑖,𝑝   𝑆,𝑖,𝑥   𝑥,𝑝

Allowed substitution hints:   𝐴(𝑥)   𝑆(𝑝)

Proof of Theorem peano3nninf

Step	Hyp	Ref	Expression
1		fveq1 5602	. . . . . . . . . 10 ⊢ (𝑝 = 𝐴 → (𝑝‘∪ 𝑖) = (𝐴‘∪ 𝑖))
2	1	ifeq2d 3601	. . . . . . . . 9 ⊢ (𝑝 = 𝐴 → if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖)) = if(𝑖 = ∅, 1o, (𝐴‘∪ 𝑖)))
3	2	mpteq2dv 4154	. . . . . . . 8 ⊢ (𝑝 = 𝐴 → (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))) = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝐴‘∪ 𝑖))))
4		peano3nninf.s	. . . . . . . 8 ⊢ 𝑆 = (𝑝 ∈ ℕ∞ ↦ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝑝‘∪ 𝑖))))
5		omex 4662	. . . . . . . . 9 ⊢ ω ∈ V
6	5	mptex 5838	. . . . . . . 8 ⊢ (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝐴‘∪ 𝑖))) ∈ V
7	3, 4, 6	fvmpt 5684	. . . . . . 7 ⊢ (𝐴 ∈ ℕ∞ → (𝑆‘𝐴) = (𝑖 ∈ ω ↦ if(𝑖 = ∅, 1o, (𝐴‘∪ 𝑖))))
8		eqeq1 2216	. . . . . . . . 9 ⊢ (𝑖 = ∅ → (𝑖 = ∅ ↔ ∅ = ∅))
9		unieq 3876	. . . . . . . . . 10 ⊢ (𝑖 = ∅ → ∪ 𝑖 = ∪ ∅)
10	9	fveq2d 5607	. . . . . . . . 9 ⊢ (𝑖 = ∅ → (𝐴‘∪ 𝑖) = (𝐴‘∪ ∅))
11	8, 10	ifbieq2d 3607	. . . . . . . 8 ⊢ (𝑖 = ∅ → if(𝑖 = ∅, 1o, (𝐴‘∪ 𝑖)) = if(∅ = ∅, 1o, (𝐴‘∪ ∅)))
12	11	adantl 277	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ∞ ∧ 𝑖 = ∅) → if(𝑖 = ∅, 1o, (𝐴‘∪ 𝑖)) = if(∅ = ∅, 1o, (𝐴‘∪ ∅)))
13		peano1 4663	. . . . . . . 8 ⊢ ∅ ∈ ω
14	13	a1i 9	. . . . . . 7 ⊢ (𝐴 ∈ ℕ∞ → ∅ ∈ ω)
15		eqid 2209	. . . . . . . . . 10 ⊢ ∅ = ∅
16	15	iftruei 3588	. . . . . . . . 9 ⊢ if(∅ = ∅, 1o, (𝐴‘∪ ∅)) = 1o
17		1onn 6636	. . . . . . . . 9 ⊢ 1o ∈ ω
18	16, 17	eqeltri 2282	. . . . . . . 8 ⊢ if(∅ = ∅, 1o, (𝐴‘∪ ∅)) ∈ ω
19	18	a1i 9	. . . . . . 7 ⊢ (𝐴 ∈ ℕ∞ → if(∅ = ∅, 1o, (𝐴‘∪ ∅)) ∈ ω)
20	7, 12, 14, 19	fvmptd 5688	. . . . . 6 ⊢ (𝐴 ∈ ℕ∞ → ((𝑆‘𝐴)‘∅) = if(∅ = ∅, 1o, (𝐴‘∪ ∅)))
21	20, 16	eqtrdi 2258	. . . . 5 ⊢ (𝐴 ∈ ℕ∞ → ((𝑆‘𝐴)‘∅) = 1o)
22	21	adantr 276	. . . 4 ⊢ ((𝐴 ∈ ℕ∞ ∧ (𝑆‘𝐴) = (𝑥 ∈ ω ↦ ∅)) → ((𝑆‘𝐴)‘∅) = 1o)
23		fveq1 5602	. . . . . 6 ⊢ ((𝑆‘𝐴) = (𝑥 ∈ ω ↦ ∅) → ((𝑆‘𝐴)‘∅) = ((𝑥 ∈ ω ↦ ∅)‘∅))
24	23	adantl 277	. . . . 5 ⊢ ((𝐴 ∈ ℕ∞ ∧ (𝑆‘𝐴) = (𝑥 ∈ ω ↦ ∅)) → ((𝑆‘𝐴)‘∅) = ((𝑥 ∈ ω ↦ ∅)‘∅))
25	15	a1i 9	. . . . . . 7 ⊢ (𝑥 = ∅ → ∅ = ∅)
26		eqid 2209	. . . . . . 7 ⊢ (𝑥 ∈ ω ↦ ∅) = (𝑥 ∈ ω ↦ ∅)
27	25, 26	fvmptg 5683	. . . . . 6 ⊢ ((∅ ∈ ω ∧ ∅ ∈ ω) → ((𝑥 ∈ ω ↦ ∅)‘∅) = ∅)
28	13, 13, 27	mp2an 426	. . . . 5 ⊢ ((𝑥 ∈ ω ↦ ∅)‘∅) = ∅
29	24, 28	eqtrdi 2258	. . . 4 ⊢ ((𝐴 ∈ ℕ∞ ∧ (𝑆‘𝐴) = (𝑥 ∈ ω ↦ ∅)) → ((𝑆‘𝐴)‘∅) = ∅)
30	22, 29	eqtr3d 2244	. . 3 ⊢ ((𝐴 ∈ ℕ∞ ∧ (𝑆‘𝐴) = (𝑥 ∈ ω ↦ ∅)) → 1o = ∅)
31		1n0 6548	. . . . 5 ⊢ 1o ≠ ∅
32	31	neii 2382	. . . 4 ⊢ ¬ 1o = ∅
33	32	a1i 9	. . 3 ⊢ ((𝐴 ∈ ℕ∞ ∧ (𝑆‘𝐴) = (𝑥 ∈ ω ↦ ∅)) → ¬ 1o = ∅)
34	30, 33	pm2.65da 665	. 2 ⊢ (𝐴 ∈ ℕ∞ → ¬ (𝑆‘𝐴) = (𝑥 ∈ ω ↦ ∅))
35	34	neqned 2387	1 ⊢ (𝐴 ∈ ℕ∞ → (𝑆‘𝐴) ≠ (𝑥 ∈ ω ↦ ∅))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   = wceq 1375   ∈ wcel 2180   ≠ wne 2380  ∅c0 3471  ifcif 3582  ∪ cuni 3867   ↦ cmpt 4124  ωcom 4659  ‘cfv 5294  1_oc1o 6525  ℕ_∞xnninf 7254

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 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-13 2182  ax-14 2183  ax-ext 2191  ax-coll 4178  ax-sep 4181  ax-nul 4189  ax-pow 4237  ax-pr 4272  ax-un 4501  ax-iinf 4657

This theorem depends on definitions:  df-bi 117  df-3an 985  df-tru 1378  df-nf 1487  df-sb 1789  df-eu 2060  df-mo 2061  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ne 2381  df-ral 2493  df-rex 2494  df-reu 2495  df-rab 2497  df-v 2781  df-sbc 3009  df-csb 3105  df-dif 3179  df-un 3181  df-in 3183  df-ss 3190  df-nul 3472  df-if 3583  df-pw 3631  df-sn 3652  df-pr 3653  df-op 3655  df-uni 3868  df-int 3903  df-iun 3946  df-br 4063  df-opab 4125  df-mpt 4126  df-id 4361  df-suc 4439  df-iom 4660  df-xp 4702  df-rel 4703  df-cnv 4704  df-co 4705  df-dm 4706  df-rn 4707  df-res 4708  df-ima 4709  df-iota 5254  df-fun 5296  df-fn 5297  df-f 5298  df-f1 5299  df-fo 5300  df-f1o 5301  df-fv 5302  df-1o 6532

This theorem is referenced by:  exmidsbthrlem  16301