Theorem sticksstones18 43095

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 3991	. . . . . . . . . . . . 13 ⊢ 𝐴 ⊆ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)}
3	2	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ⊆ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)})
4	3	sseld 3930	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑎 ∈ 𝐴 → 𝑎 ∈ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)}))
5	4	imp 412	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)})
6		vex 3454	. . . . . . . . . . 11 ⊢ 𝑎 ∈ V
7		feq1 6683	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑎 → (𝑔:(1...𝐾)⟶ℕ0 ↔ 𝑎:(1...𝐾)⟶ℕ0))
8		simpl 488	. . . . . . . . . . . . . . 15 ⊢ ((𝑔 = 𝑎 ∧ 𝑖 ∈ (1...𝐾)) → 𝑔 = 𝑎)
9	8	fveq1d 6883	. . . . . . . . . . . . . 14 ⊢ ((𝑔 = 𝑎 ∧ 𝑖 ∈ (1...𝐾)) → (𝑔‘𝑖) = (𝑎‘𝑖))
10	9	sumeq2dv 15814	. . . . . . . . . . . . 13 ⊢ (𝑔 = 𝑎 → Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖))
11	10	eqeq1d 2762	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑎 → (Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁 ↔ Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁))
12	7, 11	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑎 → ((𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁) ↔ (𝑎:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁)))
13	6, 12	elab 3633	. . . . . . . . . 10 ⊢ (𝑎 ∈ {𝑔 ∣ (𝑔:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑔‘𝑖) = 𝑁)} ↔ (𝑎:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁))
14	5, 13	sylib 221	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑎:(1...𝐾)⟶ℕ0 ∧ Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁))
15	14	simpld 500	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎:(1...𝐾)⟶ℕ0)
16	15	adantr 486	. . . . . . 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 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ◡𝑍:𝑆⟶(1...𝐾))
23	22	ffvelcdmda 7080	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ 𝑆) → (◡𝑍‘𝑥) ∈ (1...𝐾))
24	16, 23	ffvelcdmd 7081	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 ∈ 𝑆) → (𝑎‘(◡𝑍‘𝑥)) ∈ ℕ0)
25	24	fmpttd 7111	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0)
26		eqidd 2761	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))))
27		simpr 490	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) ∧ 𝑥 = 𝑖) → 𝑥 = 𝑖)
28	27	fveq2d 6885	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) ∧ 𝑥 = 𝑖) → (◡𝑍‘𝑥) = (◡𝑍‘𝑖))
29	28	fveq2d 6885	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) ∧ 𝑥 = 𝑖) → (𝑎‘(◡𝑍‘𝑥)) = (𝑎‘(◡𝑍‘𝑖)))
30		simpr 490	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → 𝑖 ∈ 𝑆)
31		fvexd 6896	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → (𝑎‘(◡𝑍‘𝑖)) ∈ V)
32	26, 29, 30, 31	fvmptd 6997	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = (𝑎‘(◡𝑍‘𝑖)))
33	32	sumeq2dv 15814	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = Σ𝑖 ∈ 𝑆 (𝑎‘(◡𝑍‘𝑖)))
34		fveq2 6881	. . . . . . . . 9 ⊢ (𝑛 = (◡𝑍‘𝑖) → (𝑎‘𝑛) = (𝑎‘(◡𝑍‘𝑖)))
35		fzfid 14062	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (1...𝐾) ∈ Fin)
36	17	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑍:(1...𝐾)–1-1-onto→𝑆)
37		f1oenfi 9180	. . . . . . . . . . . 12 ⊢ (((1...𝐾) ∈ Fin ∧ 𝑍:(1...𝐾)–1-1-onto→𝑆) → (1...𝐾) ≈ 𝑆)
38	35, 36, 37	syl2anc 596	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (1...𝐾) ≈ 𝑆)
39	38	ensymd 9018	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑆 ≈ (1...𝐾))
40		enfii 9187	. . . . . . . . . 10 ⊢ (((1...𝐾) ∈ Fin ∧ 𝑆 ≈ (1...𝐾)) → 𝑆 ∈ Fin)
41	35, 39, 40	syl2anc 596	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑆 ∈ Fin)
42	19	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ◡𝑍:𝑆–1-1-onto→(1...𝐾))
43		eqidd 2761	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑖 ∈ 𝑆) → (◡𝑍‘𝑖) = (◡𝑍‘𝑖))
44		nn0sscn 12558	. . . . . . . . . . . 12 ⊢ ℕ0 ⊆ ℂ
45	44	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ℕ0 ⊆ ℂ)
46		fss 6722	. . . . . . . . . . 11 ⊢ ((𝑎:(1...𝐾)⟶ℕ0 ∧ ℕ0 ⊆ ℂ) → 𝑎:(1...𝐾)⟶ℂ)
47	15, 45, 46	syl2anc 596	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎:(1...𝐾)⟶ℂ)
48	47	ffvelcdmda 7080	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑛 ∈ (1...𝐾)) → (𝑎‘𝑛) ∈ ℂ)
49	34, 41, 42, 43, 48	fsumf1o 15834	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛) = Σ𝑖 ∈ 𝑆 (𝑎‘(◡𝑍‘𝑖)))
50	49	eqcomd 2766	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ 𝑆 (𝑎‘(◡𝑍‘𝑖)) = Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛))
51		fveq2 6881	. . . . . . . . . 10 ⊢ (𝑛 = 𝑖 → (𝑎‘𝑛) = (𝑎‘𝑖))
52	51	cbvsumv 15808	. . . . . . . . 9 ⊢ Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛) = Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖)
53	52	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛) = Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖))
54	14	simprd 501	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ (1...𝐾)(𝑎‘𝑖) = 𝑁)
55	53, 54	eqtrd 2795	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑛 ∈ (1...𝐾)(𝑎‘𝑛) = 𝑁)
56	50, 55	eqtrd 2795	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ 𝑆 (𝑎‘(◡𝑍‘𝑖)) = 𝑁)
57	33, 56	eqtrd 2795	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁)
58	25, 57	jca 521	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁))
59		fzfid 14062	. . . . . . . 8 ⊢ (𝜑 → (1...𝐾) ∈ Fin)
60	59	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (1...𝐾) ∈ Fin)
61	59, 17, 37	syl2anc 596	. . . . . . . . 9 ⊢ (𝜑 → (1...𝐾) ≈ 𝑆)
62	61	ensymd 9018	. . . . . . . 8 ⊢ (𝜑 → 𝑆 ≈ (1...𝐾))
63	62	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑆 ≈ (1...𝐾))
64	60, 63, 40	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑆 ∈ Fin)
65	64	mptexd 7226	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ V)
66		feq1 6683	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) → (ℎ:𝑆⟶ℕ0 ↔ (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0))
67		simpl 488	. . . . . . . . . 10 ⊢ ((ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∧ 𝑖 ∈ 𝑆) → ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))))
68	67	fveq1d 6883	. . . . . . . . 9 ⊢ ((ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∧ 𝑖 ∈ 𝑆) → (ℎ‘𝑖) = ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖))
69	68	sumeq2dv 15814	. . . . . . . 8 ⊢ (ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) → Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖))
70	69	eqeq1d 2762	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) → (Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁 ↔ Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁))
71	66, 70	anbi12d 644	. . . . . 6 ⊢ (ℎ = (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) → ((ℎ:𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 (ℎ‘𝑖) = 𝑁) ↔ ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))):𝑆⟶ℕ0 ∧ Σ𝑖 ∈ 𝑆 ((𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥)))‘𝑖) = 𝑁)))
72	71	elabg 3630	. . . . 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 2863	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))) ∈ 𝐵)
78		sticksstones18.6	. 2 ⊢ 𝐹 = (𝑎 ∈ 𝐴 ↦ (𝑥 ∈ 𝑆 ↦ (𝑎‘(◡𝑍‘𝑥))))
79	77, 78	fmptd 7110	1 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2738  Vcvv 3450   ⊆ wss 3899   class class class wbr 5103   ↦ cmpt 5186  ^◡ccnv 5654  ⟶wf 6531  –1-1-onto→wf1o 6534  ‘cfv 6535  (class class class)co 7416   ≈ cen 8956  Fincfn 8959  ℂcc 11147  1c1 11150  ℕ₀cn0 12553  ...cfz 13586  Σcsu 15798

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7742  ax-inf2 9627  ax-cnex 11205  ax-resscn 11206  ax-1cn 11207  ax-icn 11208  ax-addcl 11209  ax-addrcl 11210  ax-mulcl 11211  ax-mulrcl 11212  ax-mulcom 11213  ax-addass 11214  ax-mulass 11215  ax-distr 11216  ax-i2m1 11217  ax-1ne0 11218  ax-1rid 11219  ax-rnegex 11220  ax-rrecex 11221  ax-cnre 11222  ax-pre-lttri 11223  ax-pre-lttrn 11224  ax-pre-ltadd 11225  ax-pre-mulgt0 11226  ax-pre-sup 11227

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6301  df-ord 6362  df-on 6363  df-lim 6364  df-suc 6365  df-iota 6491  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-isom 6544  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8285  df-wrecs 8316  df-recs 8365  df-rdg 8404  df-1o 8462  df-er 8703  df-en 8960  df-dom 8961  df-sdom 8962  df-fin 8963  df-sup 9419  df-oi 9489  df-card 9969  df-pnf 11294  df-mnf 11295  df-xr 11296  df-ltxr 11297  df-le 11298  df-sub 11492  df-neg 11493  df-div 11921  df-nn 12283  df-2 12352  df-3 12353  df-n0 12554  df-z 12641  df-uz 12913  df-rp 13068  df-fz 13587  df-fzo 13735  df-seq 14091  df-exp 14151  df-hash 14420  df-cj 15211  df-re 15212  df-im 15213  df-sqrt 15347  df-abs 15348  df-clim 15600  df-sum 15799

This theorem is used by:  sticksstones19  43096