Theorem sticksstones18 42959

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 3997	. . . . . . . . . . . . 13 ⊢ 𝐴 ⊆ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)}
3	2	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ⊆ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)})
4	3	sseld 3936	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑎 ∈ 𝐴 → 𝑎 ∈ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)}))
5	4	imp 411	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)})
6		vex 3459	. . . . . . . . . . 11 ⊢ 𝑎 ∈ V
7		feq1 6683	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑎 → (𝑔:(1...𝐾)⟶ℕ0 ↔ 𝑎:(1...𝐾)⟶ℕ0))
8		simpl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝑔 = 𝑎 ∧ 𝑖 ∈ (1...𝐾)) → 𝑔 = 𝑎)
9	8	fveq1d 6883	. . . . . . . . . . . . . 14 ⊢ ((𝑔 = 𝑎 ∧ 𝑖 ∈ (1...𝐾)) → (𝑔‘𝑖) = (𝑎‘𝑖))
10	9	sumeq2dv 15758	. . . . . . . . . . . . 13 ⊢ (𝑔 = 𝑎 → Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖))
11	10	eqeq1d 2765	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑎 → (Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁 ↔ Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁))
12	7, 11	anbi12d 643	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑎 → ((𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁) ↔ (𝑎:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁)))
13	6, 12	elab 3638	. . . . . . . . . 10 ⊢ (𝑎 ∈ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)} ↔ (𝑎:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁))
14	5, 13	sylib 221	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑎:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁))
15	14	simpld 499	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎:(1...𝐾)⟶ℕ0)
16	15	adantr 485	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ 𝑆) → 𝑎:(1...𝐾)⟶ℕ0)
17		sticksstones18.5	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑍:(1...𝐾)–1-1-onto→𝑆)
18		f1ocnv 6833	. . . . . . . . . . 11 ⊢ (𝑍:(1...𝐾)–1-1-onto→𝑆 → ◡𝑍:𝑆–1-1-onto→(1...𝐾))
19	17, 18	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → ◡𝑍:𝑆–1-1-onto→(1...𝐾))
20		f1of 6820	. . . . . . . . . 10 ⊢ (◡𝑍:𝑆–1-1-onto→(1...𝐾) → ◡𝑍:𝑆⟶(1...𝐾))
21	19, 20	syl 18	. . . . . . . . 9 ⊢ (𝜑 → ◡𝑍:𝑆⟶(1...𝐾))
22	21	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ◡𝑍:𝑆⟶(1...𝐾))
23	22	ffvelcdmda 7079	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ 𝑆) → (◡𝑍‘𝑥) ∈ (1...𝐾))
24	16, 23	ffvelcdmd 7080	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ 𝑆) → (𝑎‘(◡𝑍‘𝑥)) ∈ ℕ0)
25	24	fmpttd 7110	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0)
26		eqidd 2764	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))))
27		simpr 489	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) ∧ 𝑥 = 𝑖) → 𝑥 = 𝑖)
28	27	fveq2d 6885	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) ∧ 𝑥 = 𝑖) → (◡𝑍‘𝑥) = (◡𝑍‘𝑖))
29	28	fveq2d 6885	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) ∧ 𝑥 = 𝑖) → (𝑎‘(◡𝑍‘𝑥)) = (𝑎‘(◡𝑍‘𝑖)))
30		simpr 489	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → 𝑖 ∈ 𝑆)
31		fvexd 6896	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → (𝑎‘(◡𝑍‘𝑖)) ∈ V)
32	26, 29, 30, 31	fvmptd 6997	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = (𝑎‘(◡𝑍‘𝑖)))
33	32	sumeq2dv 15758	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = Σ𝑖 ∈ 𝑆 (𝑎‘(◡𝑍‘𝑖)))
34		fveq2 6881	. . . . . . . . 9 ⊢ (𝑛 = (◡𝑍‘𝑖) → (𝑎‘𝑛) = (𝑎‘(◡𝑍‘𝑖)))
35		fzfid 14014	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (1...𝐾) ∈ Fin)
36	17	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑍:(1...𝐾)–1-1-onto→𝑆)
37		f1oenfi 9159	. . . . . . . . . . . 12 ⊢ (((1...𝐾) ∈ Fin ∧ 𝑍:(1...𝐾)–1-1-onto→𝑆) → (1...𝐾) ≈ 𝑆)
38	35, 36, 37	syl2anc 595	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (1...𝐾) ≈ 𝑆)
39	38	ensymd 8998	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑆 ≈ (1...𝐾))
40		enfii 9166	. . . . . . . . . 10 ⊢ (((1...𝐾) ∈ Fin ∧ 𝑆 ≈ (1...𝐾)) → 𝑆 ∈ Fin)
41	35, 39, 40	syl2anc 595	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑆 ∈ Fin)
42	19	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ◡𝑍:𝑆–1-1-onto→(1...𝐾))
43		eqidd 2764	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → (◡𝑍‘𝑖) = (◡𝑍‘𝑖))
44		nn0sscn 12513	. . . . . . . . . . . 12 ⊢ ℕ0 ⊆ ℂ
45	44	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ℕ0 ⊆ ℂ)
46		fss 6722	. . . . . . . . . . 11 ⊢ ((𝑎:(1...𝐾)⟶ℕ0 ∧ ℕ0 ⊆ ℂ) → 𝑎:(1...𝐾)⟶ℂ)
47	15, 45, 46	syl2anc 595	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎:(1...𝐾)⟶ℂ)
48	47	ffvelcdmda 7079	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑛 ∈ (1...𝐾)) → (𝑎‘𝑛) ∈ ℂ)
49	34, 41, 42, 43, 48	fsumf1o 15779	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛) = Σ𝑖 ∈ 𝑆 (𝑎‘(◡𝑍‘𝑖)))
50	49	eqcomd 2769	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ 𝑆 (𝑎‘(◡𝑍‘𝑖)) = Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛))
51		fveq2 6881	. . . . . . . . . 10 ⊢ (𝑛 = 𝑖 → (𝑎‘𝑛) = (𝑎‘𝑖))
52	51	cbvsumv 15752	. . . . . . . . 9 ⊢ Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛) = Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖)
53	52	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛) = Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖))
54	14	simprd 500	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁)
55	53, 54	eqtrd 2798	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛) = 𝑁)
56	50, 55	eqtrd 2798	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ 𝑆 (𝑎‘(◡𝑍‘𝑖)) = 𝑁)
57	33, 56	eqtrd 2798	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁)
58	25, 57	jca 520	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁))
59		fzfid 14014	. . . . . . . 8 ⊢ (𝜑 → (1...𝐾) ∈ Fin)
60	59	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (1...𝐾) ∈ Fin)
61	59, 17, 37	syl2anc 595	. . . . . . . . 9 ⊢ (𝜑 → (1...𝐾) ≈ 𝑆)
62	61	ensymd 8998	. . . . . . . 8 ⊢ (𝜑 → 𝑆 ≈ (1...𝐾))
63	62	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑆 ≈ (1...𝐾))
64	60, 63, 40	syl2anc 595	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑆 ∈ Fin)
65	64	mptexd 7222	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ V)
66		feq1 6683	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) → (ℎ:𝑆⟶ℕ0 ↔ (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0))
67		simpl 487	. . . . . . . . . 10 ⊢ ((ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∧ 𝑖 ∈ 𝑆) → ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))))
68	67	fveq1d 6883	. . . . . . . . 9 ⊢ ((ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∧ 𝑖 ∈ 𝑆) → (ℎ‘𝑖) = ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖))
69	68	sumeq2dv 15758	. . . . . . . 8 ⊢ (ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) → Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖))
70	69	eqeq1d 2765	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) → (Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁 ↔ Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁))
71	66, 70	anbi12d 643	. . . . . 6 ⊢ (ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) → ((ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁) ↔ ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁)))
72	71	elabg 3635	. . . . 5 ⊢ ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ V → ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)} ↔ ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁)))
73	65, 72	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)} ↔ ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁)))
74	58, 73	mpbird 260	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)})
75		sticksstones18.4	. . . 4 ⊢ 𝐵 = {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)}
76	75	a1i 11	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝐵 = {ℎ ∣ (ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁)})
77	74, 76	eleqtrrd 2866	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ 𝐵)
78		sticksstones18.6	. 2 ⊢ 𝐹 = (𝑎 ∈ 𝐴 ↦ (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))))
79	77, 78	fmptd 7109	1 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  {cab 2741  Vcvv 3455   ⊆ wss 3905   class class class wbr 5109   ↦ cmpt 5192  ^◡ccnv 5660  ⟶wf 6532  –1-1-onto→wf1o 6535  ‘cfv 6536  (class class class)co 7410   ≈ cen 8936  Fincfn 8939  ℂcc 11102  1c1 11105  ℕ₀cn0 12508  ...cfz 13539  Σcsu 15742

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-inf2 9606  ax-cnex 11160  ax-resscn 11161  ax-1cn 11162  ax-icn 11163  ax-addcl 11164  ax-addrcl 11165  ax-mulcl 11166  ax-mulrcl 11167  ax-mulcom 11168  ax-addass 11169  ax-mulass 11170  ax-distr 11171  ax-i2m1 11172  ax-1ne0 11173  ax-1rid 11174  ax-rnegex 11175  ax-rrecex 11176  ax-cnre 11177  ax-pre-lttri 11178  ax-pre-lttrn 11179  ax-pre-ltadd 11180  ax-pre-mulgt0 11181  ax-pre-sup 11182

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-sup 9398  df-oi 9468  df-card 9930  df-pnf 11249  df-mnf 11250  df-xr 11251  df-ltxr 11252  df-le 11253  df-sub 11447  df-neg 11448  df-div 11876  df-nn 12238  df-2 12307  df-3 12308  df-n0 12509  df-z 12596  df-uz 12867  df-rp 13021  df-fz 13540  df-fzo 13688  df-seq 14043  df-exp 14103  df-hash 14372  df-cj 15155  df-re 15156  df-im 15157  df-sqrt 15291  df-abs 15292  df-clim 15544  df-sum 15743

This theorem is used by:  sticksstones19  42960