icceuelpart - Mathbox for Alexander van der Vekens

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

Theorem icceuelpart 43953

Description: An element of a partitioned half-open interval of extended reals is an element of exactly one part of the partition. (Contributed by AV, 19-Jul-2020.)

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

**Assertion**
Ref	Expression
icceuelpart	⊢ ((𝜑 ∧ 𝑋 ∈ ((𝑃‘0)[,)(𝑃‘𝑀))) → ∃!𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))))

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

Proof of Theorem icceuelpart Dummy variables 𝑗 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		iccpartiun.p	. . . 4 ⊢ (𝜑 → 𝑃 ∈ (RePart‘𝑀))
2	1	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ ((𝑃‘0)[,)(𝑃‘𝑀))) → 𝑃 ∈ (RePart‘𝑀))
3		iccpartiun.m	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℕ)
4		iccelpart 43950	. . . . 5 ⊢ (𝑀 ∈ ℕ → ∀𝑝 ∈ (RePart‘𝑀)(𝑋 ∈ ((𝑝‘0)[,)(𝑝‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1)))))
5	3, 4	syl 17	. . . 4 ⊢ (𝜑 → ∀𝑝 ∈ (RePart‘𝑀)(𝑋 ∈ ((𝑝‘0)[,)(𝑝‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1)))))
6	5	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ ((𝑃‘0)[,)(𝑃‘𝑀))) → ∀𝑝 ∈ (RePart‘𝑀)(𝑋 ∈ ((𝑝‘0)[,)(𝑝‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1)))))
7		fveq1 6644	. . . . . . . . 9 ⊢ (𝑝 = 𝑃 → (𝑝‘0) = (𝑃‘0))
8		fveq1 6644	. . . . . . . . 9 ⊢ (𝑝 = 𝑃 → (𝑝‘𝑀) = (𝑃‘𝑀))
9	7, 8	oveq12d 7153	. . . . . . . 8 ⊢ (𝑝 = 𝑃 → ((𝑝‘0)[,)(𝑝‘𝑀)) = ((𝑃‘0)[,)(𝑃‘𝑀)))
10	9	eleq2d 2875	. . . . . . 7 ⊢ (𝑝 = 𝑃 → (𝑋 ∈ ((𝑝‘0)[,)(𝑝‘𝑀)) ↔ 𝑋 ∈ ((𝑃‘0)[,)(𝑃‘𝑀))))
11		fveq1 6644	. . . . . . . . . 10 ⊢ (𝑝 = 𝑃 → (𝑝‘𝑖) = (𝑃‘𝑖))
12		fveq1 6644	. . . . . . . . . 10 ⊢ (𝑝 = 𝑃 → (𝑝‘(𝑖 + 1)) = (𝑃‘(𝑖 + 1)))
13	11, 12	oveq12d 7153	. . . . . . . . 9 ⊢ (𝑝 = 𝑃 → ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1))) = ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))))
14	13	eleq2d 2875	. . . . . . . 8 ⊢ (𝑝 = 𝑃 → (𝑋 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1))) ↔ 𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1)))))
15	14	rexbidv 3256	. . . . . . 7 ⊢ (𝑝 = 𝑃 → (∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1))) ↔ ∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1)))))
16	10, 15	imbi12d 348	. . . . . 6 ⊢ (𝑝 = 𝑃 → ((𝑋 ∈ ((𝑝‘0)[,)(𝑝‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1)))) ↔ (𝑋 ∈ ((𝑃‘0)[,)(𝑃‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))))))
17	16	rspcva 3569	. . . . 5 ⊢ ((𝑃 ∈ (RePart‘𝑀) ∧ ∀𝑝 ∈ (RePart‘𝑀)(𝑋 ∈ ((𝑝‘0)[,)(𝑝‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1))))) → (𝑋 ∈ ((𝑃‘0)[,)(𝑃‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1)))))
18	17	adantld 494	. . . 4 ⊢ ((𝑃 ∈ (RePart‘𝑀) ∧ ∀𝑝 ∈ (RePart‘𝑀)(𝑋 ∈ ((𝑝‘0)[,)(𝑝‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1))))) → ((𝜑 ∧ 𝑋 ∈ ((𝑃‘0)[,)(𝑃‘𝑀))) → ∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1)))))
19	18	com12 32	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ ((𝑃‘0)[,)(𝑃‘𝑀))) → ((𝑃 ∈ (RePart‘𝑀) ∧ ∀𝑝 ∈ (RePart‘𝑀)(𝑋 ∈ ((𝑝‘0)[,)(𝑝‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1))))) → ∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1)))))
20	2, 6, 19	mp2and 698	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ ((𝑃‘0)[,)(𝑃‘𝑀))) → ∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))))
21	3	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑀 ∈ ℕ)
22	1	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑃 ∈ (RePart‘𝑀))
23		elfzofz 13048	. . . . . . . . . . 11 ⊢ (𝑖 ∈ (0..^𝑀) → 𝑖 ∈ (0...𝑀))
24	23	adantl 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑖 ∈ (0...𝑀))
25	21, 22, 24	iccpartxr 43936	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑃‘𝑖) ∈ ℝ^*)
26		fzofzp1 13129	. . . . . . . . . . 11 ⊢ (𝑖 ∈ (0..^𝑀) → (𝑖 + 1) ∈ (0...𝑀))
27	26	adantl 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑖 + 1) ∈ (0...𝑀))
28	21, 22, 27	iccpartxr 43936	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑃‘(𝑖 + 1)) ∈ ℝ^*)
29	25, 28	jca 515	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑃‘𝑖) ∈ ℝ^* ∧ (𝑃‘(𝑖 + 1)) ∈ ℝ^*))
30	29	adantrr 716	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → ((𝑃‘𝑖) ∈ ℝ^* ∧ (𝑃‘(𝑖 + 1)) ∈ ℝ^*))
31		elico1 12769	. . . . . . 7 ⊢ (((𝑃‘𝑖) ∈ ℝ^* ∧ (𝑃‘(𝑖 + 1)) ∈ ℝ^) → (𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) ↔ (𝑋 ∈ ℝ^ ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1)))))
32	30, 31	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) ↔ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1)))))
33	3	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑀)) → 𝑀 ∈ ℕ)
34	1	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑀)) → 𝑃 ∈ (RePart‘𝑀))
35		elfzofz 13048	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (0..^𝑀) → 𝑗 ∈ (0...𝑀))
36	35	adantl 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑀)) → 𝑗 ∈ (0...𝑀))
37	33, 34, 36	iccpartxr 43936	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑀)) → (𝑃‘𝑗) ∈ ℝ^*)
38		fzofzp1 13129	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (0..^𝑀) → (𝑗 + 1) ∈ (0...𝑀))
39	38	adantl 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑀)) → (𝑗 + 1) ∈ (0...𝑀))
40	33, 34, 39	iccpartxr 43936	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑀)) → (𝑃‘(𝑗 + 1)) ∈ ℝ^*)
41	37, 40	jca 515	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (0..^𝑀)) → ((𝑃‘𝑗) ∈ ℝ^* ∧ (𝑃‘(𝑗 + 1)) ∈ ℝ^*))
42	41	adantrl 715	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → ((𝑃‘𝑗) ∈ ℝ^* ∧ (𝑃‘(𝑗 + 1)) ∈ ℝ^*))
43		elico1 12769	. . . . . . 7 ⊢ (((𝑃‘𝑗) ∈ ℝ^* ∧ (𝑃‘(𝑗 + 1)) ∈ ℝ^) → (𝑋 ∈ ((𝑃‘𝑗)[,)(𝑃‘(𝑗 + 1))) ↔ (𝑋 ∈ ℝ^ ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1)))))
44	42, 43	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (𝑋 ∈ ((𝑃‘𝑗)[,)(𝑃‘(𝑗 + 1))) ↔ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1)))))
45	32, 44	anbi12d 633	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → ((𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) ∧ 𝑋 ∈ ((𝑃‘𝑗)[,)(𝑃‘(𝑗 + 1)))) ↔ ((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) ∧ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1))))))
46		elfzoelz 13033	. . . . . . . . . 10 ⊢ (𝑖 ∈ (0..^𝑀) → 𝑖 ∈ ℤ)
47	46	zred 12075	. . . . . . . . 9 ⊢ (𝑖 ∈ (0..^𝑀) → 𝑖 ∈ ℝ)
48		elfzoelz 13033	. . . . . . . . . 10 ⊢ (𝑗 ∈ (0..^𝑀) → 𝑗 ∈ ℤ)
49	48	zred 12075	. . . . . . . . 9 ⊢ (𝑗 ∈ (0..^𝑀) → 𝑗 ∈ ℝ)
50	47, 49	anim12i 615	. . . . . . . 8 ⊢ ((𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)) → (𝑖 ∈ ℝ ∧ 𝑗 ∈ ℝ))
51	50	adantl 485	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (𝑖 ∈ ℝ ∧ 𝑗 ∈ ℝ))
52		lttri4 10714	. . . . . . 7 ⊢ ((𝑖 ∈ ℝ ∧ 𝑗 ∈ ℝ) → (𝑖 < 𝑗 ∨ 𝑖 = 𝑗 ∨ 𝑗 < 𝑖))
53	51, 52	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (𝑖 < 𝑗 ∨ 𝑖 = 𝑗 ∨ 𝑗 < 𝑖))
54	3, 1	icceuelpartlem 43952	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)) → (𝑖 < 𝑗 → (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗))))
55	54	imp31 421	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ 𝑖 < 𝑗) → (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗))
56		simpl 486	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)))) → 𝑋 ∈ ℝ^*)
57	28	adantrr 716	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (𝑃‘(𝑖 + 1)) ∈ ℝ^*)
58	57	adantl 485	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)))) → (𝑃‘(𝑖 + 1)) ∈ ℝ^*)
59	37	adantrl 715	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (𝑃‘𝑗) ∈ ℝ^*)
60	59	adantl 485	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)))) → (𝑃‘𝑗) ∈ ℝ^*)
61		nltle2tri 43870	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝑃‘(𝑖 + 1)) ∈ ℝ^* ∧ (𝑃‘𝑗) ∈ ℝ^*) → ¬ (𝑋 < (𝑃‘(𝑖 + 1)) ∧ (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗) ∧ (𝑃‘𝑗) ≤ 𝑋))
62	56, 58, 60, 61	syl3anc 1368	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)))) → ¬ (𝑋 < (𝑃‘(𝑖 + 1)) ∧ (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗) ∧ (𝑃‘𝑗) ≤ 𝑋))
63	62	pm2.21d 121	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)))) → ((𝑋 < (𝑃‘(𝑖 + 1)) ∧ (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗) ∧ (𝑃‘𝑗) ≤ 𝑋) → 𝑖 = 𝑗))
64	63	3expd 1350	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)))) → (𝑋 < (𝑃‘(𝑖 + 1)) → ((𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗) → ((𝑃‘𝑗) ≤ 𝑋 → 𝑖 = 𝑗))))
65	64	ex 416	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑋 ∈ ℝ^* → ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (𝑋 < (𝑃‘(𝑖 + 1)) → ((𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗) → ((𝑃‘𝑗) ≤ 𝑋 → 𝑖 = 𝑗)))))
66	65	com23 86	. . . . . . . . . . . . . . . . 17 ⊢ (𝑋 ∈ ℝ^* → (𝑋 < (𝑃‘(𝑖 + 1)) → ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → ((𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗) → ((𝑃‘𝑗) ≤ 𝑋 → 𝑖 = 𝑗)))))
67	66	com25 99	. . . . . . . . . . . . . . . 16 ⊢ (𝑋 ∈ ℝ^* → ((𝑃‘𝑗) ≤ 𝑋 → ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → ((𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗) → (𝑋 < (𝑃‘(𝑖 + 1)) → 𝑖 = 𝑗)))))
68	67	imp4b 425	. . . . . . . . . . . . . . 15 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋) → (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗)) → (𝑋 < (𝑃‘(𝑖 + 1)) → 𝑖 = 𝑗)))
69	68	com23 86	. . . . . . . . . . . . . 14 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋) → (𝑋 < (𝑃‘(𝑖 + 1)) → (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗)) → 𝑖 = 𝑗)))
70	69	3adant3 1129	. . . . . . . . . . . . 13 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1))) → (𝑋 < (𝑃‘(𝑖 + 1)) → (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗)) → 𝑖 = 𝑗)))
71	70	com12 32	. . . . . . . . . . . 12 ⊢ (𝑋 < (𝑃‘(𝑖 + 1)) → ((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1))) → (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗)) → 𝑖 = 𝑗)))
72	71	3ad2ant3 1132	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) → ((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1))) → (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗)) → 𝑖 = 𝑗)))
73	72	imp 410	. . . . . . . . . 10 ⊢ (((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) ∧ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1)))) → (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗)) → 𝑖 = 𝑗))
74	73	com12 32	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑗)) → (((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) ∧ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1)))) → 𝑖 = 𝑗))
75	55, 74	syldan 594	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ 𝑖 < 𝑗) → (((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) ∧ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1)))) → 𝑖 = 𝑗))
76	75	expcom 417	. . . . . . 7 ⊢ (𝑖 < 𝑗 → ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) ∧ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1)))) → 𝑖 = 𝑗)))
77		2a1 28	. . . . . . 7 ⊢ (𝑖 = 𝑗 → ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) ∧ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1)))) → 𝑖 = 𝑗)))
78	3, 1	icceuelpartlem 43952	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑗 ∈ (0..^𝑀) ∧ 𝑖 ∈ (0..^𝑀)) → (𝑗 < 𝑖 → (𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖))))
79	78	ancomsd 469	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)) → (𝑗 < 𝑖 → (𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖))))
80	79	imp31 421	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ 𝑗 < 𝑖) → (𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖))
81	40	adantrl 715	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (𝑃‘(𝑗 + 1)) ∈ ℝ^*)
82	81	adantl 485	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)))) → (𝑃‘(𝑗 + 1)) ∈ ℝ^*)
83	25	adantrr 716	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (𝑃‘𝑖) ∈ ℝ^*)
84	83	adantl 485	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)))) → (𝑃‘𝑖) ∈ ℝ^*)
85		nltle2tri 43870	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝑃‘(𝑗 + 1)) ∈ ℝ^* ∧ (𝑃‘𝑖) ∈ ℝ^*) → ¬ (𝑋 < (𝑃‘(𝑗 + 1)) ∧ (𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖) ∧ (𝑃‘𝑖) ≤ 𝑋))
86	56, 82, 84, 85	syl3anc 1368	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)))) → ¬ (𝑋 < (𝑃‘(𝑗 + 1)) ∧ (𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖) ∧ (𝑃‘𝑖) ≤ 𝑋))
87	86	pm2.21d 121	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)))) → ((𝑋 < (𝑃‘(𝑗 + 1)) ∧ (𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖) ∧ (𝑃‘𝑖) ≤ 𝑋) → 𝑖 = 𝑗))
88	87	3expd 1350	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀)))) → (𝑋 < (𝑃‘(𝑗 + 1)) → ((𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖) → ((𝑃‘𝑖) ≤ 𝑋 → 𝑖 = 𝑗))))
89	88	ex 416	. . . . . . . . . . . . . . . . 17 ⊢ (𝑋 ∈ ℝ^* → ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (𝑋 < (𝑃‘(𝑗 + 1)) → ((𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖) → ((𝑃‘𝑖) ≤ 𝑋 → 𝑖 = 𝑗)))))
90	89	com23 86	. . . . . . . . . . . . . . . 16 ⊢ (𝑋 ∈ ℝ^* → (𝑋 < (𝑃‘(𝑗 + 1)) → ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → ((𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖) → ((𝑃‘𝑖) ≤ 𝑋 → 𝑖 = 𝑗)))))
91	90	imp4b 425	. . . . . . . . . . . . . . 15 ⊢ ((𝑋 ∈ ℝ^* ∧ 𝑋 < (𝑃‘(𝑗 + 1))) → (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖)) → ((𝑃‘𝑖) ≤ 𝑋 → 𝑖 = 𝑗)))
92	91	com23 86	. . . . . . . . . . . . . 14 ⊢ ((𝑋 ∈ ℝ^* ∧ 𝑋 < (𝑃‘(𝑗 + 1))) → ((𝑃‘𝑖) ≤ 𝑋 → (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖)) → 𝑖 = 𝑗)))
93	92	3adant2 1128	. . . . . . . . . . . . 13 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1))) → ((𝑃‘𝑖) ≤ 𝑋 → (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖)) → 𝑖 = 𝑗)))
94	93	com12 32	. . . . . . . . . . . 12 ⊢ ((𝑃‘𝑖) ≤ 𝑋 → ((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1))) → (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖)) → 𝑖 = 𝑗)))
95	94	3ad2ant2 1131	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) → ((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1))) → (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖)) → 𝑖 = 𝑗)))
96	95	imp 410	. . . . . . . . . 10 ⊢ (((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) ∧ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1)))) → (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖)) → 𝑖 = 𝑗))
97	96	com12 32	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ (𝑃‘(𝑗 + 1)) ≤ (𝑃‘𝑖)) → (((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) ∧ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1)))) → 𝑖 = 𝑗))
98	80, 97	syldan 594	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) ∧ 𝑗 < 𝑖) → (((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) ∧ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1)))) → 𝑖 = 𝑗))
99	98	expcom 417	. . . . . . 7 ⊢ (𝑗 < 𝑖 → ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) ∧ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1)))) → 𝑖 = 𝑗)))
100	76, 77, 99	3jaoi 1424	. . . . . 6 ⊢ ((𝑖 < 𝑗 ∨ 𝑖 = 𝑗 ∨ 𝑗 < 𝑖) → ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) ∧ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1)))) → 𝑖 = 𝑗)))
101	53, 100	mpcom 38	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → (((𝑋 ∈ ℝ^* ∧ (𝑃‘𝑖) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑖 + 1))) ∧ (𝑋 ∈ ℝ^* ∧ (𝑃‘𝑗) ≤ 𝑋 ∧ 𝑋 < (𝑃‘(𝑗 + 1)))) → 𝑖 = 𝑗))
102	45, 101	sylbid 243	. . . 4 ⊢ ((𝜑 ∧ (𝑖 ∈ (0..^𝑀) ∧ 𝑗 ∈ (0..^𝑀))) → ((𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) ∧ 𝑋 ∈ ((𝑃‘𝑗)[,)(𝑃‘(𝑗 + 1)))) → 𝑖 = 𝑗))
103	102	ralrimivva 3156	. . 3 ⊢ (𝜑 → ∀𝑖 ∈ (0..^𝑀)∀𝑗 ∈ (0..^𝑀)((𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) ∧ 𝑋 ∈ ((𝑃‘𝑗)[,)(𝑃‘(𝑗 + 1)))) → 𝑖 = 𝑗))
104	103	adantr 484	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ ((𝑃‘0)[,)(𝑃‘𝑀))) → ∀𝑖 ∈ (0..^𝑀)∀𝑗 ∈ (0..^𝑀)((𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) ∧ 𝑋 ∈ ((𝑃‘𝑗)[,)(𝑃‘(𝑗 + 1)))) → 𝑖 = 𝑗))
105		fveq2 6645	. . . . 5 ⊢ (𝑖 = 𝑗 → (𝑃‘𝑖) = (𝑃‘𝑗))
106		fvoveq1 7158	. . . . 5 ⊢ (𝑖 = 𝑗 → (𝑃‘(𝑖 + 1)) = (𝑃‘(𝑗 + 1)))
107	105, 106	oveq12d 7153	. . . 4 ⊢ (𝑖 = 𝑗 → ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) = ((𝑃‘𝑗)[,)(𝑃‘(𝑗 + 1))))
108	107	eleq2d 2875	. . 3 ⊢ (𝑖 = 𝑗 → (𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) ↔ 𝑋 ∈ ((𝑃‘𝑗)[,)(𝑃‘(𝑗 + 1)))))
109	108	reu4 3670	. 2 ⊢ (∃!𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) ↔ (∃𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) ∧ ∀𝑖 ∈ (0..^𝑀)∀𝑗 ∈ (0..^𝑀)((𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) ∧ 𝑋 ∈ ((𝑃‘𝑗)[,)(𝑃‘(𝑗 + 1)))) → 𝑖 = 𝑗)))
110	20, 104, 109	sylanbrc 586	1 ⊢ ((𝜑 ∧ 𝑋 ∈ ((𝑃‘0)[,)(𝑃‘𝑀))) → ∃!𝑖 ∈ (0..^𝑀)𝑋 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 ∨ w3o 1083 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ∀wral 3106 ∃wrex 3107 ∃!wreu 3108 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 ℝcr 10525 0cc0 10526 1c1 10527 + caddc 10529 ℝ^*cxr 10663 < clt 10664 ≤ cle 10665 ℕcn 11625 [,)cico 12728 ...cfz 12885 ..^cfzo 13028 RePartciccp 43930

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-map 8391 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-n0 11886 df-z 11970 df-uz 12232 df-ico 12732 df-fz 12886 df-fzo 13029 df-iccp 43931

This theorem is referenced by: iccpartdisj 43954

W3C validator