inductionexd - Mathbox for Stanislas Polu

	Mathbox for Stanislas Polu		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > inductionexd		Structured version Visualization version GIF version

Theorem inductionexd 44128

Description: Simple induction example. (Contributed by Stanislas Polu, 9-Mar-2020.)

**Assertion**
Ref	Expression
inductionexd	⊢ (𝑁 ∈ ℕ → 3 ∥ ((4↑𝑁) + 5))

Proof of Theorem inductionexd Dummy variables 𝑘 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7361	. . . 4 ⊢ (𝑘 = 1 → (4↑𝑘) = (4↑1))
2	1	oveq1d 7368	. . 3 ⊢ (𝑘 = 1 → ((4↑𝑘) + 5) = ((4↑1) + 5))
3	2	breq2d 5107	. 2 ⊢ (𝑘 = 1 → (3 ∥ ((4↑𝑘) + 5) ↔ 3 ∥ ((4↑1) + 5)))
4		oveq2 7361	. . . 4 ⊢ (𝑘 = 𝑛 → (4↑𝑘) = (4↑𝑛))
5	4	oveq1d 7368	. . 3 ⊢ (𝑘 = 𝑛 → ((4↑𝑘) + 5) = ((4↑𝑛) + 5))
6	5	breq2d 5107	. 2 ⊢ (𝑘 = 𝑛 → (3 ∥ ((4↑𝑘) + 5) ↔ 3 ∥ ((4↑𝑛) + 5)))
7		oveq2 7361	. . . 4 ⊢ (𝑘 = (𝑛 + 1) → (4↑𝑘) = (4↑(𝑛 + 1)))
8	7	oveq1d 7368	. . 3 ⊢ (𝑘 = (𝑛 + 1) → ((4↑𝑘) + 5) = ((4↑(𝑛 + 1)) + 5))
9	8	breq2d 5107	. 2 ⊢ (𝑘 = (𝑛 + 1) → (3 ∥ ((4↑𝑘) + 5) ↔ 3 ∥ ((4↑(𝑛 + 1)) + 5)))
10		oveq2 7361	. . . 4 ⊢ (𝑘 = 𝑁 → (4↑𝑘) = (4↑𝑁))
11	10	oveq1d 7368	. . 3 ⊢ (𝑘 = 𝑁 → ((4↑𝑘) + 5) = ((4↑𝑁) + 5))
12	11	breq2d 5107	. 2 ⊢ (𝑘 = 𝑁 → (3 ∥ ((4↑𝑘) + 5) ↔ 3 ∥ ((4↑𝑁) + 5)))
13		3z 12526	. . . 4 ⊢ 3 ∈ ℤ
14		4z 12527	. . . . . 6 ⊢ 4 ∈ ℤ
15		1nn0 12418	. . . . . 6 ⊢ 1 ∈ ℕ₀
16		zexpcl 14001	. . . . . 6 ⊢ ((4 ∈ ℤ ∧ 1 ∈ ℕ₀) → (4↑1) ∈ ℤ)
17	14, 15, 16	mp2an 692	. . . . 5 ⊢ (4↑1) ∈ ℤ
18		5nn 12232	. . . . . 6 ⊢ 5 ∈ ℕ
19	18	nnzi 12517	. . . . 5 ⊢ 5 ∈ ℤ
20		zaddcl 12533	. . . . 5 ⊢ (((4↑1) ∈ ℤ ∧ 5 ∈ ℤ) → ((4↑1) + 5) ∈ ℤ)
21	17, 19, 20	mp2an 692	. . . 4 ⊢ ((4↑1) + 5) ∈ ℤ
22	13, 13, 21	3pm3.2i 1340	. . 3 ⊢ (3 ∈ ℤ ∧ 3 ∈ ℤ ∧ ((4↑1) + 5) ∈ ℤ)
23		3t3e9 12308	. . . 4 ⊢ (3 · 3) = 9
24		4nn0 12421	. . . . . . 7 ⊢ 4 ∈ ℕ₀
25	24	numexp1 17006	. . . . . 6 ⊢ (4↑1) = 4
26	25	oveq1i 7363	. . . . 5 ⊢ ((4↑1) + 5) = (4 + 5)
27		5cn 12234	. . . . . 6 ⊢ 5 ∈ ℂ
28		4cn 12231	. . . . . 6 ⊢ 4 ∈ ℂ
29		5p4e9 12299	. . . . . 6 ⊢ (5 + 4) = 9
30	27, 28, 29	addcomli 11326	. . . . 5 ⊢ (4 + 5) = 9
31	26, 30	eqtri 2752	. . . 4 ⊢ ((4↑1) + 5) = 9
32	23, 31	eqtr4i 2755	. . 3 ⊢ (3 · 3) = ((4↑1) + 5)
33		dvds0lem 16195	. . 3 ⊢ (((3 ∈ ℤ ∧ 3 ∈ ℤ ∧ ((4↑1) + 5) ∈ ℤ) ∧ (3 · 3) = ((4↑1) + 5)) → 3 ∥ ((4↑1) + 5))
34	22, 32, 33	mp2an 692	. 2 ⊢ 3 ∥ ((4↑1) + 5)
35	13	a1i 11	. . . . 5 ⊢ ((𝑛 ∈ ℕ ∧ 3 ∥ ((4↑𝑛) + 5)) → 3 ∈ ℤ)
36		4nn 12229	. . . . . . . . . . 11 ⊢ 4 ∈ ℕ
37	36	a1i 11	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → 4 ∈ ℕ)
38		nnnn0 12409	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ₀)
39	37, 38	nnexpcld 14170	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → (4↑𝑛) ∈ ℕ)
40	39	nnzd 12516	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (4↑𝑛) ∈ ℤ)
41	40	adantr 480	. . . . . . 7 ⊢ ((𝑛 ∈ ℕ ∧ 3 ∥ ((4↑𝑛) + 5)) → (4↑𝑛) ∈ ℤ)
42	19	a1i 11	. . . . . . 7 ⊢ ((𝑛 ∈ ℕ ∧ 3 ∥ ((4↑𝑛) + 5)) → 5 ∈ ℤ)
43	41, 42	zaddcld 12602	. . . . . 6 ⊢ ((𝑛 ∈ ℕ ∧ 3 ∥ ((4↑𝑛) + 5)) → ((4↑𝑛) + 5) ∈ ℤ)
44	14	a1i 11	. . . . . 6 ⊢ ((𝑛 ∈ ℕ ∧ 3 ∥ ((4↑𝑛) + 5)) → 4 ∈ ℤ)
45	43, 44	zmulcld 12604	. . . . 5 ⊢ ((𝑛 ∈ ℕ ∧ 3 ∥ ((4↑𝑛) + 5)) → (((4↑𝑛) + 5) · 4) ∈ ℤ)
46	35, 42	zmulcld 12604	. . . . 5 ⊢ ((𝑛 ∈ ℕ ∧ 3 ∥ ((4↑𝑛) + 5)) → (3 · 5) ∈ ℤ)
47		simpr 484	. . . . . 6 ⊢ ((𝑛 ∈ ℕ ∧ 3 ∥ ((4↑𝑛) + 5)) → 3 ∥ ((4↑𝑛) + 5))
48	35, 43, 44, 47	dvdsmultr1d 16226	. . . . 5 ⊢ ((𝑛 ∈ ℕ ∧ 3 ∥ ((4↑𝑛) + 5)) → 3 ∥ (((4↑𝑛) + 5) · 4))
49		dvdsmul1 16206	. . . . . . 7 ⊢ ((3 ∈ ℤ ∧ 5 ∈ ℤ) → 3 ∥ (3 · 5))
50	13, 19, 49	mp2an 692	. . . . . 6 ⊢ 3 ∥ (3 · 5)
51	50	a1i 11	. . . . 5 ⊢ ((𝑛 ∈ ℕ ∧ 3 ∥ ((4↑𝑛) + 5)) → 3 ∥ (3 · 5))
52	35, 45, 46, 48, 51	dvds2subd 16222	. . . 4 ⊢ ((𝑛 ∈ ℕ ∧ 3 ∥ ((4↑𝑛) + 5)) → 3 ∥ ((((4↑𝑛) + 5) · 4) − (3 · 5)))
53	39	nncnd 12162	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (4↑𝑛) ∈ ℂ)
54	27	a1i 11	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → 5 ∈ ℂ)
55	28	a1i 11	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → 4 ∈ ℂ)
56	53, 54, 55	adddird 11159	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → (((4↑𝑛) + 5) · 4) = (((4↑𝑛) · 4) + (5 · 4)))
57	56	oveq1d 7368	. . . . . 6 ⊢ (𝑛 ∈ ℕ → ((((4↑𝑛) + 5) · 4) − ;15) = ((((4↑𝑛) · 4) + (5 · 4)) − ;15))
58		3cn 12227	. . . . . . . . 9 ⊢ 3 ∈ ℂ
59		5t3e15 12710	. . . . . . . . 9 ⊢ (5 · 3) = ;15
60	27, 58, 59	mulcomli 11143	. . . . . . . 8 ⊢ (3 · 5) = ;15
61	60	a1i 11	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → (3 · 5) = ;15)
62	61	oveq2d 7369	. . . . . 6 ⊢ (𝑛 ∈ ℕ → ((((4↑𝑛) + 5) · 4) − (3 · 5)) = ((((4↑𝑛) + 5) · 4) − ;15))
63	55, 38	expp1d 14072	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (4↑(𝑛 + 1)) = ((4↑𝑛) · 4))
64		ax-1cn 11086	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℂ
65		3p1e4 12286	. . . . . . . . . . . . . . . 16 ⊢ (3 + 1) = 4
66	58, 64, 65	addcomli 11326	. . . . . . . . . . . . . . 15 ⊢ (1 + 3) = 4
67	66	eqcomi 2738	. . . . . . . . . . . . . 14 ⊢ 4 = (1 + 3)
68	67	oveq1i 7363	. . . . . . . . . . . . 13 ⊢ (4 − 3) = ((1 + 3) − 3)
69	64, 58	pncan3oi 11397	. . . . . . . . . . . . 13 ⊢ ((1 + 3) − 3) = 1
70	68, 69	eqtri 2752	. . . . . . . . . . . 12 ⊢ (4 − 3) = 1
71	70	oveq2i 7364	. . . . . . . . . . 11 ⊢ (5 · (4 − 3)) = (5 · 1)
72	27, 28, 58	subdii 11587	. . . . . . . . . . 11 ⊢ (5 · (4 − 3)) = ((5 · 4) − (5 · 3))
73	27	mulridi 11138	. . . . . . . . . . 11 ⊢ (5 · 1) = 5
74	71, 72, 73	3eqtr3ri 2761	. . . . . . . . . 10 ⊢ 5 = ((5 · 4) − (5 · 3))
75	59	eqcomi 2738	. . . . . . . . . . 11 ⊢ ;15 = (5 · 3)
76	75	oveq2i 7364	. . . . . . . . . 10 ⊢ ((5 · 4) − ;15) = ((5 · 4) − (5 · 3))
77	74, 76	eqtr4i 2755	. . . . . . . . 9 ⊢ 5 = ((5 · 4) − ;15)
78	77	a1i 11	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → 5 = ((5 · 4) − ;15))
79	63, 78	oveq12d 7371	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → ((4↑(𝑛 + 1)) + 5) = (((4↑𝑛) · 4) + ((5 · 4) − ;15)))
80	53, 55	mulcld 11154	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → ((4↑𝑛) · 4) ∈ ℂ)
81	54, 55	mulcld 11154	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (5 · 4) ∈ ℂ)
82		5nn0 12422	. . . . . . . . . . 11 ⊢ 5 ∈ ℕ₀
83	15, 82	deccl 12624	. . . . . . . . . 10 ⊢ ;15 ∈ ℕ₀
84	83	nn0cni 12414	. . . . . . . . 9 ⊢ ;15 ∈ ℂ
85	84	a1i 11	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → ;15 ∈ ℂ)
86	80, 81, 85	addsubassd 11513	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → ((((4↑𝑛) · 4) + (5 · 4)) − ;15) = (((4↑𝑛) · 4) + ((5 · 4) − ;15)))
87	79, 86	eqtr4d 2767	. . . . . 6 ⊢ (𝑛 ∈ ℕ → ((4↑(𝑛 + 1)) + 5) = ((((4↑𝑛) · 4) + (5 · 4)) − ;15))
88	57, 62, 87	3eqtr4rd 2775	. . . . 5 ⊢ (𝑛 ∈ ℕ → ((4↑(𝑛 + 1)) + 5) = ((((4↑𝑛) + 5) · 4) − (3 · 5)))
89	88	adantr 480	. . . 4 ⊢ ((𝑛 ∈ ℕ ∧ 3 ∥ ((4↑𝑛) + 5)) → ((4↑(𝑛 + 1)) + 5) = ((((4↑𝑛) + 5) · 4) − (3 · 5)))
90	52, 89	breqtrrd 5123	. . 3 ⊢ ((𝑛 ∈ ℕ ∧ 3 ∥ ((4↑𝑛) + 5)) → 3 ∥ ((4↑(𝑛 + 1)) + 5))
91	90	ex 412	. 2 ⊢ (𝑛 ∈ ℕ → (3 ∥ ((4↑𝑛) + 5) → 3 ∥ ((4↑(𝑛 + 1)) + 5)))
92	3, 6, 9, 12, 34, 91	nnind 12164	1 ⊢ (𝑁 ∈ ℕ → 3 ∥ ((4↑𝑁) + 5))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 class class class wbr 5095 (class class class)co 7353 ℂcc 11026 1c1 11029 + caddc 11031 · cmul 11033 − cmin 11365 ℕcn 12146 3c3 12202 4c4 12203 5c5 12204 9c9 12208 ℕ₀cn0 12402 ℤcz 12489 cdc 12609 ↑cexp 13986 ∥ cdvds 16181

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8632 df-en 8880 df-dom 8881 df-sdom 8882 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-nn 12147 df-2 12209 df-3 12210 df-4 12211 df-5 12212 df-6 12213 df-7 12214 df-8 12215 df-9 12216 df-n0 12403 df-z 12490 df-dec 12610 df-uz 12754 df-seq 13927 df-exp 13987 df-dvds 16182

This theorem is referenced by: (None)

W3C validator