MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  addsdilem3 Structured version   Visualization version   GIF version

Theorem addsdilem3 28521
Description: Lemma for addsdi 28523. Show one of the equalities involved in the final expression. (Contributed by Scott Fenton, 9-Mar-2025.)
Hypotheses
Ref Expression
addsdilem3.1 (𝜑 → 𝐴 ∈ No )
addsdilem3.2 (𝜑 → 𝐵 ∈ No )
addsdilem3.3 (𝜑 → 𝐶 ∈ No )
addsdilem3.4 (𝜑 → ∀𝑥𝑂 ∈ (( L ‘𝐴) ∪ ( R ‘𝐴))(𝑥𝑂 ·s (𝐵 +s 𝐶)) = ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝐶)))
addsdilem3.5 (𝜑 → ∀𝑦𝑂 ∈ (( L ‘𝐵) ∪ ( R ‘𝐵))(𝐴 ·s (𝑦𝑂 +s 𝐶)) = ((𝐴 ·s 𝑦𝑂) +s (𝐴 ·s 𝐶)))
addsdilem3.6 (𝜑 → ∀𝑥𝑂 ∈ (( L ‘𝐴) ∪ ( R ‘𝐴))∀𝑦𝑂 ∈ (( L ‘𝐵) ∪ ( R ‘𝐵))(𝑥𝑂 ·s (𝑦𝑂 +s 𝐶)) = ((𝑥𝑂 ·s 𝑦𝑂) +s (𝑥𝑂 ·s 𝐶)))
addsdilem3.7 (𝜓 → 𝑋 ∈ (( L ‘𝐴) ∪ ( R ‘𝐴)))
addsdilem3.8 (𝜓 → 𝑌 ∈ (( L ‘𝐵) ∪ ( R ‘𝐵)))
Assertion
Ref Expression
addsdilem3 ((𝜑 ∧ 𝜓) → (((𝑋 ·s (𝐵 +s 𝐶)) +s (𝐴 ·s (𝑌 +s 𝐶))) -s (𝑋 ·s (𝑌 +s 𝐶))) = ((((𝑋 ·s 𝐵) +s (𝐴 ·s 𝑌)) -s (𝑋 ·s 𝑌)) +s (𝐴 ·s 𝐶)))
Distinct variable groups:   𝐴,𝑥𝑂,𝑦𝑂   𝐵,𝑥𝑂,𝑦𝑂   𝐶,𝑥𝑂,𝑦𝑂   𝑋,𝑥𝑂,𝑦𝑂   𝑌,𝑦𝑂
Allowed substitution hints:   𝜑(𝑥𝑂, 𝑦𝑂)   𝜓(𝑥𝑂, 𝑦𝑂)   𝑌(𝑥𝑂)

