Theorem sticksstones17 42562

Description: Extend sticks and stones to finite sets, bijective builder. (Contributed by metakunt, 23-Oct-2024.)

Hypotheses

Ref	Expression
sticksstones17.1	⊢ (𝜑 → 𝑁 ∈ ℕ0)
sticksstones17.2	⊢ (𝜑 → 𝐾 ∈ ℕ0)
sticksstones17.3	⊢ 𝐴 = {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)}
sticksstones17.4	⊢ 𝐵 = {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)}
sticksstones17.5	⊢ (𝜑 → 𝑍:(1...𝐾)–1-1-onto→𝑆)
sticksstones17.6	⊢ 𝐺 = (𝑏 ∈ 𝐵 ↦ (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))))

Assertion

Ref	Expression
sticksstones17	⊢ (𝜑 → 𝐺:𝐵⟶𝐴)

Distinct variable groups:   𝐴,𝑏   𝐵,𝑏,𝑖,𝑦   𝑔,𝐾,𝑖,𝑦   𝑔,𝑁   ℎ,𝑁   𝑆,ℎ,𝑖   𝑔,𝑍,𝑖,𝑦   𝑔,𝑏   ℎ,𝑏   𝜑,𝑏,𝑖,𝑦

Allowed substitution hints:   𝜑(𝑔,ℎ)   𝐴(𝑦,𝑔,ℎ,𝑖)   𝐵(𝑔,ℎ)   𝑆(𝑦,𝑔,𝑏)   𝐺(𝑦,𝑔,ℎ,𝑖,𝑏)   𝐾(ℎ,𝑏)   𝑁(𝑦,𝑖,𝑏)   𝑍(ℎ,𝑏)

