Theorem ctinfomlemom 13047

Description: Lemma for ctinfom 13048. Converting between ω and ℕ₀. (Contributed by Jim Kingdon, 10-Aug-2023.)

Hypotheses

Ref	Expression
ctinfom.n	⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
ctinfom.g	⊢ 𝐺 = (𝐹 ∘ ◡𝑁)
ctinfom.f	⊢ (𝜑 → 𝐹:ω–onto→𝐴)
ctinfom.inf	⊢ (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑛))

Assertion

Ref	Expression
ctinfomlemom	⊢ (𝜑 → (𝐺:ℕ0–onto→𝐴 ∧ ∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝐺‘𝑗) ≠ (𝐺‘𝑖)))

Distinct variable groups:   𝑖,𝐹,𝑥   𝑛,𝐹   𝑗,𝐺,𝑘   𝑖,𝑁,𝑗,𝑘   𝑛,𝑁,𝑘   𝑥,𝑁,𝑘   𝑖,𝑚,𝑗,𝑘   𝜑,𝑖,𝑘,𝑚,𝑥   𝑚,𝑛

Allowed substitution hints:   𝜑(𝑗,𝑛)   𝐴(𝑥,𝑖,𝑗,𝑘,𝑚,𝑛)   𝐹(𝑗,𝑘,𝑚)   𝐺(𝑥,𝑖,𝑚,𝑛)   𝑁(𝑚)

Proof of Theorem ctinfomlemom

