Theorem sticksstones8 42845

Description: Establish mapping between strictly monotone functions and functions that sum to a fixed non-negative integer. (Contributed by metakunt, 1-Oct-2024.)

Hypotheses

Ref	Expression
sticksstones8.1	⊢ (𝜑 → 𝑁 ∈ ℕ0)
sticksstones8.2	⊢ (𝜑 → 𝐾 ∈ ℕ0)
sticksstones8.3	⊢ 𝐹 = (𝑎 ∈ 𝐴 ↦ (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))))
sticksstones8.4	⊢ 𝐴 = {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)}
sticksstones8.5	⊢ 𝐵 = {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...(𝑁 + 𝐾)) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))}

Assertion

Ref	Expression
sticksstones8	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)

Distinct variable groups:   𝐴,𝑎,𝑗,𝑙,𝑥,𝑦   𝐵,𝑎   𝑗,𝐾,𝑙,𝑓,𝑥,𝑦   𝑔,𝐾,𝑖   𝑓,𝑁,𝑗   𝑔,𝑁   𝑓,𝑎   𝑔,𝑎,𝑖   𝜑,𝑎,𝑗,𝑙   𝑖,𝑙   𝜑,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑓,𝑔,𝑖)   𝐴(𝑓,𝑔,𝑖)   𝐵(𝑥,𝑦,𝑓,𝑔,𝑖,𝑗,𝑙)   𝐹(𝑥,𝑦,𝑓,𝑔,𝑖,𝑗,𝑎,𝑙)   𝐾(𝑎)   𝑁(𝑥,𝑦,𝑖,𝑎,𝑙)

Proof of Theorem sticksstones8