Proof of Theorem sticksstones17

Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sticksstones17.4	. . . . . . . . . . . . . . . 16 ⊢ 𝐵 = {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)}
2	1	eqimssi 3996	. . . . . . . . . . . . . . 15 ⊢ 𝐵 ⊆ {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)}
3	2	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐵 ⊆ {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)})
4	3	sseld 3934	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑏 ∈ 𝐵 → 𝑏 ∈ {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)}))
5	4	imp 406	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)})
6		vex 3446	. . . . . . . . . . . . 13 ⊢ 𝑏 ∈ V
7		feq1 6650	. . . . . . . . . . . . . 14 ⊢ (ℎ = 𝑏 → (ℎ:𝑆⟶ℕ0 ↔ 𝑏:𝑆⟶ℕ0))
8		simpl 482	. . . . . . . . . . . . . . . . 17 ⊢ ((ℎ = 𝑏 ∧ 𝑖 ∈ 𝑆) → ℎ = 𝑏)
9	8	fveq1d 6846	. . . . . . . . . . . . . . . 16 ⊢ ((ℎ = 𝑏 ∧ 𝑖 ∈ 𝑆) → (ℎ‘𝑖) = (𝑏‘𝑖))
10	9	sumeq2dv 15639	. . . . . . . . . . . . . . 15 ⊢ (ℎ = 𝑏 → Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = Σ𝑖 ∈ 𝑆 (𝑏‘𝑖))
11	10	eqeq1d 2739	. . . . . . . . . . . . . 14 ⊢ (ℎ = 𝑏 → (Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁 ↔ Σ𝑖 ∈ 𝑆 (𝑏‘𝑖) = 𝑁))
12	7, 11	anbi12d 633	. . . . . . . . . . . . 13 ⊢ (ℎ = 𝑏 → ((ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁) ↔ (𝑏:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (𝑏‘𝑖) = 𝑁)))
13	6, 12	elab 3636	. . . . . . . . . . . 12 ⊢ (𝑏 ∈ {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)} ↔ (𝑏:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (𝑏‘𝑖) = 𝑁))
14	5, 13	sylib 218	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝑏:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (𝑏‘𝑖) = 𝑁))
15	14	simpld 494	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝑏:𝑆⟶ℕ0)
16	15	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑦 ∈ (1...𝐾)) → 𝑏:𝑆⟶ℕ0)
17	16	3impa 1110	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵 ∧ 𝑦 ∈ (1...𝐾)) → 𝑏:𝑆⟶ℕ0)
18		sticksstones17.5	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑍:(1...𝐾)–1-1-onto→𝑆)
19		f1of 6784	. . . . . . . . . . . . 13 ⊢ (𝑍:(1...𝐾)–1-1-onto→𝑆 → 𝑍:(1...𝐾)⟶𝑆)
20	18, 19	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑍:(1...𝐾)⟶𝑆)
21	20	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝑍:(1...𝐾)⟶𝑆)
22	21	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑦 ∈ (1...𝐾)) → 𝑍:(1...𝐾)⟶𝑆)
23	22	3impa 1110	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵 ∧ 𝑦 ∈ (1...𝐾)) → 𝑍:(1...𝐾)⟶𝑆)
24		simp3 1139	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵 ∧ 𝑦 ∈ (1...𝐾)) → 𝑦 ∈ (1...𝐾))
25	23, 24	ffvelcdmd 7041	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵 ∧ 𝑦 ∈ (1...𝐾)) → (𝑍‘𝑦) ∈ 𝑆)
26	17, 25	ffvelcdmd 7041	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵 ∧ 𝑦 ∈ (1...𝐾)) → (𝑏‘(𝑍‘𝑦)) ∈ ℕ0)
27	26	3expa 1119	. . . . . 6 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑦 ∈ (1...𝐾)) → (𝑏‘(𝑍‘𝑦)) ∈ ℕ0)
28	27	fmpttd 7071	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))):(1...𝐾)⟶ℕ0)
29		eqidd 2738	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑖 ∈ (1...𝐾)) → (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))) = (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))))
30		simpr 484	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑖 ∈ (1...𝐾)) ∧ 𝑦 = 𝑖) → 𝑦 = 𝑖)
31	30	fveq2d 6848	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑖 ∈ (1...𝐾)) ∧ 𝑦 = 𝑖) → (𝑍‘𝑦) = (𝑍‘𝑖))
32	31	fveq2d 6848	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑖 ∈ (1...𝐾)) ∧ 𝑦 = 𝑖) → (𝑏‘(𝑍‘𝑦)) = (𝑏‘(𝑍‘𝑖)))
33		simpr 484	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑖 ∈ (1...𝐾)) → 𝑖 ∈ (1...𝐾))
34		fvexd 6859	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑖 ∈ (1...𝐾)) → (𝑏‘(𝑍‘𝑖)) ∈ V)
35	29, 32, 33, 34	fvmptd 6959	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑖 ∈ (1...𝐾)) → ((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦)))‘𝑖) = (𝑏‘(𝑍‘𝑖)))
36	35	sumeq2dv 15639	. . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → Σ𝑖 ∈ (1...𝐾)((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦)))‘𝑖) = Σ𝑖 ∈ (1...𝐾)(𝑏‘(𝑍‘𝑖)))
37		fveq2 6844	. . . . . . . . 9 ⊢ (𝑠 = (𝑍‘𝑖) → (𝑏‘𝑠) = (𝑏‘(𝑍‘𝑖)))
38		fzfi 13909	. . . . . . . . . 10 ⊢ (1...𝐾) ∈ Fin
39	38	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (1...𝐾) ∈ Fin)
40	18	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝑍:(1...𝐾)–1-1-onto→𝑆)
41		eqidd 2738	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑖 ∈ (1...𝐾)) → (𝑍‘𝑖) = (𝑍‘𝑖))
42		nn0sscn 12420	. . . . . . . . . . . 12 ⊢ ℕ0 ⊆ ℂ
43	42	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ℕ0 ⊆ ℂ)
44		fss 6688	. . . . . . . . . . 11 ⊢ ((𝑏:𝑆⟶ℕ0 ∧ ℕ0 ⊆ ℂ) → 𝑏:𝑆⟶ℂ)
45	15, 43, 44	syl2anc 585	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝑏:𝑆⟶ℂ)
46	45	ffvelcdmda 7040	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑠 ∈ 𝑆) → (𝑏‘𝑠) ∈ ℂ)
47	37, 39, 40, 41, 46	fsumf1o 15660	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → Σ𝑠 ∈ 𝑆 (𝑏‘𝑠) = Σ𝑖 ∈ (1...𝐾)(𝑏‘(𝑍‘𝑖)))
48	47	eqcomd 2743	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → Σ𝑖 ∈ (1...𝐾)(𝑏‘(𝑍‘𝑖)) = Σ𝑠 ∈ 𝑆 (𝑏‘𝑠))
49		fveq2 6844	. . . . . . . . . 10 ⊢ (𝑠 = 𝑖 → (𝑏‘𝑠) = (𝑏‘𝑖))
50	49	cbvsumv 15633	. . . . . . . . 9 ⊢ Σ𝑠 ∈ 𝑆 (𝑏‘𝑠) = Σ𝑖 ∈ 𝑆 (𝑏‘𝑖)
51	50	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → Σ𝑠 ∈ 𝑆 (𝑏‘𝑠) = Σ𝑖 ∈ 𝑆 (𝑏‘𝑖))
52	14	simprd 495	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → Σ𝑖 ∈ 𝑆 (𝑏‘𝑖) = 𝑁)
53	51, 52	eqtrd 2772	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → Σ𝑠 ∈ 𝑆 (𝑏‘𝑠) = 𝑁)
54	48, 53	eqtrd 2772	. . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → Σ𝑖 ∈ (1...𝐾)(𝑏‘(𝑍‘𝑖)) = 𝑁)
55	36, 54	eqtrd 2772	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → Σ𝑖 ∈ (1...𝐾)((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦)))‘𝑖) = 𝑁)
56	28, 55	jca 511	. . . 4 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))):(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦)))‘𝑖) = 𝑁))
57		fzfid 13910	. . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (1...𝐾) ∈ Fin)
58	57	mptexd 7182	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))) ∈ V)
59		feq1 6650	. . . . . . 7 ⊢ (𝑔 = (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))) → (𝑔:(1...𝐾)⟶ℕ0 ↔ (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))):(1...𝐾)⟶ℕ0))
60		simpl 482	. . . . . . . . . 10 ⊢ ((𝑔 = (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))) ∧ 𝑖 ∈ (1...𝐾)) → 𝑔 = (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))))
61	60	fveq1d 6846	. . . . . . . . 9 ⊢ ((𝑔 = (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))) ∧ 𝑖 ∈ (1...𝐾)) → (𝑔‘𝑖) = ((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦)))‘𝑖))
62	61	sumeq2dv 15639	. . . . . . . 8 ⊢ (𝑔 = (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))) → Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = Σ𝑖 ∈ (1...𝐾)((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦)))‘𝑖))
63	62	eqeq1d 2739	. . . . . . 7 ⊢ (𝑔 = (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))) → (Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁 ↔ Σ𝑖 ∈ (1...𝐾)((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦)))‘𝑖) = 𝑁))
64	59, 63	anbi12d 633	. . . . . 6 ⊢ (𝑔 = (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))) → ((𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁) ↔ ((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))):(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦)))‘𝑖) = 𝑁)))
65	64	elabg 3633	. . . . 5 ⊢ ((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))) ∈ V → ((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))) ∈ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)} ↔ ((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))):(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦)))‘𝑖) = 𝑁)))
66	58, 65	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))) ∈ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)} ↔ ((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))):(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)((𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦)))‘𝑖) = 𝑁)))
67	56, 66	mpbird 257	. . 3 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))) ∈ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)})
68		sticksstones17.3	. . . 4 ⊢ 𝐴 = {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)}
69	68	a1i 11	. . 3 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝐴 = {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)})
70	67, 69	eleqtrrd 2840	. 2 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))) ∈ 𝐴)
71		sticksstones17.6	. 2 ⊢ 𝐺 = (𝑏 ∈ 𝐵 ↦ (𝑦 ∈ (1...𝐾) ↦ (𝑏‘(𝑍‘𝑦))))
72	70, 71	fmptd 7070	1 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  {cab 2715  Vcvv 3442   ⊆ wss 3903   ↦ cmpt 5181  ⟶wf 6498  –1-1-onto→wf1o 6501  ‘cfv 6502  (class class class)co 7370  Fincfn 8897  ℂcc 11038  1c1 11041  ℕ₀cn0 12415  ...cfz 13437  Σcsu 15623

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692  ax-inf2 9564  ax-cnex 11096  ax-resscn 11097  ax-1cn 11098  ax-icn 11099  ax-addcl 11100  ax-addrcl 11101  ax-mulcl 11102  ax-mulrcl 11103  ax-mulcom 11104  ax-addass 11105  ax-mulass 11106  ax-distr 11107  ax-i2m1 11108  ax-1ne0 11109  ax-1rid 11110  ax-rnegex 11111  ax-rrecex 11112  ax-cnre 11113  ax-pre-lttri 11114  ax-pre-lttrn 11115  ax-pre-ltadd 11116  ax-pre-mulgt0 11117  ax-pre-sup 11118

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-se 5588  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-pred 6269  df-ord 6330  df-on 6331  df-lim 6332  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-isom 6511  df-riota 7327  df-ov 7373  df-oprab 7374  df-mpo 7375  df-om 7821  df-1st 7945  df-2nd 7946  df-frecs 8235  df-wrecs 8266  df-recs 8315  df-rdg 8353  df-1o 8409  df-er 8647  df-en 8898  df-dom 8899  df-sdom 8900  df-fin 8901  df-sup 9359  df-oi 9429  df-card 9865  df-pnf 11182  df-mnf 11183  df-xr 11184  df-ltxr 11185  df-le 11186  df-sub 11380  df-neg 11381  df-div 11809  df-nn 12160  df-2 12222  df-3 12223  df-n0 12416  df-z 12503  df-uz 12766  df-rp 12920  df-fz 13438  df-fzo 13585  df-seq 13939  df-exp 13999  df-hash 14268  df-cj 15036  df-re 15037  df-im 15038  df-sqrt 15172  df-abs 15173  df-clim 15425  df-sum 15624

This theorem is referenced by:  sticksstones19  42564