Theorem 235t711 43183

Description: Calculate a product by long multiplication as a base comparison with other multiplication algorithms.

Conveniently, 711 has two ones which greatly simplifies calculations like 235 · 1. There isn't a higher level mulcomli 11245 saving the lower level uses of mulcomli 11245 within 235 · 7 since mulcom2 doesn't exist, but if commuted versions of theorems like 7t2e14 12853 are added then this proof would benefit more than ex-decpmul 43184.

For practicality, this proof doesn't have "e167085" at the end of its name like 2p2e4 12402 or 8t7e56 12864. (Contributed by Steven Nguyen, 10-Dec-2022.) (New usage is discouraged.)

Assertion

Ref	Expression
235t711	⊢ (;;235 · ;;711) = ;;;;;167085

Proof of Theorem 235t711

Step	Hyp	Ref	Expression
1		2nn0 12548	. . . 4 ⊢ 2 ∈ ℕ0
2		3nn0 12549	. . . 4 ⊢ 3 ∈ ℕ0
3	1, 2	deccl 12754	. . 3 ⊢ ;23 ∈ ℕ0
4		5nn0 12551	. . 3 ⊢ 5 ∈ ℕ0
5	3, 4	deccl 12754	. 2 ⊢ ;;235 ∈ ℕ0
6		7nn0 12553	. . 3 ⊢ 7 ∈ ℕ0
7		1nn0 12547	. . 3 ⊢ 1 ∈ ℕ0
8	6, 7	deccl 12754	. 2 ⊢ ;71 ∈ ℕ0
9		eqid 2760	. 2 ⊢ ;;711 = ;;711
10		eqid 2760	. . 3 ⊢ ;71 = ;71
11		eqid 2760	. . 3 ⊢ ;23 = ;23
12		8nn0 12554	. . 3 ⊢ 8 ∈ ℕ0
13		eqid 2760	. . . 4 ⊢ ;;235 = ;;235
14	3	nn0cni 12543	. . . . 5 ⊢ ;23 ∈ ℂ
15		2cn 12343	. . . . 5 ⊢ 2 ∈ ℂ
16		3p2e5 12418	. . . . . 6 ⊢ (3 + 2) = 5
17	1, 2, 1, 11, 16	decaddi 12804	. . . . 5 ⊢ (;23 + 2) = ;25
18	14, 15, 17	addcomli 11429	. . . 4 ⊢ (2 + ;23) = ;25
19		0nn0 12546	. . . 4 ⊢ 0 ∈ ℕ0
20		4nn0 12550	. . . 4 ⊢ 4 ∈ ℕ0
21		6nn0 12552	. . . . . 6 ⊢ 6 ∈ ℕ0
22	7, 21	deccl 12754	. . . . 5 ⊢ ;16 ∈ ℕ0
23	1, 20	nn0addcli 12568	. . . . 5 ⊢ (2 + 4) ∈ ℕ0
24		7cn 12362	. . . . . . . 8 ⊢ 7 ∈ ℂ
25		7t2e14 12853	. . . . . . . 8 ⊢ (7 · 2) = ;14
26	24, 15, 25	mulcomli 11245	. . . . . . 7 ⊢ (2 · 7) = ;14
27		4p2e6 12420	. . . . . . 7 ⊢ (4 + 2) = 6
28	7, 20, 1, 26, 27	decaddi 12804	. . . . . 6 ⊢ ((2 · 7) + 2) = ;16
29		3cn 12349	. . . . . . 7 ⊢ 3 ∈ ℂ
30		7t3e21 12854	. . . . . . 7 ⊢ (7 · 3) = ;21
31	24, 29, 30	mulcomli 11245	. . . . . 6 ⊢ (3 · 7) = ;21
32	6, 1, 2, 11, 7, 1, 28, 31	decmul1c 12809	. . . . 5 ⊢ (;23 · 7) = ;;161
33		4cn 12353	. . . . . . 7 ⊢ 4 ∈ ℂ
34	15, 33	addcli 11242	. . . . . 6 ⊢ (2 + 4) ∈ ℂ
35		ax-1cn 11185	. . . . . 6 ⊢ 1 ∈ ℂ
36	33, 15, 27	addcomli 11429	. . . . . . . 8 ⊢ (2 + 4) = 6
37	36	oveq1i 7424	. . . . . . 7 ⊢ ((2 + 4) + 1) = (6 + 1)
38		6p1e7 12415	. . . . . . 7 ⊢ (6 + 1) = 7
39	37, 38	eqtri 2783	. . . . . 6 ⊢ ((2 + 4) + 1) = 7
40	34, 35, 39	addcomli 11429	. . . . 5 ⊢ (1 + (2 + 4)) = 7
41	22, 7, 23, 32, 40	decaddi 12804	. . . 4 ⊢ ((;23 · 7) + (2 + 4)) = ;;167
42		5cn 12356	. . . . . 6 ⊢ 5 ∈ ℂ
43		7t5e35 12856	. . . . . 6 ⊢ (7 · 5) = ;35
44	24, 42, 43	mulcomli 11245	. . . . 5 ⊢ (5 · 7) = ;35
45		3p1e4 12412	. . . . 5 ⊢ (3 + 1) = 4
46		5p5e10 12815	. . . . 5 ⊢ (5 + 5) = ;10
47	2, 4, 4, 44, 45, 46	decaddci2 12806	. . . 4 ⊢ ((5 · 7) + 5) = ;40
48	3, 4, 1, 4, 13, 18, 6, 19, 20, 41, 47	decmac 12796	. . 3 ⊢ ((;;235 · 7) + (2 + ;23)) = ;;;1670
49	5	nn0cni 12543	. . . . 5 ⊢ ;;235 ∈ ℂ
50	49	mulridi 11240	. . . 4 ⊢ (;;235 · 1) = ;;235
51		5p3e8 12424	. . . 4 ⊢ (5 + 3) = 8
52	3, 4, 2, 50, 51	decaddi 12804	. . 3 ⊢ ((;;235 · 1) + 3) = ;;238
53	6, 7, 1, 2, 10, 11, 5, 12, 3, 48, 52	decma2c 12797	. 2 ⊢ ((;;235 · ;71) + ;23) = ;;;;16708
54	5, 8, 7, 9, 4, 3, 53, 50	decmul2c 12810	1 ⊢ (;;235 · ;;711) = ;;;;;167085

This proof depends on syntax axioms:   = wceq 1570  (class class class)co 7414  0cc0 11127  1c1 11128   + caddc 11130   · cmul 11132  2c2 12322  3c3 12323  4c4 12324  5c5 12325  6c6 12326  7c7 12327  8c8 12328  ;cdc 12739

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-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203

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-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-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-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 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-er 8699  df-en 8956  df-dom 8957  df-sdom 8958  df-pnf 11272  df-mnf 11273  df-ltxr 11275  df-sub 11470  df-nn 12261  df-2 12330  df-3 12331  df-4 12332  df-5 12333  df-6 12334  df-7 12335  df-8 12336  df-9 12337  df-n0 12532  df-dec 12740

This theorem is used by: (None)