Theorem ctinfom 13377

Description: A condition for a set being countably infinite. Restates ennnfone 13374 in terms of ω and function image. Like ennnfone 13374 the condition can be summarized as 𝐴 being countable, infinite, and having decidable equality. (Contributed by Jim Kingdon, 7-Aug-2023.)

Assertion

Ref	Expression
ctinfom	⊢ (𝐴 ≈ ℕ ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛))))

Distinct variable groups:   𝐴,𝑓,𝑛   𝑥,𝐴,𝑦   𝑓,𝑘,𝑛

Allowed substitution hint:   𝐴(𝑘)

Proof of Theorem ctinfom

Dummy variables 𝑎 𝑑 𝑖 𝑚 𝑔 𝑏 𝑐 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ennnfone 13374	. . . 4 ⊢ (𝐴 ≈ ℕ ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑔(𝑔:ℕ0–onto→𝐴 ∧ ∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝑔‘𝑗) ≠ (𝑔‘𝑖))))
2	1	simplbi 274	. . 3 ⊢ (𝐴 ≈ ℕ → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
3		nnenom 10892	. . . . . . 7 ⊢ ℕ ≈ ω
4		entr 7075	. . . . . . 7 ⊢ ((𝐴 ≈ ℕ ∧ ℕ ≈ ω) → 𝐴 ≈ ω)
5	3, 4	mpan2 429	. . . . . 6 ⊢ (𝐴 ≈ ℕ → 𝐴 ≈ ω)
6	5	ensymd 7074	. . . . 5 ⊢ (𝐴 ≈ ℕ → ω ≈ 𝐴)
7		bren 7034	. . . . 5 ⊢ (ω ≈ 𝐴 ↔ ∃𝑓 𝑓:ω–1-1-onto→𝐴)
8	6, 7	sylib 122	. . . 4 ⊢ (𝐴 ≈ ℕ → ∃𝑓 𝑓:ω–1-1-onto→𝐴)
9		f1ofo 5649	. . . . . . . 8 ⊢ (𝑓:ω–1-1-onto→𝐴 → 𝑓:ω–onto→𝐴)
10	9	adantl 277	. . . . . . 7 ⊢ ((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto→𝐴) → 𝑓:ω–onto→𝐴)
11		simpr 110	. . . . . . . . 9 ⊢ (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto→𝐴) ∧ 𝑛 ∈ ω) → 𝑛 ∈ ω)
12		nnord 4761	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ω → Ord 𝑛)
13	12	adantl 277	. . . . . . . . . . 11 ⊢ (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto→𝐴) ∧ 𝑛 ∈ ω) → Ord 𝑛)
14		ordirr 4691	. . . . . . . . . . 11 ⊢ (Ord 𝑛 → ¬ 𝑛 ∈ 𝑛)
15	13, 14	syl 14	. . . . . . . . . 10 ⊢ (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto→𝐴) ∧ 𝑛 ∈ ω) → ¬ 𝑛 ∈ 𝑛)
16		f1of1 5641	. . . . . . . . . . . 12 ⊢ (𝑓:ω–1-1-onto→𝐴 → 𝑓:ω–1-1→𝐴)
17	16	ad2antlr 493	. . . . . . . . . . 11 ⊢ (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto→𝐴) ∧ 𝑛 ∈ ω) → 𝑓:ω–1-1→𝐴)
18		omelon 4758	. . . . . . . . . . . . 13 ⊢ ω ∈ On
19	18	onelssi 4576	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ω → 𝑛 ⊆ ω)
20	19	adantl 277	. . . . . . . . . . 11 ⊢ (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto→𝐴) ∧ 𝑛 ∈ ω) → 𝑛 ⊆ ω)
21		f1elima 5982	. . . . . . . . . . 11 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝑛 ∈ ω ∧ 𝑛 ⊆ ω) → ((𝑓‘𝑛) ∈ (𝑓 “ 𝑛) ↔ 𝑛 ∈ 𝑛))
22	17, 11, 20, 21	syl3anc 1278	. . . . . . . . . 10 ⊢ (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto→𝐴) ∧ 𝑛 ∈ ω) → ((𝑓‘𝑛) ∈ (𝑓 “ 𝑛) ↔ 𝑛 ∈ 𝑛))
23	15, 22	mtbird 684	. . . . . . . . 9 ⊢ (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto→𝐴) ∧ 𝑛 ∈ ω) → ¬ (𝑓‘𝑛) ∈ (𝑓 “ 𝑛))
24		fveq2 5698	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑛 → (𝑓‘𝑘) = (𝑓‘𝑛))
25	24	eleq1d 2307	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑛 → ((𝑓‘𝑘) ∈ (𝑓 “ 𝑛) ↔ (𝑓‘𝑛) ∈ (𝑓 “ 𝑛)))
26	25	notbid 677	. . . . . . . . . 10 ⊢ (𝑘 = 𝑛 → (¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛) ↔ ¬ (𝑓‘𝑛) ∈ (𝑓 “ 𝑛)))
27	26	rspcev 2929	. . . . . . . . 9 ⊢ ((𝑛 ∈ ω ∧ ¬ (𝑓‘𝑛) ∈ (𝑓 “ 𝑛)) → ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛))
28	11, 23, 27	syl2anc 415	. . . . . . . 8 ⊢ (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto→𝐴) ∧ 𝑛 ∈ ω) → ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛))
29	28	ralrimiva 2623	. . . . . . 7 ⊢ ((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto→𝐴) → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛))
30	10, 29	jca 306	. . . . . 6 ⊢ ((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto→𝐴) → (𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛)))
31	30	ex 115	. . . . 5 ⊢ (𝐴 ≈ ℕ → (𝑓:ω–1-1-onto→𝐴 → (𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛))))
32	31	eximdv 1933	. . . 4 ⊢ (𝐴 ≈ ℕ → (∃𝑓 𝑓:ω–1-1-onto→𝐴 → ∃𝑓(𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛))))
33	8, 32	mpd 13	. . 3 ⊢ (𝐴 ≈ ℕ → ∃𝑓(𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛)))
34	2, 33	jca 306	. 2 ⊢ (𝐴 ≈ ℕ → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛))))
35		oveq1 6095	. . . . . . . . 9 ⊢ (𝑏 = 𝑎 → (𝑏 + 1) = (𝑎 + 1))
36	35	cbvmptv 4229	. . . . . . . 8 ⊢ (𝑏 ∈ ℤ ↦ (𝑏 + 1)) = (𝑎 ∈ ℤ ↦ (𝑎 + 1))
37		freceq1 6667	. . . . . . . 8 ⊢ ((𝑏 ∈ ℤ ↦ (𝑏 + 1)) = (𝑎 ∈ ℤ ↦ (𝑎 + 1)) → frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0) = frec((𝑎 ∈ ℤ ↦ (𝑎 + 1)), 0))
38	36, 37	ax-mp 5	. . . . . . 7 ⊢ frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0) = frec((𝑎 ∈ ℤ ↦ (𝑎 + 1)), 0)
39		eqid 2238	. . . . . . 7 ⊢ (𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) = (𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))
40		simpl 109	. . . . . . 7 ⊢ ((𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛)) → 𝑓:ω–onto→𝐴)
41		fveq2 5698	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑑 → (𝑓‘𝑘) = (𝑓‘𝑑))
42	41	eleq1d 2307	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑑 → ((𝑓‘𝑘) ∈ (𝑓 “ 𝑛) ↔ (𝑓‘𝑑) ∈ (𝑓 “ 𝑛)))
43	42	notbid 677	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑑 → (¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛) ↔ ¬ (𝑓‘𝑑) ∈ (𝑓 “ 𝑛)))
44	43	cbvrexv 2787	. . . . . . . . . 10 ⊢ (∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛) ↔ ∃𝑑 ∈ ω ¬ (𝑓‘𝑑) ∈ (𝑓 “ 𝑛))
45	44	ralbii 2556	. . . . . . . . 9 ⊢ (∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛) ↔ ∀𝑛 ∈ ω ∃𝑑 ∈ ω ¬ (𝑓‘𝑑) ∈ (𝑓 “ 𝑛))
46		imaeq2 5125	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑐 → (𝑓 “ 𝑛) = (𝑓 “ 𝑐))
47	46	eleq2d 2308	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑐 → ((𝑓‘𝑑) ∈ (𝑓 “ 𝑛) ↔ (𝑓‘𝑑) ∈ (𝑓 “ 𝑐)))
48	47	notbid 677	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑐 → (¬ (𝑓‘𝑑) ∈ (𝑓 “ 𝑛) ↔ ¬ (𝑓‘𝑑) ∈ (𝑓 “ 𝑐)))
49	48	rexbidv 2551	. . . . . . . . . 10 ⊢ (𝑛 = 𝑐 → (∃𝑑 ∈ ω ¬ (𝑓‘𝑑) ∈ (𝑓 “ 𝑛) ↔ ∃𝑑 ∈ ω ¬ (𝑓‘𝑑) ∈ (𝑓 “ 𝑐)))
50	49	cbvralv 2786	. . . . . . . . 9 ⊢ (∀𝑛 ∈ ω ∃𝑑 ∈ ω ¬ (𝑓‘𝑑) ∈ (𝑓 “ 𝑛) ↔ ∀𝑐 ∈ ω ∃𝑑 ∈ ω ¬ (𝑓‘𝑑) ∈ (𝑓 “ 𝑐))
51	45, 50	sylbb 123	. . . . . . . 8 ⊢ (∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛) → ∀𝑐 ∈ ω ∃𝑑 ∈ ω ¬ (𝑓‘𝑑) ∈ (𝑓 “ 𝑐))
52	51	adantl 277	. . . . . . 7 ⊢ ((𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛)) → ∀𝑐 ∈ ω ∃𝑑 ∈ ω ¬ (𝑓‘𝑑) ∈ (𝑓 “ 𝑐))
53	38, 39, 40, 52	ctinfomlemom 13376	. . . . . 6 ⊢ ((𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛)) → ((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)):ℕ0–onto→𝐴 ∧ ∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖)))
54		vex 2824	. . . . . . . 8 ⊢ 𝑓 ∈ V
55		frecex 6669	. . . . . . . . 9 ⊢ frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0) ∈ V
56	55	cnvex 5329	. . . . . . . 8 ⊢ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0) ∈ V
57	54, 56	coex 5336	. . . . . . 7 ⊢ (𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) ∈ V
58		foeq1 5614	. . . . . . . 8 ⊢ (𝑔 = (𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → (𝑔:ℕ0–onto→𝐴 ↔ (𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)):ℕ0–onto→𝐴))
59		fveq1 5697	. . . . . . . . . . . 12 ⊢ (𝑔 = (𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → (𝑔‘𝑗) = ((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗))
60		fveq1 5697	. . . . . . . . . . . 12 ⊢ (𝑔 = (𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → (𝑔‘𝑖) = ((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖))
61	59, 60	neeq12d 2440	. . . . . . . . . . 11 ⊢ (𝑔 = (𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → ((𝑔‘𝑗) ≠ (𝑔‘𝑖) ↔ ((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖)))
62	61	ralbidv 2550	. . . . . . . . . 10 ⊢ (𝑔 = (𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → (∀𝑖 ∈ (0...𝑚)(𝑔‘𝑗) ≠ (𝑔‘𝑖) ↔ ∀𝑖 ∈ (0...𝑚)((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖)))
63	62	rexbidv 2551	. . . . . . . . 9 ⊢ (𝑔 = (𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → (∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝑔‘𝑗) ≠ (𝑔‘𝑖) ↔ ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖)))
64	63	ralbidv 2550	. . . . . . . 8 ⊢ (𝑔 = (𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → (∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝑔‘𝑗) ≠ (𝑔‘𝑖) ↔ ∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖)))
65	58, 64	anbi12d 477	. . . . . . 7 ⊢ (𝑔 = (𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → ((𝑔:ℕ0–onto→𝐴 ∧ ∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝑔‘𝑗) ≠ (𝑔‘𝑖)) ↔ ((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)):ℕ0–onto→𝐴 ∧ ∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖))))
66	57, 65	spcev 2920	. . . . . 6 ⊢ (((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)):ℕ0–onto→𝐴 ∧ ∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓 ∘ ◡frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖)) → ∃𝑔(𝑔:ℕ0–onto→𝐴 ∧ ∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝑔‘𝑗) ≠ (𝑔‘𝑖)))
67	53, 66	syl 14	. . . . 5 ⊢ ((𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛)) → ∃𝑔(𝑔:ℕ0–onto→𝐴 ∧ ∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝑔‘𝑗) ≠ (𝑔‘𝑖)))
68	67	exlimiv 1651	. . . 4 ⊢ (∃𝑓(𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛)) → ∃𝑔(𝑔:ℕ0–onto→𝐴 ∧ ∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝑔‘𝑗) ≠ (𝑔‘𝑖)))
69	68	anim2i 342	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛))) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑔(𝑔:ℕ0–onto→𝐴 ∧ ∀𝑚 ∈ ℕ0 ∃𝑗 ∈ ℕ0 ∀𝑖 ∈ (0...𝑚)(𝑔‘𝑗) ≠ (𝑔‘𝑖))))
70	69, 1	sylibr 134	. 2 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛))) → 𝐴 ≈ ℕ)
71	34, 70	impbii 126	1 ⊢ (𝐴 ≈ ℕ ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ω–onto→𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓‘𝑘) ∈ (𝑓 “ 𝑛))))

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 104   ↔ wb 105  DECID wdc 846   = wceq 1402  ∃wex 1545   ∈ wcel 2209   ≠ wne 2420  ∀wral 2528  ∃wrex 2529   ⊆ wss 3220   class class class wbr 4131   ↦ cmpt 4193  Ord word 4509  ωcom 4739  ^◡ccnv 4775   “ cima 4779   ∘ ccom 4780  –1-1→wf1 5377  –onto→wfo 5378  –1-1-onto→wf1o 5379  ‘cfv 5380  (class class class)co 6088  freccfrec 6665   ≈ cen 7024  0cc0 8185  1c1 8186   + caddc 8188  ℕcn 9313  ℕ₀cn0 9574  ℤcz 9655  ...cfz 10428

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-ltadd 8301

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-er 6811  df-pm 6929  df-en 7027  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-n0 9575  df-z 9656  df-uz 9938  df-fz 10429  df-seqfrec 10906

This theorem is used by:  ctinf  13379