Theorem eulerpartlemb 31028

Description: Lemma for eulerpart 31042. The set of all partitions of 𝑁 is finite. (Contributed by Mario Carneiro, 26-Jan-2015.)

Hypotheses

Ref	Expression
eulerpart.p	⊢ 𝑃 = {𝑓 ∈ (ℕ0 ↑𝑚 ℕ) ∣ ((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁)}
eulerpart.o	⊢ 𝑂 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ (◡𝑔 “ ℕ) ¬ 2 ∥ 𝑛}
eulerpart.d	⊢ 𝐷 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ ℕ (𝑔‘𝑛) ≤ 1}
eulerpart.j	⊢ 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
eulerpart.f	⊢ 𝐹 = (𝑥 ∈ 𝐽, 𝑦 ∈ ℕ0 ↦ ((2↑𝑦) · 𝑥))
eulerpart.h	⊢ 𝐻 = {𝑟 ∈ ((𝒫 ℕ0 ∩ Fin) ↑𝑚 𝐽) ∣ (𝑟 supp ∅) ∈ Fin}
eulerpart.m	⊢ 𝑀 = (𝑟 ∈ 𝐻 ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ (𝑟‘𝑥))})

Assertion

Ref	Expression
eulerpartlemb	⊢ 𝑃 ∈ Fin

Distinct variable groups:   𝑓,𝑔,𝑘,𝑥,𝑦   𝑓,𝑁,𝑔,𝑥   𝑃,𝑔

Allowed substitution hints:   𝐷(𝑥,𝑦,𝑧,𝑓,𝑔,𝑘,𝑛,𝑟)   𝑃(𝑥,𝑦,𝑧,𝑓,𝑘,𝑛,𝑟)   𝐹(𝑥,𝑦,𝑧,𝑓,𝑔,𝑘,𝑛,𝑟)   𝐻(𝑥,𝑦,𝑧,𝑓,𝑔,𝑘,𝑛,𝑟)   𝐽(𝑥,𝑦,𝑧,𝑓,𝑔,𝑘,𝑛,𝑟)   𝑀(𝑥,𝑦,𝑧,𝑓,𝑔,𝑘,𝑛,𝑟)   𝑁(𝑦,𝑧,𝑘,𝑛,𝑟)   𝑂(𝑥,𝑦,𝑧,𝑓,𝑔,𝑘,𝑛,𝑟)

Proof of Theorem eulerpartlemb

