Theorem addsdilem4 28597

Description: Lemma for addsdi 28598. Show one of the equalities involved in the final expression. (Contributed by Scott Fenton, 9-Mar-2025.)

Hypotheses

Ref	Expression
addsdilem4.1	⊢ (𝜑 → 𝐴 ∈ No)
addsdilem4.2	⊢ (𝜑 → 𝐵 ∈ No)
addsdilem4.3	⊢ (𝜑 → 𝐶 ∈ No)
addsdilem4.4	⊢ (𝜑 → ∀𝑥𝑂 ∈ ((L‘𝐴) ∪ (R‘𝐴))(𝑥𝑂 ·s (𝐵 +s 𝐶)) = ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝐶)))
addsdilem4.5	⊢ (𝜑 → ∀𝑧𝑂 ∈ ((L‘𝐶) ∪ (R‘𝐶))(𝐴 ·s (𝐵 +s 𝑧𝑂)) = ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑧𝑂)))
addsdilem4.6	⊢ (𝜑 → ∀𝑥𝑂 ∈ ((L‘𝐴) ∪ (R‘𝐴))∀𝑧𝑂 ∈ ((L‘𝐶) ∪ (R‘𝐶))(𝑥𝑂 ·s (𝐵 +s 𝑧𝑂)) = ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝑧𝑂)))
addsdilem4.7	⊢ (𝜓 → 𝑋 ∈ ((L‘𝐴) ∪ (R‘𝐴)))
addsdilem4.8	⊢ (𝜓 → 𝑍 ∈ ((L‘𝐶) ∪ (R‘𝐶)))

Assertion

Ref	Expression
addsdilem4	⊢ ((𝜑 ∧ 𝜓) → (((𝑋 ·s (𝐵 +s 𝐶)) +s (𝐴 ·s (𝐵 +s 𝑍))) −s (𝑋 ·s (𝐵 +s 𝑍))) = ((𝐴 ·s 𝐵) +s (((𝑋 ·s 𝐶) +s (𝐴 ·s 𝑍)) −s (𝑋 ·s 𝑍))))

Distinct variable groups:   𝐴,𝑥_𝑂,𝑧_𝑂   𝐵,𝑥_𝑂,𝑧_𝑂   𝐶,𝑥_𝑂,𝑧_𝑂   𝑋,𝑥_𝑂,𝑧_𝑂   𝑍,𝑧_𝑂

Allowed substitution hints:   𝜑(𝑥_𝑂, 𝑧_𝑂)   𝜓(𝑥_𝑂, 𝑧_𝑂)   𝑍(𝑥_𝑂)

Proof of Theorem addsdilem4