Proof of Theorem addsdilem3
StepHypRef Expression
1 oveq1 7419 . . . . . 6 (𝑥𝑂 = 𝑋 → (𝑥𝑂 ·s (𝐵 +s 𝐶)) = (𝑋 ·s (𝐵 +s 𝐶)))
2 oveq1 7419 . . . . . . 7 (𝑥𝑂 = 𝑋 → (𝑥𝑂 ·s 𝐵) = (𝑋 ·s 𝐵))
3 oveq1 7419 . . . . . . 7 (𝑥𝑂 = 𝑋 → (𝑥𝑂 ·s 𝐶) = (𝑋 ·s 𝐶))
42, 3oveq12d 7430 . . . . . 6 (𝑥𝑂 = 𝑋 → ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝐶)) = ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)))
51, 4eqeq12d 2777 . . . . 5 (𝑥𝑂 = 𝑋 → ((𝑥𝑂 ·s (𝐵 +s 𝐶)) = ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝐶)) ↔ (𝑋 ·s (𝐵 +s 𝐶)) = ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶))))
6 addsdilem3.4 . . . . . 6 (𝜑 → ∀𝑥𝑂 ∈ (( L ‘𝐴) ∪ ( R ‘𝐴))(𝑥𝑂 ·s (𝐵 +s 𝐶)) = ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝐶)))
76adantr 486 . . . . 5 ((𝜑 ∧ 𝜓) → ∀𝑥𝑂 ∈ (( L ‘𝐴) ∪ ( R ‘𝐴))(𝑥𝑂 ·s (𝐵 +s 𝐶)) = ((𝑥𝑂 ·s 𝐵) +s (𝑥𝑂 ·s 𝐶)))
8 addsdilem3.7 . . . . . 6 (𝜓 → 𝑋 ∈ (( L ‘𝐴) ∪ ( R ‘𝐴)))
98adantl 487 . . . . 5 ((𝜑 ∧ 𝜓) → 𝑋 ∈ (( L ‘𝐴) ∪ ( R ‘𝐴)))
105, 7, 9rspcdva 3578 . . . 4 ((𝜑 ∧ 𝜓) → (𝑋 ·s (𝐵 +s 𝐶)) = ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)))
11 oveq1 7419 . . . . . . 7 (𝑦𝑂 = 𝑌 → (𝑦𝑂 +s 𝐶) = (𝑌 +s 𝐶))
1211oveq2d 7428 . . . . . 6 (𝑦𝑂 = 𝑌 → (𝐴 ·s (𝑦𝑂 +s 𝐶)) = (𝐴 ·s (𝑌 +s 𝐶)))
13 oveq2 7420 . . . . . . 7 (𝑦𝑂 = 𝑌 → (𝐴 ·s 𝑦𝑂) = (𝐴 ·s 𝑌))
1413oveq1d 7427 . . . . . 6 (𝑦𝑂 = 𝑌 → ((𝐴 ·s 𝑦𝑂) +s (𝐴 ·s 𝐶)) = ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶)))
1512, 14eqeq12d 2777 . . . . 5 (𝑦𝑂 = 𝑌 → ((𝐴 ·s (𝑦𝑂 +s 𝐶)) = ((𝐴 ·s 𝑦𝑂) +s (𝐴 ·s 𝐶)) ↔ (𝐴 ·s (𝑌 +s 𝐶)) = ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))))
16 addsdilem3.5 . . . . . 6 (𝜑 → ∀𝑦𝑂 ∈ (( L ‘𝐵) ∪ ( R ‘𝐵))(𝐴 ·s (𝑦𝑂 +s 𝐶)) = ((𝐴 ·s 𝑦𝑂) +s (𝐴 ·s 𝐶)))
1716adantr 486 . . . . 5 ((𝜑 ∧ 𝜓) → ∀𝑦𝑂 ∈ (( L ‘𝐵) ∪ ( R ‘𝐵))(𝐴 ·s (𝑦𝑂 +s 𝐶)) = ((𝐴 ·s 𝑦𝑂) +s (𝐴 ·s 𝐶)))
18 addsdilem3.8 . . . . . 6 (𝜓 → 𝑌 ∈ (( L ‘𝐵) ∪ ( R ‘𝐵)))
1918adantl 487 . . . . 5 ((𝜑 ∧ 𝜓) → 𝑌 ∈ (( L ‘𝐵) ∪ ( R ‘𝐵)))
2015, 17, 19rspcdva 3578 . . . 4 ((𝜑 ∧ 𝜓) → (𝐴 ·s (𝑌 +s 𝐶)) = ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶)))
2110, 20oveq12d 7430 . . 3 ((𝜑 ∧ 𝜓) → ((𝑋 ·s (𝐵 +s 𝐶)) +s (𝐴 ·s (𝑌 +s 𝐶))) = (((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))))
22 oveq1 7419 . . . . 5 (𝑥𝑂 = 𝑋 → (𝑥𝑂 ·s (𝑦𝑂 +s 𝐶)) = (𝑋 ·s (𝑦𝑂 +s 𝐶)))
23 oveq1 7419 . . . . . 6 (𝑥𝑂 = 𝑋 → (𝑥𝑂 ·s 𝑦𝑂) = (𝑋 ·s 𝑦𝑂))
2423, 3oveq12d 7430 . . . . 5 (𝑥𝑂 = 𝑋 → ((𝑥𝑂 ·s 𝑦𝑂) +s (𝑥𝑂 ·s 𝐶)) = ((𝑋 ·s 𝑦𝑂) +s (𝑋 ·s 𝐶)))
2522, 24eqeq12d 2777 . . . 4 (𝑥𝑂 = 𝑋 → ((𝑥𝑂 ·s (𝑦𝑂 +s 𝐶)) = ((𝑥𝑂 ·s 𝑦𝑂) +s (𝑥𝑂 ·s 𝐶)) ↔ (𝑋 ·s (𝑦𝑂 +s 𝐶)) = ((𝑋 ·s 𝑦𝑂) +s (𝑋 ·s 𝐶))))
2611oveq2d 7428 . . . . 5 (𝑦𝑂 = 𝑌 → (𝑋 ·s (𝑦𝑂 +s 𝐶)) = (𝑋 ·s (𝑌 +s 𝐶)))
27 oveq2 7420 . . . . . 6 (𝑦𝑂 = 𝑌 → (𝑋 ·s 𝑦𝑂) = (𝑋 ·s 𝑌))
2827oveq1d 7427 . . . . 5 (𝑦𝑂 = 𝑌 → ((𝑋 ·s 𝑦𝑂) +s (𝑋 ·s 𝐶)) = ((𝑋 ·s 𝑌) +s (𝑋 ·s 𝐶)))
2926, 28eqeq12d 2777 . . . 4 (𝑦𝑂 = 𝑌 → ((𝑋 ·s (𝑦𝑂 +s 𝐶)) = ((𝑋 ·s 𝑦𝑂) +s (𝑋 ·s 𝐶)) ↔ (𝑋 ·s (𝑌 +s 𝐶)) = ((𝑋 ·s 𝑌) +s (𝑋 ·s 𝐶))))
30 addsdilem3.6 . . . . 5 (𝜑 → ∀𝑥𝑂 ∈ (( L ‘𝐴) ∪ ( R ‘𝐴))∀𝑦𝑂 ∈ (( L ‘𝐵) ∪ ( R ‘𝐵))(𝑥𝑂 ·s (𝑦𝑂 +s 𝐶)) = ((𝑥𝑂 ·s 𝑦𝑂) +s (𝑥𝑂 ·s 𝐶)))
3130adantr 486 . . . 4 ((𝜑 ∧ 𝜓) → ∀𝑥𝑂 ∈ (( L ‘𝐴) ∪ ( R ‘𝐴))∀𝑦𝑂 ∈ (( L ‘𝐵) ∪ ( R ‘𝐵))(𝑥𝑂 ·s (𝑦𝑂 +s 𝐶)) = ((𝑥𝑂 ·s 𝑦𝑂) +s (𝑥𝑂 ·s 𝐶)))
3225, 29, 31, 9, 19rspc2dv 3591 . . 3 ((𝜑 ∧ 𝜓) → (𝑋 ·s (𝑌 +s 𝐶)) = ((𝑋 ·s 𝑌) +s (𝑋 ·s 𝐶)))
3321, 32oveq12d 7430 . 2 ((𝜑 ∧ 𝜓) → (((𝑋 ·s (𝐵 +s 𝐶)) +s (𝐴 ·s (𝑌 +s 𝐶))) -s (𝑋 ·s (𝑌 +s 𝐶))) = ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))) -s ((𝑋 ·s 𝑌) +s (𝑋 ·s 𝐶))))
34 leftssno 28241 . . . . . . . . . . 11 ( L ‘𝐴) ⊆ No
35 rightssno 28242 . . . . . . . . . . 11 ( R ‘𝐴) ⊆ No
3634, 35unssi 4137 . . . . . . . . . 10 (( L ‘𝐴) ∪ ( R ‘𝐴)) ⊆ No
3736, 8sselid 3929 . . . . . . . . 9 (𝜓 → 𝑋 ∈ No )
3837adantl 487 . . . . . . . 8 ((𝜑 ∧ 𝜓) → 𝑋 ∈ No )
39 addsdilem3.2 . . . . . . . . 9 (𝜑 → 𝐵 ∈ No )
4039adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝜓) → 𝐵 ∈ No )
4138, 40mulscld 28503 . . . . . . 7 ((𝜑 ∧ 𝜓) → (𝑋 ·s 𝐵) ∈ No )
42 addsdilem3.3 . . . . . . . . 9 (𝜑 → 𝐶 ∈ No )
4342adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝜓) → 𝐶 ∈ No )
4438, 43mulscld 28503 . . . . . . 7 ((𝜑 ∧ 𝜓) → (𝑋 ·s 𝐶) ∈ No )
45 pncans 28440 . . . . . . 7 (((𝑋 ·s 𝐵) ∈ No ∧ (𝑋 ·s 𝐶) ∈ No ) → (((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) -s (𝑋 ·s 𝐶)) = (𝑋 ·s 𝐵))
4641, 44, 45syl2anc 596 . . . . . 6 ((𝜑 ∧ 𝜓) → (((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) -s (𝑋 ·s 𝐶)) = (𝑋 ·s 𝐵))
4746oveq1d 7427 . . . . 5 ((𝜑 ∧ 𝜓) → ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) -s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))) = ((𝑋 ·s 𝐵) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))))
4841, 44addscld 28348 . . . . . 6 ((𝜑 ∧ 𝜓) → ((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) ∈ No )
49 addsdilem3.1 . . . . . . . . 9 (𝜑 → 𝐴 ∈ No )
5049adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝜓) → 𝐴 ∈ No )
51 leftssno 28241 . . . . . . . . . . 11 ( L ‘𝐵) ⊆ No
52 rightssno 28242 . . . . . . . . . . 11 ( R ‘𝐵) ⊆ No
5351, 52unssi 4137 . . . . . . . . . 10 (( L ‘𝐵) ∪ ( R ‘𝐵)) ⊆ No
5453, 18sselid 3929 . . . . . . . . 9 (𝜓 → 𝑌 ∈ No )
5554adantl 487 . . . . . . . 8 ((𝜑 ∧ 𝜓) → 𝑌 ∈ No )
5650, 55mulscld 28503 . . . . . . 7 ((𝜑 ∧ 𝜓) → (𝐴 ·s 𝑌) ∈ No )
5749, 42mulscld 28503 . . . . . . . 8 (𝜑 → (𝐴 ·s 𝐶) ∈ No )
5857adantr 486 . . . . . . 7 ((𝜑 ∧ 𝜓) → (𝐴 ·s 𝐶) ∈ No )
5956, 58addscld 28348 . . . . . 6 ((𝜑 ∧ 𝜓) → ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶)) ∈ No )
6048, 59, 44addsubsd 28450 . . . . 5 ((𝜑 ∧ 𝜓) → ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))) -s (𝑋 ·s 𝐶)) = ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) -s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))))
6141, 56, 58addsassd 28374 . . . . 5 ((𝜑 ∧ 𝜓) → (((𝑋 ·s 𝐵) +s (𝐴 ·s 𝑌)) +s (𝐴 ·s 𝐶)) = ((𝑋 ·s 𝐵) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))))
6247, 60, 613eqtr4d 2806 . . . 4 ((𝜑 ∧ 𝜓) → ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))) -s (𝑋 ·s 𝐶)) = (((𝑋 ·s 𝐵) +s (𝐴 ·s 𝑌)) +s (𝐴 ·s 𝐶)))
6362oveq1d 7427 . . 3 ((𝜑 ∧ 𝜓) → (((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))) -s (𝑋 ·s 𝐶)) -s (𝑋 ·s 𝑌)) = ((((𝑋 ·s 𝐵) +s (𝐴 ·s 𝑌)) +s (𝐴 ·s 𝐶)) -s (𝑋 ·s 𝑌)))
6448, 59addscld 28348 . . . . 5 ((𝜑 ∧ 𝜓) → (((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))) ∈ No )
6537, 54mulscld 28503 . . . . . 6 (𝜓 → (𝑋 ·s 𝑌) ∈ No )
6665adantl 487 . . . . 5 ((𝜑 ∧ 𝜓) → (𝑋 ·s 𝑌) ∈ No )
6764, 44, 66subsubs4d 28462 . . . 4 ((𝜑 ∧ 𝜓) → (((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))) -s (𝑋 ·s 𝐶)) -s (𝑋 ·s 𝑌)) = ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))) -s ((𝑋 ·s 𝐶) +s (𝑋 ·s 𝑌))))
6844, 66addscomd 28335 . . . . 5 ((𝜑 ∧ 𝜓) → ((𝑋 ·s 𝐶) +s (𝑋 ·s 𝑌)) = ((𝑋 ·s 𝑌) +s (𝑋 ·s 𝐶)))
6968oveq2d 7428 . . . 4 ((𝜑 ∧ 𝜓) → ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))) -s ((𝑋 ·s 𝐶) +s (𝑋 ·s 𝑌))) = ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))) -s ((𝑋 ·s 𝑌) +s (𝑋 ·s 𝐶))))
7067, 69eqtrd 2796 . . 3 ((𝜑 ∧ 𝜓) → (((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))) -s (𝑋 ·s 𝐶)) -s (𝑋 ·s 𝑌)) = ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))) -s ((𝑋 ·s 𝑌) +s (𝑋 ·s 𝐶))))
7141, 56addscld 28348 . . . 4 ((𝜑 ∧ 𝜓) → ((𝑋 ·s 𝐵) +s (𝐴 ·s 𝑌)) ∈ No )
7271, 58, 66addsubsd 28450 . . 3 ((𝜑 ∧ 𝜓) → ((((𝑋 ·s 𝐵) +s (𝐴 ·s 𝑌)) +s (𝐴 ·s 𝐶)) -s (𝑋 ·s 𝑌)) = ((((𝑋 ·s 𝐵) +s (𝐴 ·s 𝑌)) -s (𝑋 ·s 𝑌)) +s (𝐴 ·s 𝐶)))
7363, 70, 723eqtr3d 2804 . 2 ((𝜑 ∧ 𝜓) → ((((𝑋 ·s 𝐵) +s (𝑋 ·s 𝐶)) +s ((𝐴 ·s 𝑌) +s (𝐴 ·s 𝐶))) -s ((𝑋 ·s 𝑌) +s (𝑋 ·s 𝐶))) = ((((𝑋 ·s 𝐵) +s (𝐴 ·s 𝑌)) -s (𝑋 ·s 𝑌)) +s (𝐴 ·s 𝐶)))
7433, 73eqtrd 2796 1 ((𝜑 ∧ 𝜓) → (((𝑋 ·s (𝐵 +s 𝐶)) +s (𝐴 ·s (𝑌 +s 𝐶))) -s (𝑋 ·s (𝑌 +s 𝐶))) = ((((𝑋 ·s 𝐵) +s (𝐴 ·s 𝑌)) -s (𝑋 ·s 𝑌)) +s (𝐴 ·s 𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077   ∪ cun 3897  ‘cfv 6531  (class class class)co 7412   No csur 27979   L cleft 28193   R cright 28194   +s cadds 28327   -s csubs 28388   ·s cmuls 28474
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  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-tp 4589  df-op 4591  df-ot 4593  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-1o 8460  df-2o 8461  df-nadd 8659  df-no 27982  df-lts 27983  df-bday 27984  df-les 28084  df-slts 28126  df-cuts 28128  df-0s 28175  df-made 28195  df-old 28196  df-left 28198  df-right 28199  df-norec 28306  df-norec2 28317  df-adds 28328  df-negs 28389  df-subs 28390  df-muls 28475
This theorem is used by:  addsdi  28523
  Copyright terms: Public domain W3C validator