Theorem ennnfonelemim 12666

Description: Lemma for ennnfone 12667. The trivial direction. (Contributed by Jim Kingdon, 27-Oct-2022.)

Assertion

Ref	Expression
ennnfonelemim	⊢ (𝐴 ≈ ℕ → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ℕ0–onto→𝐴 ∧ ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝑓‘𝑘) ≠ (𝑓‘𝑗))))

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

Allowed substitution hint:   𝐴(𝑘)

Proof of Theorem ennnfonelemim

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nn0ennn 10542	. . . 4 ⊢ ℕ0 ≈ ℕ
2	1	ensymi 6850	. . 3 ⊢ ℕ ≈ ℕ0
3		entr 6852	. . 3 ⊢ ((𝐴 ≈ ℕ ∧ ℕ ≈ ℕ0) → 𝐴 ≈ ℕ0)
4	2, 3	mpan2 425	. 2 ⊢ (𝐴 ≈ ℕ → 𝐴 ≈ ℕ0)
5		bren 6815	. . . 4 ⊢ (𝐴 ≈ ℕ0 ↔ ∃𝑔 𝑔:𝐴–1-1-onto→ℕ0)
6	5	biimpi 120	. . 3 ⊢ (𝐴 ≈ ℕ0 → ∃𝑔 𝑔:𝐴–1-1-onto→ℕ0)
7		f1of 5507	. . . . . . . . . . 11 ⊢ (𝑔:𝐴–1-1-onto→ℕ0 → 𝑔:𝐴⟶ℕ0)
8	7	adantr 276	. . . . . . . . . 10 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → 𝑔:𝐴⟶ℕ0)
9		simprl 529	. . . . . . . . . 10 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → 𝑥 ∈ 𝐴)
10	8, 9	ffvelcdmd 5701	. . . . . . . . 9 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑔‘𝑥) ∈ ℕ0)
11	10	nn0zd 9463	. . . . . . . 8 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑔‘𝑥) ∈ ℤ)
12		simprr 531	. . . . . . . . . 10 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → 𝑦 ∈ 𝐴)
13	8, 12	ffvelcdmd 5701	. . . . . . . . 9 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑔‘𝑦) ∈ ℕ0)
14	13	nn0zd 9463	. . . . . . . 8 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑔‘𝑦) ∈ ℤ)
15		zdceq 9418	. . . . . . . 8 ⊢ (((𝑔‘𝑥) ∈ ℤ ∧ (𝑔‘𝑦) ∈ ℤ) → DECID (𝑔‘𝑥) = (𝑔‘𝑦))
16	11, 14, 15	syl2anc 411	. . . . . . 7 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → DECID (𝑔‘𝑥) = (𝑔‘𝑦))
17		dff1o6 5826	. . . . . . . . . . . . 13 ⊢ (𝑔:𝐴–1-1-onto→ℕ0 ↔ (𝑔 Fn 𝐴 ∧ ran 𝑔 = ℕ0 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑔‘𝑥) = (𝑔‘𝑦) → 𝑥 = 𝑦)))
18	17	simp3bi 1016	. . . . . . . . . . . 12 ⊢ (𝑔:𝐴–1-1-onto→ℕ0 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑔‘𝑥) = (𝑔‘𝑦) → 𝑥 = 𝑦))
19	18	r19.21bi 2585	. . . . . . . . . . 11 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑥 ∈ 𝐴) → ∀𝑦 ∈ 𝐴 ((𝑔‘𝑥) = (𝑔‘𝑦) → 𝑥 = 𝑦))
20	19	r19.21bi 2585	. . . . . . . . . 10 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝑔‘𝑥) = (𝑔‘𝑦) → 𝑥 = 𝑦))
21	20	anasss 399	. . . . . . . . 9 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑔‘𝑥) = (𝑔‘𝑦) → 𝑥 = 𝑦))
22		fveq2 5561	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝑔‘𝑥) = (𝑔‘𝑦))
23	21, 22	impbid1 142	. . . . . . . 8 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑔‘𝑥) = (𝑔‘𝑦) ↔ 𝑥 = 𝑦))
24	23	dcbid 839	. . . . . . 7 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (DECID (𝑔‘𝑥) = (𝑔‘𝑦) ↔ DECID 𝑥 = 𝑦))
25	16, 24	mpbid 147	. . . . . 6 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → DECID 𝑥 = 𝑦)
26	25	ralrimivva 2579	. . . . 5 ⊢ (𝑔:𝐴–1-1-onto→ℕ0 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
27		f1ocnv 5520	. . . . . . 7 ⊢ (𝑔:𝐴–1-1-onto→ℕ0 → ◡𝑔:ℕ0–1-1-onto→𝐴)
28		f1ofo 5514	. . . . . . 7 ⊢ (◡𝑔:ℕ0–1-1-onto→𝐴 → ◡𝑔:ℕ0–onto→𝐴)
29	27, 28	syl 14	. . . . . 6 ⊢ (𝑔:𝐴–1-1-onto→ℕ0 → ◡𝑔:ℕ0–onto→𝐴)
30		peano2nn0 9306	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ0 → (𝑛 + 1) ∈ ℕ0)
31	30	adantl 277	. . . . . . . 8 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) → (𝑛 + 1) ∈ ℕ0)
32		elfznn0 10206	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ (0...𝑛) → 𝑗 ∈ ℕ0)
33	32	adantl 277	. . . . . . . . . . . . . 14 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → 𝑗 ∈ ℕ0)
34	33	nn0red 9320	. . . . . . . . . . . . 13 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → 𝑗 ∈ ℝ)
35		elfzle2 10120	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ (0...𝑛) → 𝑗 ≤ 𝑛)
36	35	adantl 277	. . . . . . . . . . . . . 14 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → 𝑗 ≤ 𝑛)
37		simplr 528	. . . . . . . . . . . . . . 15 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → 𝑛 ∈ ℕ0)
38		nn0leltp1 9406	. . . . . . . . . . . . . . 15 ⊢ ((𝑗 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → (𝑗 ≤ 𝑛 ↔ 𝑗 < (𝑛 + 1)))
39	33, 37, 38	syl2anc 411	. . . . . . . . . . . . . 14 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → (𝑗 ≤ 𝑛 ↔ 𝑗 < (𝑛 + 1)))
40	36, 39	mpbid 147	. . . . . . . . . . . . 13 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → 𝑗 < (𝑛 + 1))
41	34, 40	gtned 8156	. . . . . . . . . . . 12 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → (𝑛 + 1) ≠ 𝑗)
42	41	neneqd 2388	. . . . . . . . . . 11 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → ¬ (𝑛 + 1) = 𝑗)
43		dff1o6 5826	. . . . . . . . . . . . . . 15 ⊢ (◡𝑔:ℕ0–1-1-onto→𝐴 ↔ (◡𝑔 Fn ℕ0 ∧ ran ◡𝑔 = 𝐴 ∧ ∀𝑥 ∈ ℕ0 ∀𝑦 ∈ ℕ0 ((◡𝑔‘𝑥) = (◡𝑔‘𝑦) → 𝑥 = 𝑦)))
44	27, 43	sylib 122	. . . . . . . . . . . . . 14 ⊢ (𝑔:𝐴–1-1-onto→ℕ0 → (◡𝑔 Fn ℕ0 ∧ ran ◡𝑔 = 𝐴 ∧ ∀𝑥 ∈ ℕ0 ∀𝑦 ∈ ℕ0 ((◡𝑔‘𝑥) = (◡𝑔‘𝑦) → 𝑥 = 𝑦)))
45	44	simp3d 1013	. . . . . . . . . . . . 13 ⊢ (𝑔:𝐴–1-1-onto→ℕ0 → ∀𝑥 ∈ ℕ0 ∀𝑦 ∈ ℕ0 ((◡𝑔‘𝑥) = (◡𝑔‘𝑦) → 𝑥 = 𝑦))
46	45	ad2antrr 488	. . . . . . . . . . . 12 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → ∀𝑥 ∈ ℕ0 ∀𝑦 ∈ ℕ0 ((◡𝑔‘𝑥) = (◡𝑔‘𝑦) → 𝑥 = 𝑦))
47	31	adantr 276	. . . . . . . . . . . . 13 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → (𝑛 + 1) ∈ ℕ0)
48		fveqeq2 5570	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = (𝑛 + 1) → ((◡𝑔‘𝑥) = (◡𝑔‘𝑦) ↔ (◡𝑔‘(𝑛 + 1)) = (◡𝑔‘𝑦)))
49		eqeq1 2203	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = (𝑛 + 1) → (𝑥 = 𝑦 ↔ (𝑛 + 1) = 𝑦))
50	48, 49	imbi12d 234	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (𝑛 + 1) → (((◡𝑔‘𝑥) = (◡𝑔‘𝑦) → 𝑥 = 𝑦) ↔ ((◡𝑔‘(𝑛 + 1)) = (◡𝑔‘𝑦) → (𝑛 + 1) = 𝑦)))
51		fveq2 5561	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑗 → (◡𝑔‘𝑦) = (◡𝑔‘𝑗))
52	51	eqeq2d 2208	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑗 → ((◡𝑔‘(𝑛 + 1)) = (◡𝑔‘𝑦) ↔ (◡𝑔‘(𝑛 + 1)) = (◡𝑔‘𝑗)))
53		eqeq2 2206	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑗 → ((𝑛 + 1) = 𝑦 ↔ (𝑛 + 1) = 𝑗))
54	52, 53	imbi12d 234	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑗 → (((◡𝑔‘(𝑛 + 1)) = (◡𝑔‘𝑦) → (𝑛 + 1) = 𝑦) ↔ ((◡𝑔‘(𝑛 + 1)) = (◡𝑔‘𝑗) → (𝑛 + 1) = 𝑗)))
55	50, 54	rspc2v 2881	. . . . . . . . . . . . 13 ⊢ (((𝑛 + 1) ∈ ℕ0 ∧ 𝑗 ∈ ℕ0) → (∀𝑥 ∈ ℕ0 ∀𝑦 ∈ ℕ0 ((◡𝑔‘𝑥) = (◡𝑔‘𝑦) → 𝑥 = 𝑦) → ((◡𝑔‘(𝑛 + 1)) = (◡𝑔‘𝑗) → (𝑛 + 1) = 𝑗)))
56	47, 33, 55	syl2anc 411	. . . . . . . . . . . 12 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → (∀𝑥 ∈ ℕ0 ∀𝑦 ∈ ℕ0 ((◡𝑔‘𝑥) = (◡𝑔‘𝑦) → 𝑥 = 𝑦) → ((◡𝑔‘(𝑛 + 1)) = (◡𝑔‘𝑗) → (𝑛 + 1) = 𝑗)))
57	46, 56	mpd 13	. . . . . . . . . . 11 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → ((◡𝑔‘(𝑛 + 1)) = (◡𝑔‘𝑗) → (𝑛 + 1) = 𝑗))
58	42, 57	mtod 664	. . . . . . . . . 10 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → ¬ (◡𝑔‘(𝑛 + 1)) = (◡𝑔‘𝑗))
59	58	neqned 2374	. . . . . . . . 9 ⊢ (((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) ∧ 𝑗 ∈ (0...𝑛)) → (◡𝑔‘(𝑛 + 1)) ≠ (◡𝑔‘𝑗))
60	59	ralrimiva 2570	. . . . . . . 8 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) → ∀𝑗 ∈ (0...𝑛)(◡𝑔‘(𝑛 + 1)) ≠ (◡𝑔‘𝑗))
61		fveq2 5561	. . . . . . . . . . 11 ⊢ (𝑘 = (𝑛 + 1) → (◡𝑔‘𝑘) = (◡𝑔‘(𝑛 + 1)))
62	61	neeq1d 2385	. . . . . . . . . 10 ⊢ (𝑘 = (𝑛 + 1) → ((◡𝑔‘𝑘) ≠ (◡𝑔‘𝑗) ↔ (◡𝑔‘(𝑛 + 1)) ≠ (◡𝑔‘𝑗)))
63	62	ralbidv 2497	. . . . . . . . 9 ⊢ (𝑘 = (𝑛 + 1) → (∀𝑗 ∈ (0...𝑛)(◡𝑔‘𝑘) ≠ (◡𝑔‘𝑗) ↔ ∀𝑗 ∈ (0...𝑛)(◡𝑔‘(𝑛 + 1)) ≠ (◡𝑔‘𝑗)))
64	63	rspcev 2868	. . . . . . . 8 ⊢ (((𝑛 + 1) ∈ ℕ0 ∧ ∀𝑗 ∈ (0...𝑛)(◡𝑔‘(𝑛 + 1)) ≠ (◡𝑔‘𝑗)) → ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(◡𝑔‘𝑘) ≠ (◡𝑔‘𝑗))
65	31, 60, 64	syl2anc 411	. . . . . . 7 ⊢ ((𝑔:𝐴–1-1-onto→ℕ0 ∧ 𝑛 ∈ ℕ0) → ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(◡𝑔‘𝑘) ≠ (◡𝑔‘𝑗))
66	65	ralrimiva 2570	. . . . . 6 ⊢ (𝑔:𝐴–1-1-onto→ℕ0 → ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(◡𝑔‘𝑘) ≠ (◡𝑔‘𝑗))
67		cnvexg 5208	. . . . . . . 8 ⊢ (𝑔 ∈ V → ◡𝑔 ∈ V)
68	67	elv 2767	. . . . . . 7 ⊢ ◡𝑔 ∈ V
69		foeq1 5479	. . . . . . . 8 ⊢ (𝑓 = ◡𝑔 → (𝑓:ℕ0–onto→𝐴 ↔ ◡𝑔:ℕ0–onto→𝐴))
70		fveq1 5560	. . . . . . . . . . 11 ⊢ (𝑓 = ◡𝑔 → (𝑓‘𝑘) = (◡𝑔‘𝑘))
71		fveq1 5560	. . . . . . . . . . 11 ⊢ (𝑓 = ◡𝑔 → (𝑓‘𝑗) = (◡𝑔‘𝑗))
72	70, 71	neeq12d 2387	. . . . . . . . . 10 ⊢ (𝑓 = ◡𝑔 → ((𝑓‘𝑘) ≠ (𝑓‘𝑗) ↔ (◡𝑔‘𝑘) ≠ (◡𝑔‘𝑗)))
73	72	rexralbidv 2523	. . . . . . . . 9 ⊢ (𝑓 = ◡𝑔 → (∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝑓‘𝑘) ≠ (𝑓‘𝑗) ↔ ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(◡𝑔‘𝑘) ≠ (◡𝑔‘𝑗)))
74	73	ralbidv 2497	. . . . . . . 8 ⊢ (𝑓 = ◡𝑔 → (∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝑓‘𝑘) ≠ (𝑓‘𝑗) ↔ ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(◡𝑔‘𝑘) ≠ (◡𝑔‘𝑗)))
75	69, 74	anbi12d 473	. . . . . . 7 ⊢ (𝑓 = ◡𝑔 → ((𝑓:ℕ0–onto→𝐴 ∧ ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝑓‘𝑘) ≠ (𝑓‘𝑗)) ↔ (◡𝑔:ℕ0–onto→𝐴 ∧ ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(◡𝑔‘𝑘) ≠ (◡𝑔‘𝑗))))
76	68, 75	spcev 2859	. . . . . 6 ⊢ ((◡𝑔:ℕ0–onto→𝐴 ∧ ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(◡𝑔‘𝑘) ≠ (◡𝑔‘𝑗)) → ∃𝑓(𝑓:ℕ0–onto→𝐴 ∧ ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝑓‘𝑘) ≠ (𝑓‘𝑗)))
77	29, 66, 76	syl2anc 411	. . . . 5 ⊢ (𝑔:𝐴–1-1-onto→ℕ0 → ∃𝑓(𝑓:ℕ0–onto→𝐴 ∧ ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝑓‘𝑘) ≠ (𝑓‘𝑗)))
78	26, 77	jca 306	. . . 4 ⊢ (𝑔:𝐴–1-1-onto→ℕ0 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ℕ0–onto→𝐴 ∧ ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝑓‘𝑘) ≠ (𝑓‘𝑗))))
79	78	adantl 277	. . 3 ⊢ ((𝐴 ≈ ℕ0 ∧ 𝑔:𝐴–1-1-onto→ℕ0) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ℕ0–onto→𝐴 ∧ ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝑓‘𝑘) ≠ (𝑓‘𝑗))))
80	6, 79	exlimddv 1913	. 2 ⊢ (𝐴 ≈ ℕ0 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ℕ0–onto→𝐴 ∧ ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝑓‘𝑘) ≠ (𝑓‘𝑗))))
81	4, 80	syl 14	1 ⊢ (𝐴 ≈ ℕ → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ℕ0–onto→𝐴 ∧ ∀𝑛 ∈ ℕ0 ∃𝑘 ∈ ℕ0 ∀𝑗 ∈ (0...𝑛)(𝑓‘𝑘) ≠ (𝑓‘𝑗))))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  DECID wdc 835   ∧ w3a 980   = wceq 1364  ∃wex 1506   ∈ wcel 2167   ≠ wne 2367  ∀wral 2475  ∃wrex 2476  Vcvv 2763   class class class wbr 4034  ^◡ccnv 4663  ran crn 4665   Fn wfn 5254  ⟶wf 5255  –onto→wfo 5257  –1-1-onto→wf1o 5258  ‘cfv 5259  (class class class)co 5925   ≈ cen 6806  0cc0 7896  1c1 7897   + caddc 7899   < clt 8078   ≤ cle 8079  ℕcn 9007  ℕ₀cn0 9266  ℤcz 9343  ...cfz 10100

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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-ltadd 8012

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-er 6601  df-en 6809  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-inn 9008  df-n0 9267  df-z 9344  df-uz 9619  df-fz 10101

This theorem is referenced by:  ennnfone  12667