Step	Hyp	Ref	Expression
1		oveq1 7458	. . . . . 6 ⊢ (𝑥𝑂 = 𝑋 → (𝑥𝑂 ·s (𝐵 +s 𝐶)) = (𝑋 ·s (𝐵 +s 𝐶)))
2		oveq1 7458	. . . . . . 7 ⊢ (𝑥𝑂 = 𝑋 → (𝑥𝑂 ·s 𝐵) = (𝑋 ·s 𝐵))
3		oveq1 7458	. . . . . . 7 ⊢ (𝑥𝑂 = 𝑋 → (𝑥𝑂 ·s 𝐶) = (𝑋 ·s 𝐶))
4	2, 3	oveq12d 7469	. . . . . 6 ⊢ (𝑥𝑂 = 𝑋 → ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝐶)) = ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)))
5	1, 4	eqeq12d 2779	. . . . 5 ⊢ (𝑥𝑂 = 𝑋 → ((𝑥𝑂 ·s (𝐵 +s 𝐶)) = ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝐶)) ↔ (𝑋 ·s (𝐵 +s 𝐶)) = ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶))))
6		addsdilem4.4	. . . . . 6 ⊢ (𝜑 → ∀𝑥𝑂 ∈ ((L‘𝐴) ∪ (R‘𝐴))(𝑥𝑂 ·s (𝐵 +s 𝐶)) = ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝐶)))
7	6	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → ∀𝑥𝑂 ∈ ((L‘𝐴) ∪ (R‘𝐴))(𝑥𝑂 ·s (𝐵 +s 𝐶)) = ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝐶)))
8		addsdilem4.7	. . . . . 6 ⊢ (𝜓 → 𝑋 ∈ ((L‘𝐴) ∪ (R‘𝐴)))
9	8	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → 𝑋 ∈ ((L‘𝐴) ∪ (R‘𝐴)))
10	5, 7, 9	rspcdva 3581	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → (𝑋 ·s (𝐵 +s 𝐶)) = ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)))
11		oveq2 7459	. . . . . . 7 ⊢ (𝑧𝑂 = 𝑍 → (𝐵 +s 𝑧𝑂) = (𝐵 +s 𝑍))
12	11	oveq2d 7467	. . . . . 6 ⊢ (𝑧𝑂 = 𝑍 → (𝐴 ·s (𝐵 +s 𝑧𝑂)) = (𝐴 ·s (𝐵 +s 𝑍)))
13		oveq2 7459	. . . . . . 7 ⊢ (𝑧𝑂 = 𝑍 → (𝐴 ·s 𝑧𝑂) = (𝐴 ·s 𝑍))
14	13	oveq2d 7467	. . . . . 6 ⊢ (𝑧𝑂 = 𝑍 → ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑧𝑂)) = ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍)))
15	12, 14	eqeq12d 2779	. . . . 5 ⊢ (𝑧𝑂 = 𝑍 → ((𝐴 ·s (𝐵 +s 𝑧𝑂)) = ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑧𝑂)) ↔ (𝐴 ·s (𝐵 +s 𝑍)) = ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))))
16		addsdilem4.5	. . . . . 6 ⊢ (𝜑 → ∀𝑧𝑂 ∈ ((L‘𝐶) ∪ (R‘𝐶))(𝐴 ·s (𝐵 +s 𝑧𝑂)) = ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑧𝑂)))
17	16	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → ∀𝑧𝑂 ∈ ((L‘𝐶) ∪ (R‘𝐶))(𝐴 ·s (𝐵 +s 𝑧𝑂)) = ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑧𝑂)))
18		addsdilem4.8	. . . . . 6 ⊢ (𝜓 → 𝑍 ∈ ((L‘𝐶) ∪ (R‘𝐶)))
19	18	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → 𝑍 ∈ ((L‘𝐶) ∪ (R‘𝐶)))
20	15, 17, 19	rspcdva 3581	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → (𝐴 ·s (𝐵 +s 𝑍)) = ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍)))
21	10, 20	oveq12d 7469	. . 3 ⊢ ((𝜑 ∧ 𝜓) → ((𝑋 ·s (𝐵 +s 𝐶)) +s (𝐴 ·s (𝐵 +s 𝑍))) = (((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))))
22		oveq1 7458	. . . . 5 ⊢ (𝑥𝑂 = 𝑋 → (𝑥𝑂 ·s (𝐵 +s 𝑧𝑂)) = (𝑋 ·s (𝐵 +s 𝑧𝑂)))
23		oveq1 7458	. . . . . 6 ⊢ (𝑥𝑂 = 𝑋 → (𝑥𝑂 ·s 𝑧𝑂) = (𝑋 ·s 𝑧𝑂))
24	2, 23	oveq12d 7469	. . . . 5 ⊢ (𝑥𝑂 = 𝑋 → ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝑧𝑂)) = ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝑧𝑂)))
25	22, 24	eqeq12d 2779	. . . 4 ⊢ (𝑥𝑂 = 𝑋 → ((𝑥𝑂 ·s (𝐵 +s 𝑧𝑂)) = ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝑧𝑂)) ↔ (𝑋 ·s (𝐵 +s 𝑧𝑂)) = ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝑧𝑂))))
26	11	oveq2d 7467	. . . . 5 ⊢ (𝑧𝑂 = 𝑍 → (𝑋 ·s (𝐵 +s 𝑧𝑂)) = (𝑋 ·s (𝐵 +s 𝑍)))
27		oveq2 7459	. . . . . 6 ⊢ (𝑧𝑂 = 𝑍 → (𝑋 ·s 𝑧𝑂) = (𝑋 ·s 𝑍))
28	27	oveq2d 7467	. . . . 5 ⊢ (𝑧𝑂 = 𝑍 → ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝑧𝑂)) = ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝑍)))
29	26, 28	eqeq12d 2779	. . . 4 ⊢ (𝑧𝑂 = 𝑍 → ((𝑋 ·s (𝐵 +s 𝑧𝑂)) = ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝑧𝑂)) ↔ (𝑋 ·s (𝐵 +s 𝑍)) = ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝑍))))
30		addsdilem4.6	. . . . 5 ⊢ (𝜑 → ∀𝑥𝑂 ∈ ((L‘𝐴) ∪ (R‘𝐴))∀𝑧𝑂 ∈ ((L‘𝐶) ∪ (R‘𝐶))(𝑥𝑂 ·s (𝐵 +s 𝑧𝑂)) = ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝑧𝑂)))
31	30	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → ∀𝑥𝑂 ∈ ((L‘𝐴) ∪ (R‘𝐴))∀𝑧𝑂 ∈ ((L‘𝐶) ∪ (R‘𝐶))(𝑥𝑂 ·s (𝐵 +s 𝑧𝑂)) = ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝑧𝑂)))
32	25, 29, 31, 9, 19	rspc2dv 3594	. . 3 ⊢ ((𝜑 ∧ 𝜓) → (𝑋 ·s (𝐵 +s 𝑍)) = ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝑍)))
33	21, 32	oveq12d 7469	. 2 ⊢ ((𝜑 ∧ 𝜓) → (((𝑋 ·s (𝐵 +s 𝐶)) +s (𝐴 ·s (𝐵 +s 𝑍))) −s (𝑋 ·s (𝐵 +s 𝑍))) = ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))) −s ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝑍))))
34		leftssno 28316	. . . . . . . . 9 ⊢ (L‘𝐴) ⊆ No
35		rightssno 28317	. . . . . . . . 9 ⊢ (R‘𝐴) ⊆ No
36	34, 35	unssi 4192	. . . . . . . 8 ⊢ ((L‘𝐴) ∪ (R‘𝐴)) ⊆ No
37	36, 8	sselid 3911	. . . . . . 7 ⊢ (𝜓 → 𝑋 ∈ No)
38	37	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝑋 ∈ No)
39		addsdilem4.2	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ No)
40	39	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝐵 ∈ No)
41	38, 40	mulscld 28578	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → (𝑋 ·s 𝐵) ∈ No)
42		addsdilem4.3	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ No)
43	42	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝐶 ∈ No)
44	38, 43	mulscld 28578	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → (𝑋 ·s 𝐶) ∈ No)
45	41, 44	addscld 28423	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) ∈ No)
46		addsdilem4.1	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ No)
47	46, 39	mulscld 28578	. . . . . 6 ⊢ (𝜑 → (𝐴 ·s 𝐵) ∈ No)
48	47	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → (𝐴 ·s 𝐵) ∈ No)
49	46	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝐴 ∈ No)
50		leftssno 28316	. . . . . . . . 9 ⊢ (L‘𝐶) ⊆ No
51		rightssno 28317	. . . . . . . . 9 ⊢ (R‘𝐶) ⊆ No
52	50, 51	unssi 4192	. . . . . . . 8 ⊢ ((L‘𝐶) ∪ (R‘𝐶)) ⊆ No
53	52, 18	sselid 3911	. . . . . . 7 ⊢ (𝜓 → 𝑍 ∈ No)
54	53	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝑍 ∈ No)
55	49, 54	mulscld 28578	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → (𝐴 ·s 𝑍) ∈ No)
56	48, 55	addscld 28423	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍)) ∈ No)
57	45, 56	addscld 28423	. . 3 ⊢ ((𝜑 ∧ 𝜓) → (((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))) ∈ No)
58	38, 54	mulscld 28578	. . 3 ⊢ ((𝜑 ∧ 𝜓) → (𝑋 ·s 𝑍) ∈ No)
59	57, 41, 58	subsubs4d 28537	. 2 ⊢ ((𝜑 ∧ 𝜓) → (((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))) −s (𝑋 ·s 𝐵)) −s (𝑋 ·s 𝑍)) = ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))) −s ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝑍))))
60	45, 56, 41	addsubsd 28525	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))) −s (𝑋 ·s 𝐵)) = ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) −s (𝑋 ·s 𝐵)) +s ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))))
61	41, 44	addscomd 28410	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝜓) → ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) = ((𝑋 ·s 𝐶) +s (𝑋 ·s 𝐵)))
62	61	oveq1d 7466	. . . . . . 7 ⊢ ((𝜑 ∧ 𝜓) → (((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) −s (𝑋 ·s 𝐵)) = (((𝑋 ·s 𝐶) +s (𝑋 ·s 𝐵)) −s (𝑋 ·s 𝐵)))
63		pncans 28515	. . . . . . . 8 ⊢ (((𝑋 ·s 𝐶) ∈ No ∧ (𝑋 ·s 𝐵) ∈ No) → (((𝑋 ·s 𝐶) +s (𝑋 ·s 𝐵)) −s (𝑋 ·s 𝐵)) = (𝑋 ·s 𝐶))
64	44, 41, 63	syl2anc 596	. . . . . . 7 ⊢ ((𝜑 ∧ 𝜓) → (((𝑋 ·s 𝐶) +s (𝑋 ·s 𝐵)) −s (𝑋 ·s 𝐵)) = (𝑋 ·s 𝐶))
65	62, 64	eqtrd 2798	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → (((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) −s (𝑋 ·s 𝐵)) = (𝑋 ·s 𝐶))
66	65	oveq1d 7466	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) −s (𝑋 ·s 𝐵)) +s ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))) = ((𝑋 ·s 𝐶) +s ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))))
67	44, 48, 55	adds12d 28451	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → ((𝑋 ·s 𝐶) +s ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))) = ((𝐴 ·s 𝐵) +s ((𝑋 ·s 𝐶) +s (𝐴 ·s 𝑍))))
68	60, 66, 67	3eqtrd 2802	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))) −s (𝑋 ·s 𝐵)) = ((𝐴 ·s 𝐵) +s ((𝑋 ·s 𝐶) +s (𝐴 ·s 𝑍))))
69	68	oveq1d 7466	. . 3 ⊢ ((𝜑 ∧ 𝜓) → (((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))) −s (𝑋 ·s 𝐵)) −s (𝑋 ·s 𝑍)) = (((𝐴 ·s 𝐵) +s ((𝑋 ·s 𝐶) +s (𝐴 ·s 𝑍))) −s (𝑋 ·s 𝑍)))
70	44, 55	addscld 28423	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → ((𝑋 ·s 𝐶) +s (𝐴 ·s 𝑍)) ∈ No)
71	48, 70, 58	addsubsassd 28524	. . 3 ⊢ ((𝜑 ∧ 𝜓) → (((𝐴 ·s 𝐵) +s ((𝑋 ·s 𝐶) +s (𝐴 ·s 𝑍))) −s (𝑋 ·s 𝑍)) = ((𝐴 ·s 𝐵) +s (((𝑋 ·s 𝐶) +s (𝐴 ·s 𝑍)) −s (𝑋 ·s 𝑍))))
72	69, 71	eqtrd 2798	. 2 ⊢ ((𝜑 ∧ 𝜓) → (((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝐵) +s (𝐴 ·s 𝑍))) −s (𝑋 ·s 𝐵)) −s (𝑋 ·s 𝑍)) = ((𝐴 ·s 𝐵) +s (((𝑋 ·s 𝐶) +s (𝐴 ·s 𝑍)) −s (𝑋 ·s 𝑍))))
73	33, 59, 72	3eqtr2d 2804	1 ⊢ ((𝜑 ∧ 𝜓) → (((𝑋 ·s (𝐵 +s 𝐶)) +s (𝐴 ·s (𝐵 +s 𝑍))) −s (𝑋 ·s (𝐵 +s 𝑍))) = ((𝐴 ·s 𝐵) +s (((𝑋 ·s 𝐶) +s (𝐴 ·s 𝑍)) −s (𝑋 ·s 𝑍))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ∪ cun 4152  ‘cfv 6566  (class class class)co 7451  Nocsur 28054  Lcleft 28268  Rcright 28269   +_s cadds 28402   −_s csubs 28463   ·_s cmuls 28549

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-ot 4864  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-1o 8514  df-2o 8515  df-nadd 8713  df-no 28057  df-lts 28058  df-bday 28059  df-les 28159  df-slts 28201  df-cuts 28203  df-0s 28250  df-made 28270  df-old 28271  df-left 28273  df-right 28274  df-norec 28381  df-norec2 28392  df-adds 28403  df-negs 28464  df-subs 28465  df-muls 28550

This theorem is used by:  addsdi  28598