iccpartigtl - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > iccpartigtl		Structured version Visualization version GIF version

Theorem iccpartigtl 48310

Description: If there is a partition, then all intermediate points are strictly greater than the lower bound. (Contributed by AV, 12-Jul-2020.)

**Hypotheses**
Ref	Expression
iccpartgtprec.m	⊢ (𝜑 → 𝑀 ∈ ℕ)
iccpartgtprec.p	⊢ (𝜑 → 𝑃 ∈ (RePart‘𝑀))

**Assertion**
Ref	Expression
iccpartigtl	⊢ (𝜑 → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))

Distinct variable groups: 𝑖,𝑀 𝑃,𝑖 𝜑,𝑖

Proof of Theorem iccpartigtl Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ral0 4457	. . . 4 ⊢ ∀𝑖 ∈ ∅ (𝑃‘0) < (𝑃‘𝑖)
2		oveq2 7424	. . . . . 6 ⊢ (𝑀 = 1 → (1..^𝑀) = (1..^1))
3		fzo0 13741	. . . . . 6 ⊢ (1..^1) = ∅
4	2, 3	eqtrdi 2813	. . . . 5 ⊢ (𝑀 = 1 → (1..^𝑀) = ∅)
5	4	raleqdv 3321	. . . 4 ⊢ (𝑀 = 1 → (∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖) ↔ ∀𝑖 ∈ ∅ (𝑃‘0) < (𝑃‘𝑖)))
6	1, 5	mpbiri 261	. . 3 ⊢ (𝑀 = 1 → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))
7	6	a1d 26	. 2 ⊢ (𝑀 = 1 → (𝜑 → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
8		iccpartgtprec.m	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℕ)
9		iccpartgtprec.p	. . . . . 6 ⊢ (𝜑 → 𝑃 ∈ (RePart‘𝑀))
10	8	nnnn0d 12592	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
11		0elfz 13681	. . . . . . 7 ⊢ (𝑀 ∈ ℕ₀ → 0 ∈ (0...𝑀))
12	10, 11	syl 18	. . . . . 6 ⊢ (𝜑 → 0 ∈ (0...𝑀))
13	8, 9, 12	iccpartxr 48306	. . . . 5 ⊢ (𝜑 → (𝑃‘0) ∈ ℝ^*)
14	13	adantr 486	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑀 = 1) → (𝑃‘0) ∈ ℝ^*)
15		elxr 13169	. . . . 5 ⊢ ((𝑃‘0) ∈ ℝ^* ↔ ((𝑃‘0) ∈ ℝ ∨ (𝑃‘0) = +∞ ∨ (𝑃‘0) = -∞))
16		0zd 12630	. . . . . . . . 9 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 0 ∈ ℤ)
17		elfzouz 13721	. . . . . . . . . . 11 ⊢ (𝑖 ∈ (1..^𝑀) → 𝑖 ∈ (ℤ_≥‘1))
18		0p1e1 12388	. . . . . . . . . . . 12 ⊢ (0 + 1) = 1
19	18	fveq2i 6885	. . . . . . . . . . 11 ⊢ (ℤ_≥‘(0 + 1)) = (ℤ_≥‘1)
20	17, 19	eleqtrrdi 2873	. . . . . . . . . 10 ⊢ (𝑖 ∈ (1..^𝑀) → 𝑖 ∈ (ℤ_≥‘(0 + 1)))
21	20	adantl 487	. . . . . . . . 9 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑖 ∈ (ℤ_≥‘(0 + 1)))
22		fveq2 6882	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 0 → (𝑃‘𝑘) = (𝑃‘0))
23	22	eqcomd 2768	. . . . . . . . . . . . 13 ⊢ (𝑘 = 0 → (𝑃‘0) = (𝑃‘𝑘))
24	23	eleq1d 2847	. . . . . . . . . . . 12 ⊢ (𝑘 = 0 → ((𝑃‘0) ∈ ℝ ↔ (𝑃‘𝑘) ∈ ℝ))
25	24	biimpcd 252	. . . . . . . . . . 11 ⊢ ((𝑃‘0) ∈ ℝ → (𝑘 = 0 → (𝑃‘𝑘) ∈ ℝ))
26	25	ad3antrrr 743	. . . . . . . . . 10 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...𝑖)) → (𝑘 = 0 → (𝑃‘𝑘) ∈ ℝ))
27	8	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0))) → 𝑀 ∈ ℕ)
28	9	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0))) → 𝑃 ∈ (RePart‘𝑀))
29		elfz2nn0 13675	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ (0...𝑖) ↔ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖))
30		elfzo2 13719	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑖 ∈ (1..^𝑀) ↔ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀))
31		simpl1 1210	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑘 ∈ ℕ₀)
32		simpr2 1214	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑀 ∈ ℤ)
33		nn0ge0 12556	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑖 ∈ ℕ₀ → 0 ≤ 𝑖)
34		0red 11238	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → 0 ∈ ℝ)
35		eluzelre 12901	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑖 ∈ (ℤ_≥‘1) → 𝑖 ∈ ℝ)
36	35	adantr 486	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → 𝑖 ∈ ℝ)
37		zre 12622	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
38	37	adantl 487	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → 𝑀 ∈ ℝ)
39		lelttr 11327	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((0 ∈ ℝ ∧ 𝑖 ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((0 ≤ 𝑖 ∧ 𝑖 < 𝑀) → 0 < 𝑀))
40	34, 36, 38, 39	syl3anc 1398	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → ((0 ≤ 𝑖 ∧ 𝑖 < 𝑀) → 0 < 𝑀))
41	40	expcomd 422	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → (𝑖 < 𝑀 → (0 ≤ 𝑖 → 0 < 𝑀)))
42	41	3impia 1135	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → (0 ≤ 𝑖 → 0 < 𝑀))
43	33, 42	syl5com 32	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑖 ∈ ℕ₀ → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → 0 < 𝑀))
44	43	3ad2ant2 1152	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → 0 < 𝑀))
45	44	imp 412	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 0 < 𝑀)
46		elnnz 12628	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑀 ∈ ℕ ↔ (𝑀 ∈ ℤ ∧ 0 < 𝑀))
47	32, 45, 46	sylanbrc 595	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑀 ∈ ℕ)
48		nn0re 12540	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝑘 ∈ ℕ₀ → 𝑘 ∈ ℝ)
49	48	ad2antrl 741	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) ∧ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀)) → 𝑘 ∈ ℝ)
50		nn0re 12540	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑖 ∈ ℕ₀ → 𝑖 ∈ ℝ)
51	50	adantl 487	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → 𝑖 ∈ ℝ)
52	51	adantl 487	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) ∧ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀)) → 𝑖 ∈ ℝ)
53	38	adantr 486	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) ∧ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀)) → 𝑀 ∈ ℝ)
54		lelttr 11327	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑘 ∈ ℝ ∧ 𝑖 ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((𝑘 ≤ 𝑖 ∧ 𝑖 < 𝑀) → 𝑘 < 𝑀))
55	54	expd 421	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝑘 ∈ ℝ ∧ 𝑖 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝑘 ≤ 𝑖 → (𝑖 < 𝑀 → 𝑘 < 𝑀)))
56	49, 52, 53, 55	syl3anc 1398	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) ∧ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀)) → (𝑘 ≤ 𝑖 → (𝑖 < 𝑀 → 𝑘 < 𝑀)))
57	56	exp31 425	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑖 ∈ (ℤ_≥‘1) → (𝑀 ∈ ℤ → ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑘 ≤ 𝑖 → (𝑖 < 𝑀 → 𝑘 < 𝑀)))))
58	57	com34 92	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑖 ∈ (ℤ_≥‘1) → (𝑀 ∈ ℤ → (𝑘 ≤ 𝑖 → ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑖 < 𝑀 → 𝑘 < 𝑀)))))
59	58	com35 99	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑖 ∈ (ℤ_≥‘1) → (𝑀 ∈ ℤ → (𝑖 < 𝑀 → ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑘 ≤ 𝑖 → 𝑘 < 𝑀)))))
60	59	3imp 1128	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑘 ≤ 𝑖 → 𝑘 < 𝑀)))
61	60	expdcom 420	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑘 ∈ ℕ₀ → (𝑖 ∈ ℕ₀ → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → (𝑘 ≤ 𝑖 → 𝑘 < 𝑀))))
62	61	com34 92	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑘 ∈ ℕ₀ → (𝑖 ∈ ℕ₀ → (𝑘 ≤ 𝑖 → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → 𝑘 < 𝑀))))
63	62	3imp1 1366	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑘 < 𝑀)
64		elfzo0 13758	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑘 ∈ (0..^𝑀) ↔ (𝑘 ∈ ℕ₀ ∧ 𝑀 ∈ ℕ ∧ 𝑘 < 𝑀))
65	31, 47, 63, 64	syl3anbrc 1362	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑘 ∈ (0..^𝑀))
66	65	ex 418	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → 𝑘 ∈ (0..^𝑀)))
67	30, 66	biimtrid 245	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) → (𝑖 ∈ (1..^𝑀) → 𝑘 ∈ (0..^𝑀)))
68	29, 67	sylbi 220	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (0...𝑖) → (𝑖 ∈ (1..^𝑀) → 𝑘 ∈ (0..^𝑀)))
69	68	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → (𝑖 ∈ (1..^𝑀) → 𝑘 ∈ (0..^𝑀)))
70	69	impcom 413	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0)) → 𝑘 ∈ (0..^𝑀))
71		simpr 490	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → 𝑘 ≠ 0)
72	71	adantl 487	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0)) → 𝑘 ≠ 0)
73		fzo1fzo0n0 13773	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (1..^𝑀) ↔ (𝑘 ∈ (0..^𝑀) ∧ 𝑘 ≠ 0))
74	70, 72, 73	sylanbrc 595	. . . . . . . . . . . . . . . 16 ⊢ ((𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0)) → 𝑘 ∈ (1..^𝑀))
75	74	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0))) → 𝑘 ∈ (1..^𝑀))
76	27, 28, 75	iccpartipre 48308	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0))) → (𝑃‘𝑘) ∈ ℝ)
77	76	exp32 426	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑖 ∈ (1..^𝑀) → ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → (𝑃‘𝑘) ∈ ℝ)))
78	77	ad2antrl 741	. . . . . . . . . . . 12 ⊢ (((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → (𝑖 ∈ (1..^𝑀) → ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → (𝑃‘𝑘) ∈ ℝ)))
79	78	imp 412	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → (𝑃‘𝑘) ∈ ℝ))
80	79	expdimp 458	. . . . . . . . . 10 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...𝑖)) → (𝑘 ≠ 0 → (𝑃‘𝑘) ∈ ℝ))
81	26, 80	pm2.61dne 3043	. . . . . . . . 9 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...𝑖)) → (𝑃‘𝑘) ∈ ℝ)
82	8	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝑀 = 1) → 𝑀 ∈ ℕ)
83	82	ad3antlr 744	. . . . . . . . . . 11 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → 𝑀 ∈ ℕ)
84	9	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝑀 = 1) → 𝑃 ∈ (RePart‘𝑀))
85	84	ad3antlr 744	. . . . . . . . . . 11 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → 𝑃 ∈ (RePart‘𝑀))
86		elfzoelz 13716	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ (1..^𝑀) → 𝑖 ∈ ℤ)
87	86	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑖 ∈ ℤ)
88		fzoval 13717	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ ℤ → (0..^𝑖) = (0...(𝑖 − 1)))
89	88	eqcomd 2768	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ ℤ → (0...(𝑖 − 1)) = (0..^𝑖))
90	87, 89	syl 18	. . . . . . . . . . . . . 14 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (0...(𝑖 − 1)) = (0..^𝑖))
91	90	eleq2d 2848	. . . . . . . . . . . . 13 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑘 ∈ (0...(𝑖 − 1)) ↔ 𝑘 ∈ (0..^𝑖)))
92		elfzouz2 13732	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ (1..^𝑀) → 𝑀 ∈ (ℤ_≥‘𝑖))
93	92	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑀 ∈ (ℤ_≥‘𝑖))
94		fzoss2 13745	. . . . . . . . . . . . . . 15 ⊢ (𝑀 ∈ (ℤ_≥‘𝑖) → (0..^𝑖) ⊆ (0..^𝑀))
95	93, 94	syl 18	. . . . . . . . . . . . . 14 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (0..^𝑖) ⊆ (0..^𝑀))
96	95	sseld 3933	. . . . . . . . . . . . 13 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑘 ∈ (0..^𝑖) → 𝑘 ∈ (0..^𝑀)))
97	91, 96	sylbid 243	. . . . . . . . . . . 12 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑘 ∈ (0...(𝑖 − 1)) → 𝑘 ∈ (0..^𝑀)))
98	97	imp 412	. . . . . . . . . . 11 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → 𝑘 ∈ (0..^𝑀))
99		iccpartimp 48304	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 𝑘 ∈ (0..^𝑀)) → (𝑃 ∈ (ℝ^* ↑_m (0...𝑀)) ∧ (𝑃‘𝑘) < (𝑃‘(𝑘 + 1))))
100	83, 85, 98, 99	syl3anc 1398	. . . . . . . . . 10 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → (𝑃 ∈ (ℝ^* ↑_m (0...𝑀)) ∧ (𝑃‘𝑘) < (𝑃‘(𝑘 + 1))))
101	100	simprd 501	. . . . . . . . 9 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → (𝑃‘𝑘) < (𝑃‘(𝑘 + 1)))
102	16, 21, 81, 101	smonoord 48252	. . . . . . . 8 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘0) < (𝑃‘𝑖))
103	102	ralrimiva 3156	. . . . . . 7 ⊢ (((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))
104	103	ex 418	. . . . . 6 ⊢ ((𝑃‘0) ∈ ℝ → ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
105		lbfzo0 13757	. . . . . . . . . . . . . . . 16 ⊢ (0 ∈ (0..^𝑀) ↔ 𝑀 ∈ ℕ)
106	8, 105	sylibr 237	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 0 ∈ (0..^𝑀))
107	8, 9, 106	3jca 1146	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 0 ∈ (0..^𝑀)))
108	107	ad2antrl 741	. . . . . . . . . . . . 13 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → (𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 0 ∈ (0..^𝑀)))
109	108	adantr 486	. . . . . . . . . . . 12 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 0 ∈ (0..^𝑀)))
110		iccpartimp 48304	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 0 ∈ (0..^𝑀)) → (𝑃 ∈ (ℝ^* ↑_m (0...𝑀)) ∧ (𝑃‘0) < (𝑃‘(0 + 1))))
111	109, 110	syl 18	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃 ∈ (ℝ^* ↑_m (0...𝑀)) ∧ (𝑃‘0) < (𝑃‘(0 + 1))))
112	111	simprd 501	. . . . . . . . . 10 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘0) < (𝑃‘(0 + 1)))
113		breq1 5110	. . . . . . . . . . . 12 ⊢ ((𝑃‘0) = +∞ → ((𝑃‘0) < (𝑃‘(0 + 1)) ↔ +∞ < (𝑃‘(0 + 1))))
114	113	adantr 486	. . . . . . . . . . 11 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ((𝑃‘0) < (𝑃‘(0 + 1)) ↔ +∞ < (𝑃‘(0 + 1))))
115	114	adantr 486	. . . . . . . . . 10 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → ((𝑃‘0) < (𝑃‘(0 + 1)) ↔ +∞ < (𝑃‘(0 + 1))))
116	112, 115	mpbid 235	. . . . . . . . 9 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → +∞ < (𝑃‘(0 + 1)))
117	8	ad2antrl 741	. . . . . . . . . . . 12 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → 𝑀 ∈ ℕ)
118	117	adantr 486	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑀 ∈ ℕ)
119	9	ad2antrl 741	. . . . . . . . . . . 12 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → 𝑃 ∈ (RePart‘𝑀))
120	119	adantr 486	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑃 ∈ (RePart‘𝑀))
121		1nn0 12547	. . . . . . . . . . . . . . . . . 18 ⊢ 1 ∈ ℕ₀
122	121	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ → 1 ∈ ℕ₀)
123		nnnn0 12538	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℕ₀)
124		nnge1 12291	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ → 1 ≤ 𝑀)
125	122, 123, 124	3jca 1146	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ ℕ → (1 ∈ ℕ₀ ∧ 𝑀 ∈ ℕ₀ ∧ 1 ≤ 𝑀))
126	8, 125	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (1 ∈ ℕ₀ ∧ 𝑀 ∈ ℕ₀ ∧ 1 ≤ 𝑀))
127		elfz2nn0 13675	. . . . . . . . . . . . . . 15 ⊢ (1 ∈ (0...𝑀) ↔ (1 ∈ ℕ₀ ∧ 𝑀 ∈ ℕ₀ ∧ 1 ≤ 𝑀))
128	126, 127	sylibr 237	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 1 ∈ (0...𝑀))
129	18, 128	eqeltrid 2866	. . . . . . . . . . . . 13 ⊢ (𝜑 → (0 + 1) ∈ (0...𝑀))
130	129	ad2antrl 741	. . . . . . . . . . . 12 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → (0 + 1) ∈ (0...𝑀))
131	130	adantr 486	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (0 + 1) ∈ (0...𝑀))
132	118, 120, 131	iccpartxr 48306	. . . . . . . . . 10 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘(0 + 1)) ∈ ℝ^*)
133		pnfnlt 13181	. . . . . . . . . 10 ⊢ ((𝑃‘(0 + 1)) ∈ ℝ^* → ¬ +∞ < (𝑃‘(0 + 1)))
134	132, 133	syl 18	. . . . . . . . 9 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → ¬ +∞ < (𝑃‘(0 + 1)))
135	116, 134	pm2.21dd 198	. . . . . . . 8 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘0) < (𝑃‘𝑖))
136	135	ralrimiva 3156	. . . . . . 7 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))
137	136	ex 418	. . . . . 6 ⊢ ((𝑃‘0) = +∞ → ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
138	8	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → 𝑀 ∈ ℕ)
139	9	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → 𝑃 ∈ (RePart‘𝑀))
140		simpr 490	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → 𝑖 ∈ (1..^𝑀))
141	138, 139, 140	iccpartipre 48308	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘𝑖) ∈ ℝ)
142		mnflt 13176	. . . . . . . . . . 11 ⊢ ((𝑃‘𝑖) ∈ ℝ → -∞ < (𝑃‘𝑖))
143	141, 142	syl 18	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → -∞ < (𝑃‘𝑖))
144	143	ralrimiva 3156	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑖 ∈ (1..^𝑀)-∞ < (𝑃‘𝑖))
145	144	ad2antrl 741	. . . . . . . 8 ⊢ (((𝑃‘0) = -∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ∀𝑖 ∈ (1..^𝑀)-∞ < (𝑃‘𝑖))
146		breq1 5110	. . . . . . . . . 10 ⊢ ((𝑃‘0) = -∞ → ((𝑃‘0) < (𝑃‘𝑖) ↔ -∞ < (𝑃‘𝑖)))
147	146	adantr 486	. . . . . . . . 9 ⊢ (((𝑃‘0) = -∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ((𝑃‘0) < (𝑃‘𝑖) ↔ -∞ < (𝑃‘𝑖)))
148	147	ralbidv 3187	. . . . . . . 8 ⊢ (((𝑃‘0) = -∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → (∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖) ↔ ∀𝑖 ∈ (1..^𝑀)-∞ < (𝑃‘𝑖)))
149	145, 148	mpbird 260	. . . . . . 7 ⊢ (((𝑃‘0) = -∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))
150	149	ex 418	. . . . . 6 ⊢ ((𝑃‘0) = -∞ → ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
151	104, 137, 150	3jaoi 1454	. . . . 5 ⊢ (((𝑃‘0) ∈ ℝ ∨ (𝑃‘0) = +∞ ∨ (𝑃‘0) = -∞) → ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
152	15, 151	sylbi 220	. . . 4 ⊢ ((𝑃‘0) ∈ ℝ^* → ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
153	14, 152	mpcom 39	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))
154	153	expcom 419	. 2 ⊢ (¬ 𝑀 = 1 → (𝜑 → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
155	7, 154	pm2.61i 184	1 ⊢ (𝜑 → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ w3o 1102 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 ∀wral 3078 ⊆ wss 3902 ∅c0 4282 class class class wbr 5107 ‘cfv 6537 (class class class)co 7416 ↑_m cmap 8829 ℝcr 11126 0cc0 11127 1c1 11128 + caddc 11130 +∞cpnf 11267 -∞cmnf 11268 ℝ^*cxr 11269 < clt 11270 ≤ cle 11271 − cmin 11468 ℕcn 12260 ℕ₀cn0 12531 ℤcz 12618 ℤ_≥cuz 12890 ...cfz 13563 ..^cfzo 13711 RePartciccp 48300

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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 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 ax-pre-mulgt0 11204

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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8699 df-map 8831 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-n0 12532 df-z 12619 df-uz 12891 df-fz 13564 df-fzo 13712 df-iccp 48301

This theorem is used by: iccpartlt 48311 iccpartgtl 48313 iccpartgt 48314

W3C validator