Theorem sticksstones18 40120

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

Hypotheses

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

Assertion

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

Distinct variable groups:   𝐴,𝑎,𝑖,𝑥   𝐵,𝑎   𝑔,𝐾,𝑖   𝑔,𝑁   ℎ,𝑁   𝑆,ℎ,𝑖,𝑥   ℎ,𝑍,𝑖,𝑥   𝑔,𝑎   ℎ,𝑎   𝜑,𝑎,𝑖,𝑥

Allowed substitution hints:   𝜑(𝑔,ℎ)   𝐴(𝑔,ℎ)   𝐵(𝑥,𝑔,ℎ,𝑖)   𝑆(𝑔,𝑎)   𝐹(𝑥,𝑔,ℎ,𝑖,𝑎)   𝐾(𝑥,ℎ,𝑎)   𝑁(𝑥,𝑖,𝑎)   𝑍(𝑔,𝑎)

Proof of Theorem sticksstones18

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sticksstones18.3	. . . . . . . . . . . . . 14 ⊢ 𝐴 = {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)}
2	1	eqimssi 3979	. . . . . . . . . . . . 13 ⊢ 𝐴 ⊆ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)}
3	2	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ⊆ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)})
4	3	sseld 3920	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑎 ∈ 𝐴 → 𝑎 ∈ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)}))
5	4	imp 407	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)})
6		vex 3436	. . . . . . . . . . 11 ⊢ 𝑎 ∈ V
7		feq1 6581	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑎 → (𝑔:(1...𝐾)⟶ℕ0 ↔ 𝑎:(1...𝐾)⟶ℕ0))
8		simpl 483	. . . . . . . . . . . . . . 15 ⊢ ((𝑔 = 𝑎 ∧ 𝑖 ∈ (1...𝐾)) → 𝑔 = 𝑎)
9	8	fveq1d 6776	. . . . . . . . . . . . . 14 ⊢ ((𝑔 = 𝑎 ∧ 𝑖 ∈ (1...𝐾)) → (𝑔‘𝑖) = (𝑎‘𝑖))
10	9	sumeq2dv 15415	. . . . . . . . . . . . 13 ⊢ (𝑔 = 𝑎 → Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖))
11	10	eqeq1d 2740	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑎 → (Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁 ↔ Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁))
12	7, 11	anbi12d 631	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑎 → ((𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁) ↔ (𝑎:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁)))
13	6, 12	elab 3609	. . . . . . . . . 10 ⊢ (𝑎 ∈ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)} ↔ (𝑎:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁))
14	5, 13	sylib 217	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑎:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁))
15	14	simpld 495	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎:(1...𝐾)⟶ℕ0)
16	15	adantr 481	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ 𝑆) → 𝑎:(1...𝐾)⟶ℕ0)
17		sticksstones18.5	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑍:(1...𝐾)–1-1-onto→𝑆)
18		f1ocnv 6728	. . . . . . . . . . 11 ⊢ (𝑍:(1...𝐾)–1-1-onto→𝑆 → ◡𝑍:𝑆–1-1-onto→(1...𝐾))
19	17, 18	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → ◡𝑍:𝑆–1-1-onto→(1...𝐾))
20		f1of 6716	. . . . . . . . . 10 ⊢ (◡𝑍:𝑆–1-1-onto→(1...𝐾) → ◡𝑍:𝑆⟶(1...𝐾))
21	19, 20	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ◡𝑍:𝑆⟶(1...𝐾))
22	21	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ◡𝑍:𝑆⟶(1...𝐾))
23	22	ffvelrnda 6961	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ 𝑆) → (◡𝑍‘𝑥) ∈ (1...𝐾))
24	16, 23	ffvelrnd 6962	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ 𝑆) → (𝑎‘(◡𝑍‘𝑥)) ∈ ℕ0)
25	24	fmpttd 6989	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0)
26		eqidd 2739	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))))
27		simpr 485	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) ∧ 𝑥 = 𝑖) → 𝑥 = 𝑖)
28	27	fveq2d 6778	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) ∧ 𝑥 = 𝑖) → (◡𝑍‘𝑥) = (◡𝑍‘𝑖))
29	28	fveq2d 6778	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) ∧ 𝑥 = 𝑖) → (𝑎‘(◡𝑍‘𝑥)) = (𝑎‘(◡𝑍‘𝑖)))
30		simpr 485	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → 𝑖 ∈ 𝑆)
31		fvexd 6789	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → (𝑎‘(◡𝑍‘𝑖)) ∈ V)
32	26, 29, 30, 31	fvmptd 6882	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = (𝑎‘(◡𝑍‘𝑖)))
33	32	sumeq2dv 15415	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = Σ𝑖 ∈ 𝑆 (𝑎‘(◡𝑍‘𝑖)))
34		fveq2 6774	. . . . . . . . 9 ⊢ (𝑛 = (◡𝑍‘𝑖) → (𝑎‘𝑛) = (𝑎‘(◡𝑍‘𝑖)))
35		fzfid 13693	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (1...𝐾) ∈ Fin)
36	17	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑍:(1...𝐾)–1-1-onto→𝑆)
37		f1oenfi 8965	. . . . . . . . . . . 12 ⊢ (((1...𝐾) ∈ Fin ∧ 𝑍:(1...𝐾)–1-1-onto→𝑆) → (1...𝐾) ≈ 𝑆)
38	35, 36, 37	syl2anc 584	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (1...𝐾) ≈ 𝑆)
39	38	ensymd 8791	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑆 ≈ (1...𝐾))
40		enfii 8972	. . . . . . . . . 10 ⊢ (((1...𝐾) ∈ Fin ∧ 𝑆 ≈ (1...𝐾)) → 𝑆 ∈ Fin)
41	35, 39, 40	syl2anc 584	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑆 ∈ Fin)
42	19	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ◡𝑍:𝑆–1-1-onto→(1...𝐾))
43		eqidd 2739	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → (◡𝑍‘𝑖) = (◡𝑍‘𝑖))
44		nn0sscn 12238	. . . . . . . . . . . 12 ⊢ ℕ0 ⊆ ℂ
45	44	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ℕ0 ⊆ ℂ)
46		fss 6617	. . . . . . . . . . 11 ⊢ ((𝑎:(1...𝐾)⟶ℕ0 ∧ ℕ0 ⊆ ℂ) → 𝑎:(1...𝐾)⟶ℂ)
47	15, 45, 46	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎:(1...𝐾)⟶ℂ)
48	47	ffvelrnda 6961	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑛 ∈ (1...𝐾)) → (𝑎‘𝑛) ∈ ℂ)
49	34, 41, 42, 43, 48	fsumf1o 15435	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛) = Σ𝑖 ∈ 𝑆 (𝑎‘(◡𝑍‘𝑖)))
50	49	eqcomd 2744	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ 𝑆 (𝑎‘(◡𝑍‘𝑖)) = Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛))
51		fveq2 6774	. . . . . . . . . 10 ⊢ (𝑛 = 𝑖 → (𝑎‘𝑛) = (𝑎‘𝑖))
52	51	cbvsumv 15408	. . . . . . . . 9 ⊢ Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛) = Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖)
53	52	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛) = Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖))
54	14	simprd 496	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁)
55	53, 54	eqtrd 2778	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛) = 𝑁)
56	50, 55	eqtrd 2778	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ 𝑆 (𝑎‘(◡𝑍‘𝑖)) = 𝑁)
57	33, 56	eqtrd 2778	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁)
58	25, 57	jca 512	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁))
59		fzfid 13693	. . . . . . . 8 ⊢ (𝜑 → (1...𝐾) ∈ Fin)
60	59	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (1...𝐾) ∈ Fin)
61	59, 17, 37	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → (1...𝐾) ≈ 𝑆)
62	61	ensymd 8791	. . . . . . . 8 ⊢ (𝜑 → 𝑆 ≈ (1...𝐾))
63	62	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑆 ≈ (1...𝐾))
64	60, 63, 40	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑆 ∈ Fin)
65	64	mptexd 7100	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ V)
66		feq1 6581	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) → (ℎ:𝑆⟶ℕ0 ↔ (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0))
67		simpl 483	. . . . . . . . . 10 ⊢ ((ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∧ 𝑖 ∈ 𝑆) → ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))))
68	67	fveq1d 6776	. . . . . . . . 9 ⊢ ((ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∧ 𝑖 ∈ 𝑆) → (ℎ‘𝑖) = ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖))
69	68	sumeq2dv 15415	. . . . . . . 8 ⊢ (ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) → Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖))
70	69	eqeq1d 2740	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) → (Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁 ↔ Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁))
71	66, 70	anbi12d 631	. . . . . 6 ⊢ (ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) → ((ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁) ↔ ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁)))
72	71	elabg 3607	. . . . 5 ⊢ ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ V → ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)} ↔ ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁)))
73	65, 72	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)} ↔ ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁)))
74	58, 73	mpbird 256	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)})
75		sticksstones18.4	. . . 4 ⊢ 𝐵 = {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)}
76	75	a1i 11	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝐵 = {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)})
77	74, 76	eleqtrrd 2842	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ 𝐵)
78		sticksstones18.6	. 2 ⊢ 𝐹 = (𝑎 ∈ 𝐴 ↦ (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))))
79	77, 78	fmptd 6988	1 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106  {cab 2715  Vcvv 3432   ⊆ wss 3887   class class class wbr 5074   ↦ cmpt 5157  ^◡ccnv 5588  ⟶wf 6429  –1-1-onto→wf1o 6432  ‘cfv 6433  (class class class)co 7275   ≈ cen 8730  Fincfn 8733  ℂcc 10869  1c1 10872  ℕ₀cn0 12233  ...cfz 13239  Σcsu 15397

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-inf2 9399  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948  ax-pre-sup 10949

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-se 5545  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-isom 6442  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-1o 8297  df-er 8498  df-en 8734  df-dom 8735  df-sdom 8736  df-fin 8737  df-sup 9201  df-oi 9269  df-card 9697  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-div 11633  df-nn 11974  df-2 12036  df-3 12037  df-n0 12234  df-z 12320  df-uz 12583  df-rp 12731  df-fz 13240  df-fzo 13383  df-seq 13722  df-exp 13783  df-hash 14045  df-cj 14810  df-re 14811  df-im 14812  df-sqrt 14946  df-abs 14947  df-clim 15197  df-sum 15398

This theorem is referenced by:  sticksstones19  40121