Theorem nndir 6767

Description: Distributive law for natural numbers (right-distributivity). (Contributed by Jim Kingdon, 3-Dec-2019.)

Assertion

Ref	Expression
nndir	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 +o 𝐵) ·o 𝐶) = ((𝐴 ·o 𝐶) +o (𝐵 ·o 𝐶)))

Proof of Theorem nndir

Step	Hyp	Ref	Expression
1		nndi 6763	. . 3 ⊢ ((𝐶 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐶 ·o (𝐴 +o 𝐵)) = ((𝐶 ·o 𝐴) +o (𝐶 ·o 𝐵)))
2	1	3coml 1241	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐶 ·o (𝐴 +o 𝐵)) = ((𝐶 ·o 𝐴) +o (𝐶 ·o 𝐵)))
3		nnacl 6757	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ∈ ω)
4		nnmcom 6766	. . . . 5 ⊢ ((𝐶 ∈ ω ∧ (𝐴 +o 𝐵) ∈ ω) → (𝐶 ·o (𝐴 +o 𝐵)) = ((𝐴 +o 𝐵) ·o 𝐶))
5	3, 4	sylan2 286	. . . 4 ⊢ ((𝐶 ∈ ω ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐶 ·o (𝐴 +o 𝐵)) = ((𝐴 +o 𝐵) ·o 𝐶))
6	5	ancoms 268	. . 3 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐶 ∈ ω) → (𝐶 ·o (𝐴 +o 𝐵)) = ((𝐴 +o 𝐵) ·o 𝐶))
7	6	3impa 1225	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐶 ·o (𝐴 +o 𝐵)) = ((𝐴 +o 𝐵) ·o 𝐶))
8		nnmcom 6766	. . . . 5 ⊢ ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) → (𝐶 ·o 𝐴) = (𝐴 ·o 𝐶))
9	8	ancoms 268	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐶 ∈ ω) → (𝐶 ·o 𝐴) = (𝐴 ·o 𝐶))
10	9	3adant2 1047	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐶 ·o 𝐴) = (𝐴 ·o 𝐶))
11		nnmcom 6766	. . . . 5 ⊢ ((𝐶 ∈ ω ∧ 𝐵 ∈ ω) → (𝐶 ·o 𝐵) = (𝐵 ·o 𝐶))
12	11	ancoms 268	. . . 4 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐶 ·o 𝐵) = (𝐵 ·o 𝐶))
13	12	3adant1 1046	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐶 ·o 𝐵) = (𝐵 ·o 𝐶))
14	10, 13	oveq12d 6106	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 ·o 𝐴) +o (𝐶 ·o 𝐵)) = ((𝐴 ·o 𝐶) +o (𝐵 ·o 𝐶)))
15	2, 7, 14	3eqtr3d 2279	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 +o 𝐵) ·o 𝐶) = ((𝐴 ·o 𝐶) +o (𝐵 ·o 𝐶)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ωcom 4739  (class class class)co 6088   +_o coa 6688   ·_o comu 6689

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-oadd 6695  df-omul 6696

This theorem is used by:  addassnq0  7835