ctinfomlemom - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > ctinfomlemom		GIF version

Theorem ctinfomlemom 12441

Description: Lemma for ctinfom 12442. 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	⊢ (𝜑 → (𝐺:ℕ₀–onto→𝐴 ∧ ∀𝑚 ∈ ℕ₀ ∃𝑗 ∈ ℕ₀ ∀𝑖 ∈ (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 10441	. . . . . 6 ⊢ 𝑁:ω–1-1-onto→ℕ₀
4		f1ocnv 5486	. . . . . 6 ⊢ (𝑁:ω–1-1-onto→ℕ₀ → ^◡𝑁:ℕ₀–1-1-onto→ω)
5	3, 4	ax-mp 5	. . . . 5 ⊢ ^◡𝑁:ℕ₀–1-1-onto→ω
6		f1ofo 5480	. . . . 5 ⊢ (^◡𝑁:ℕ₀–1-1-onto→ω → ^◡𝑁:ℕ₀–onto→ω)
7	5, 6	ax-mp 5	. . . 4 ⊢ ^◡𝑁:ℕ₀–onto→ω
8		foco 5460	. . . 4 ⊢ ((𝐹:ω–onto→𝐴 ∧ ^◡𝑁:ℕ₀–onto→ω) → (𝐹 ∘ ^◡𝑁):ℕ₀–onto→𝐴)
9	1, 7, 8	sylancl 413	. . 3 ⊢ (𝜑 → (𝐹 ∘ ^◡𝑁):ℕ₀–onto→𝐴)
10		ctinfom.g	. . . 4 ⊢ 𝐺 = (𝐹 ∘ ^◡𝑁)
11		foeq1 5446	. . . 4 ⊢ (𝐺 = (𝐹 ∘ ^◡𝑁) → (𝐺:ℕ₀–onto→𝐴 ↔ (𝐹 ∘ ^◡𝑁):ℕ₀–onto→𝐴))
12	10, 11	ax-mp 5	. . 3 ⊢ (𝐺:ℕ₀–onto→𝐴 ↔ (𝐹 ∘ ^◡𝑁):ℕ₀–onto→𝐴)
13	9, 12	sylibr 134	. 2 ⊢ (𝜑 → 𝐺:ℕ₀–onto→𝐴)
14		imaeq2 4978	. . . . . . . 8 ⊢ (𝑛 = suc (^◡𝑁‘𝑚) → (𝐹 “ 𝑛) = (𝐹 “ suc (^◡𝑁‘𝑚)))
15	14	eleq2d 2257	. . . . . . 7 ⊢ (𝑛 = suc (^◡𝑁‘𝑚) → ((𝐹‘𝑘) ∈ (𝐹 “ 𝑛) ↔ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚))))
16	15	notbid 668	. . . . . 6 ⊢ (𝑛 = suc (^◡𝑁‘𝑚) → (¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑛) ↔ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚))))
17	16	rexbidv 2488	. . . . 5 ⊢ (𝑛 = suc (^◡𝑁‘𝑚) → (∃𝑘 ∈ ω ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑛) ↔ ∃𝑘 ∈ ω ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚))))
18		ctinfom.inf	. . . . . 6 ⊢ (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑛))
19	18	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ₀) → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝐹‘𝑘) ∈ (𝐹 “ 𝑛))
20		f1of 5473	. . . . . . . . 9 ⊢ (^◡𝑁:ℕ₀–1-1-onto→ω → ^◡𝑁:ℕ₀⟶ω)
21	5, 20	ax-mp 5	. . . . . . . 8 ⊢ ^◡𝑁:ℕ₀⟶ω
22	21	a1i 9	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ₀) → ^◡𝑁:ℕ₀⟶ω)
23		simpr 110	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ₀) → 𝑚 ∈ ℕ₀)
24	22, 23	ffvelcdmd 5665	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ₀) → (^◡𝑁‘𝑚) ∈ ω)
25		peano2 4606	. . . . . 6 ⊢ ((^◡𝑁‘𝑚) ∈ ω → suc (^◡𝑁‘𝑚) ∈ ω)
26	24, 25	syl 14	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ₀) → suc (^◡𝑁‘𝑚) ∈ ω)
27	17, 19, 26	rspcdva 2858	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ₀) → ∃𝑘 ∈ ω ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))
28		f1of 5473	. . . . . . . 8 ⊢ (𝑁:ω–1-1-onto→ℕ₀ → 𝑁:ω⟶ℕ₀)
29	3, 28	ax-mp 5	. . . . . . 7 ⊢ 𝑁:ω⟶ℕ₀
30	29	a1i 9	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) → 𝑁:ω⟶ℕ₀)
31		simprl 529	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) → 𝑘 ∈ ω)
32	30, 31	ffvelcdmd 5665	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) → (𝑁‘𝑘) ∈ ℕ₀)
33	10	fveq1i 5528	. . . . . . . . . . 11 ⊢ (𝐺‘(𝑁‘𝑘)) = ((𝐹 ∘ ^◡𝑁)‘(𝑁‘𝑘))
34	32	adantr 276	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝑁‘𝑘) ∈ ℕ₀)
35		fvco3 5600	. . . . . . . . . . . 12 ⊢ ((^◡𝑁:ℕ₀⟶ω ∧ (𝑁‘𝑘) ∈ ℕ₀) → ((𝐹 ∘ ^◡𝑁)‘(𝑁‘𝑘)) = (𝐹‘(^◡𝑁‘(𝑁‘𝑘))))
36	21, 34, 35	sylancr 414	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((𝐹 ∘ ^◡𝑁)‘(𝑁‘𝑘)) = (𝐹‘(^◡𝑁‘(𝑁‘𝑘))))
37	33, 36	eqtrid 2232	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐺‘(𝑁‘𝑘)) = (𝐹‘(^◡𝑁‘(𝑁‘𝑘))))
38	31	adantr 276	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 𝑘 ∈ ω)
39		f1ocnvfv1 5791	. . . . . . . . . . . . 13 ⊢ ((𝑁:ω–1-1-onto→ℕ₀ ∧ 𝑘 ∈ ω) → (^◡𝑁‘(𝑁‘𝑘)) = 𝑘)
40	3, 39	mpan 424	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ω → (^◡𝑁‘(𝑁‘𝑘)) = 𝑘)
41	40	fveq2d 5531	. . . . . . . . . . 11 ⊢ (𝑘 ∈ ω → (𝐹‘(^◡𝑁‘(𝑁‘𝑘))) = (𝐹‘𝑘))
42	38, 41	syl 14	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐹‘(^◡𝑁‘(𝑁‘𝑘))) = (𝐹‘𝑘))
43	37, 42	eqtrd 2220	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐺‘(𝑁‘𝑘)) = (𝐹‘𝑘))
44		simplrr 536	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))
45	43, 44	eqneltrd 2283	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ¬ (𝐺‘(𝑁‘𝑘)) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))
46		simpr 110	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) ∧ (𝐺‘(𝑁‘𝑘)) = (𝐺‘𝑖)) → (𝐺‘(𝑁‘𝑘)) = (𝐺‘𝑖))
47	10	fveq1i 5528	. . . . . . . . . . . 12 ⊢ (𝐺‘𝑖) = ((𝐹 ∘ ^◡𝑁)‘𝑖)
48		elfznn0 10127	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ (0...𝑚) → 𝑖 ∈ ℕ₀)
49	48	adantl 277	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 𝑖 ∈ ℕ₀)
50		fvco3 5600	. . . . . . . . . . . . 13 ⊢ ((^◡𝑁:ℕ₀⟶ω ∧ 𝑖 ∈ ℕ₀) → ((𝐹 ∘ ^◡𝑁)‘𝑖) = (𝐹‘(^◡𝑁‘𝑖)))
51	21, 49, 50	sylancr 414	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((𝐹 ∘ ^◡𝑁)‘𝑖) = (𝐹‘(^◡𝑁‘𝑖)))
52	47, 51	eqtrid 2232	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐺‘𝑖) = (𝐹‘(^◡𝑁‘𝑖)))
53		elfzle2 10041	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ (0...𝑚) → 𝑖 ≤ 𝑚)
54	53	adantl 277	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 𝑖 ≤ 𝑚)
55		0zd 9278	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 0 ∈ ℤ)
56	21	a1i 9	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ^◡𝑁:ℕ₀⟶ω)
57	56, 49	ffvelcdmd 5665	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (^◡𝑁‘𝑖) ∈ ω)
58	24	ad2antrr 488	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (^◡𝑁‘𝑚) ∈ ω)
59	55, 2, 57, 58	frec2uzled 10442	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((^◡𝑁‘𝑖) ⊆ (^◡𝑁‘𝑚) ↔ (𝑁‘(^◡𝑁‘𝑖)) ≤ (𝑁‘(^◡𝑁‘𝑚))))
60		f1ocnvfv2 5792	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁:ω–1-1-onto→ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑁‘(^◡𝑁‘𝑖)) = 𝑖)
61	3, 49, 60	sylancr 414	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝑁‘(^◡𝑁‘𝑖)) = 𝑖)
62	23	ad2antrr 488	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 𝑚 ∈ ℕ₀)
63		f1ocnvfv2 5792	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁:ω–1-1-onto→ℕ₀ ∧ 𝑚 ∈ ℕ₀) → (𝑁‘(^◡𝑁‘𝑚)) = 𝑚)
64	3, 62, 63	sylancr 414	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝑁‘(^◡𝑁‘𝑚)) = 𝑚)
65	61, 64	breq12d 4028	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((𝑁‘(^◡𝑁‘𝑖)) ≤ (𝑁‘(^◡𝑁‘𝑚)) ↔ 𝑖 ≤ 𝑚))
66	59, 65	bitrd 188	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((^◡𝑁‘𝑖) ⊆ (^◡𝑁‘𝑚) ↔ 𝑖 ≤ 𝑚))
67	54, 66	mpbird 167	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (^◡𝑁‘𝑖) ⊆ (^◡𝑁‘𝑚))
68		nnsssuc 6516	. . . . . . . . . . . . . 14 ⊢ (((^◡𝑁‘𝑖) ∈ ω ∧ (^◡𝑁‘𝑚) ∈ ω) → ((^◡𝑁‘𝑖) ⊆ (^◡𝑁‘𝑚) ↔ (^◡𝑁‘𝑖) ∈ suc (^◡𝑁‘𝑚)))
69	57, 58, 68	syl2anc 411	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((^◡𝑁‘𝑖) ⊆ (^◡𝑁‘𝑚) ↔ (^◡𝑁‘𝑖) ∈ suc (^◡𝑁‘𝑚)))
70	67, 69	mpbid 147	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (^◡𝑁‘𝑖) ∈ suc (^◡𝑁‘𝑚))
71	1	ad3antrrr 492	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 𝐹:ω–onto→𝐴)
72		fof 5450	. . . . . . . . . . . . . . 15 ⊢ (𝐹:ω–onto→𝐴 → 𝐹:ω⟶𝐴)
73	71, 72	syl 14	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → 𝐹:ω⟶𝐴)
74	73	ffund 5381	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → Fun 𝐹)
75	73	fdmd 5384	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → dom 𝐹 = ω)
76	57, 75	eleqtrrd 2267	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (^◡𝑁‘𝑖) ∈ dom 𝐹)
77		funfvima 5761	. . . . . . . . . . . . 13 ⊢ ((Fun 𝐹 ∧ (^◡𝑁‘𝑖) ∈ dom 𝐹) → ((^◡𝑁‘𝑖) ∈ suc (^◡𝑁‘𝑚) → (𝐹‘(^◡𝑁‘𝑖)) ∈ (𝐹 “ suc (^◡𝑁‘𝑚))))
78	74, 76, 77	syl2anc 411	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ((^◡𝑁‘𝑖) ∈ suc (^◡𝑁‘𝑚) → (𝐹‘(^◡𝑁‘𝑖)) ∈ (𝐹 “ suc (^◡𝑁‘𝑚))))
79	70, 78	mpd 13	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐹‘(^◡𝑁‘𝑖)) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))
80	52, 79	eqeltrd 2264	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐺‘𝑖) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))
81	80	adantr 276	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) ∧ (𝐺‘(𝑁‘𝑘)) = (𝐺‘𝑖)) → (𝐺‘𝑖) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))
82	46, 81	eqeltrd 2264	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) ∧ (𝐺‘(𝑁‘𝑘)) = (𝐺‘𝑖)) → (𝐺‘(𝑁‘𝑘)) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))
83	45, 82	mtand 666	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → ¬ (𝐺‘(𝑁‘𝑘)) = (𝐺‘𝑖))
84	83	neqned 2364	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) ∧ 𝑖 ∈ (0...𝑚)) → (𝐺‘(𝑁‘𝑘)) ≠ (𝐺‘𝑖))
85	84	ralrimiva 2560	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) → ∀𝑖 ∈ (0...𝑚)(𝐺‘(𝑁‘𝑘)) ≠ (𝐺‘𝑖))
86		fveq2 5527	. . . . . . . 8 ⊢ (𝑗 = (𝑁‘𝑘) → (𝐺‘𝑗) = (𝐺‘(𝑁‘𝑘)))
87	86	neeq1d 2375	. . . . . . 7 ⊢ (𝑗 = (𝑁‘𝑘) → ((𝐺‘𝑗) ≠ (𝐺‘𝑖) ↔ (𝐺‘(𝑁‘𝑘)) ≠ (𝐺‘𝑖)))
88	87	ralbidv 2487	. . . . . 6 ⊢ (𝑗 = (𝑁‘𝑘) → (∀𝑖 ∈ (0...𝑚)(𝐺‘𝑗) ≠ (𝐺‘𝑖) ↔ ∀𝑖 ∈ (0...𝑚)(𝐺‘(𝑁‘𝑘)) ≠ (𝐺‘𝑖)))
89	88	rspcev 2853	. . . . 5 ⊢ (((𝑁‘𝑘) ∈ ℕ₀ ∧ ∀𝑖 ∈ (0...𝑚)(𝐺‘(𝑁‘𝑘)) ≠ (𝐺‘𝑖)) → ∃𝑗 ∈ ℕ₀ ∀𝑖 ∈ (0...𝑚)(𝐺‘𝑗) ≠ (𝐺‘𝑖))
90	32, 85, 89	syl2anc 411	. . . 4 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ₀) ∧ (𝑘 ∈ ω ∧ ¬ (𝐹‘𝑘) ∈ (𝐹 “ suc (^◡𝑁‘𝑚)))) → ∃𝑗 ∈ ℕ₀ ∀𝑖 ∈ (0...𝑚)(𝐺‘𝑗) ≠ (𝐺‘𝑖))
91	27, 90	rexlimddv 2609	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ₀) → ∃𝑗 ∈ ℕ₀ ∀𝑖 ∈ (0...𝑚)(𝐺‘𝑗) ≠ (𝐺‘𝑖))
92	91	ralrimiva 2560	. 2 ⊢ (𝜑 → ∀𝑚 ∈ ℕ₀ ∃𝑗 ∈ ℕ₀ ∀𝑖 ∈ (0...𝑚)(𝐺‘𝑗) ≠ (𝐺‘𝑖))
93	13, 92	jca 306	1 ⊢ (𝜑 → (𝐺:ℕ₀–onto→𝐴 ∧ ∀𝑚 ∈ ℕ₀ ∃𝑗 ∈ ℕ₀ ∀𝑖 ∈ (0...𝑚)(𝐺‘𝑗) ≠ (𝐺‘𝑖)))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1363 ∈ wcel 2158 ≠ wne 2357 ∀wral 2465 ∃wrex 2466 ⊆ wss 3141 class class class wbr 4015 ↦ cmpt 4076 suc csuc 4377 ωcom 4601 ^◡ccnv 4637 dom cdm 4638 “ cima 4641 ∘ ccom 4642 Fun wfun 5222 ⟶wf 5224 –onto→wfo 5226 –1-1-onto→wf1o 5227 ‘cfv 5228 (class class class)co 5888 freccfrec 6404 0cc0 7824 1c1 7825 + caddc 7827 ≤ cle 8006 ℕ₀cn0 9189 ℤcz 9266 ...cfz 10021

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 615 ax-in2 616 ax-io 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2160 ax-14 2161 ax-ext 2169 ax-coll 4130 ax-sep 4133 ax-nul 4141 ax-pow 4186 ax-pr 4221 ax-un 4445 ax-setind 4548 ax-iinf 4599 ax-cnex 7915 ax-resscn 7916 ax-1cn 7917 ax-1re 7918 ax-icn 7919 ax-addcl 7920 ax-addrcl 7921 ax-mulcl 7922 ax-addcom 7924 ax-addass 7926 ax-distr 7928 ax-i2m1 7929 ax-0lt1 7930 ax-0id 7932 ax-rnegex 7933 ax-cnre 7935 ax-pre-ltirr 7936 ax-pre-ltwlin 7937 ax-pre-lttrn 7938 ax-pre-ltadd 7940