Step	Hyp	Ref	Expression
1		fzfid 13091	. . . 4 ⊢ (⊤ → (1...𝑁) ∈ Fin)
2		fzfi 13090	. . . . . 6 ⊢ (0...𝑁) ∈ Fin
3		snfi 8326	. . . . . 6 ⊢ {0} ∈ Fin
4	2, 3	ifcli 4353	. . . . 5 ⊢ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}) ∈ Fin
5	4	a1i 11	. . . 4 ⊢ ((⊤ ∧ 𝑥 ∈ ℕ) → if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}) ∈ Fin)
6		eldifn 3956	. . . . . 6 ⊢ (𝑥 ∈ (ℕ ∖ (1...𝑁)) → ¬ 𝑥 ∈ (1...𝑁))
7	6	adantl 475	. . . . 5 ⊢ ((⊤ ∧ 𝑥 ∈ (ℕ ∖ (1...𝑁))) → ¬ 𝑥 ∈ (1...𝑁))
8		iffalse 4316	. . . . 5 ⊢ (¬ 𝑥 ∈ (1...𝑁) → if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}) = {0})
9		eqimss 3876	. . . . 5 ⊢ (if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}) = {0} → if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}) ⊆ {0})
10	7, 8, 9	3syl 18	. . . 4 ⊢ ((⊤ ∧ 𝑥 ∈ (ℕ ∖ (1...𝑁))) → if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}) ⊆ {0})
11	1, 5, 10	ixpfi2 8552	. . 3 ⊢ (⊤ → X𝑥 ∈ ℕ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}) ∈ Fin)
12	11	mptru 1609	. 2 ⊢ X𝑥 ∈ ℕ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}) ∈ Fin
13		eulerpart.p	. . . . 5 ⊢ 𝑃 = {𝑓 ∈ (ℕ0 ↑𝑚 ℕ) ∣ ((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁)}
14	13	eulerpartleme 31023	. . . 4 ⊢ (𝑔 ∈ 𝑃 ↔ (𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁))
15		ffn 6291	. . . . . 6 ⊢ (𝑔:ℕ⟶ℕ0 → 𝑔 Fn ℕ)
16	15	3ad2ant1 1124	. . . . 5 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) → 𝑔 Fn ℕ)
17		ffvelrn 6621	. . . . . . . . . . . . 13 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ 𝑥 ∈ ℕ) → (𝑔‘𝑥) ∈ ℕ0)
18	17	3ad2antl1 1193	. . . . . . . . . . . 12 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (𝑔‘𝑥) ∈ ℕ0)
19	18	nn0red 11703	. . . . . . . . . . 11 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (𝑔‘𝑥) ∈ ℝ)
20		nnre 11382	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℕ → 𝑥 ∈ ℝ)
21	20	adantl 475	. . . . . . . . . . . 12 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → 𝑥 ∈ ℝ)
22	19, 21	remulcld 10407	. . . . . . . . . . 11 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → ((𝑔‘𝑥) · 𝑥) ∈ ℝ)
23		cnvimass 5739	. . . . . . . . . . . . . . . . . 18 ⊢ (◡𝑔 “ ℕ) ⊆ dom 𝑔
24		fdm 6299	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑔:ℕ⟶ℕ0 → dom 𝑔 = ℕ)
25	24	adantr 474	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → dom 𝑔 = ℕ)
26	23, 25	syl5sseq 3872	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → (◡𝑔 “ ℕ) ⊆ ℕ)
27	26	sselda 3821	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑘 ∈ (◡𝑔 “ ℕ)) → 𝑘 ∈ ℕ)
28		ffvelrn 6621	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ 𝑘 ∈ ℕ) → (𝑔‘𝑘) ∈ ℕ0)
29	28	adantlr 705	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑘 ∈ ℕ) → (𝑔‘𝑘) ∈ ℕ0)
30	27, 29	syldan 585	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑘 ∈ (◡𝑔 “ ℕ)) → (𝑔‘𝑘) ∈ ℕ0)
31	27	nnnn0d 11702	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑘 ∈ (◡𝑔 “ ℕ)) → 𝑘 ∈ ℕ0)
32	30, 31	nn0mulcld 11707	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑘 ∈ (◡𝑔 “ ℕ)) → ((𝑔‘𝑘) · 𝑘) ∈ ℕ0)
33	32	nn0cnd 11704	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑘 ∈ (◡𝑔 “ ℕ)) → ((𝑔‘𝑘) · 𝑘) ∈ ℂ)
34		simpl 476	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → 𝑔:ℕ⟶ℕ0)
35		nnex 11381	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ℕ ∈ V
36		frnnn0supp 11700	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((ℕ ∈ V ∧ 𝑔:ℕ⟶ℕ0) → (𝑔 supp 0) = (◡𝑔 “ ℕ))
37	35, 36	mpan 680	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑔:ℕ⟶ℕ0 → (𝑔 supp 0) = (◡𝑔 “ ℕ))
38	37	adantr 474	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → (𝑔 supp 0) = (◡𝑔 “ ℕ))
39		eqimss 3876	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑔 supp 0) = (◡𝑔 “ ℕ) → (𝑔 supp 0) ⊆ (◡𝑔 “ ℕ))
40	38, 39	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → (𝑔 supp 0) ⊆ (◡𝑔 “ ℕ))
41	35	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → ℕ ∈ V)
42		0nn0 11659	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 0 ∈ ℕ0
43	42	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → 0 ∈ ℕ0)
44	34, 40, 41, 43	suppssr 7608	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑘 ∈ (ℕ ∖ (◡𝑔 “ ℕ))) → (𝑔‘𝑘) = 0)
45	44	oveq1d 6937	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑘 ∈ (ℕ ∖ (◡𝑔 “ ℕ))) → ((𝑔‘𝑘) · 𝑘) = (0 · 𝑘))
46		eldifi 3955	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ (ℕ ∖ (◡𝑔 “ ℕ)) → 𝑘 ∈ ℕ)
47	46	adantl 475	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑘 ∈ (ℕ ∖ (◡𝑔 “ ℕ))) → 𝑘 ∈ ℕ)
48		nncn 11383	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℂ)
49		mul02 10554	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ ℂ → (0 · 𝑘) = 0)
50	47, 48, 49	3syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑘 ∈ (ℕ ∖ (◡𝑔 “ ℕ))) → (0 · 𝑘) = 0)
51	45, 50	eqtrd 2814	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑘 ∈ (ℕ ∖ (◡𝑔 “ ℕ))) → ((𝑔‘𝑘) · 𝑘) = 0)
52		nnuz 12029	. . . . . . . . . . . . . . . . . . 19 ⊢ ℕ = (ℤ≥‘1)
53	52	eqimssi 3878	. . . . . . . . . . . . . . . . . 18 ⊢ ℕ ⊆ (ℤ≥‘1)
54	53	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → ℕ ⊆ (ℤ≥‘1))
55	26, 33, 51, 54	sumss 14862	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → Σ𝑘 ∈ (◡𝑔 “ ℕ)((𝑔‘𝑘) · 𝑘) = Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘))
56		simpr 479	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → (◡𝑔 “ ℕ) ∈ Fin)
57	56, 32	fsumnn0cl 14874	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → Σ𝑘 ∈ (◡𝑔 “ ℕ)((𝑔‘𝑘) · 𝑘) ∈ ℕ0)
58	55, 57	eqeltrrd 2860	. . . . . . . . . . . . . . 15 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) ∈ ℕ0)
59		eleq1 2847	. . . . . . . . . . . . . . 15 ⊢ (Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁 → (Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) ∈ ℕ0 ↔ 𝑁 ∈ ℕ0))
60	58, 59	syl5ibcom 237	. . . . . . . . . . . . . 14 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → (Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁 → 𝑁 ∈ ℕ0))
61	60	3impia 1106	. . . . . . . . . . . . 13 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) → 𝑁 ∈ ℕ0)
62	61	adantr 474	. . . . . . . . . . . 12 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → 𝑁 ∈ ℕ0)
63	62	nn0red 11703	. . . . . . . . . . 11 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → 𝑁 ∈ ℝ)
64	18	nn0ge0d 11705	. . . . . . . . . . . 12 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → 0 ≤ (𝑔‘𝑥))
65		nnge1 11404	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℕ → 1 ≤ 𝑥)
66	65	adantl 475	. . . . . . . . . . . 12 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → 1 ≤ 𝑥)
67	19, 21, 64, 66	lemulge11d 11315	. . . . . . . . . . 11 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (𝑔‘𝑥) ≤ ((𝑔‘𝑥) · 𝑥))
68	56	adantr 474	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ (𝑥 ∈ ℕ ∧ 𝑥 ∈ (◡𝑔 “ ℕ))) → (◡𝑔 “ ℕ) ∈ Fin)
69	32	nn0red 11703	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑘 ∈ (◡𝑔 “ ℕ)) → ((𝑔‘𝑘) · 𝑘) ∈ ℝ)
70	69	adantlr 705	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ (𝑥 ∈ ℕ ∧ 𝑥 ∈ (◡𝑔 “ ℕ))) ∧ 𝑘 ∈ (◡𝑔 “ ℕ)) → ((𝑔‘𝑘) · 𝑘) ∈ ℝ)
71	32	nn0ge0d 11705	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑘 ∈ (◡𝑔 “ ℕ)) → 0 ≤ ((𝑔‘𝑘) · 𝑘))
72	71	adantlr 705	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ (𝑥 ∈ ℕ ∧ 𝑥 ∈ (◡𝑔 “ ℕ))) ∧ 𝑘 ∈ (◡𝑔 “ ℕ)) → 0 ≤ ((𝑔‘𝑘) · 𝑘))
73		fveq2 6446	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 = 𝑥 → (𝑔‘𝑘) = (𝑔‘𝑥))
74		id 22	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 = 𝑥 → 𝑘 = 𝑥)
75	73, 74	oveq12d 6940	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = 𝑥 → ((𝑔‘𝑘) · 𝑘) = ((𝑔‘𝑥) · 𝑥))
76		simprr 763	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ (𝑥 ∈ ℕ ∧ 𝑥 ∈ (◡𝑔 “ ℕ))) → 𝑥 ∈ (◡𝑔 “ ℕ))
77	68, 70, 72, 75, 76	fsumge1 14933	. . . . . . . . . . . . . . . 16 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ (𝑥 ∈ ℕ ∧ 𝑥 ∈ (◡𝑔 “ ℕ))) → ((𝑔‘𝑥) · 𝑥) ≤ Σ𝑘 ∈ (◡𝑔 “ ℕ)((𝑔‘𝑘) · 𝑘))
78	77	expr 450	. . . . . . . . . . . . . . 15 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑥 ∈ ℕ) → (𝑥 ∈ (◡𝑔 “ ℕ) → ((𝑔‘𝑥) · 𝑥) ≤ Σ𝑘 ∈ (◡𝑔 “ ℕ)((𝑔‘𝑘) · 𝑘)))
79		eldif 3802	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ (ℕ ∖ (◡𝑔 “ ℕ)) ↔ (𝑥 ∈ ℕ ∧ ¬ 𝑥 ∈ (◡𝑔 “ ℕ)))
80	51	ralrimiva 3148	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) → ∀𝑘 ∈ (ℕ ∖ (◡𝑔 “ ℕ))((𝑔‘𝑘) · 𝑘) = 0)
81	75	eqeq1d 2780	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 = 𝑥 → (((𝑔‘𝑘) · 𝑘) = 0 ↔ ((𝑔‘𝑥) · 𝑥) = 0))
82	81	rspccva 3510	. . . . . . . . . . . . . . . . . . 19 ⊢ ((∀𝑘 ∈ (ℕ ∖ (◡𝑔 “ ℕ))((𝑔‘𝑘) · 𝑘) = 0 ∧ 𝑥 ∈ (ℕ ∖ (◡𝑔 “ ℕ))) → ((𝑔‘𝑥) · 𝑥) = 0)
83	80, 82	sylan 575	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑥 ∈ (ℕ ∖ (◡𝑔 “ ℕ))) → ((𝑔‘𝑥) · 𝑥) = 0)
84	79, 83	sylan2br 588	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ (𝑥 ∈ ℕ ∧ ¬ 𝑥 ∈ (◡𝑔 “ ℕ))) → ((𝑔‘𝑥) · 𝑥) = 0)
85	56	adantr 474	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑥 ∈ ℕ) → (◡𝑔 “ ℕ) ∈ Fin)
86	32	adantlr 705	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑥 ∈ ℕ) ∧ 𝑘 ∈ (◡𝑔 “ ℕ)) → ((𝑔‘𝑘) · 𝑘) ∈ ℕ0)
87	86	nn0red 11703	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑥 ∈ ℕ) ∧ 𝑘 ∈ (◡𝑔 “ ℕ)) → ((𝑔‘𝑘) · 𝑘) ∈ ℝ)
88	86	nn0ge0d 11705	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑥 ∈ ℕ) ∧ 𝑘 ∈ (◡𝑔 “ ℕ)) → 0 ≤ ((𝑔‘𝑘) · 𝑘))
89	85, 87, 88	fsumge0 14931	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑥 ∈ ℕ) → 0 ≤ Σ𝑘 ∈ (◡𝑔 “ ℕ)((𝑔‘𝑘) · 𝑘))
90	89	adantrr 707	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ (𝑥 ∈ ℕ ∧ ¬ 𝑥 ∈ (◡𝑔 “ ℕ))) → 0 ≤ Σ𝑘 ∈ (◡𝑔 “ ℕ)((𝑔‘𝑘) · 𝑘))
91	84, 90	eqbrtrd 4908	. . . . . . . . . . . . . . . 16 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ (𝑥 ∈ ℕ ∧ ¬ 𝑥 ∈ (◡𝑔 “ ℕ))) → ((𝑔‘𝑥) · 𝑥) ≤ Σ𝑘 ∈ (◡𝑔 “ ℕ)((𝑔‘𝑘) · 𝑘))
92	91	expr 450	. . . . . . . . . . . . . . 15 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑥 ∈ ℕ) → (¬ 𝑥 ∈ (◡𝑔 “ ℕ) → ((𝑔‘𝑥) · 𝑥) ≤ Σ𝑘 ∈ (◡𝑔 “ ℕ)((𝑔‘𝑘) · 𝑘)))
93	78, 92	pm2.61d 172	. . . . . . . . . . . . . 14 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑥 ∈ ℕ) → ((𝑔‘𝑥) · 𝑥) ≤ Σ𝑘 ∈ (◡𝑔 “ ℕ)((𝑔‘𝑘) · 𝑘))
94	55	adantr 474	. . . . . . . . . . . . . 14 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑥 ∈ ℕ) → Σ𝑘 ∈ (◡𝑔 “ ℕ)((𝑔‘𝑘) · 𝑘) = Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘))
95	93, 94	breqtrd 4912	. . . . . . . . . . . . 13 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin) ∧ 𝑥 ∈ ℕ) → ((𝑔‘𝑥) · 𝑥) ≤ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘))
96	95	3adantl3 1170	. . . . . . . . . . . 12 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → ((𝑔‘𝑥) · 𝑥) ≤ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘))
97		simpl3 1203	. . . . . . . . . . . 12 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁)
98	96, 97	breqtrd 4912	. . . . . . . . . . 11 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → ((𝑔‘𝑥) · 𝑥) ≤ 𝑁)
99	19, 22, 63, 67, 98	letrd 10533	. . . . . . . . . 10 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (𝑔‘𝑥) ≤ 𝑁)
100		nn0uz 12028	. . . . . . . . . . . 12 ⊢ ℕ0 = (ℤ≥‘0)
101	18, 100	syl6eleq 2869	. . . . . . . . . . 11 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (𝑔‘𝑥) ∈ (ℤ≥‘0))
102	62	nn0zd 11832	. . . . . . . . . . 11 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → 𝑁 ∈ ℤ)
103		elfz5 12651	. . . . . . . . . . 11 ⊢ (((𝑔‘𝑥) ∈ (ℤ≥‘0) ∧ 𝑁 ∈ ℤ) → ((𝑔‘𝑥) ∈ (0...𝑁) ↔ (𝑔‘𝑥) ≤ 𝑁))
104	101, 102, 103	syl2anc 579	. . . . . . . . . 10 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → ((𝑔‘𝑥) ∈ (0...𝑁) ↔ (𝑔‘𝑥) ≤ 𝑁))
105	99, 104	mpbird 249	. . . . . . . . 9 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (𝑔‘𝑥) ∈ (0...𝑁))
106	105	adantr 474	. . . . . . . 8 ⊢ ((((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ∈ (1...𝑁)) → (𝑔‘𝑥) ∈ (0...𝑁))
107		iftrue 4313	. . . . . . . . 9 ⊢ (𝑥 ∈ (1...𝑁) → if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}) = (0...𝑁))
108	107	adantl 475	. . . . . . . 8 ⊢ ((((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ∈ (1...𝑁)) → if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}) = (0...𝑁))
109	106, 108	eleqtrrd 2862	. . . . . . 7 ⊢ ((((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ∈ (1...𝑁)) → (𝑔‘𝑥) ∈ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}))
110		nnge1 11404	. . . . . . . . . . . . . 14 ⊢ ((𝑔‘𝑥) ∈ ℕ → 1 ≤ (𝑔‘𝑥))
111		nnnn0 11650	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ℕ → 𝑥 ∈ ℕ0)
112	111	adantl 475	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → 𝑥 ∈ ℕ0)
113	112	nn0ge0d 11705	. . . . . . . . . . . . . . . 16 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → 0 ≤ 𝑥)
114		lemulge12 11240	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∈ ℝ ∧ (𝑔‘𝑥) ∈ ℝ) ∧ (0 ≤ 𝑥 ∧ 1 ≤ (𝑔‘𝑥))) → 𝑥 ≤ ((𝑔‘𝑥) · 𝑥))
115	114	expr 450	. . . . . . . . . . . . . . . 16 ⊢ (((𝑥 ∈ ℝ ∧ (𝑔‘𝑥) ∈ ℝ) ∧ 0 ≤ 𝑥) → (1 ≤ (𝑔‘𝑥) → 𝑥 ≤ ((𝑔‘𝑥) · 𝑥)))
116	21, 19, 113, 115	syl21anc 828	. . . . . . . . . . . . . . 15 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (1 ≤ (𝑔‘𝑥) → 𝑥 ≤ ((𝑔‘𝑥) · 𝑥)))
117		letr 10470	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ ∧ ((𝑔‘𝑥) · 𝑥) ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝑥 ≤ ((𝑔‘𝑥) · 𝑥) ∧ ((𝑔‘𝑥) · 𝑥) ≤ 𝑁) → 𝑥 ≤ 𝑁))
118	21, 22, 63, 117	syl3anc 1439	. . . . . . . . . . . . . . . 16 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → ((𝑥 ≤ ((𝑔‘𝑥) · 𝑥) ∧ ((𝑔‘𝑥) · 𝑥) ≤ 𝑁) → 𝑥 ≤ 𝑁))
119	98, 118	mpan2d 684	. . . . . . . . . . . . . . 15 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (𝑥 ≤ ((𝑔‘𝑥) · 𝑥) → 𝑥 ≤ 𝑁))
120	116, 119	syld 47	. . . . . . . . . . . . . 14 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (1 ≤ (𝑔‘𝑥) → 𝑥 ≤ 𝑁))
121	110, 120	syl5 34	. . . . . . . . . . . . 13 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → ((𝑔‘𝑥) ∈ ℕ → 𝑥 ≤ 𝑁))
122		simpr 479	. . . . . . . . . . . . . . 15 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → 𝑥 ∈ ℕ)
123	122, 52	syl6eleq 2869	. . . . . . . . . . . . . 14 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → 𝑥 ∈ (ℤ≥‘1))
124		elfz5 12651	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ (ℤ≥‘1) ∧ 𝑁 ∈ ℤ) → (𝑥 ∈ (1...𝑁) ↔ 𝑥 ≤ 𝑁))
125	123, 102, 124	syl2anc 579	. . . . . . . . . . . . 13 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (𝑥 ∈ (1...𝑁) ↔ 𝑥 ≤ 𝑁))
126	121, 125	sylibrd 251	. . . . . . . . . . . 12 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → ((𝑔‘𝑥) ∈ ℕ → 𝑥 ∈ (1...𝑁)))
127	126	con3d 150	. . . . . . . . . . 11 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (¬ 𝑥 ∈ (1...𝑁) → ¬ (𝑔‘𝑥) ∈ ℕ))
128		elnn0 11644	. . . . . . . . . . . . 13 ⊢ ((𝑔‘𝑥) ∈ ℕ0 ↔ ((𝑔‘𝑥) ∈ ℕ ∨ (𝑔‘𝑥) = 0))
129	18, 128	sylib 210	. . . . . . . . . . . 12 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → ((𝑔‘𝑥) ∈ ℕ ∨ (𝑔‘𝑥) = 0))
130	129	ord 853	. . . . . . . . . . 11 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (¬ (𝑔‘𝑥) ∈ ℕ → (𝑔‘𝑥) = 0))
131	127, 130	syld 47	. . . . . . . . . 10 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (¬ 𝑥 ∈ (1...𝑁) → (𝑔‘𝑥) = 0))
132	131	imp 397	. . . . . . . . 9 ⊢ ((((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) ∧ ¬ 𝑥 ∈ (1...𝑁)) → (𝑔‘𝑥) = 0)
133		fvex 6459	. . . . . . . . . 10 ⊢ (𝑔‘𝑥) ∈ V
134	133	elsn 4413	. . . . . . . . 9 ⊢ ((𝑔‘𝑥) ∈ {0} ↔ (𝑔‘𝑥) = 0)
135	132, 134	sylibr 226	. . . . . . . 8 ⊢ ((((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) ∧ ¬ 𝑥 ∈ (1...𝑁)) → (𝑔‘𝑥) ∈ {0})
136	8	adantl 475	. . . . . . . 8 ⊢ ((((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) ∧ ¬ 𝑥 ∈ (1...𝑁)) → if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}) = {0})
137	135, 136	eleqtrrd 2862	. . . . . . 7 ⊢ ((((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) ∧ ¬ 𝑥 ∈ (1...𝑁)) → (𝑔‘𝑥) ∈ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}))
138	109, 137	pm2.61dan 803	. . . . . 6 ⊢ (((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) ∧ 𝑥 ∈ ℕ) → (𝑔‘𝑥) ∈ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}))
139	138	ralrimiva 3148	. . . . 5 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) → ∀𝑥 ∈ ℕ (𝑔‘𝑥) ∈ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}))
140		vex 3401	. . . . . 6 ⊢ 𝑔 ∈ V
141	140	elixp 8201	. . . . 5 ⊢ (𝑔 ∈ X𝑥 ∈ ℕ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}) ↔ (𝑔 Fn ℕ ∧ ∀𝑥 ∈ ℕ (𝑔‘𝑥) ∈ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0})))
142	16, 139, 141	sylanbrc 578	. . . 4 ⊢ ((𝑔:ℕ⟶ℕ0 ∧ (◡𝑔 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑔‘𝑘) · 𝑘) = 𝑁) → 𝑔 ∈ X𝑥 ∈ ℕ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}))
143	14, 142	sylbi 209	. . 3 ⊢ (𝑔 ∈ 𝑃 → 𝑔 ∈ X𝑥 ∈ ℕ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}))
144	143	ssriv 3825	. 2 ⊢ 𝑃 ⊆ X𝑥 ∈ ℕ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0})
145		ssfi 8468	. 2 ⊢ ((X𝑥 ∈ ℕ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0}) ∈ Fin ∧ 𝑃 ⊆ X𝑥 ∈ ℕ if(𝑥 ∈ (1...𝑁), (0...𝑁), {0})) → 𝑃 ∈ Fin)
146	12, 144, 145	mp2an 682	1 ⊢ 𝑃 ∈ Fin

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 198   ∧ wa 386   ∨ wo 836   ∧ w3a 1071   = wceq 1601  ⊤wtru 1602   ∈ wcel 2107  ∀wral 3090  {crab 3094  Vcvv 3398   ∖ cdif 3789   ∩ cin 3791   ⊆ wss 3792  ∅c0 4141  ifcif 4307  𝒫 cpw 4379  {csn 4398   class class class wbr 4886  {copab 4948   ↦ cmpt 4965  ^◡ccnv 5354  dom cdm 5355   “ cima 5358   Fn wfn 6130  ⟶wf 6131  ‘cfv 6135  (class class class)co 6922   ↦ cmpt2 6924   supp csupp 7576   ↑_𝑚 cmap 8140  Xcixp 8194  Fincfn 8241  ℂcc 10270  ℝcr 10271  0cc0 10272  1c1 10273   · cmul 10277   ≤ cle 10412  ℕcn 11374  2c2 11430  ℕ₀cn0 11642  ℤcz 11728  ℤ_≥cuz 11992  ...cfz 12643  ↑cexp 13178  Σcsu 14824   ∥ cdvds 15387

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-8 2109  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-rep 5006  ax-sep 5017  ax-nul 5025  ax-pow 5077  ax-pr 5138  ax-un 7226  ax-inf2 8835  ax-cnex 10328  ax-resscn 10329  ax-1cn 10330  ax-icn 10331  ax-addcl 10332  ax-addrcl 10333  ax-mulcl 10334  ax-mulrcl 10335  ax-mulcom 10336  ax-addass 10337  ax-mulass 10338  ax-distr 10339  ax-i2m1 10340  ax-1ne0 10341  ax-1rid 10342  ax-rnegex 10343  ax-rrecex 10344  ax-cnre 10345  ax-pre-lttri 10346  ax-pre-lttrn 10347  ax-pre-ltadd 10348  ax-pre-mulgt0 10349  ax-pre-sup 10350

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3or 1072  df-3an 1073  df-tru 1605  df-fal 1615  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2551  df-eu 2587  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ne 2970  df-nel 3076  df-ral 3095  df-rex 3096  df-reu 3097  df-rmo 3098  df-rab 3099  df-v 3400  df-sbc 3653  df-csb 3752  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-pss 3808  df-nul 4142  df-if 4308  df-pw 4381  df-sn 4399  df-pr 4401  df-tp 4403  df-op 4405  df-uni 4672  df-int 4711  df-iun 4755  df-br 4887  df-opab 4949  df-mpt 4966  df-tr 4988  df-id 5261  df-eprel 5266  df-po 5274  df-so 5275  df-fr 5314  df-se 5315  df-we 5316  df-xp 5361  df-rel 5362  df-cnv 5363  df-co 5364  df-dm 5365  df-rn 5366  df-res 5367  df-ima 5368  df-pred 5933  df-ord 5979  df-on 5980  df-lim 5981  df-suc 5982  df-iota 6099  df-fun 6137  df-fn 6138  df-f 6139  df-f1 6140  df-fo 6141  df-f1o 6142  df-fv 6143  df-isom 6144  df-riota 6883  df-ov 6925  df-oprab 6926  df-mpt2 6927  df-om 7344  df-1st 7445  df-2nd 7446  df-supp 7577  df-wrecs 7689  df-recs 7751  df-rdg 7789  df-1o 7843  df-2o 7844  df-oadd 7847  df-er 8026  df-map 8142  df-pm 8143  df-ixp 8195  df-en 8242  df-dom 8243  df-sdom 8244  df-fin 8245  df-sup 8636  df-oi 8704  df-card 9098  df-pnf 10413  df-mnf 10414  df-xr 10415  df-ltxr 10416  df-le 10417  df-sub 10608  df-neg 10609  df-div 11033  df-nn 11375  df-2 11438  df-3 11439  df-n0 11643  df-z 11729  df-uz 11993  df-rp 12138  df-ico 12493  df-fz 12644  df-fzo 12785  df-seq 13120  df-exp 13179  df-hash 13436  df-cj 14246  df-re 14247  df-im 14248  df-sqrt 14382  df-abs 14383  df-clim 14627  df-sum 14825

This theorem is referenced by: (None)