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 48096

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 4462	. . . 4 ⊢ ∀𝑖 ∈ ∅ (𝑃‘0) < (𝑃‘𝑖)
2		oveq2 7419	. . . . . 6 ⊢ (𝑀 = 1 → (1..^𝑀) = (1..^1))
3		fzo0 13712	. . . . . 6 ⊢ (1..^1) = ∅
4	2, 3	eqtrdi 2820	. . . . 5 ⊢ (𝑀 = 1 → (1..^𝑀) = ∅)
5	4	raleqdv 3329	. . . 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 12565	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
11		0elfz 13652	. . . . . . 7 ⊢ (𝑀 ∈ ℕ₀ → 0 ∈ (0...𝑀))
12	10, 11	syl 18	. . . . . 6 ⊢ (𝜑 → 0 ∈ (0...𝑀))
13	8, 9, 12	iccpartxr 48092	. . . . 5 ⊢ (𝜑 → (𝑃‘0) ∈ ℝ^*)
14	13	adantr 485	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑀 = 1) → (𝑃‘0) ∈ ℝ^*)
15		elxr 13141	. . . . 5 ⊢ ((𝑃‘0) ∈ ℝ^* ↔ ((𝑃‘0) ∈ ℝ ∨ (𝑃‘0) = +∞ ∨ (𝑃‘0) = -∞))
16		0zd 12603	. . . . . . . . 9 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 0 ∈ ℤ)
17		elfzouz 13692	. . . . . . . . . . 11 ⊢ (𝑖 ∈ (1..^𝑀) → 𝑖 ∈ (ℤ_≥‘1))
18		0p1e1 12361	. . . . . . . . . . . 12 ⊢ (0 + 1) = 1
19	18	fveq2i 6885	. . . . . . . . . . 11 ⊢ (ℤ_≥‘(0 + 1)) = (ℤ_≥‘1)
20	17, 19	eleqtrrdi 2880	. . . . . . . . . 10 ⊢ (𝑖 ∈ (1..^𝑀) → 𝑖 ∈ (ℤ_≥‘(0 + 1)))
21	20	adantl 486	. . . . . . . . 9 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑖 ∈ (ℤ_≥‘(0 + 1)))
22		fveq2 6882	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 0 → (𝑃‘𝑘) = (𝑃‘0))
23	22	eqcomd 2775	. . . . . . . . . . . . 13 ⊢ (𝑘 = 0 → (𝑃‘0) = (𝑃‘𝑘))
24	23	eleq1d 2854	. . . . . . . . . . . 12 ⊢ (𝑘 = 0 → ((𝑃‘0) ∈ ℝ ↔ (𝑃‘𝑘) ∈ ℝ))
25	24	biimpcd 252	. . . . . . . . . . 11 ⊢ ((𝑃‘0) ∈ ℝ → (𝑘 = 0 → (𝑃‘𝑘) ∈ ℝ))
26	25	ad3antrrr 742	. . . . . . . . . 10 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...𝑖)) → (𝑘 = 0 → (𝑃‘𝑘) ∈ ℝ))
27	8	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0))) → 𝑀 ∈ ℕ)
28	9	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0))) → 𝑃 ∈ (RePart‘𝑀))
29		elfz2nn0 13646	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ (0...𝑖) ↔ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖))
30		elfzo2 13690	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑖 ∈ (1..^𝑀) ↔ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀))
31		simpl1 1208	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑘 ∈ ℕ₀)
32		simpr2 1212	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑀 ∈ ℤ)
33		nn0ge0 12529	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑖 ∈ ℕ₀ → 0 ≤ 𝑖)
34		0red 11211	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → 0 ∈ ℝ)
35		eluzelre 12873	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑖 ∈ (ℤ_≥‘1) → 𝑖 ∈ ℝ)
36	35	adantr 485	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → 𝑖 ∈ ℝ)
37		zre 12595	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
38	37	adantl 486	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → 𝑀 ∈ ℝ)
39		lelttr 11300	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((0 ∈ ℝ ∧ 𝑖 ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((0 ≤ 𝑖 ∧ 𝑖 < 𝑀) → 0 < 𝑀))
40	34, 36, 38, 39	syl3anc 1396	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → ((0 ≤ 𝑖 ∧ 𝑖 < 𝑀) → 0 < 𝑀))
41	40	expcomd 421	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) → (𝑖 < 𝑀 → (0 ≤ 𝑖 → 0 < 𝑀)))
42	41	3impia 1133	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → (0 ≤ 𝑖 → 0 < 𝑀))
43	33, 42	syl5com 32	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑖 ∈ ℕ₀ → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → 0 < 𝑀))
44	43	3ad2ant2 1150	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → 0 < 𝑀))
45	44	imp 411	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 0 < 𝑀)
46		elnnz 12601	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑀 ∈ ℕ ↔ (𝑀 ∈ ℤ ∧ 0 < 𝑀))
47	32, 45, 46	sylanbrc 594	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑀 ∈ ℕ)
48		nn0re 12513	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝑘 ∈ ℕ₀ → 𝑘 ∈ ℝ)
49	48	ad2antrl 740	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) ∧ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀)) → 𝑘 ∈ ℝ)
50		nn0re 12513	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑖 ∈ ℕ₀ → 𝑖 ∈ ℝ)
51	50	adantl 486	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → 𝑖 ∈ ℝ)
52	51	adantl 486	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) ∧ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀)) → 𝑖 ∈ ℝ)
53	38	adantr 485	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) ∧ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀)) → 𝑀 ∈ ℝ)
54		lelttr 11300	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑘 ∈ ℝ ∧ 𝑖 ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((𝑘 ≤ 𝑖 ∧ 𝑖 < 𝑀) → 𝑘 < 𝑀))
55	54	expd 420	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝑘 ∈ ℝ ∧ 𝑖 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝑘 ≤ 𝑖 → (𝑖 < 𝑀 → 𝑘 < 𝑀)))
56	49, 52, 53, 55	syl3anc 1396	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ) ∧ (𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀)) → (𝑘 ≤ 𝑖 → (𝑖 < 𝑀 → 𝑘 < 𝑀)))
57	56	exp31 424	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑖 ∈ (ℤ_≥‘1) → (𝑀 ∈ ℤ → ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑘 ≤ 𝑖 → (𝑖 < 𝑀 → 𝑘 < 𝑀)))))
58	57	com34 92	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑖 ∈ (ℤ_≥‘1) → (𝑀 ∈ ℤ → (𝑘 ≤ 𝑖 → ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑖 < 𝑀 → 𝑘 < 𝑀)))))
59	58	com35 99	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑖 ∈ (ℤ_≥‘1) → (𝑀 ∈ ℤ → (𝑖 < 𝑀 → ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑘 ≤ 𝑖 → 𝑘 < 𝑀)))))
60	59	3imp 1126	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑘 ≤ 𝑖 → 𝑘 < 𝑀)))
61	60	expdcom 419	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑘 ∈ ℕ₀ → (𝑖 ∈ ℕ₀ → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → (𝑘 ≤ 𝑖 → 𝑘 < 𝑀))))
62	61	com34 92	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑘 ∈ ℕ₀ → (𝑖 ∈ ℕ₀ → (𝑘 ≤ 𝑖 → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → 𝑘 < 𝑀))))
63	62	3imp1 1364	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑘 < 𝑀)
64		elfzo0 13729	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑘 ∈ (0..^𝑀) ↔ (𝑘 ∈ ℕ₀ ∧ 𝑀 ∈ ℕ ∧ 𝑘 < 𝑀))
65	31, 47, 63, 64	syl3anbrc 1360	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) ∧ (𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀)) → 𝑘 ∈ (0..^𝑀))
66	65	ex 417	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) → ((𝑖 ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ ℤ ∧ 𝑖 < 𝑀) → 𝑘 ∈ (0..^𝑀)))
67	30, 66	biimtrid 245	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑘 ∈ ℕ₀ ∧ 𝑖 ∈ ℕ₀ ∧ 𝑘 ≤ 𝑖) → (𝑖 ∈ (1..^𝑀) → 𝑘 ∈ (0..^𝑀)))
68	29, 67	sylbi 220	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (0...𝑖) → (𝑖 ∈ (1..^𝑀) → 𝑘 ∈ (0..^𝑀)))
69	68	adantr 485	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → (𝑖 ∈ (1..^𝑀) → 𝑘 ∈ (0..^𝑀)))
70	69	impcom 412	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0)) → 𝑘 ∈ (0..^𝑀))
71		simpr 489	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → 𝑘 ≠ 0)
72	71	adantl 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0)) → 𝑘 ≠ 0)
73		fzo1fzo0n0 13744	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (1..^𝑀) ↔ (𝑘 ∈ (0..^𝑀) ∧ 𝑘 ≠ 0))
74	70, 72, 73	sylanbrc 594	. . . . . . . . . . . . . . . 16 ⊢ ((𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0)) → 𝑘 ∈ (1..^𝑀))
75	74	adantl 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0))) → 𝑘 ∈ (1..^𝑀))
76	27, 28, 75	iccpartipre 48094	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑖 ∈ (1..^𝑀) ∧ (𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0))) → (𝑃‘𝑘) ∈ ℝ)
77	76	exp32 425	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑖 ∈ (1..^𝑀) → ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → (𝑃‘𝑘) ∈ ℝ)))
78	77	ad2antrl 740	. . . . . . . . . . . 12 ⊢ (((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → (𝑖 ∈ (1..^𝑀) → ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → (𝑃‘𝑘) ∈ ℝ)))
79	78	imp 411	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → ((𝑘 ∈ (0...𝑖) ∧ 𝑘 ≠ 0) → (𝑃‘𝑘) ∈ ℝ))
80	79	expdimp 457	. . . . . . . . . 10 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...𝑖)) → (𝑘 ≠ 0 → (𝑃‘𝑘) ∈ ℝ))
81	26, 80	pm2.61dne 3050	. . . . . . . . 9 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...𝑖)) → (𝑃‘𝑘) ∈ ℝ)
82	8	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝑀 = 1) → 𝑀 ∈ ℕ)
83	82	ad3antlr 743	. . . . . . . . . . 11 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → 𝑀 ∈ ℕ)
84	9	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝑀 = 1) → 𝑃 ∈ (RePart‘𝑀))
85	84	ad3antlr 743	. . . . . . . . . . 11 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → 𝑃 ∈ (RePart‘𝑀))
86		elfzoelz 13687	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ (1..^𝑀) → 𝑖 ∈ ℤ)
87	86	adantl 486	. . . . . . . . . . . . . . 15 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑖 ∈ ℤ)
88		fzoval 13688	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ ℤ → (0..^𝑖) = (0...(𝑖 − 1)))
89	88	eqcomd 2775	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ ℤ → (0...(𝑖 − 1)) = (0..^𝑖))
90	87, 89	syl 18	. . . . . . . . . . . . . 14 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (0...(𝑖 − 1)) = (0..^𝑖))
91	90	eleq2d 2855	. . . . . . . . . . . . 13 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑘 ∈ (0...(𝑖 − 1)) ↔ 𝑘 ∈ (0..^𝑖)))
92		elfzouz2 13703	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ (1..^𝑀) → 𝑀 ∈ (ℤ_≥‘𝑖))
93	92	adantl 486	. . . . . . . . . . . . . . 15 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑀 ∈ (ℤ_≥‘𝑖))
94		fzoss2 13716	. . . . . . . . . . . . . . 15 ⊢ (𝑀 ∈ (ℤ_≥‘𝑖) → (0..^𝑖) ⊆ (0..^𝑀))
95	93, 94	syl 18	. . . . . . . . . . . . . 14 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (0..^𝑖) ⊆ (0..^𝑀))
96	95	sseld 3942	. . . . . . . . . . . . 13 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑘 ∈ (0..^𝑖) → 𝑘 ∈ (0..^𝑀)))
97	91, 96	sylbid 243	. . . . . . . . . . . 12 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑘 ∈ (0...(𝑖 − 1)) → 𝑘 ∈ (0..^𝑀)))
98	97	imp 411	. . . . . . . . . . 11 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → 𝑘 ∈ (0..^𝑀))
99		iccpartimp 48090	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 𝑘 ∈ (0..^𝑀)) → (𝑃 ∈ (ℝ^* ↑_m (0...𝑀)) ∧ (𝑃‘𝑘) < (𝑃‘(𝑘 + 1))))
100	83, 85, 98, 99	syl3anc 1396	. . . . . . . . . 10 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → (𝑃 ∈ (ℝ^* ↑_m (0...𝑀)) ∧ (𝑃‘𝑘) < (𝑃‘(𝑘 + 1))))
101	100	simprd 500	. . . . . . . . 9 ⊢ (((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) ∧ 𝑘 ∈ (0...(𝑖 − 1))) → (𝑃‘𝑘) < (𝑃‘(𝑘 + 1)))
102	16, 21, 81, 101	smonoord 48038	. . . . . . . 8 ⊢ ((((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘0) < (𝑃‘𝑖))
103	102	ralrimiva 3163	. . . . . . 7 ⊢ (((𝑃‘0) ∈ ℝ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))
104	103	ex 417	. . . . . 6 ⊢ ((𝑃‘0) ∈ ℝ → ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
105		lbfzo0 13728	. . . . . . . . . . . . . . . 16 ⊢ (0 ∈ (0..^𝑀) ↔ 𝑀 ∈ ℕ)
106	8, 105	sylibr 237	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 0 ∈ (0..^𝑀))
107	8, 9, 106	3jca 1144	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 0 ∈ (0..^𝑀)))
108	107	ad2antrl 740	. . . . . . . . . . . . 13 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → (𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 0 ∈ (0..^𝑀)))
109	108	adantr 485	. . . . . . . . . . . 12 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 0 ∈ (0..^𝑀)))
110		iccpartimp 48090	. . . . . . . . . . . 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 500	. . . . . . . . . 10 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘0) < (𝑃‘(0 + 1)))
113		breq1 5114	. . . . . . . . . . . 12 ⊢ ((𝑃‘0) = +∞ → ((𝑃‘0) < (𝑃‘(0 + 1)) ↔ +∞ < (𝑃‘(0 + 1))))
114	113	adantr 485	. . . . . . . . . . 11 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ((𝑃‘0) < (𝑃‘(0 + 1)) ↔ +∞ < (𝑃‘(0 + 1))))
115	114	adantr 485	. . . . . . . . . 10 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → ((𝑃‘0) < (𝑃‘(0 + 1)) ↔ +∞ < (𝑃‘(0 + 1))))
116	112, 115	mpbid 235	. . . . . . . . 9 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → +∞ < (𝑃‘(0 + 1)))
117	8	ad2antrl 740	. . . . . . . . . . . 12 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → 𝑀 ∈ ℕ)
118	117	adantr 485	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑀 ∈ ℕ)
119	9	ad2antrl 740	. . . . . . . . . . . 12 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → 𝑃 ∈ (RePart‘𝑀))
120	119	adantr 485	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → 𝑃 ∈ (RePart‘𝑀))
121		1nn0 12520	. . . . . . . . . . . . . . . . . 18 ⊢ 1 ∈ ℕ₀
122	121	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ → 1 ∈ ℕ₀)
123		nnnn0 12511	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℕ₀)
124		nnge1 12264	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ → 1 ≤ 𝑀)
125	122, 123, 124	3jca 1144	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ ℕ → (1 ∈ ℕ₀ ∧ 𝑀 ∈ ℕ₀ ∧ 1 ≤ 𝑀))
126	8, 125	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (1 ∈ ℕ₀ ∧ 𝑀 ∈ ℕ₀ ∧ 1 ≤ 𝑀))
127		elfz2nn0 13646	. . . . . . . . . . . . . . 15 ⊢ (1 ∈ (0...𝑀) ↔ (1 ∈ ℕ₀ ∧ 𝑀 ∈ ℕ₀ ∧ 1 ≤ 𝑀))
128	126, 127	sylibr 237	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 1 ∈ (0...𝑀))
129	18, 128	eqeltrid 2873	. . . . . . . . . . . . 13 ⊢ (𝜑 → (0 + 1) ∈ (0...𝑀))
130	129	ad2antrl 740	. . . . . . . . . . . 12 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → (0 + 1) ∈ (0...𝑀))
131	130	adantr 485	. . . . . . . . . . 11 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (0 + 1) ∈ (0...𝑀))
132	118, 120, 131	iccpartxr 48092	. . . . . . . . . 10 ⊢ ((((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘(0 + 1)) ∈ ℝ^*)
133		pnfnlt 13153	. . . . . . . . . 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 3163	. . . . . . 7 ⊢ (((𝑃‘0) = +∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))
137	136	ex 417	. . . . . 6 ⊢ ((𝑃‘0) = +∞ → ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
138	8	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → 𝑀 ∈ ℕ)
139	9	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → 𝑃 ∈ (RePart‘𝑀))
140		simpr 489	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → 𝑖 ∈ (1..^𝑀))
141	138, 139, 140	iccpartipre 48094	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → (𝑃‘𝑖) ∈ ℝ)
142		mnflt 13148	. . . . . . . . . . 11 ⊢ ((𝑃‘𝑖) ∈ ℝ → -∞ < (𝑃‘𝑖))
143	141, 142	syl 18	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (1..^𝑀)) → -∞ < (𝑃‘𝑖))
144	143	ralrimiva 3163	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑖 ∈ (1..^𝑀)-∞ < (𝑃‘𝑖))
145	144	ad2antrl 740	. . . . . . . 8 ⊢ (((𝑃‘0) = -∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ∀𝑖 ∈ (1..^𝑀)-∞ < (𝑃‘𝑖))
146		breq1 5114	. . . . . . . . . 10 ⊢ ((𝑃‘0) = -∞ → ((𝑃‘0) < (𝑃‘𝑖) ↔ -∞ < (𝑃‘𝑖)))
147	146	adantr 485	. . . . . . . . 9 ⊢ (((𝑃‘0) = -∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ((𝑃‘0) < (𝑃‘𝑖) ↔ -∞ < (𝑃‘𝑖)))
148	147	ralbidv 3194	. . . . . . . 8 ⊢ (((𝑃‘0) = -∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → (∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖) ↔ ∀𝑖 ∈ (1..^𝑀)-∞ < (𝑃‘𝑖)))
149	145, 148	mpbird 260	. . . . . . 7 ⊢ (((𝑃‘0) = -∞ ∧ (𝜑 ∧ ¬ 𝑀 = 1)) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖))
150	149	ex 417	. . . . . 6 ⊢ ((𝑃‘0) = -∞ → ((𝜑 ∧ ¬ 𝑀 = 1) → ∀𝑖 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑖)))
151	104, 137, 150	3jaoi 1452	. . . . 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 418	. 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 209 ∧ wa 400 ∨ w3o 1100 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∀wral 3085 ⊆ wss 3911 ∅c0 4292 class class class wbr 5111 ‘cfv 6537 (class class class)co 7411 ↑_m cmap 8824 ℝcr 11099 0cc0 11100 1c1 11101 + caddc 11103 +∞cpnf 11240 -∞cmnf 11241 ℝ^*cxr 11242 < clt 11243 ≤ cle 11244 − cmin 11441 ℕcn 12233 ℕ₀cn0 12504 ℤcz 12591 ℤ_≥cuz 12862 ...cfz 13535 ..^cfzo 13682 RePartciccp 48086

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 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 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8694 df-map 8826 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-n0 12505 df-z 12592 df-uz 12863 df-fz 13536 df-fzo 13683 df-iccp 48087

This theorem is referenced by: iccpartlt 48097 iccpartgtl 48099 iccpartgt 48100

W3C validator