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 43603

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 4456	. . . 4 ⊢ ∀𝑖 ∈ ∅ (𝑃‘0) < (𝑃‘𝑖)
2		oveq2 7164	. . . . . 6 ⊢ (𝑀 = 1 → (1..^𝑀) = (1..^1))
3		fzo0 13062	. . . . . 6 ⊢ (1..^1) = ∅
4	2, 3	syl6eq 2872	. . . . 5 ⊢ (𝑀 = 1 → (1..^𝑀) = ∅)
5	4	raleqdv 3415	. . . 4 ⊢ (𝑀 = 1 → (∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖) ↔ ∀𝑖 ∈ ∅ (𝑃‘0) < (𝑃‘𝑖)))
6	1, 5	mpbiri 260	. . 3 ⊢ (𝑀 = 1 → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))
7	6	a1d 25	. 2 ⊢ (𝑀 = 1 → (𝜑 → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
8		iccpartgtprec.m	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℕ)
9		iccpartgtprec.p	. . . . . 6 ⊢ (𝜑 → 𝑃 ∈ (RePart‘𝑀))
10	8	nnnn0d 11956	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
11		0elfz 13005	. . . . . . 7 ⊢ (𝑀 ∈ ℕ₀ → 0 ∈ (0...𝑀))
12	10, 11	syl 17	. . . . . 6 ⊢ (𝜑 → 0 ∈ (0...𝑀))
13	8, 9, 12	iccpartxr 43599	. . . . 5 ⊢ (𝜑 → (𝑃‘0) ∈ ℝ^*)
14	13	adantr 483	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑀 = 1) → (𝑃‘0) ∈ ℝ^*)
15		elxr 12512	. . . . 5 ⊢ ((𝑃‘0) ∈ ℝ^* ↔ ((𝑃‘0) ∈ ℝ ∨ (𝑃‘0) = +∞ ∨ (𝑃‘0) = -∞))
16		0zd 11994	. . . . . . . . 9 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 0 ∈ ℤ)
17		elfzouz 13043	. . . . . . . . . . 11 ⊢ (𝑖 ∈ (1..^𝑀) → 𝑖 ∈ (ℤ_≥‘1))
18		0p1e1 11760	. . . . . . . . . . . 12 ⊢ (0 + 1) = 1
19	18	fveq2i 6673	. . . . . . . . . . 11 ⊢ (ℤ_≥‘(0 + 1)) = (ℤ_≥‘1)
20	17, 19	eleqtrrdi 2924	. . . . . . . . . 10 ⊢ (𝑖 ∈ (1..^𝑀) → 𝑖 ∈ (ℤ_≥‘(0 + 1)))
21	20	adantl 484	. . . . . . . . 9 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑖 ∈ (ℤ_≥‘(0 + 1)))
22		fveq2 6670	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 0 → (𝑃‘𝑘) = (𝑃‘0))
23	22	eqcomd 2827	. . . . . . . . . . . . 13 ⊢ (𝑘 = 0 → (𝑃‘0) = (𝑃‘𝑘))
24	23	eleq1d 2897	. . . . . . . . . . . 12 ⊢ (𝑘 = 0 → ((𝑃‘0) ∈ ℝ ↔ (𝑃‘𝑘) ∈ ℝ))
25	24	biimpcd 251	. . . . . . . . . . 11 ⊢ ((𝑃‘0) ∈ ℝ → (𝑘 = 0 → (𝑃‘𝑘) ∈ ℝ))
26	25	ad3antrrr 728	. . . . . . . . . 10 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...𝑖)) → (𝑘 = 0 → (𝑃‘𝑘) ∈ ℝ))
27	8	adantr 483	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0))) → 𝑀 ∈ ℕ)
28	9	adantr 483	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0))) → 𝑃 ∈ (RePart‘𝑀))
29		elfz2nn0 12999	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ (0...𝑖) ↔ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖))
30		elfzo2 13042	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑖 ∈ (1..^𝑀) ↔ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀))
31		simpl1 1187	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑘 ∈ ℕ₀)
32		simpr2 1191	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑀 ∈ ℤ)
33		nn0ge0 11923	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑖 ∈ ℕ₀ → 0 ≤ 𝑖)
34		0red 10644	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → 0 ∈ ℝ)
35		eluzelre 12255	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑖 ∈ (ℤ_≥‘1) → 𝑖 ∈ ℝ)
36	35	adantr 483	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → 𝑖 ∈ ℝ)
37		zre 11986	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
38	37	adantl 484	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → 𝑀 ∈ ℝ)
39		lelttr 10731	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((0 ∈ ℝ ∧ 𝑖 ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((0 ≤ 𝑖 ∧ 𝑖 < 𝑀) → 0 < 𝑀))
40	34, 36, 38, 39	syl3anc 1367	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → ((0 ≤ 𝑖 ∧ 𝑖 < 𝑀) → 0 < 𝑀))
41	40	expcomd 419	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → (𝑖 < 𝑀 → (0 ≤ 𝑖 → 0 < 𝑀)))
42	41	3impia 1113	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → (0 ≤ 𝑖 → 0 < 𝑀))
43	33, 42	syl5com 31	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑖 ∈ ℕ₀ → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → 0 < 𝑀))
44	43	3ad2ant2 1130	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → 0 < 𝑀))
45	44	imp 409	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 0 < 𝑀)
46		elnnz 11992	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑀 ∈ ℕ ↔ (𝑀 ∈ ℤ ∧ 0 < 𝑀))
47	32, 45, 46	sylanbrc 585	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑀 ∈ ℕ)
48		nn0re 11907	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝑘 ∈ ℕ₀ → 𝑘 ∈ ℝ)
49	48	ad2antrl 726	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) ∧ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀)) → 𝑘 ∈ ℝ)
50		nn0re 11907	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑖 ∈ ℕ₀ → 𝑖 ∈ ℝ)
51	50	adantl 484	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → 𝑖 ∈ ℝ)
52	51	adantl 484	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) ∧ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀)) → 𝑖 ∈ ℝ)
53	38	adantr 483	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) ∧ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀)) → 𝑀 ∈ ℝ)
54		lelttr 10731	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑘 ∈ ℝ ∧ 𝑖 ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((𝑘 ≤ 𝑖 ∧ 𝑖 < 𝑀) → 𝑘 < 𝑀))
55	54	expd 418	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝑘 ∈ ℝ ∧ 𝑖 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝑘 ≤ 𝑖 → (𝑖 < 𝑀 → 𝑘 < 𝑀)))
56	49, 52, 53, 55	syl3anc 1367	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) ∧ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀)) → (𝑘 ≤ 𝑖 → (𝑖 < 𝑀 → 𝑘 < 𝑀)))
57	56	exp31 422	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑖 ∈ (ℤ_≥‘1) → (𝑀 ∈ ℤ → ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑘 ≤ 𝑖 → (𝑖 < 𝑀 → 𝑘 < 𝑀)))))
58	57	com34 91	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑖 ∈ (ℤ_≥‘1) → (𝑀 ∈ ℤ → (𝑘 ≤ 𝑖 → ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑖 < 𝑀 → 𝑘 < 𝑀)))))
59	58	com35 98	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑖 ∈ (ℤ_≥‘1) → (𝑀 ∈ ℤ → (𝑖 < 𝑀 → ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑘 ≤ 𝑖 → 𝑘 < 𝑀)))))
60	59	3imp 1107	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑘 ≤ 𝑖 → 𝑘 < 𝑀)))
61	60	expdcom 417	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑘 ∈ ℕ₀ → (𝑖 ∈ ℕ₀ → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → (𝑘 ≤ 𝑖 → 𝑘 < 𝑀))))
62	61	com34 91	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑘 ∈ ℕ₀ → (𝑖 ∈ ℕ₀ → (𝑘 ≤ 𝑖 → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → 𝑘 < 𝑀))))
63	62	3imp1 1343	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑘 < 𝑀)
64		elfzo0 13079	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑘 ∈ (0..^𝑀) ↔ (𝑘 ∈ ℕ₀ ∧ 𝑀 ∈ ℕ ∧ 𝑘 < 𝑀))
65	31, 47, 63, 64	syl3anbrc 1339	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑘 ∈ (0..^𝑀))
66	65	ex 415	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → 𝑘 ∈ (0..^𝑀)))
67	30, 66	syl5bi 244	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) → (𝑖 ∈ (1..^𝑀) → 𝑘 ∈ (0..^𝑀)))
68	29, 67	sylbi 219	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (0...𝑖) → (𝑖 ∈ (1..^𝑀) → 𝑘 ∈ (0..^𝑀)))
69	68	adantr 483	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → (𝑖 ∈ (1..^𝑀) → 𝑘 ∈ (0..^𝑀)))
70	69	impcom 410	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0)) → 𝑘 ∈ (0..^𝑀))
71		simpr 487	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → 𝑘 ≠ 0)
72	71	adantl 484	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0)) → 𝑘 ≠ 0)
73		fzo1fzo0n0 13089	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (1..^𝑀) ↔ (𝑘 ∈ (0..^𝑀) ∧ 𝑘 ≠ 0))
74	70, 72, 73	sylanbrc 585	. . . . . . . . . . . . . . . 16 ⊢ ((𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0)) → 𝑘 ∈ (1..^𝑀))
75	74	adantl 484	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0))) → 𝑘 ∈ (1..^𝑀))
76	27, 28, 75	iccpartipre 43601	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0))) → (𝑃‘𝑘) ∈ ℝ)
77	76	exp32 423	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑖 ∈ (1..^𝑀) → ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → (𝑃‘𝑘) ∈ ℝ)))
78	77	ad2antrl 726	. . . . . . . . . . . 12 ⊢ (((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → (𝑖 ∈ (1..^𝑀) → ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → (𝑃‘𝑘) ∈ ℝ)))
79	78	imp 409	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → (𝑃‘𝑘) ∈ ℝ))
80	79	expdimp 455	. . . . . . . . . 10 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...𝑖)) → (𝑘 ≠ 0 → (𝑃‘𝑘) ∈ ℝ))
81	26, 80	pm2.61dne 3103	. . . . . . . . 9 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...𝑖)) → (𝑃‘𝑘) ∈ ℝ)
82	8	adantr 483	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝑀 = 1) → 𝑀 ∈ ℕ)
83	82	ad3antlr 729	. . . . . . . . . . 11 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → 𝑀 ∈ ℕ)
84	9	adantr 483	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝑀 = 1) → 𝑃 ∈ (RePart‘𝑀))
85	84	ad3antlr 729	. . . . . . . . . . 11 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → 𝑃 ∈ (RePart‘𝑀))
86		elfzoelz 13039	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ (1..^𝑀) → 𝑖 ∈ ℤ)
87	86	adantl 484	. . . . . . . . . . . . . . 15 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑖 ∈ ℤ)
88		fzoval 13040	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ ℤ → (0..^𝑖) = (0...(𝑖 − 1)))
89	88	eqcomd 2827	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ ℤ → (0...(𝑖 − 1)) = (0..^𝑖))
90	87, 89	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (0...(𝑖 − 1)) = (0..^𝑖))
91	90	eleq2d 2898	. . . . . . . . . . . . 13 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑘 ∈ (0...(𝑖 − 1)) ↔ 𝑘 ∈ (0..^𝑖)))
92		elfzouz2 13053	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ (1..^𝑀) → 𝑀 ∈ (ℤ_≥‘𝑖))
93	92	adantl 484	. . . . . . . . . . . . . . 15 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑀 ∈ (ℤ_≥‘𝑖))
94		fzoss2 13066	. . . . . . . . . . . . . . 15 ⊢ (𝑀 ∈ (ℤ_≥‘𝑖) → (0..^𝑖) ⊆ (0..^𝑀))
95	93, 94	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (0..^𝑖) ⊆ (0..^𝑀))
96	95	sseld 3966	. . . . . . . . . . . . 13 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑘 ∈ (0..^𝑖) → 𝑘 ∈ (0..^𝑀)))
97	91, 96	sylbid 242	. . . . . . . . . . . 12 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑘 ∈ (0...(𝑖 − 1)) → 𝑘 ∈ (0..^𝑀)))
98	97	imp 409	. . . . . . . . . . 11 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → 𝑘 ∈ (0..^𝑀))
99		iccpartimp 43597	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 𝑘 ∈ (0..^𝑀)) → (𝑃 ∈ (ℝ^* ↑_m (0...𝑀)) ∧ (𝑃‘𝑘) < (𝑃‘(𝑘 + 1))))
100	83, 85, 98, 99	syl3anc 1367	. . . . . . . . . 10 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → (𝑃 ∈ (ℝ^* ↑_m (0...𝑀)) ∧ (𝑃‘𝑘) < (𝑃‘(𝑘 + 1))))
101	100	simprd 498	. . . . . . . . 9 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → (𝑃‘𝑘) < (𝑃‘(𝑘 + 1)))
102	16, 21, 81, 101	smonoord 43551	. . . . . . . 8 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘0) < (𝑃‘𝑖))
103	102	ralrimiva 3182	. . . . . . 7 ⊢ (((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))
104	103	ex 415	. . . . . 6 ⊢ ((𝑃‘0) ∈ ℝ → ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
105		lbfzo0 13078	. . . . . . . . . . . . . . . 16 ⊢ (0 ∈ (0..^𝑀) ↔ 𝑀 ∈ ℕ)
106	8, 105	sylibr 236	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 0 ∈ (0..^𝑀))
107	8, 9, 106	3jca 1124	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 0 ∈ (0..^𝑀)))
108	107	ad2antrl 726	. . . . . . . . . . . . 13 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → (𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 0 ∈ (0..^𝑀)))
109	108	adantr 483	. . . . . . . . . . . 12 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 0 ∈ (0..^𝑀)))
110		iccpartimp 43597	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 0 ∈ (0..^𝑀)) → (𝑃 ∈ (ℝ^* ↑_m (0...𝑀)) ∧ (𝑃‘0) < (𝑃‘(0 + 1))))
111	109, 110	syl 17	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃 ∈ (ℝ^* ↑_m (0...𝑀)) ∧ (𝑃‘0) < (𝑃‘(0 + 1))))
112	111	simprd 498	. . . . . . . . . 10 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘0) < (𝑃‘(0 + 1)))
113		breq1 5069	. . . . . . . . . . . 12 ⊢ ((𝑃‘0) = +∞ → ((𝑃‘0) < (𝑃‘(0 + 1)) ↔ +∞ < (𝑃‘(0 + 1))))
114	113	adantr 483	. . . . . . . . . . 11 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ((𝑃‘0) < (𝑃‘(0 + 1)) ↔ +∞ < (𝑃‘(0 + 1))))
115	114	adantr 483	. . . . . . . . . 10 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → ((𝑃‘0) < (𝑃‘(0 + 1)) ↔ +∞ < (𝑃‘(0 + 1))))
116	112, 115	mpbid 234	. . . . . . . . 9 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → +∞ < (𝑃‘(0 + 1)))
117	8	ad2antrl 726	. . . . . . . . . . . 12 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → 𝑀 ∈ ℕ)
118	117	adantr 483	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑀 ∈ ℕ)
119	9	ad2antrl 726	. . . . . . . . . . . 12 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → 𝑃 ∈ (RePart‘𝑀))
120	119	adantr 483	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑃 ∈ (RePart‘𝑀))
121		1nn0 11914	. . . . . . . . . . . . . . . . . 18 ⊢ 1 ∈ ℕ₀
122	121	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ → 1 ∈ ℕ₀)
123		nnnn0 11905	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℕ₀)
124		nnge1 11666	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ → 1 ≤ 𝑀)
125	122, 123, 124	3jca 1124	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ ℕ → (1 ∈ ℕ₀ ∧ 𝑀 ∈ ℕ₀ ∧ 1 ≤ 𝑀))
126	8, 125	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (1 ∈ ℕ₀ ∧ 𝑀 ∈ ℕ₀ ∧ 1 ≤ 𝑀))
127		elfz2nn0 12999	. . . . . . . . . . . . . . 15 ⊢ (1 ∈ (0...𝑀) ↔ (1 ∈ ℕ₀ ∧ 𝑀 ∈ ℕ₀ ∧ 1 ≤ 𝑀))
128	126, 127	sylibr 236	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 1 ∈ (0...𝑀))
129	18, 128	eqeltrid 2917	. . . . . . . . . . . . 13 ⊢ (𝜑 → (0 + 1) ∈ (0...𝑀))
130	129	ad2antrl 726	. . . . . . . . . . . 12 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → (0 + 1) ∈ (0...𝑀))
131	130	adantr 483	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (0 + 1) ∈ (0...𝑀))
132	118, 120, 131	iccpartxr 43599	. . . . . . . . . 10 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘(0 + 1)) ∈ ℝ^*)
133		pnfnlt 12524	. . . . . . . . . 10 ⊢ ((𝑃‘(0 + 1)) ∈ ℝ^* → ¬ +∞ < (𝑃‘(0 + 1)))
134	132, 133	syl 17	. . . . . . . . 9 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → ¬ +∞ < (𝑃‘(0 + 1)))
135	116, 134	pm2.21dd 197	. . . . . . . 8 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘0) < (𝑃‘𝑖))
136	135	ralrimiva 3182	. . . . . . 7 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))
137	136	ex 415	. . . . . 6 ⊢ ((𝑃‘0) = +∞ → ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
138	8	adantr 483	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → 𝑀 ∈ ℕ)
139	9	adantr 483	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → 𝑃 ∈ (RePart‘𝑀))
140		simpr 487	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → 𝑖 ∈ (1..^𝑀))
141	138, 139, 140	iccpartipre 43601	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘𝑖) ∈ ℝ)
142		mnflt 12519	. . . . . . . . . . 11 ⊢ ((𝑃‘𝑖) ∈ ℝ → -∞ < (𝑃‘𝑖))
143	141, 142	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → -∞ < (𝑃‘𝑖))
144	143	ralrimiva 3182	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑖 ∈ (1..^𝑀)-∞ < (𝑃‘𝑖))
145	144	ad2antrl 726	. . . . . . . 8 ⊢ (((𝑃‘0) = -∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ∀𝑖 ∈ (1..^𝑀)-∞ < (𝑃‘𝑖))
146		breq1 5069	. . . . . . . . . 10 ⊢ ((𝑃‘0) = -∞ → ((𝑃‘0) < (𝑃‘𝑖) ↔ -∞ < (𝑃‘𝑖)))
147	146	adantr 483	. . . . . . . . 9 ⊢ (((𝑃‘0) = -∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ((𝑃‘0) < (𝑃‘𝑖) ↔ -∞ < (𝑃‘𝑖)))
148	147	ralbidv 3197	. . . . . . . 8 ⊢ (((𝑃‘0) = -∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → (∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖) ↔ ∀𝑖 ∈ (1..^𝑀)-∞ < (𝑃‘𝑖)))
149	145, 148	mpbird 259	. . . . . . 7 ⊢ (((𝑃‘0) = -∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))
150	149	ex 415	. . . . . 6 ⊢ ((𝑃‘0) = -∞ → ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
151	104, 137, 150	3jaoi 1423	. . . . 5 ⊢ (((𝑃‘0) ∈ ℝ ∨ (𝑃‘0) = +∞ ∨ (𝑃‘0) = -∞) → ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
152	15, 151	sylbi 219	. . . 4 ⊢ ((𝑃‘0) ∈ ℝ^* → ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
153	14, 152	mpcom 38	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))
154	153	expcom 416	. 2 ⊢ (¬ 𝑀 = 1 → (𝜑 → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
155	7, 154	pm2.61i 184	1 ⊢ (𝜑 → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∨ w3o 1082 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ≠ wne 3016 ∀wral 3138 ⊆ wss 3936 ∅c0 4291 class class class wbr 5066 ‘cfv 6355 (class class class)co 7156 ↑_m cmap 8406 ℝcr 10536 0cc0 10537 1c1 10538 + caddc 10540 +∞cpnf 10672 -∞cmnf 10673 ℝ^*cxr 10674 < clt 10675 ≤ cle 10676 − cmin 10870 ℕcn 11638 ℕ₀cn0 11898 ℤcz 11982 ℤ_≥cuz 12244 ...cfz 12893 ..^cfzo 13034 RePartciccp 43593

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-map 8408 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-n0 11899 df-z 11983 df-uz 12245 df-fz 12894 df-fzo 13035 df-iccp 43594

This theorem is referenced by: iccpartlt 43604 iccpartgtl 43606 iccpartgt 43607

W3C validator