iccpartiun - Mathbox for Alexander van der Vekens

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

Theorem iccpartiun 46092

Description: A half-open interval of extended reals is the union of the parts of its partition. (Contributed by AV, 18-Jul-2020.)

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

**Assertion**
Ref	Expression
iccpartiun	⊢ (𝜑 → ((𝑃‘0)[,)(𝑃‘𝑀)) = ∪ 𝑖 ∈ (0..^𝑀)((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))))

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

Proof of Theorem iccpartiun Dummy variables 𝑗 𝑘 𝑝 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		iccpartiun.p	. . . . 5 ⊢ (𝜑 → 𝑃 ∈ (RePart‘𝑀))
2		iccpartiun.m	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℕ)
3		iccelpart 46091	. . . . . 6 ⊢ (𝑀 ∈ ℕ → ∀𝑝 ∈ (RePart‘𝑀)(𝑥 ∈ ((𝑝‘0)[,)(𝑝‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1)))))
4		fveq1 6890	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑃 → (𝑝‘0) = (𝑃‘0))
5		fveq1 6890	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑃 → (𝑝‘𝑀) = (𝑃‘𝑀))
6	4, 5	oveq12d 7426	. . . . . . . . . 10 ⊢ (𝑝 = 𝑃 → ((𝑝‘0)[,)(𝑝‘𝑀)) = ((𝑃‘0)[,)(𝑃‘𝑀)))
7	6	eleq2d 2819	. . . . . . . . 9 ⊢ (𝑝 = 𝑃 → (𝑥 ∈ ((𝑝‘0)[,)(𝑝‘𝑀)) ↔ 𝑥 ∈ ((𝑃‘0)[,)(𝑃‘𝑀))))
8		fveq1 6890	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑃 → (𝑝‘𝑖) = (𝑃‘𝑖))
9		fveq1 6890	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑃 → (𝑝‘(𝑖 + 1)) = (𝑃‘(𝑖 + 1)))
10	8, 9	oveq12d 7426	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑃 → ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1))) = ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))))
11	10	eleq2d 2819	. . . . . . . . . 10 ⊢ (𝑝 = 𝑃 → (𝑥 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1))) ↔ 𝑥 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1)))))
12	11	rexbidv 3178	. . . . . . . . 9 ⊢ (𝑝 = 𝑃 → (∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1))) ↔ ∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1)))))
13	7, 12	imbi12d 344	. . . . . . . 8 ⊢ (𝑝 = 𝑃 → ((𝑥 ∈ ((𝑝‘0)[,)(𝑝‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1)))) ↔ (𝑥 ∈ ((𝑃‘0)[,)(𝑃‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))))))
14	13	rspcva 3610	. . . . . . 7 ⊢ ((𝑃 ∈ (RePart‘𝑀) ∧ ∀𝑝 ∈ (RePart‘𝑀)(𝑥 ∈ ((𝑝‘0)[,)(𝑝‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1))))) → (𝑥 ∈ ((𝑃‘0)[,)(𝑃‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1)))))
15	14	expcom 414	. . . . . 6 ⊢ (∀𝑝 ∈ (RePart‘𝑀)(𝑥 ∈ ((𝑝‘0)[,)(𝑝‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑝‘𝑖)[,)(𝑝‘(𝑖 + 1)))) → (𝑃 ∈ (RePart‘𝑀) → (𝑥 ∈ ((𝑃‘0)[,)(𝑃‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))))))
16	2, 3, 15	3syl 18	. . . . 5 ⊢ (𝜑 → (𝑃 ∈ (RePart‘𝑀) → (𝑥 ∈ ((𝑃‘0)[,)(𝑃‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))))))
17	1, 16	mpd 15	. . . 4 ⊢ (𝜑 → (𝑥 ∈ ((𝑃‘0)[,)(𝑃‘𝑀)) → ∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1)))))
18		nnnn0 12478	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℕ₀)
19		0elfz 13597	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℕ₀ → 0 ∈ (0...𝑀))
20	2, 18, 19	3syl 18	. . . . . . . . . 10 ⊢ (𝜑 → 0 ∈ (0...𝑀))
21	2, 1, 20	iccpartxr 46077	. . . . . . . . 9 ⊢ (𝜑 → (𝑃‘0) ∈ ℝ^*)
22		nn0fz0 13598	. . . . . . . . . . . 12 ⊢ (𝑀 ∈ ℕ₀ ↔ 𝑀 ∈ (0...𝑀))
23	22	biimpi 215	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℕ₀ → 𝑀 ∈ (0...𝑀))
24	2, 18, 23	3syl 18	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ (0...𝑀))
25	2, 1, 24	iccpartxr 46077	. . . . . . . . 9 ⊢ (𝜑 → (𝑃‘𝑀) ∈ ℝ^*)
26	21, 25	jca 512	. . . . . . . 8 ⊢ (𝜑 → ((𝑃‘0) ∈ ℝ^* ∧ (𝑃‘𝑀) ∈ ℝ^*))
27	26	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑃‘0) ∈ ℝ^* ∧ (𝑃‘𝑀) ∈ ℝ^*))
28		elfzofz 13647	. . . . . . . 8 ⊢ (𝑖 ∈ (0..^𝑀) → 𝑖 ∈ (0...𝑀))
29	2, 1	iccpartgel 46087	. . . . . . . 8 ⊢ (𝜑 → ∀𝑗 ∈ (0...𝑀)(𝑃‘0) ≤ (𝑃‘𝑗))
30		fveq2 6891	. . . . . . . . . 10 ⊢ (𝑗 = 𝑖 → (𝑃‘𝑗) = (𝑃‘𝑖))
31	30	breq2d 5160	. . . . . . . . 9 ⊢ (𝑗 = 𝑖 → ((𝑃‘0) ≤ (𝑃‘𝑗) ↔ (𝑃‘0) ≤ (𝑃‘𝑖)))
32	31	rspcva 3610	. . . . . . . 8 ⊢ ((𝑖 ∈ (0...𝑀) ∧ ∀𝑗 ∈ (0...𝑀)(𝑃‘0) ≤ (𝑃‘𝑗)) → (𝑃‘0) ≤ (𝑃‘𝑖))
33	28, 29, 32	syl2anr 597	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑃‘0) ≤ (𝑃‘𝑖))
34		fzofzp1 13728	. . . . . . . 8 ⊢ (𝑖 ∈ (0..^𝑀) → (𝑖 + 1) ∈ (0...𝑀))
35	2, 1	iccpartleu 46086	. . . . . . . 8 ⊢ (𝜑 → ∀𝑘 ∈ (0...𝑀)(𝑃‘𝑘) ≤ (𝑃‘𝑀))
36		fveq2 6891	. . . . . . . . . 10 ⊢ (𝑘 = (𝑖 + 1) → (𝑃‘𝑘) = (𝑃‘(𝑖 + 1)))
37	36	breq1d 5158	. . . . . . . . 9 ⊢ (𝑘 = (𝑖 + 1) → ((𝑃‘𝑘) ≤ (𝑃‘𝑀) ↔ (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑀)))
38	37	rspcva 3610	. . . . . . . 8 ⊢ (((𝑖 + 1) ∈ (0...𝑀) ∧ ∀𝑘 ∈ (0...𝑀)(𝑃‘𝑘) ≤ (𝑃‘𝑀)) → (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑀))
39	34, 35, 38	syl2anr 597	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑀))
40		icossico 13393	. . . . . . 7 ⊢ ((((𝑃‘0) ∈ ℝ^* ∧ (𝑃‘𝑀) ∈ ℝ^*) ∧ ((𝑃‘0) ≤ (𝑃‘𝑖) ∧ (𝑃‘(𝑖 + 1)) ≤ (𝑃‘𝑀))) → ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) ⊆ ((𝑃‘0)[,)(𝑃‘𝑀)))
41	27, 33, 39, 40	syl12anc 835	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) ⊆ ((𝑃‘0)[,)(𝑃‘𝑀)))
42	41	sseld 3981	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑥 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) → 𝑥 ∈ ((𝑃‘0)[,)(𝑃‘𝑀))))
43	42	rexlimdva 3155	. . . 4 ⊢ (𝜑 → (∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) → 𝑥 ∈ ((𝑃‘0)[,)(𝑃‘𝑀))))
44	17, 43	impbid 211	. . 3 ⊢ (𝜑 → (𝑥 ∈ ((𝑃‘0)[,)(𝑃‘𝑀)) ↔ ∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1)))))
45		eliun 5001	. . 3 ⊢ (𝑥 ∈ ∪ 𝑖 ∈ (0..^𝑀)((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))) ↔ ∃𝑖 ∈ (0..^𝑀)𝑥 ∈ ((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))))
46	44, 45	bitr4di 288	. 2 ⊢ (𝜑 → (𝑥 ∈ ((𝑃‘0)[,)(𝑃‘𝑀)) ↔ 𝑥 ∈ ∪ 𝑖 ∈ (0..^𝑀)((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1)))))
47	46	eqrdv 2730	1 ⊢ (𝜑 → ((𝑃‘0)[,)(𝑃‘𝑀)) = ∪ 𝑖 ∈ (0..^𝑀)((𝑃‘𝑖)[,)(𝑃‘(𝑖 + 1))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 ⊆ wss 3948 ∪ ciun 4997 class class class wbr 5148 ‘cfv 6543 (class class class)co 7408 0cc0 11109 1c1 11110 + caddc 11112 ℝ^*cxr 11246 ≤ cle 11248 ℕcn 12211 ℕ₀cn0 12471 [,)cico 13325 ...cfz 13483 ..^cfzo 13626 RePartciccp 46071

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-1st 7974 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-er 8702 df-map 8821 df-en 8939 df-dom 8940 df-sdom 8941 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-nn 12212 df-2 12274 df-n0 12472 df-z 12558 df-uz 12822 df-ico 13329 df-fz 13484 df-fzo 13627 df-iccp 46072

This theorem is referenced by: (None)

W3C validator