Theorem ennnfonelemnn0 12413

Description: Lemma for ennnfone 12416. A version of ennnfonelemen 12412 expressed in terms of ℕ₀ instead of ω. (Contributed by Jim Kingdon, 27-Oct-2022.)

Hypotheses

Ref	Expression
ennnfonelemr.dceq	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
ennnfonelemr.f	⊢ (𝜑 → 𝐹:ℕ0–onto→𝐴)
ennnfonelemr.n	⊢ (𝜑 → ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗))
ennnfonelemnn0.n	⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)

Assertion

Ref	Expression
ennnfonelemnn0	⊢ (𝜑 → 𝐴 ≈ ℕ)

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐹,𝑦   𝑗,𝐹,𝑘,𝑛   𝑥,𝑁,𝑦   𝑗,𝑁,𝑘,𝑛   𝜑,𝑘   𝜑,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑗,𝑛)   𝐴(𝑗,𝑘,𝑛)

Proof of Theorem ennnfonelemnn0

Dummy variables 𝑎 𝑏 𝑐 𝑖 𝑟 𝑝 𝑞 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ennnfonelemr.dceq	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
2		ennnfonelemr.f	. . 3 ⊢ (𝜑 → 𝐹:ℕ0–onto→𝐴)
3		ennnfonelemnn0.n	. . . . . 6 ⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
4	3	frechashgf1o 10421	. . . . 5 ⊢ 𝑁:ω–1-1-onto→ℕ0
5		f1ofo 5465	. . . . 5 ⊢ (𝑁:ω–1-1-onto→ℕ0 → 𝑁:ω–onto→ℕ0)
6	4, 5	ax-mp 5	. . . 4 ⊢ 𝑁:ω–onto→ℕ0
7	6	a1i 9	. . 3 ⊢ (𝜑 → 𝑁:ω–onto→ℕ0)
8		foco 5445	. . 3 ⊢ ((𝐹:ℕ0–onto→𝐴 ∧ 𝑁:ω–onto→ℕ0) → (𝐹 ∘ 𝑁):ω–onto→𝐴)
9	2, 7, 8	syl2anc 411	. 2 ⊢ (𝜑 → (𝐹 ∘ 𝑁):ω–onto→𝐴)
10		oveq2 5878	. . . . . . 7 ⊢ (𝑛 = (𝑁‘𝑝) → (0...𝑛) = (0...(𝑁‘𝑝)))
11	10	raleqdv 2678	. . . . . 6 ⊢ (𝑛 = (𝑁‘𝑝) → (∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗)))
12	11	rexbidv 2478	. . . . 5 ⊢ (𝑛 = (𝑁‘𝑝) → (∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗)))
13		ennnfonelemr.n	. . . . . 6 ⊢ (𝜑 → ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗))
14	13	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ ω) → ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝐹‘𝑘) ≠ (𝐹‘𝑗))
15		f1of 5458	. . . . . . . 8 ⊢ (𝑁:ω–1-1-onto→ℕ0 → 𝑁:ω⟶ℕ0)
16	4, 15	ax-mp 5	. . . . . . 7 ⊢ 𝑁:ω⟶ℕ0
17	16	a1i 9	. . . . . 6 ⊢ ((𝜑 ∧ 𝑝 ∈ ω) → 𝑁:ω⟶ℕ0)
18		simpr 110	. . . . . 6 ⊢ ((𝜑 ∧ 𝑝 ∈ ω) → 𝑝 ∈ ω)
19	17, 18	ffvelcdmd 5649	. . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ ω) → (𝑁‘𝑝) ∈ ℕ0)
20	12, 14, 19	rspcdva 2846	. . . 4 ⊢ ((𝜑 ∧ 𝑝 ∈ ω) → ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))
21		f1ocnv 5471	. . . . . . . 8 ⊢ (𝑁:ω–1-1-onto→ℕ0 → ◡𝑁:ℕ0–1-1-onto→ω)
22		f1of 5458	. . . . . . . 8 ⊢ (◡𝑁:ℕ0–1-1-onto→ω → ◡𝑁:ℕ0⟶ω)
23	4, 21, 22	mp2b 8	. . . . . . 7 ⊢ ◡𝑁:ℕ0⟶ω
24	23	a1i 9	. . . . . 6 ⊢ (((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) → ◡𝑁:ℕ0⟶ω)
25		simprl 529	. . . . . 6 ⊢ (((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) → 𝑘 ∈ ℕ0)
26	24, 25	ffvelcdmd 5649	. . . . 5 ⊢ (((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) → (◡𝑁‘𝑘) ∈ ω)
27		fveq2 5512	. . . . . . . . 9 ⊢ (𝑗 = (𝑁‘𝑟) → (𝐹‘𝑗) = (𝐹‘(𝑁‘𝑟)))
28	27	neeq2d 2366	. . . . . . . 8 ⊢ (𝑗 = (𝑁‘𝑟) → ((𝐹‘𝑘) ≠ (𝐹‘𝑗) ↔ (𝐹‘𝑘) ≠ (𝐹‘(𝑁‘𝑟))))
29		simplrr 536	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))
30		simpr 110	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → 𝑟 ∈ suc 𝑝)
31	18	ad2antrr 488	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → 𝑝 ∈ ω)
32		peano2 4592	. . . . . . . . . . . 12 ⊢ (𝑝 ∈ ω → suc 𝑝 ∈ ω)
33	31, 32	syl 14	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → suc 𝑝 ∈ ω)
34		elnn 4603	. . . . . . . . . . 11 ⊢ ((𝑟 ∈ suc 𝑝 ∧ suc 𝑝 ∈ ω) → 𝑟 ∈ ω)
35	30, 33, 34	syl2anc 411	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → 𝑟 ∈ ω)
36	16	ffvelcdmi 5647	. . . . . . . . . 10 ⊢ (𝑟 ∈ ω → (𝑁‘𝑟) ∈ ℕ0)
37	35, 36	syl 14	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → (𝑁‘𝑟) ∈ ℕ0)
38		0zd 9259	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → 0 ∈ ℤ)
39	38, 3, 35, 33	frec2uzltd 10396	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → (𝑟 ∈ suc 𝑝 → (𝑁‘𝑟) < (𝑁‘suc 𝑝)))
40	30, 39	mpd 13	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → (𝑁‘𝑟) < (𝑁‘suc 𝑝))
41	38, 3, 31	frec2uzsucd 10394	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → (𝑁‘suc 𝑝) = ((𝑁‘𝑝) + 1))
42	40, 41	breqtrd 4027	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → (𝑁‘𝑟) < ((𝑁‘𝑝) + 1))
43	19	ad2antrr 488	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → (𝑁‘𝑝) ∈ ℕ0)
44		nn0leltp1 9310	. . . . . . . . . . 11 ⊢ (((𝑁‘𝑟) ∈ ℕ0 ∧ (𝑁‘𝑝) ∈ ℕ0) → ((𝑁‘𝑟) ≤ (𝑁‘𝑝) ↔ (𝑁‘𝑟) < ((𝑁‘𝑝) + 1)))
45	37, 43, 44	syl2anc 411	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → ((𝑁‘𝑟) ≤ (𝑁‘𝑝) ↔ (𝑁‘𝑟) < ((𝑁‘𝑝) + 1)))
46	42, 45	mpbird 167	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → (𝑁‘𝑟) ≤ (𝑁‘𝑝))
47		fznn0 10106	. . . . . . . . . 10 ⊢ ((𝑁‘𝑝) ∈ ℕ0 → ((𝑁‘𝑟) ∈ (0...(𝑁‘𝑝)) ↔ ((𝑁‘𝑟) ∈ ℕ0 ∧ (𝑁‘𝑟) ≤ (𝑁‘𝑝))))
48	43, 47	syl 14	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → ((𝑁‘𝑟) ∈ (0...(𝑁‘𝑝)) ↔ ((𝑁‘𝑟) ∈ ℕ0 ∧ (𝑁‘𝑟) ≤ (𝑁‘𝑝))))
49	37, 46, 48	mpbir2and 944	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → (𝑁‘𝑟) ∈ (0...(𝑁‘𝑝)))
50	28, 29, 49	rspcdva 2846	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → (𝐹‘𝑘) ≠ (𝐹‘(𝑁‘𝑟)))
51	26	adantr 276	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → (◡𝑁‘𝑘) ∈ ω)
52		fvco3 5584	. . . . . . . . 9 ⊢ ((𝑁:ω⟶ℕ0 ∧ (◡𝑁‘𝑘) ∈ ω) → ((𝐹 ∘ 𝑁)‘(◡𝑁‘𝑘)) = (𝐹‘(𝑁‘(◡𝑁‘𝑘))))
53	16, 51, 52	sylancr 414	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → ((𝐹 ∘ 𝑁)‘(◡𝑁‘𝑘)) = (𝐹‘(𝑁‘(◡𝑁‘𝑘))))
54	25	adantr 276	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → 𝑘 ∈ ℕ0)
55		f1ocnvfv2 5774	. . . . . . . . . 10 ⊢ ((𝑁:ω–1-1-onto→ℕ0 ∧ 𝑘 ∈ ℕ0) → (𝑁‘(◡𝑁‘𝑘)) = 𝑘)
56	4, 54, 55	sylancr 414	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → (𝑁‘(◡𝑁‘𝑘)) = 𝑘)
57	56	fveq2d 5516	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → (𝐹‘(𝑁‘(◡𝑁‘𝑘))) = (𝐹‘𝑘))
58	53, 57	eqtrd 2210	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → ((𝐹 ∘ 𝑁)‘(◡𝑁‘𝑘)) = (𝐹‘𝑘))
59		fvco3 5584	. . . . . . . 8 ⊢ ((𝑁:ω⟶ℕ0 ∧ 𝑟 ∈ ω) → ((𝐹 ∘ 𝑁)‘𝑟) = (𝐹‘(𝑁‘𝑟)))
60	16, 35, 59	sylancr 414	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → ((𝐹 ∘ 𝑁)‘𝑟) = (𝐹‘(𝑁‘𝑟)))
61	50, 58, 60	3netr4d 2380	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) ∧ 𝑟 ∈ suc 𝑝) → ((𝐹 ∘ 𝑁)‘(◡𝑁‘𝑘)) ≠ ((𝐹 ∘ 𝑁)‘𝑟))
62	61	ralrimiva 2550	. . . . 5 ⊢ (((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) → ∀𝑟 ∈ suc 𝑝((𝐹 ∘ 𝑁)‘(◡𝑁‘𝑘)) ≠ ((𝐹 ∘ 𝑁)‘𝑟))
63		fveq2 5512	. . . . . . . 8 ⊢ (𝑞 = (◡𝑁‘𝑘) → ((𝐹 ∘ 𝑁)‘𝑞) = ((𝐹 ∘ 𝑁)‘(◡𝑁‘𝑘)))
64	63	neeq1d 2365	. . . . . . 7 ⊢ (𝑞 = (◡𝑁‘𝑘) → (((𝐹 ∘ 𝑁)‘𝑞) ≠ ((𝐹 ∘ 𝑁)‘𝑟) ↔ ((𝐹 ∘ 𝑁)‘(◡𝑁‘𝑘)) ≠ ((𝐹 ∘ 𝑁)‘𝑟)))
65	64	ralbidv 2477	. . . . . 6 ⊢ (𝑞 = (◡𝑁‘𝑘) → (∀𝑟 ∈ suc 𝑝((𝐹 ∘ 𝑁)‘𝑞) ≠ ((𝐹 ∘ 𝑁)‘𝑟) ↔ ∀𝑟 ∈ suc 𝑝((𝐹 ∘ 𝑁)‘(◡𝑁‘𝑘)) ≠ ((𝐹 ∘ 𝑁)‘𝑟)))
66	65	rspcev 2841	. . . . 5 ⊢ (((◡𝑁‘𝑘) ∈ ω ∧ ∀𝑟 ∈ suc 𝑝((𝐹 ∘ 𝑁)‘(◡𝑁‘𝑘)) ≠ ((𝐹 ∘ 𝑁)‘𝑟)) → ∃𝑞 ∈ ω ∀𝑟 ∈ suc 𝑝((𝐹 ∘ 𝑁)‘𝑞) ≠ ((𝐹 ∘ 𝑁)‘𝑟))
67	26, 62, 66	syl2anc 411	. . . 4 ⊢ (((𝜑 ∧ 𝑝 ∈ ω) ∧ (𝑘 ∈ ℕ0 ∧ ∀𝑗 ∈ (0...(𝑁‘𝑝))(𝐹‘𝑘) ≠ (𝐹‘𝑗))) → ∃𝑞 ∈ ω ∀𝑟 ∈ suc 𝑝((𝐹 ∘ 𝑁)‘𝑞) ≠ ((𝐹 ∘ 𝑁)‘𝑟))
68	20, 67	rexlimddv 2599	. . 3 ⊢ ((𝜑 ∧ 𝑝 ∈ ω) → ∃𝑞 ∈ ω ∀𝑟 ∈ suc 𝑝((𝐹 ∘ 𝑁)‘𝑞) ≠ ((𝐹 ∘ 𝑁)‘𝑟))
69	68	ralrimiva 2550	. 2 ⊢ (𝜑 → ∀𝑝 ∈ ω ∃𝑞 ∈ ω ∀𝑟 ∈ suc 𝑝((𝐹 ∘ 𝑁)‘𝑞) ≠ ((𝐹 ∘ 𝑁)‘𝑟))
70		id 19	. . . 4 ⊢ (𝑎 = 𝑥 → 𝑎 = 𝑥)
71		dmeq 4824	. . . . . . 7 ⊢ (𝑎 = 𝑥 → dom 𝑎 = dom 𝑥)
72	71	opeq1d 3783	. . . . . 6 ⊢ (𝑎 = 𝑥 → ⟨dom 𝑎, ((𝐹 ∘ 𝑁)‘𝑏)⟩ = ⟨dom 𝑥, ((𝐹 ∘ 𝑁)‘𝑏)⟩)
73	72	sneqd 3605	. . . . 5 ⊢ (𝑎 = 𝑥 → {⟨dom 𝑎, ((𝐹 ∘ 𝑁)‘𝑏)⟩} = {⟨dom 𝑥, ((𝐹 ∘ 𝑁)‘𝑏)⟩})
74	70, 73	uneq12d 3290	. . . 4 ⊢ (𝑎 = 𝑥 → (𝑎 ∪ {⟨dom 𝑎, ((𝐹 ∘ 𝑁)‘𝑏)⟩}) = (𝑥 ∪ {⟨dom 𝑥, ((𝐹 ∘ 𝑁)‘𝑏)⟩}))
75	70, 74	ifeq12d 3553	. . 3 ⊢ (𝑎 = 𝑥 → if(((𝐹 ∘ 𝑁)‘𝑏) ∈ ((𝐹 ∘ 𝑁) “ 𝑏), 𝑎, (𝑎 ∪ {⟨dom 𝑎, ((𝐹 ∘ 𝑁)‘𝑏)⟩})) = if(((𝐹 ∘ 𝑁)‘𝑏) ∈ ((𝐹 ∘ 𝑁) “ 𝑏), 𝑥, (𝑥 ∪ {⟨dom 𝑥, ((𝐹 ∘ 𝑁)‘𝑏)⟩})))
76		fveq2 5512	. . . . 5 ⊢ (𝑏 = 𝑦 → ((𝐹 ∘ 𝑁)‘𝑏) = ((𝐹 ∘ 𝑁)‘𝑦))
77		imaeq2 4963	. . . . 5 ⊢ (𝑏 = 𝑦 → ((𝐹 ∘ 𝑁) “ 𝑏) = ((𝐹 ∘ 𝑁) “ 𝑦))
78	76, 77	eleq12d 2248	. . . 4 ⊢ (𝑏 = 𝑦 → (((𝐹 ∘ 𝑁)‘𝑏) ∈ ((𝐹 ∘ 𝑁) “ 𝑏) ↔ ((𝐹 ∘ 𝑁)‘𝑦) ∈ ((𝐹 ∘ 𝑁) “ 𝑦)))
79	76	opeq2d 3784	. . . . . 6 ⊢ (𝑏 = 𝑦 → ⟨dom 𝑥, ((𝐹 ∘ 𝑁)‘𝑏)⟩ = ⟨dom 𝑥, ((𝐹 ∘ 𝑁)‘𝑦)⟩)
80	79	sneqd 3605	. . . . 5 ⊢ (𝑏 = 𝑦 → {⟨dom 𝑥, ((𝐹 ∘ 𝑁)‘𝑏)⟩} = {⟨dom 𝑥, ((𝐹 ∘ 𝑁)‘𝑦)⟩})
81	80	uneq2d 3289	. . . 4 ⊢ (𝑏 = 𝑦 → (𝑥 ∪ {⟨dom 𝑥, ((𝐹 ∘ 𝑁)‘𝑏)⟩}) = (𝑥 ∪ {⟨dom 𝑥, ((𝐹 ∘ 𝑁)‘𝑦)⟩}))
82	78, 81	ifbieq2d 3558	. . 3 ⊢ (𝑏 = 𝑦 → if(((𝐹 ∘ 𝑁)‘𝑏) ∈ ((𝐹 ∘ 𝑁) “ 𝑏), 𝑥, (𝑥 ∪ {⟨dom 𝑥, ((𝐹 ∘ 𝑁)‘𝑏)⟩})) = if(((𝐹 ∘ 𝑁)‘𝑦) ∈ ((𝐹 ∘ 𝑁) “ 𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, ((𝐹 ∘ 𝑁)‘𝑦)⟩})))
83	75, 82	cbvmpov 5950	. 2 ⊢ (𝑎 ∈ (𝐴 ↑pm ω), 𝑏 ∈ ω ↦ if(((𝐹 ∘ 𝑁)‘𝑏) ∈ ((𝐹 ∘ 𝑁) “ 𝑏), 𝑎, (𝑎 ∪ {⟨dom 𝑎, ((𝐹 ∘ 𝑁)‘𝑏)⟩}))) = (𝑥 ∈ (𝐴 ↑pm ω), 𝑦 ∈ ω ↦ if(((𝐹 ∘ 𝑁)‘𝑦) ∈ ((𝐹 ∘ 𝑁) “ 𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, ((𝐹 ∘ 𝑁)‘𝑦)⟩})))
84		eqeq1 2184	. . . 4 ⊢ (𝑎 = 𝑥 → (𝑎 = 0 ↔ 𝑥 = 0))
85		fvoveq1 5893	. . . 4 ⊢ (𝑎 = 𝑥 → (◡𝑁‘(𝑎 − 1)) = (◡𝑁‘(𝑥 − 1)))
86	84, 85	ifbieq2d 3558	. . 3 ⊢ (𝑎 = 𝑥 → if(𝑎 = 0, ∅, (◡𝑁‘(𝑎 − 1))) = if(𝑥 = 0, ∅, (◡𝑁‘(𝑥 − 1))))
87	86	cbvmptv 4097	. 2 ⊢ (𝑎 ∈ ℕ0 ↦ if(𝑎 = 0, ∅, (◡𝑁‘(𝑎 − 1)))) = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 0, ∅, (◡𝑁‘(𝑥 − 1))))
88		eqid 2177	. 2 ⊢ seq0((𝑎 ∈ (𝐴 ↑pm ω), 𝑏 ∈ ω ↦ if(((𝐹 ∘ 𝑁)‘𝑏) ∈ ((𝐹 ∘ 𝑁) “ 𝑏), 𝑎, (𝑎 ∪ {⟨dom 𝑎, ((𝐹 ∘ 𝑁)‘𝑏)⟩}))), (𝑎 ∈ ℕ0 ↦ if(𝑎 = 0, ∅, (◡𝑁‘(𝑎 − 1))))) = seq0((𝑎 ∈ (𝐴 ↑pm ω), 𝑏 ∈ ω ↦ if(((𝐹 ∘ 𝑁)‘𝑏) ∈ ((𝐹 ∘ 𝑁) “ 𝑏), 𝑎, (𝑎 ∪ {⟨dom 𝑎, ((𝐹 ∘ 𝑁)‘𝑏)⟩}))), (𝑎 ∈ ℕ0 ↦ if(𝑎 = 0, ∅, (◡𝑁‘(𝑎 − 1)))))
89		fveq2 5512	. . 3 ⊢ (𝑖 = 𝑐 → (seq0((𝑎 ∈ (𝐴 ↑pm ω), 𝑏 ∈ ω ↦ if(((𝐹 ∘ 𝑁)‘𝑏) ∈ ((𝐹 ∘ 𝑁) “ 𝑏), 𝑎, (𝑎 ∪ {⟨dom 𝑎, ((𝐹 ∘ 𝑁)‘𝑏)⟩}))), (𝑎 ∈ ℕ0 ↦ if(𝑎 = 0, ∅, (◡𝑁‘(𝑎 − 1)))))‘𝑖) = (seq0((𝑎 ∈ (𝐴 ↑pm ω), 𝑏 ∈ ω ↦ if(((𝐹 ∘ 𝑁)‘𝑏) ∈ ((𝐹 ∘ 𝑁) “ 𝑏), 𝑎, (𝑎 ∪ {⟨dom 𝑎, ((𝐹 ∘ 𝑁)‘𝑏)⟩}))), (𝑎 ∈ ℕ0 ↦ if(𝑎 = 0, ∅, (◡𝑁‘(𝑎 − 1)))))‘𝑐))
90	89	cbviunv 3924	. 2 ⊢ ∪ 𝑖 ∈ ℕ0 (seq0((𝑎 ∈ (𝐴 ↑pm ω), 𝑏 ∈ ω ↦ if(((𝐹 ∘ 𝑁)‘𝑏) ∈ ((𝐹 ∘ 𝑁) “ 𝑏), 𝑎, (𝑎 ∪ {⟨dom 𝑎, ((𝐹 ∘ 𝑁)‘𝑏)⟩}))), (𝑎 ∈ ℕ0 ↦ if(𝑎 = 0, ∅, (◡𝑁‘(𝑎 − 1)))))‘𝑖) = ∪ 𝑐 ∈ ℕ0 (seq0((𝑎 ∈ (𝐴 ↑pm ω), 𝑏 ∈ ω ↦ if(((𝐹 ∘ 𝑁)‘𝑏) ∈ ((𝐹 ∘ 𝑁) “ 𝑏), 𝑎, (𝑎 ∪ {⟨dom 𝑎, ((𝐹 ∘ 𝑁)‘𝑏)⟩}))), (𝑎 ∈ ℕ0 ↦ if(𝑎 = 0, ∅, (◡𝑁‘(𝑎 − 1)))))‘𝑐)
91	1, 9, 69, 83, 3, 87, 88, 90	ennnfonelemen 12412	1 ⊢ (𝜑 → 𝐴 ≈ ℕ)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  DECID wdc 834   = wceq 1353   ∈ wcel 2148   ≠ wne 2347  ∀wral 2455  ∃wrex 2456   ∪ cun 3127  ∅c0 3422  ifcif 3534  {csn 3592  ⟨cop 3595  ∪ ciun 3885   class class class wbr 4001   ↦ cmpt 4062  suc csuc 4363  ωcom 4587  ^◡ccnv 4623  dom cdm 4624   “ cima 4627   ∘ ccom 4628  ⟶wf 5209  –onto→wfo 5211  –1-1-onto→wf1o 5212  ‘cfv 5213  (class class class)co 5870   ∈ cmpo 5872  freccfrec 6386   ↑_pm cpm 6644   ≈ cen 6733  0cc0 7806  1c1 7807   + caddc 7809   < clt 7986   ≤ cle 7987   − cmin 8122  ℕcn 8913  ℕ₀cn0 9170  ℤcz 9247  ...cfz 10002  seqcseq 10438

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4116  ax-sep 4119  ax-nul 4127  ax-pow 4172  ax-pr 4207  ax-un 4431  ax-setind 4534  ax-iinf 4585  ax-cnex 7897  ax-resscn 7898  ax-1cn 7899  ax-1re 7900  ax-icn 7901  ax-addcl 7902  ax-addrcl 7903  ax-mulcl 7904  ax-addcom 7906  ax-addass 7908  ax-distr 7910  ax-i2m1 7911  ax-0lt1 7912  ax-0id 7914  ax-rnegex 7915  ax-cnre 7917  ax-pre-ltirr 7918  ax-pre-ltwlin 7919  ax-pre-lttrn 7920  ax-pre-ltadd 7922

This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-if 3535  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3809  df-int 3844  df-iun 3887  df-br 4002  df-opab 4063  df-mpt 4064  df-tr 4100  df-id 4291  df-iord 4364  df-on 4366  df-ilim 4367  df-suc 4369  df-iom 4588  df-xp 4630  df-rel 4631  df-cnv 4632  df-co 4633  df-dm 4634  df-rn 4635  df-res 4636  df-ima 4637  df-iota 5175  df-fun 5215  df-fn 5216  df-f 5217  df-f1 5218  df-fo 5219  df-f1o 5220  df-fv 5221  df-riota 5826  df-ov 5873  df-oprab 5874  df-mpo 5875  df-1st 6136  df-2nd 6137  df-recs 6301  df-frec 6387  df-er 6530  df-pm 6646  df-en 6736  df-pnf 7988  df-mnf 7989  df-xr 7990  df-ltxr 7991  df-le 7992  df-sub 8124  df-neg 8125  df-inn 8914  df-n0 9171  df-z 9248  df-uz 9523  df-fz 10003  df-seqfrec 10439

This theorem is referenced by:  ennnfonelemr  12414