Step	Hyp	Ref	Expression
1		ctinfom.f	. . . 4 ⊢ (𝜑 → 𝐹:ω–onto→𝐴)
2		ctinfom.n	. . . . . . 7 ⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
3	2	frechashgf1o 10689	. . . . . 6 ⊢ 𝑁:ω–1-1-onto→ℕ0
4		f1ocnv 5596	. . . . . 6 ⊢ (𝑁:ω–1-1-onto→ℕ0 → ◡𝑁:ℕ0–1-1-onto→ω)
5	3, 4	ax-mp 5	. . . . 5 ⊢ ◡𝑁:ℕ0–1-1-onto→ω
6		f1ofo 5590	. . . . 5 ⊢ (◡𝑁:ℕ0–1-1-onto→ω → ◡𝑁:ℕ0–onto→ω)
7	5, 6	ax-mp 5	. . . 4 ⊢ ◡𝑁:ℕ0–onto→ω
8		foco 5570	. . . 4 ⊢ ((𝐹:ω–onto→𝐴 ∧ ◡𝑁:ℕ0–onto→ω) → (𝐹 ∘ ◡𝑁):ℕ0–onto→𝐴)
9	1, 7, 8	sylancl 413	. . 3 ⊢ (𝜑 → (𝐹 ∘ ◡𝑁):ℕ0–onto→𝐴)
10		ctinfom.g	. . . 4 ⊢ 𝐺 = (𝐹 ∘ ◡𝑁)
11		foeq1 5555	. . . 4 ⊢ (𝐺 = (𝐹 ∘ ◡𝑁) → (𝐺:ℕ0–onto→𝐴 ↔ (𝐹 ∘ ◡𝑁):ℕ0–onto→𝐴))
12	10, 11	ax-mp 5	. . 3 ⊢ (𝐺:ℕ0–onto→𝐴 ↔ (𝐹 ∘ ◡𝑁):ℕ0–onto→𝐴)
13	9, 12	sylibr 134	. 2 ⊢ (𝜑 → 𝐺:ℕ0–onto→𝐴)
14		imaeq2 5072	. . . . . . . 8 ⊢ (𝑛 = suc (◡𝑁‘𝑚) → (𝐹 “ 𝑛) = (𝐹 “ suc (◡𝑁‘𝑚)))
15	14	eleq2d 2301	. . . . . . 7 ⊢ (𝑛 = suc (◡𝑁‘𝑚) → ((𝐹‘𝑘) ∈ (𝐹 “ 𝑛) ↔ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚))))
16	15	notbid 673	. . . . . 6 ⊢ (𝑛 = suc (◡𝑁‘𝑚) → (¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑛) ↔ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚))))
17	16	rexbidv 2533	. . . . 5 ⊢ (𝑛 = suc (◡𝑁‘𝑚) → (∃𝑘 ∈ ω ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑛) ↔ ∃𝑘 ∈ ω ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚))))
18		ctinfom.inf	. . . . . 6 ⊢ (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑛))
19	18	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑛))
20		f1of 5583	. . . . . . . . 9 ⊢ (◡𝑁:ℕ0–1-1-onto→ω → ◡𝑁:ℕ0⟶ω)
21	5, 20	ax-mp 5	. . . . . . . 8 ⊢ ◡𝑁:ℕ0⟶ω
22	21	a1i 9	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → ◡𝑁:ℕ0⟶ω)
23		simpr 110	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → 𝑚 ∈ ℕ0)
24	22, 23	ffvelcdmd 5783	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → (◡𝑁‘𝑚) ∈ ω)
25		peano2 4693	. . . . . 6 ⊢ ((◡𝑁‘𝑚) ∈ ω → suc (◡𝑁‘𝑚) ∈ ω)
26	24, 25	syl 14	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → suc (◡𝑁‘𝑚) ∈ ω)
27	17, 19, 26	rspcdva 2915	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → ∃𝑘 ∈ ω ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))
28		f1of 5583	. . . . . . . 8 ⊢ (𝑁:ω–1-1-onto→ℕ0 → 𝑁:ω⟶ℕ0)
29	3, 28	ax-mp 5	. . . . . . 7 ⊢ 𝑁:ω⟶ℕ0
30	29	a1i 9	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) → 𝑁:ω⟶ℕ0)
31		simprl 531	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) → 𝑘 ∈ ω)
32	30, 31	ffvelcdmd 5783	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) → (𝑁‘𝑘) ∈ ℕ0)
33	10	fveq1i 5640	. . . . . . . . . . 11 ⊢ (𝐺‘(𝑁‘𝑘)) = ((𝐹 ∘ ◡𝑁)‘(𝑁‘𝑘))
34	32	adantr 276	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝑁‘𝑘) ∈ ℕ0)
35		fvco3 5717	. . . . . . . . . . . 12 ⊢ ((◡𝑁:ℕ0⟶ω ∧ (𝑁‘𝑘) ∈ ℕ0) → ((𝐹 ∘ ◡𝑁)‘(𝑁‘𝑘)) = (𝐹‘(◡𝑁‘(𝑁‘𝑘))))
36	21, 34, 35	sylancr 414	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((𝐹 ∘ ◡𝑁)‘(𝑁‘𝑘)) = (𝐹‘(◡𝑁‘(𝑁‘𝑘))))
37	33, 36	eqtrid 2276	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐺‘(𝑁‘𝑘)) = (𝐹‘(◡𝑁‘(𝑁‘𝑘))))
38	31	adantr 276	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 𝑘 ∈ ω)
39		f1ocnvfv1 5917	. . . . . . . . . . . . 13 ⊢ ((𝑁:ω–1-1-onto→ℕ0 ∧ 𝑘 ∈ ω) → (◡𝑁‘(𝑁‘𝑘)) = 𝑘)
40	3, 39	mpan 424	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ω → (◡𝑁‘(𝑁‘𝑘)) = 𝑘)
41	40	fveq2d 5643	. . . . . . . . . . 11 ⊢ (𝑘 ∈ ω → (𝐹‘(◡𝑁‘(𝑁‘𝑘))) = (𝐹‘𝑘))
42	38, 41	syl 14	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐹‘(◡𝑁‘(𝑁‘𝑘))) = (𝐹‘𝑘))
43	37, 42	eqtrd 2264	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐺‘(𝑁‘𝑘)) = (𝐹‘𝑘))
44		simplrr 538	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))
45	43, 44	eqneltrd 2327	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ¬ (𝐺‘(𝑁‘𝑘)) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))
46		simpr 110	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) ∧ (𝐺‘(𝑁‘𝑘)) = (𝐺‘𝑖)) → (𝐺‘(𝑁‘𝑘)) = (𝐺‘𝑖))
47	10	fveq1i 5640	. . . . . . . . . . . 12 ⊢ (𝐺‘𝑖) = ((𝐹 ∘ ◡𝑁)‘𝑖)
48		elfznn0 10348	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ (0...𝑚) → 𝑖 ∈ ℕ0)
49	48	adantl 277	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 𝑖 ∈ ℕ0)
50		fvco3 5717	. . . . . . . . . . . . 13 ⊢ ((◡𝑁:ℕ0⟶ω ∧ 𝑖 ∈ ℕ0) → ((𝐹 ∘ ◡𝑁)‘𝑖) = (𝐹‘(◡𝑁‘𝑖)))
51	21, 49, 50	sylancr 414	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((𝐹 ∘ ◡𝑁)‘𝑖) = (𝐹‘(◡𝑁‘𝑖)))
52	47, 51	eqtrid 2276	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐺‘𝑖) = (𝐹‘(◡𝑁‘𝑖)))
53		elfzle2 10262	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ (0...𝑚) → 𝑖 ≤ 𝑚)
54	53	adantl 277	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 𝑖 ≤ 𝑚)
55		0zd 9490	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 0 ∈ ℤ)
56	21	a1i 9	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ◡𝑁:ℕ0⟶ω)
57	56, 49	ffvelcdmd 5783	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (◡𝑁‘𝑖) ∈ ω)
58	24	ad2antrr 488	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (◡𝑁‘𝑚) ∈ ω)
59	55, 2, 57, 58	frec2uzled 10690	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((◡𝑁‘𝑖) ⊆ (◡𝑁‘𝑚) ↔ (𝑁‘(◡𝑁‘𝑖)) ≤ (𝑁‘(◡𝑁‘𝑚))))
60		f1ocnvfv2 5918	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁:ω–1-1-onto→ℕ0 ∧ 𝑖 ∈ ℕ0) → (𝑁‘(◡𝑁‘𝑖)) = 𝑖)
61	3, 49, 60	sylancr 414	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝑁‘(◡𝑁‘𝑖)) = 𝑖)
62	23	ad2antrr 488	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 𝑚 ∈ ℕ0)
63		f1ocnvfv2 5918	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁:ω–1-1-onto→ℕ0 ∧ 𝑚 ∈ ℕ0) → (𝑁‘(◡𝑁‘𝑚)) = 𝑚)
64	3, 62, 63	sylancr 414	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝑁‘(◡𝑁‘𝑚)) = 𝑚)
65	61, 64	breq12d 4101	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((𝑁‘(◡𝑁‘𝑖)) ≤ (𝑁‘(◡𝑁‘𝑚)) ↔ 𝑖 ≤ 𝑚))
66	59, 65	bitrd 188	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((◡𝑁‘𝑖) ⊆ (◡𝑁‘𝑚) ↔ 𝑖 ≤ 𝑚))
67	54, 66	mpbird 167	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (◡𝑁‘𝑖) ⊆ (◡𝑁‘𝑚))
68		nnsssuc 6669	. . . . . . . . . . . . . 14 ⊢ (((◡𝑁‘𝑖) ∈ ω ∧ (◡𝑁‘𝑚) ∈ ω) → ((◡𝑁‘𝑖) ⊆ (◡𝑁‘𝑚) ↔ (◡𝑁‘𝑖) ∈ suc (◡𝑁‘𝑚)))
69	57, 58, 68	syl2anc 411	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((◡𝑁‘𝑖) ⊆ (◡𝑁‘𝑚) ↔ (◡𝑁‘𝑖) ∈ suc (◡𝑁‘𝑚)))
70	67, 69	mpbid 147	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (◡𝑁‘𝑖) ∈ suc (◡𝑁‘𝑚))
71	1	ad3antrrr 492	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 𝐹:ω–onto→𝐴)
72		fof 5559	. . . . . . . . . . . . . . 15 ⊢ (𝐹:ω–onto→𝐴 → 𝐹:ω⟶𝐴)
73	71, 72	syl 14	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 𝐹:ω⟶𝐴)
74	73	ffund 5486	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → Fun 𝐹)
75	73	fdmd 5489	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → dom 𝐹 = ω)
76	57, 75	eleqtrrd 2311	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (◡𝑁‘𝑖) ∈ dom 𝐹)
77		funfvima 5885	. . . . . . . . . . . . 13 ⊢ ((Fun 𝐹 ∧ (◡𝑁‘𝑖) ∈ dom 𝐹) → ((◡𝑁‘𝑖) ∈ suc (◡𝑁‘𝑚) → (𝐹‘(◡𝑁‘𝑖)) ∈ (𝐹 “ suc (◡𝑁‘𝑚))))
78	74, 76, 77	syl2anc 411	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((◡𝑁‘𝑖) ∈ suc (◡𝑁‘𝑚) → (𝐹‘(◡𝑁‘𝑖)) ∈ (𝐹 “ suc (◡𝑁‘𝑚))))
79	70, 78	mpd 13	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐹‘(◡𝑁‘𝑖)) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))
80	52, 79	eqeltrd 2308	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐺‘𝑖) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))
81	80	adantr 276	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) ∧ (𝐺‘(𝑁‘𝑘)) = (𝐺‘𝑖)) → (𝐺‘𝑖) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))
82	46, 81	eqeltrd 2308	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) ∧ (𝐺‘(𝑁‘𝑘)) = (𝐺‘𝑖)) → (𝐺‘(𝑁‘𝑘)) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))
83	45, 82	mtand 671	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ¬ (𝐺‘(𝑁‘𝑘)) = (𝐺‘𝑖))
84	83	neqned 2409	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐺‘(𝑁‘𝑘)) ≠ (𝐺‘𝑖))
85	84	ralrimiva 2605	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) → ∀𝑖 ∈ (0...𝑚)(𝐺‘(𝑁‘𝑘)) ≠ (𝐺‘𝑖))
86		fveq2 5639	. . . . . . . 8 ⊢ (𝑗 = (𝑁‘𝑘) → (𝐺‘𝑗) = (𝐺‘(𝑁‘𝑘)))
87	86	neeq1d 2420	. . . . . . 7 ⊢ (𝑗 = (𝑁‘𝑘) → ((𝐺‘𝑗) ≠ (𝐺‘𝑖) ↔ (𝐺‘(𝑁‘𝑘)) ≠ (𝐺‘𝑖)))
88	87	ralbidv 2532	. . . . . 6 ⊢ (𝑗 = (𝑁‘𝑘) → (∀𝑖 ∈ (0...𝑚)(𝐺‘𝑗) ≠ (𝐺‘𝑖) ↔ ∀𝑖 ∈ (0...𝑚)(𝐺‘(𝑁‘𝑘)) ≠ (𝐺‘𝑖)))
89	88	rspcev 2910	. . . . 5 ⊢ (((𝑁‘𝑘) ∈ ℕ0 ∧ ∀𝑖 ∈ (0...𝑚)(𝐺‘(𝑁‘𝑘)) ≠ (𝐺‘𝑖)) → ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝐺‘𝑗) ≠ (𝐺‘𝑖))
90	32, 85, 89	syl2anc 411	. . . 4 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ0) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (◡𝑁‘𝑚)))) → ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝐺‘𝑗) ≠ (𝐺‘𝑖))
91	27, 90	rexlimddv 2655	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ0) → ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝐺‘𝑗) ≠ (𝐺‘𝑖))
92	91	ralrimiva 2605	. 2 ⊢ (𝜑 → ∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝐺‘𝑗) ≠ (𝐺‘𝑖))
93	13, 92	jca 306	1 ⊢ (𝜑 → (𝐺:ℕ0–onto→𝐴 ∧ ∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝐺‘𝑗) ≠ (𝐺‘𝑖)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1397   ∈ wcel 2202   ≠ wne 2402  ∀wral 2510  ∃wrex 2511   ⊆ wss 3200   class class class wbr 4088   ↦ cmpt 4150  suc csuc 4462  ωcom 4688  ^◡ccnv 4724  dom cdm 4725   “ cima 4728   ∘ ccom 4729  Fun wfun 5320  ⟶wf 5322  –onto→wfo 5324  –1-1-onto→wf1o 5325  ‘cfv 5326  (class class class)co 6017  freccfrec 6555  0cc0 8031  1c1 8032   + caddc 8034   ≤ cle 8214  ℕ₀cn0 9401  ℤcz 9478  ...cfz 10242

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-ltadd 8147

This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-recs 6470  df-frec 6556  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-inn 9143  df-n0 9402  df-z 9479  df-uz 9755  df-fz 10243

This theorem is referenced by:  ctinfom  13048