faclbnd - Metamath Proof Explorer

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

Theorem faclbnd 13856

Description: A lower bound for the factorial function. (Contributed by NM, 17-Dec-2005.)

**Assertion**
Ref	Expression
faclbnd	⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑀↑(𝑁 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑁)))

Proof of Theorem faclbnd Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elnn0 12092	. 2 ⊢ (𝑀 ∈ ℕ₀ ↔ (𝑀 ∈ ℕ ∨ 𝑀 = 0))
2		oveq1 7220	. . . . . . . 8 ⊢ (𝑗 = 0 → (𝑗 + 1) = (0 + 1))
3	2	oveq2d 7229	. . . . . . 7 ⊢ (𝑗 = 0 → (𝑀↑(𝑗 + 1)) = (𝑀↑(0 + 1)))
4		fveq2 6717	. . . . . . . 8 ⊢ (𝑗 = 0 → (!‘𝑗) = (!‘0))
5	4	oveq2d 7229	. . . . . . 7 ⊢ (𝑗 = 0 → ((𝑀↑𝑀) · (!‘𝑗)) = ((𝑀↑𝑀) · (!‘0)))
6	3, 5	breq12d 5066	. . . . . 6 ⊢ (𝑗 = 0 → ((𝑀↑(𝑗 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑗)) ↔ (𝑀↑(0 + 1)) ≤ ((𝑀↑𝑀) · (!‘0))))
7	6	imbi2d 344	. . . . 5 ⊢ (𝑗 = 0 → ((𝑀 ∈ ℕ → (𝑀↑(𝑗 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑗))) ↔ (𝑀 ∈ ℕ → (𝑀↑(0 + 1)) ≤ ((𝑀↑𝑀) · (!‘0)))))
8		oveq1 7220	. . . . . . . 8 ⊢ (𝑗 = 𝑘 → (𝑗 + 1) = (𝑘 + 1))
9	8	oveq2d 7229	. . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝑀↑(𝑗 + 1)) = (𝑀↑(𝑘 + 1)))
10		fveq2 6717	. . . . . . . 8 ⊢ (𝑗 = 𝑘 → (!‘𝑗) = (!‘𝑘))
11	10	oveq2d 7229	. . . . . . 7 ⊢ (𝑗 = 𝑘 → ((𝑀↑𝑀) · (!‘𝑗)) = ((𝑀↑𝑀) · (!‘𝑘)))
12	9, 11	breq12d 5066	. . . . . 6 ⊢ (𝑗 = 𝑘 → ((𝑀↑(𝑗 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑗)) ↔ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))))
13	12	imbi2d 344	. . . . 5 ⊢ (𝑗 = 𝑘 → ((𝑀 ∈ ℕ → (𝑀↑(𝑗 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑗))) ↔ (𝑀 ∈ ℕ → (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘)))))
14		oveq1 7220	. . . . . . . 8 ⊢ (𝑗 = (𝑘 + 1) → (𝑗 + 1) = ((𝑘 + 1) + 1))
15	14	oveq2d 7229	. . . . . . 7 ⊢ (𝑗 = (𝑘 + 1) → (𝑀↑(𝑗 + 1)) = (𝑀↑((𝑘 + 1) + 1)))
16		fveq2 6717	. . . . . . . 8 ⊢ (𝑗 = (𝑘 + 1) → (!‘𝑗) = (!‘(𝑘 + 1)))
17	16	oveq2d 7229	. . . . . . 7 ⊢ (𝑗 = (𝑘 + 1) → ((𝑀↑𝑀) · (!‘𝑗)) = ((𝑀↑𝑀) · (!‘(𝑘 + 1))))
18	15, 17	breq12d 5066	. . . . . 6 ⊢ (𝑗 = (𝑘 + 1) → ((𝑀↑(𝑗 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑗)) ↔ (𝑀↑((𝑘 + 1) + 1)) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1)))))
19	18	imbi2d 344	. . . . 5 ⊢ (𝑗 = (𝑘 + 1) → ((𝑀 ∈ ℕ → (𝑀↑(𝑗 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑗))) ↔ (𝑀 ∈ ℕ → (𝑀↑((𝑘 + 1) + 1)) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1))))))
20		oveq1 7220	. . . . . . . 8 ⊢ (𝑗 = 𝑁 → (𝑗 + 1) = (𝑁 + 1))
21	20	oveq2d 7229	. . . . . . 7 ⊢ (𝑗 = 𝑁 → (𝑀↑(𝑗 + 1)) = (𝑀↑(𝑁 + 1)))
22		fveq2 6717	. . . . . . . 8 ⊢ (𝑗 = 𝑁 → (!‘𝑗) = (!‘𝑁))
23	22	oveq2d 7229	. . . . . . 7 ⊢ (𝑗 = 𝑁 → ((𝑀↑𝑀) · (!‘𝑗)) = ((𝑀↑𝑀) · (!‘𝑁)))
24	21, 23	breq12d 5066	. . . . . 6 ⊢ (𝑗 = 𝑁 → ((𝑀↑(𝑗 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑗)) ↔ (𝑀↑(𝑁 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑁))))
25	24	imbi2d 344	. . . . 5 ⊢ (𝑗 = 𝑁 → ((𝑀 ∈ ℕ → (𝑀↑(𝑗 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑗))) ↔ (𝑀 ∈ ℕ → (𝑀↑(𝑁 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑁)))))
26		nnre 11837	. . . . . . 7 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℝ)
27		nnge1 11858	. . . . . . 7 ⊢ (𝑀 ∈ ℕ → 1 ≤ 𝑀)
28		elnnuz 12478	. . . . . . . 8 ⊢ (𝑀 ∈ ℕ ↔ 𝑀 ∈ (ℤ_≥‘1))
29	28	biimpi 219	. . . . . . 7 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ (ℤ_≥‘1))
30	26, 27, 29	leexp2ad 13823	. . . . . 6 ⊢ (𝑀 ∈ ℕ → (𝑀↑1) ≤ (𝑀↑𝑀))
31		0p1e1 11952	. . . . . . . 8 ⊢ (0 + 1) = 1
32	31	oveq2i 7224	. . . . . . 7 ⊢ (𝑀↑(0 + 1)) = (𝑀↑1)
33	32	a1i 11	. . . . . 6 ⊢ (𝑀 ∈ ℕ → (𝑀↑(0 + 1)) = (𝑀↑1))
34		fac0 13842	. . . . . . . 8 ⊢ (!‘0) = 1
35	34	oveq2i 7224	. . . . . . 7 ⊢ ((𝑀↑𝑀) · (!‘0)) = ((𝑀↑𝑀) · 1)
36		nnnn0 12097	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℕ₀)
37	26, 36	reexpcld 13733	. . . . . . . . 9 ⊢ (𝑀 ∈ ℕ → (𝑀↑𝑀) ∈ ℝ)
38	37	recnd 10861	. . . . . . . 8 ⊢ (𝑀 ∈ ℕ → (𝑀↑𝑀) ∈ ℂ)
39	38	mulid1d 10850	. . . . . . 7 ⊢ (𝑀 ∈ ℕ → ((𝑀↑𝑀) · 1) = (𝑀↑𝑀))
40	35, 39	eqtrid 2789	. . . . . 6 ⊢ (𝑀 ∈ ℕ → ((𝑀↑𝑀) · (!‘0)) = (𝑀↑𝑀))
41	30, 33, 40	3brtr4d 5085	. . . . 5 ⊢ (𝑀 ∈ ℕ → (𝑀↑(0 + 1)) ≤ ((𝑀↑𝑀) · (!‘0)))
42	26	ad3antrrr 730	. . . . . . . . . . . . . 14 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → 𝑀 ∈ ℝ)
43		simpllr 776	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → 𝑘 ∈ ℕ₀)
44		peano2nn0 12130	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ ℕ₀ → (𝑘 + 1) ∈ ℕ₀)
45	43, 44	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → (𝑘 + 1) ∈ ℕ₀)
46	42, 45	reexpcld 13733	. . . . . . . . . . . . 13 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → (𝑀↑(𝑘 + 1)) ∈ ℝ)
47	36	ad3antrrr 730	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → 𝑀 ∈ ℕ₀)
48	42, 47	reexpcld 13733	. . . . . . . . . . . . . 14 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → (𝑀↑𝑀) ∈ ℝ)
49	43	faccld 13850	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → (!‘𝑘) ∈ ℕ)
50	49	nnred 11845	. . . . . . . . . . . . . 14 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → (!‘𝑘) ∈ ℝ)
51	48, 50	remulcld 10863	. . . . . . . . . . . . 13 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → ((𝑀↑𝑀) · (!‘𝑘)) ∈ ℝ)
52		nn0re 12099	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℕ₀ → 𝑘 ∈ ℝ)
53		peano2re 11005	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℝ → (𝑘 + 1) ∈ ℝ)
54	43, 52, 53	3syl 18	. . . . . . . . . . . . 13 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → (𝑘 + 1) ∈ ℝ)
55		nngt0 11861	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ ℕ → 0 < 𝑀)
56	55	ad3antrrr 730	. . . . . . . . . . . . . . 15 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → 0 < 𝑀)
57		0re 10835	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ ℝ
58		ltle 10921	. . . . . . . . . . . . . . . 16 ⊢ ((0 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (0 < 𝑀 → 0 ≤ 𝑀))
59	57, 58	mpan 690	. . . . . . . . . . . . . . 15 ⊢ (𝑀 ∈ ℝ → (0 < 𝑀 → 0 ≤ 𝑀))
60	42, 56, 59	sylc 65	. . . . . . . . . . . . . 14 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → 0 ≤ 𝑀)
61	42, 45, 60	expge0d 13734	. . . . . . . . . . . . 13 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → 0 ≤ (𝑀↑(𝑘 + 1)))
62		simplr 769	. . . . . . . . . . . . 13 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘)))
63		simprr 773	. . . . . . . . . . . . 13 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → 𝑀 ≤ (𝑘 + 1))
64	46, 51, 42, 54, 61, 60, 62, 63	lemul12ad 11774	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) ∧ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ 𝑀 ≤ (𝑘 + 1))) → ((𝑀↑(𝑘 + 1)) · 𝑀) ≤ (((𝑀↑𝑀) · (!‘𝑘)) · (𝑘 + 1)))
65	64	anandis 678	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘)) ∧ 𝑀 ≤ (𝑘 + 1))) → ((𝑀↑(𝑘 + 1)) · 𝑀) ≤ (((𝑀↑𝑀) · (!‘𝑘)) · (𝑘 + 1)))
66		nncn 11838	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℂ)
67		expp1 13642	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ ℂ ∧ (𝑘 + 1) ∈ ℕ₀) → (𝑀↑((𝑘 + 1) + 1)) = ((𝑀↑(𝑘 + 1)) · 𝑀))
68	66, 44, 67	syl2an 599	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → (𝑀↑((𝑘 + 1) + 1)) = ((𝑀↑(𝑘 + 1)) · 𝑀))
69	68	adantr 484	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘)) ∧ 𝑀 ≤ (𝑘 + 1))) → (𝑀↑((𝑘 + 1) + 1)) = ((𝑀↑(𝑘 + 1)) · 𝑀))
70		facp1 13844	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ ℕ₀ → (!‘(𝑘 + 1)) = ((!‘𝑘) · (𝑘 + 1)))
71	70	adantl 485	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → (!‘(𝑘 + 1)) = ((!‘𝑘) · (𝑘 + 1)))
72	71	oveq2d 7229	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → ((𝑀↑𝑀) · (!‘(𝑘 + 1))) = ((𝑀↑𝑀) · ((!‘𝑘) · (𝑘 + 1))))
73	38	adantr 484	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → (𝑀↑𝑀) ∈ ℂ)
74		faccl 13849	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ ℕ₀ → (!‘𝑘) ∈ ℕ)
75	74	nncnd 11846	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ ℕ₀ → (!‘𝑘) ∈ ℂ)
76	75	adantl 485	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → (!‘𝑘) ∈ ℂ)
77		nn0cn 12100	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ ℕ₀ → 𝑘 ∈ ℂ)
78		peano2cn 11004	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ ℂ → (𝑘 + 1) ∈ ℂ)
79	77, 78	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ ℕ₀ → (𝑘 + 1) ∈ ℂ)
80	79	adantl 485	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → (𝑘 + 1) ∈ ℂ)
81	73, 76, 80	mulassd 10856	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → (((𝑀↑𝑀) · (!‘𝑘)) · (𝑘 + 1)) = ((𝑀↑𝑀) · ((!‘𝑘) · (𝑘 + 1))))
82	72, 81	eqtr4d 2780	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → ((𝑀↑𝑀) · (!‘(𝑘 + 1))) = (((𝑀↑𝑀) · (!‘𝑘)) · (𝑘 + 1)))
83	82	adantr 484	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘)) ∧ 𝑀 ≤ (𝑘 + 1))) → ((𝑀↑𝑀) · (!‘(𝑘 + 1))) = (((𝑀↑𝑀) · (!‘𝑘)) · (𝑘 + 1)))
84	65, 69, 83	3brtr4d 5085	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘)) ∧ 𝑀 ≤ (𝑘 + 1))) → (𝑀↑((𝑘 + 1) + 1)) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1))))
85	84	exp32 424	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → ((𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘)) → (𝑀 ≤ (𝑘 + 1) → (𝑀↑((𝑘 + 1) + 1)) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1))))))
86	85	com23 86	. . . . . . . 8 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → (𝑀 ≤ (𝑘 + 1) → ((𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘)) → (𝑀↑((𝑘 + 1) + 1)) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1))))))
87		nn0ltp1le 12235	. . . . . . . . . . 11 ⊢ (((𝑘 + 1) ∈ ℕ₀ ∧ 𝑀 ∈ ℕ₀) → ((𝑘 + 1) < 𝑀 ↔ ((𝑘 + 1) + 1) ≤ 𝑀))
88	44, 36, 87	syl2anr 600	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → ((𝑘 + 1) < 𝑀 ↔ ((𝑘 + 1) + 1) ≤ 𝑀))
89		peano2nn0 12130	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 + 1) ∈ ℕ₀ → ((𝑘 + 1) + 1) ∈ ℕ₀)
90	44, 89	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℕ₀ → ((𝑘 + 1) + 1) ∈ ℕ₀)
91		reexpcl 13652	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ ℝ ∧ ((𝑘 + 1) + 1) ∈ ℕ₀) → (𝑀↑((𝑘 + 1) + 1)) ∈ ℝ)
92	26, 90, 91	syl2an 599	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → (𝑀↑((𝑘 + 1) + 1)) ∈ ℝ)
93	92	adantr 484	. . . . . . . . . . . 12 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → (𝑀↑((𝑘 + 1) + 1)) ∈ ℝ)
94	37	ad2antrr 726	. . . . . . . . . . . 12 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → (𝑀↑𝑀) ∈ ℝ)
95	44	faccld 13850	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ ℕ₀ → (!‘(𝑘 + 1)) ∈ ℕ)
96	95	nnred 11845	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℕ₀ → (!‘(𝑘 + 1)) ∈ ℝ)
97		remulcl 10814	. . . . . . . . . . . . . 14 ⊢ (((𝑀↑𝑀) ∈ ℝ ∧ (!‘(𝑘 + 1)) ∈ ℝ) → ((𝑀↑𝑀) · (!‘(𝑘 + 1))) ∈ ℝ)
98	37, 96, 97	syl2an 599	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → ((𝑀↑𝑀) · (!‘(𝑘 + 1))) ∈ ℝ)
99	98	adantr 484	. . . . . . . . . . . 12 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → ((𝑀↑𝑀) · (!‘(𝑘 + 1))) ∈ ℝ)
100	26	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → 𝑀 ∈ ℝ)
101	27	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → 1 ≤ 𝑀)
102		simpr 488	. . . . . . . . . . . . . 14 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → ((𝑘 + 1) + 1) ≤ 𝑀)
103	90	ad2antlr 727	. . . . . . . . . . . . . . . 16 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → ((𝑘 + 1) + 1) ∈ ℕ₀)
104	103	nn0zd 12280	. . . . . . . . . . . . . . 15 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → ((𝑘 + 1) + 1) ∈ ℤ)
105		nnz 12199	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℤ)
106	105	ad2antrr 726	. . . . . . . . . . . . . . 15 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → 𝑀 ∈ ℤ)
107		eluz 12452	. . . . . . . . . . . . . . 15 ⊢ ((((𝑘 + 1) + 1) ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑀 ∈ (ℤ_≥‘((𝑘 + 1) + 1)) ↔ ((𝑘 + 1) + 1) ≤ 𝑀))
108	104, 106, 107	syl2anc 587	. . . . . . . . . . . . . 14 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → (𝑀 ∈ (ℤ_≥‘((𝑘 + 1) + 1)) ↔ ((𝑘 + 1) + 1) ≤ 𝑀))
109	102, 108	mpbird 260	. . . . . . . . . . . . 13 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → 𝑀 ∈ (ℤ_≥‘((𝑘 + 1) + 1)))
110	100, 101, 109	leexp2ad 13823	. . . . . . . . . . . 12 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → (𝑀↑((𝑘 + 1) + 1)) ≤ (𝑀↑𝑀))
111	37, 96	anim12i 616	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → ((𝑀↑𝑀) ∈ ℝ ∧ (!‘(𝑘 + 1)) ∈ ℝ))
112		nn0re 12099	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ₀ → 𝑀 ∈ ℝ)
113		id 22	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ₀ → 𝑀 ∈ ℕ₀)
114		nn0ge0 12115	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ₀ → 0 ≤ 𝑀)
115	112, 113, 114	expge0d 13734	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ ℕ₀ → 0 ≤ (𝑀↑𝑀))
116	36, 115	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝑀 ∈ ℕ → 0 ≤ (𝑀↑𝑀))
117	95	nnge1d 11878	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ ℕ₀ → 1 ≤ (!‘(𝑘 + 1)))
118	116, 117	anim12i 616	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → (0 ≤ (𝑀↑𝑀) ∧ 1 ≤ (!‘(𝑘 + 1))))
119		lemulge11 11694	. . . . . . . . . . . . . 14 ⊢ ((((𝑀↑𝑀) ∈ ℝ ∧ (!‘(𝑘 + 1)) ∈ ℝ) ∧ (0 ≤ (𝑀↑𝑀) ∧ 1 ≤ (!‘(𝑘 + 1)))) → (𝑀↑𝑀) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1))))
120	111, 118, 119	syl2anc 587	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → (𝑀↑𝑀) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1))))
121	120	adantr 484	. . . . . . . . . . . 12 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → (𝑀↑𝑀) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1))))
122	93, 94, 99, 110, 121	letrd 10989	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) ∧ ((𝑘 + 1) + 1) ≤ 𝑀) → (𝑀↑((𝑘 + 1) + 1)) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1))))
123	122	ex 416	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → (((𝑘 + 1) + 1) ≤ 𝑀 → (𝑀↑((𝑘 + 1) + 1)) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1)))))
124	88, 123	sylbid 243	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → ((𝑘 + 1) < 𝑀 → (𝑀↑((𝑘 + 1) + 1)) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1)))))
125	124	a1dd 50	. . . . . . . 8 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → ((𝑘 + 1) < 𝑀 → ((𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘)) → (𝑀↑((𝑘 + 1) + 1)) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1))))))
126	52, 53	syl 17	. . . . . . . . 9 ⊢ (𝑘 ∈ ℕ₀ → (𝑘 + 1) ∈ ℝ)
127		lelttric 10939	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℝ ∧ (𝑘 + 1) ∈ ℝ) → (𝑀 ≤ (𝑘 + 1) ∨ (𝑘 + 1) < 𝑀))
128	26, 126, 127	syl2an 599	. . . . . . . 8 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → (𝑀 ≤ (𝑘 + 1) ∨ (𝑘 + 1) < 𝑀))
129	86, 125, 128	mpjaod 860	. . . . . . 7 ⊢ ((𝑀 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → ((𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘)) → (𝑀↑((𝑘 + 1) + 1)) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1)))))
130	129	expcom 417	. . . . . 6 ⊢ (𝑘 ∈ ℕ₀ → (𝑀 ∈ ℕ → ((𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘)) → (𝑀↑((𝑘 + 1) + 1)) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1))))))
131	130	a2d 29	. . . . 5 ⊢ (𝑘 ∈ ℕ₀ → ((𝑀 ∈ ℕ → (𝑀↑(𝑘 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑘))) → (𝑀 ∈ ℕ → (𝑀↑((𝑘 + 1) + 1)) ≤ ((𝑀↑𝑀) · (!‘(𝑘 + 1))))))
132	7, 13, 19, 25, 41, 131	nn0ind 12272	. . . 4 ⊢ (𝑁 ∈ ℕ₀ → (𝑀 ∈ ℕ → (𝑀↑(𝑁 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑁))))
133	132	impcom 411	. . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝑀↑(𝑁 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑁)))
134		faccl 13849	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ₀ → (!‘𝑁) ∈ ℕ)
135	134	nnnn0d 12150	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → (!‘𝑁) ∈ ℕ₀)
136	135	nn0ge0d 12153	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → 0 ≤ (!‘𝑁))
137		nn0p1nn 12129	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → (𝑁 + 1) ∈ ℕ)
138	137	0expd 13709	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → (0↑(𝑁 + 1)) = 0)
139		0exp0e1 13640	. . . . . . . 8 ⊢ (0↑0) = 1
140	139	oveq1i 7223	. . . . . . 7 ⊢ ((0↑0) · (!‘𝑁)) = (1 · (!‘𝑁))
141	134	nncnd 11846	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ₀ → (!‘𝑁) ∈ ℂ)
142	141	mulid2d 10851	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → (1 · (!‘𝑁)) = (!‘𝑁))
143	140, 142	eqtrid 2789	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → ((0↑0) · (!‘𝑁)) = (!‘𝑁))
144	136, 138, 143	3brtr4d 5085	. . . . 5 ⊢ (𝑁 ∈ ℕ₀ → (0↑(𝑁 + 1)) ≤ ((0↑0) · (!‘𝑁)))
145		oveq1 7220	. . . . . 6 ⊢ (𝑀 = 0 → (𝑀↑(𝑁 + 1)) = (0↑(𝑁 + 1)))
146		oveq12 7222	. . . . . . . 8 ⊢ ((𝑀 = 0 ∧ 𝑀 = 0) → (𝑀↑𝑀) = (0↑0))
147	146	anidms 570	. . . . . . 7 ⊢ (𝑀 = 0 → (𝑀↑𝑀) = (0↑0))
148	147	oveq1d 7228	. . . . . 6 ⊢ (𝑀 = 0 → ((𝑀↑𝑀) · (!‘𝑁)) = ((0↑0) · (!‘𝑁)))
149	145, 148	breq12d 5066	. . . . 5 ⊢ (𝑀 = 0 → ((𝑀↑(𝑁 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑁)) ↔ (0↑(𝑁 + 1)) ≤ ((0↑0) · (!‘𝑁))))
150	144, 149	syl5ibr 249	. . . 4 ⊢ (𝑀 = 0 → (𝑁 ∈ ℕ₀ → (𝑀↑(𝑁 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑁))))
151	150	imp 410	. . 3 ⊢ ((𝑀 = 0 ∧ 𝑁 ∈ ℕ₀) → (𝑀↑(𝑁 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑁)))
152	133, 151	jaoian 957	. 2 ⊢ (((𝑀 ∈ ℕ ∨ 𝑀 = 0) ∧ 𝑁 ∈ ℕ₀) → (𝑀↑(𝑁 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑁)))
153	1, 152	sylanb 584	1 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑀↑(𝑁 + 1)) ≤ ((𝑀↑𝑀) · (!‘𝑁)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∨ wo 847 = wceq 1543 ∈ wcel 2110 class class class wbr 5053 ‘cfv 6380 (class class class)co 7213 ℂcc 10727 ℝcr 10728 0cc0 10729 1c1 10730 + caddc 10732 · cmul 10734 < clt 10867 ≤ cle 10868 ℕcn 11830 ℕ₀cn0 12090 ℤcz 12176 ℤ_≥cuz 12438 ↑cexp 13635 !cfa 13839

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-sep 5192 ax-nul 5199 ax-pow 5258 ax-pr 5322 ax-un 7523 ax-cnex 10785 ax-resscn 10786 ax-1cn 10787 ax-icn 10788 ax-addcl 10789 ax-addrcl 10790 ax-mulcl 10791 ax-mulrcl 10792 ax-mulcom 10793 ax-addass 10794 ax-mulass 10795 ax-distr 10796 ax-i2m1 10797 ax-1ne0 10798 ax-1rid 10799 ax-rnegex 10800 ax-rrecex 10801 ax-cnre 10802 ax-pre-lttri 10803 ax-pre-lttrn 10804 ax-pre-ltadd 10805 ax-pre-mulgt0 10806

This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3410 df-sbc 3695 df-csb 3812 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-pss 3885 df-nul 4238 df-if 4440 df-pw 4515 df-sn 4542 df-pr 4544 df-tp 4546 df-op 4548 df-uni 4820 df-iun 4906 df-br 5054 df-opab 5116 df-mpt 5136 df-tr 5162 df-id 5455 df-eprel 5460 df-po 5468 df-so 5469 df-fr 5509 df-we 5511 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-rn 5562 df-res 5563 df-ima 5564 df-pred 6160 df-ord 6216 df-on 6217 df-lim 6218 df-suc 6219 df-iota 6338 df-fun 6382 df-fn 6383 df-f 6384 df-f1 6385 df-fo 6386 df-f1o 6387 df-fv 6388 df-riota 7170 df-ov 7216 df-oprab 7217 df-mpo 7218 df-om 7645 df-2nd 7762 df-wrecs 8047 df-recs 8108 df-rdg 8146 df-er 8391 df-en 8627 df-dom 8628 df-sdom 8629 df-pnf 10869 df-mnf 10870 df-xr 10871 df-ltxr 10872 df-le 10873 df-sub 11064 df-neg 11065 df-div 11490 df-nn 11831 df-n0 12091 df-z 12177 df-uz 12439 df-rp 12587 df-seq 13575 df-exp 13636 df-fac 13840

This theorem is referenced by: faclbnd2 13857 faclbnd3 13858

W3C validator