This theorem depends on definitions: df-bi 117 df-3or 980 df-3an 981 df-tru 1366 df-fal 1369 df-nf 1471 df-sb 1773 df-eu 2039 df-mo 2040 df-clab 2174 df-cleq 2180 df-clel 2183 df-nfc 2318 df-ne 2358 df-nel 2453 df-ral 2470 df-rex 2471 df-reu 2472 df-rab 2474 df-v 2751 df-sbc 2975 df-csb 3070 df-dif 3143 df-un 3145 df-in 3147 df-ss 3154 df-nul 3435 df-pw 3589 df-sn 3610 df-pr 3611 df-op 3613 df-uni 3822 df-int 3857 df-iun 3900 df-br 4016 df-opab 4077 df-mpt 4078 df-tr 4114 df-id 4305 df-iord 4378 df-on 4380 df-ilim 4381 df-suc 4383 df-iom 4602 df-xp 4644 df-rel 4645 df-cnv 4646 df-co 4647 df-dm 4648 df-rn 4649 df-res 4650 df-ima 4651 df-iota 5190 df-fun 5230 df-fn 5231 df-f 5232 df-f1 5233 df-fo 5234 df-f1o 5235 df-fv 5236 df-riota 5844 df-ov 5891 df-oprab 5892 df-mpo 5893 df-recs 6319 df-frec 6405 df-pnf 8007 df-mnf 8008 df-xr 8009 df-ltxr 8010 df-le 8011 df-sub 8143 df-neg 8144 df-inn 8933 df-n0 9190 df-z 9267 df-uz 9542 df-fz 10022

This theorem is referenced by: ctinfom 12442

W3C validator