Dummy variable 𝑒 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqidd 2770	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) → (𝑒 ∈ (1...𝐾) ↦ (𝑒 + Σ𝑙 ∈ (1...𝑒)(𝑎‘𝑙))) = (𝑒 ∈ (1...𝐾) ↦ (𝑒 + Σ𝑙 ∈ (1...𝑒)(𝑎‘𝑙))))
2		simpr 489	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) ∧ 𝑒 = 𝑗) → 𝑒 = 𝑗)
3	2	oveq2d 7427	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) ∧ 𝑒 = 𝑗) → (1...𝑒) = (1...𝑗))
4	3	sumeq1d 15751	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) ∧ 𝑒 = 𝑗) → Σ𝑙 ∈ (1...𝑒)(𝑎‘𝑙) = Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))
5	2, 4	oveq12d 7429	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) ∧ 𝑒 = 𝑗) → (𝑒 + Σ𝑙 ∈ (1...𝑒)(𝑎‘𝑙)) = (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))
6		simp3 1154	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) → 𝑗 ∈ (1...𝐾))
7		ovexd 7446	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) → (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)) ∈ V)
8	1, 5, 6, 7	fvmptd 6998	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) → ((𝑒 ∈ (1...𝐾) ↦ (𝑒 + Σ𝑙 ∈ (1...𝑒)(𝑎‘𝑙)))‘𝑗) = (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))
9		sticksstones8.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ0)
10	9	3ad2ant1 1149	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) → 𝑁 ∈ ℕ0)
11		sticksstones8.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ ℕ0)
12	11	3ad2ant1 1149	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) → 𝐾 ∈ ℕ0)
13		simpr 489	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ 𝐴)
14		sticksstones8.4	. . . . . . . . . . . . . . 15 ⊢ 𝐴 = {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)}
15	14	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝐴 = {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)})
16	15	eqcomd 2775	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)} = 𝐴)
17	13, 16	eleqtrrd 2872	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)})
18		feq1 6684	. . . . . . . . . . . . . . . 16 ⊢ (𝑔 = 𝑎 → (𝑔:(1...(𝐾 + 1))⟶ℕ0 ↔ 𝑎:(1...(𝐾 + 1))⟶ℕ0))
19		simpl 487	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑔 = 𝑎 ∧ 𝑖 ∈ (1...(𝐾 + 1))) → 𝑔 = 𝑎)
20	19	fveq1d 6884	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑔 = 𝑎 ∧ 𝑖 ∈ (1...(𝐾 + 1))) → (𝑔‘𝑖) = (𝑎‘𝑖))
21	20	sumeq2dv 15753	. . . . . . . . . . . . . . . . 17 ⊢ (𝑔 = 𝑎 → Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = Σ𝑖 ∈ (1...(𝐾 + 1))(𝑎‘𝑖))
22	21	eqeq1d 2771	. . . . . . . . . . . . . . . 16 ⊢ (𝑔 = 𝑎 → (Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁 ↔ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑎‘𝑖) = 𝑁))
23	18, 22	anbi12d 643	. . . . . . . . . . . . . . 15 ⊢ (𝑔 = 𝑎 → ((𝑔:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁) ↔ (𝑎:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑎‘𝑖) = 𝑁)))
24	23	elabg 3642	. . . . . . . . . . . . . 14 ⊢ (𝑎 ∈ 𝐴 → (𝑎 ∈ {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)} ↔ (𝑎:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑎‘𝑖) = 𝑁)))
25	13, 24	syl 18	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑎 ∈ {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)} ↔ (𝑎:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑎‘𝑖) = 𝑁)))
26	25	biimpd 232	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑎 ∈ {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)} → (𝑎:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑎‘𝑖) = 𝑁)))
27	17, 26	mpd 16	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑎:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑎‘𝑖) = 𝑁))
28	27	simpld 499	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎:(1...(𝐾 + 1))⟶ℕ0)
29	28	3adant3 1148	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) → 𝑎:(1...(𝐾 + 1))⟶ℕ0)
30		eqid 2769	. . . . . . . . 9 ⊢ (𝑒 ∈ (1...𝐾) ↦ (𝑒 + Σ𝑙 ∈ (1...𝑒)(𝑎‘𝑙))) = (𝑒 ∈ (1...𝐾) ↦ (𝑒 + Σ𝑙 ∈ (1...𝑒)(𝑎‘𝑙)))
31		fveq2 6882	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑙 → (𝑎‘𝑖) = (𝑎‘𝑙))
32		nfcv 2931	. . . . . . . . . . . 12 ⊢ Ⅎ𝑙(𝑎‘𝑖)
33		nfcv 2931	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝑎‘𝑙)
34	31, 32, 33	cbvsum 15746	. . . . . . . . . . 11 ⊢ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑎‘𝑖) = Σ𝑙 ∈ (1...(𝐾 + 1))(𝑎‘𝑙)
35	27	simprd 500	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ (1...(𝐾 + 1))(𝑎‘𝑖) = 𝑁)
36	34, 35	eqtr3id 2818	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑙 ∈ (1...(𝐾 + 1))(𝑎‘𝑙) = 𝑁)
37	36	3adant3 1148	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) → Σ𝑙 ∈ (1...(𝐾 + 1))(𝑎‘𝑙) = 𝑁)
38	10, 12, 29, 6, 30, 37	sticksstones7 42844	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) → ((𝑒 ∈ (1...𝐾) ↦ (𝑒 + Σ𝑙 ∈ (1...𝑒)(𝑎‘𝑙)))‘𝑗) ∈ (1...(𝑁 + 𝐾)))
39	8, 38	eqeltrrd 2870	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑗 ∈ (1...𝐾)) → (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)) ∈ (1...(𝑁 + 𝐾)))
40	39	3expa 1134	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑗 ∈ (1...𝐾)) → (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)) ∈ (1...(𝑁 + 𝐾)))
41		eqid 2769	. . . . . 6 ⊢ (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) = (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))
42	40, 41	fmptd 7110	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))):(1...𝐾)⟶(1...(𝑁 + 𝐾)))
43	9	ad3antrrr 742	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ (1...𝐾)) ∧ 𝑦 ∈ (1...𝐾)) → 𝑁 ∈ ℕ0)
44	43	adantr 485	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ (1...𝐾)) ∧ 𝑦 ∈ (1...𝐾)) ∧ 𝑥 < 𝑦) → 𝑁 ∈ ℕ0)
45	11	ad3antrrr 742	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ (1...𝐾)) ∧ 𝑦 ∈ (1...𝐾)) → 𝐾 ∈ ℕ0)
46	45	adantr 485	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ (1...𝐾)) ∧ 𝑦 ∈ (1...𝐾)) ∧ 𝑥 < 𝑦) → 𝐾 ∈ ℕ0)
47	24	adantl 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑎 ∈ {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)} ↔ (𝑎:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑎‘𝑖) = 𝑁)))
48	47	biimpd 232	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑎 ∈ {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)} → (𝑎:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑎‘𝑖) = 𝑁)))
49	17, 48	mpd 16	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑎:(1...(𝐾 + 1))⟶ℕ0 ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑎‘𝑖) = 𝑁))
50	49	simpld 499	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎:(1...(𝐾 + 1))⟶ℕ0)
51	50	adantr 485	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ (1...𝐾)) → 𝑎:(1...(𝐾 + 1))⟶ℕ0)
52	51	adantr 485	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ (1...𝐾)) ∧ 𝑦 ∈ (1...𝐾)) → 𝑎:(1...(𝐾 + 1))⟶ℕ0)
53	52	adantr 485	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ (1...𝐾)) ∧ 𝑦 ∈ (1...𝐾)) ∧ 𝑥 < 𝑦) → 𝑎:(1...(𝐾 + 1))⟶ℕ0)
54		simpllr 787	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ (1...𝐾)) ∧ 𝑦 ∈ (1...𝐾)) ∧ 𝑥 < 𝑦) → 𝑥 ∈ (1...𝐾))
55		simplr 780	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ (1...𝐾)) ∧ 𝑦 ∈ (1...𝐾)) ∧ 𝑥 < 𝑦) → 𝑦 ∈ (1...𝐾))
56		simpr 489	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ (1...𝐾)) ∧ 𝑦 ∈ (1...𝐾)) ∧ 𝑥 < 𝑦) → 𝑥 < 𝑦)
57	44, 46, 53, 54, 55, 56, 41	sticksstones6 42843	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ (1...𝐾)) ∧ 𝑦 ∈ (1...𝐾)) ∧ 𝑥 < 𝑦) → ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑥) < ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑦))
58	57	ex 417	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ (1...𝐾)) ∧ 𝑦 ∈ (1...𝐾)) → (𝑥 < 𝑦 → ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑥) < ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑦)))
59	58	ralrimiva 3163	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ (1...𝐾)) → ∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑥) < ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑦)))
60	59	ralrimiva 3163	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑥) < ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑦)))
61	42, 60	jca 520	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))):(1...𝐾)⟶(1...(𝑁 + 𝐾)) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑥) < ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑦))))
62		fzfid 14009	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (1...𝐾) ∈ Fin)
63	42, 62	fexd 7226	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) ∈ V)
64		feq1 6684	. . . . . . 7 ⊢ (𝑓 = (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) → (𝑓:(1...𝐾)⟶(1...(𝑁 + 𝐾)) ↔ (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))):(1...𝐾)⟶(1...(𝑁 + 𝐾))))
65		fveq1 6881	. . . . . . . . . 10 ⊢ (𝑓 = (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) → (𝑓‘𝑥) = ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑥))
66		fveq1 6881	. . . . . . . . . 10 ⊢ (𝑓 = (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) → (𝑓‘𝑦) = ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑦))
67	65, 66	breq12d 5124	. . . . . . . . 9 ⊢ (𝑓 = (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) → ((𝑓‘𝑥) < (𝑓‘𝑦) ↔ ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑥) < ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑦)))
68	67	imbi2d 343	. . . . . . . 8 ⊢ (𝑓 = (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) → ((𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)) ↔ (𝑥 < 𝑦 → ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑥) < ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑦))))
69	68	2ralbidv 3235	. . . . . . 7 ⊢ (𝑓 = (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) → (∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)) ↔ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑥) < ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑦))))
70	64, 69	anbi12d 643	. . . . . 6 ⊢ (𝑓 = (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) → ((𝑓:(1...𝐾)⟶(1...(𝑁 + 𝐾)) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦))) ↔ ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))):(1...𝐾)⟶(1...(𝑁 + 𝐾)) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑥) < ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑦)))))
71	70	elabg 3642	. . . . 5 ⊢ ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) ∈ V → ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) ∈ {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...(𝑁 + 𝐾)) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} ↔ ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))):(1...𝐾)⟶(1...(𝑁 + 𝐾)) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑥) < ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑦)))))
72	63, 71	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) ∈ {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...(𝑁 + 𝐾)) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} ↔ ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))):(1...𝐾)⟶(1...(𝑁 + 𝐾)) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑥) < ((𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙)))‘𝑦)))))
73	61, 72	mpbird 260	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) ∈ {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...(𝑁 + 𝐾)) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))})
74		sticksstones8.5	. . . 4 ⊢ 𝐵 = {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...(𝑁 + 𝐾)) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))}
75	74	a1i 11	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝐵 = {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...(𝑁 + 𝐾)) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))})
76	73, 75	eleqtrrd 2872	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))) ∈ 𝐵)
77		sticksstones8.3	. 2 ⊢ 𝐹 = (𝑎 ∈ 𝐴 ↦ (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))))
78	76, 77	fmptd 7110	1 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149  {cab 2747  ∀wral 3085  Vcvv 3461   class class class wbr 5111   ↦ cmpt 5194  ⟶wf 6533  ‘cfv 6537  (class class class)co 7411  Fincfn 8943  1c1 11101   + caddc 11103   < clt 11243  ℕ₀cn0 12504  ...cfz 13535  Σcsu 15737

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-inf2 9610  ax-cnex 11156  ax-resscn 11157  ax-1cn 11158  ax-icn 11159  ax-addcl 11160  ax-addrcl 11161  ax-mulcl 11162  ax-mulrcl 11163  ax-mulcom 11164  ax-addass 11165  ax-mulass 11166  ax-distr 11167  ax-i2m1 11168  ax-1ne0 11169  ax-1rid 11170  ax-rnegex 11171  ax-rrecex 11172  ax-cnre 11173  ax-pre-lttri 11174  ax-pre-lttrn 11175  ax-pre-ltadd 11176  ax-pre-mulgt0 11177  ax-pre-sup 11178

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3375  df-reu 3376  df-rab 3423  df-v 3463  df-sbc 3752  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-se 5616  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8453  df-er 8694  df-en 8944  df-dom 8945  df-sdom 8946  df-fin 8947  df-sup 9402  df-oi 9472  df-card 9925  df-pnf 11245  df-mnf 11246  df-xr 11247  df-ltxr 11248  df-le 11249  df-sub 11443  df-neg 11444  df-div 11872  df-nn 12234  df-2 12303  df-3 12304  df-n0 12505  df-z 12592  df-uz 12863  df-rp 13017  df-ico 13378  df-fz 13536  df-fzo 13683  df-seq 14038  df-exp 14098  df-hash 14367  df-cj 15150  df-re 15151  df-im 15152  df-sqrt 15286  df-abs 15287  df-clim 15539  df-sum 15738

This theorem is referenced by:  sticksstones11  42848  sticksstones12  42850