Theorem iccpartres 43598

Description: The restriction of a partition is a partition. (Contributed by AV, 16-Jul-2020.)

Assertion

Ref	Expression
iccpartres	⊢ ((𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘(𝑀 + 1))) → (𝑃 ↾ (0...𝑀)) ∈ (RePart‘𝑀))

Proof of Theorem iccpartres

Dummy variable 𝑖 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		peano2nn 11650	. . . 4 ⊢ (𝑀 ∈ ℕ → (𝑀 + 1) ∈ ℕ)
2		iccpart 43596	. . . 4 ⊢ ((𝑀 + 1) ∈ ℕ → (𝑃 ∈ (RePart‘(𝑀 + 1)) ↔ (𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ ∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)))))
3	1, 2	syl 17	. . 3 ⊢ (𝑀 ∈ ℕ → (𝑃 ∈ (RePart‘(𝑀 + 1)) ↔ (𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ ∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)))))
4		simpl 485	. . . . . 6 ⊢ ((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ ∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1))) → 𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))))
5		nnz 12005	. . . . . . . . 9 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℤ)
6		uzid 12259	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀))
7	5, 6	syl 17	. . . . . . . 8 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ (ℤ≥‘𝑀))
8		peano2uz 12302	. . . . . . . 8 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (𝑀 + 1) ∈ (ℤ≥‘𝑀))
9	7, 8	syl 17	. . . . . . 7 ⊢ (𝑀 ∈ ℕ → (𝑀 + 1) ∈ (ℤ≥‘𝑀))
10		fzss2 12948	. . . . . . 7 ⊢ ((𝑀 + 1) ∈ (ℤ≥‘𝑀) → (0...𝑀) ⊆ (0...(𝑀 + 1)))
11	9, 10	syl 17	. . . . . 6 ⊢ (𝑀 ∈ ℕ → (0...𝑀) ⊆ (0...(𝑀 + 1)))
12		elmapssres 8431	. . . . . 6 ⊢ ((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ (0...𝑀) ⊆ (0...(𝑀 + 1))) → (𝑃 ↾ (0...𝑀)) ∈ (ℝ* ↑m (0...𝑀)))
13	4, 11, 12	syl2anr 598	. . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ (𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ ∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)))) → (𝑃 ↾ (0...𝑀)) ∈ (ℝ* ↑m (0...𝑀)))
14		fzoss2 13066	. . . . . . . . . 10 ⊢ ((𝑀 + 1) ∈ (ℤ≥‘𝑀) → (0..^𝑀) ⊆ (0..^(𝑀 + 1)))
15	9, 14	syl 17	. . . . . . . . 9 ⊢ (𝑀 ∈ ℕ → (0..^𝑀) ⊆ (0..^(𝑀 + 1)))
16		ssralv 4033	. . . . . . . . 9 ⊢ ((0..^𝑀) ⊆ (0..^(𝑀 + 1)) → (∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)) → ∀𝑖 ∈ (0..^𝑀)(𝑃‘𝑖) < (𝑃‘(𝑖 + 1))))
17	15, 16	syl 17	. . . . . . . 8 ⊢ (𝑀 ∈ ℕ → (∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)) → ∀𝑖 ∈ (0..^𝑀)(𝑃‘𝑖) < (𝑃‘(𝑖 + 1))))
18	17	adantld 493	. . . . . . 7 ⊢ (𝑀 ∈ ℕ → ((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ ∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1))) → ∀𝑖 ∈ (0..^𝑀)(𝑃‘𝑖) < (𝑃‘(𝑖 + 1))))
19	18	imp 409	. . . . . 6 ⊢ ((𝑀 ∈ ℕ ∧ (𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ ∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)))) → ∀𝑖 ∈ (0..^𝑀)(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)))
20		fzossfz 13057	. . . . . . . . . . . . . . 15 ⊢ (0..^𝑀) ⊆ (0...𝑀)
21	20	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ 𝑀 ∈ ℕ) → (0..^𝑀) ⊆ (0...𝑀))
22	21	sselda 3967	. . . . . . . . . . . . 13 ⊢ (((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ 𝑀 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → 𝑖 ∈ (0...𝑀))
23		fvres 6689	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ (0...𝑀) → ((𝑃 ↾ (0...𝑀))‘𝑖) = (𝑃‘𝑖))
24	23	eqcomd 2827	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ (0...𝑀) → (𝑃‘𝑖) = ((𝑃 ↾ (0...𝑀))‘𝑖))
25	22, 24	syl 17	. . . . . . . . . . . 12 ⊢ (((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ 𝑀 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → (𝑃‘𝑖) = ((𝑃 ↾ (0...𝑀))‘𝑖))
26		simpr 487	. . . . . . . . . . . . . . 15 ⊢ (((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ 𝑀 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → 𝑖 ∈ (0..^𝑀))
27		elfzouz 13043	. . . . . . . . . . . . . . . . 17 ⊢ (𝑖 ∈ (0..^𝑀) → 𝑖 ∈ (ℤ≥‘0))
28	27	adantl 484	. . . . . . . . . . . . . . . 16 ⊢ (((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ 𝑀 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → 𝑖 ∈ (ℤ≥‘0))
29		fzofzp1b 13136	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ (ℤ≥‘0) → (𝑖 ∈ (0..^𝑀) ↔ (𝑖 + 1) ∈ (0...𝑀)))
30	28, 29	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ 𝑀 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → (𝑖 ∈ (0..^𝑀) ↔ (𝑖 + 1) ∈ (0...𝑀)))
31	26, 30	mpbid 234	. . . . . . . . . . . . . 14 ⊢ (((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ 𝑀 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → (𝑖 + 1) ∈ (0...𝑀))
32		fvres 6689	. . . . . . . . . . . . . 14 ⊢ ((𝑖 + 1) ∈ (0...𝑀) → ((𝑃 ↾ (0...𝑀))‘(𝑖 + 1)) = (𝑃‘(𝑖 + 1)))
33	31, 32	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ 𝑀 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑃 ↾ (0...𝑀))‘(𝑖 + 1)) = (𝑃‘(𝑖 + 1)))
34	33	eqcomd 2827	. . . . . . . . . . . 12 ⊢ (((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ 𝑀 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → (𝑃‘(𝑖 + 1)) = ((𝑃 ↾ (0...𝑀))‘(𝑖 + 1)))
35	25, 34	breq12d 5079	. . . . . . . . . . 11 ⊢ (((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ 𝑀 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑃‘𝑖) < (𝑃‘(𝑖 + 1)) ↔ ((𝑃 ↾ (0...𝑀))‘𝑖) < ((𝑃 ↾ (0...𝑀))‘(𝑖 + 1))))
36	35	biimpd 231	. . . . . . . . . 10 ⊢ (((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ 𝑀 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑃‘𝑖) < (𝑃‘(𝑖 + 1)) → ((𝑃 ↾ (0...𝑀))‘𝑖) < ((𝑃 ↾ (0...𝑀))‘(𝑖 + 1))))
37	36	ralimdva 3177	. . . . . . . . 9 ⊢ ((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ 𝑀 ∈ ℕ) → (∀𝑖 ∈ (0..^𝑀)(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)) → ∀𝑖 ∈ (0..^𝑀)((𝑃 ↾ (0...𝑀))‘𝑖) < ((𝑃 ↾ (0...𝑀))‘(𝑖 + 1))))
38	37	ex 415	. . . . . . . 8 ⊢ (𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) → (𝑀 ∈ ℕ → (∀𝑖 ∈ (0..^𝑀)(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)) → ∀𝑖 ∈ (0..^𝑀)((𝑃 ↾ (0...𝑀))‘𝑖) < ((𝑃 ↾ (0...𝑀))‘(𝑖 + 1)))))
39	38	adantr 483	. . . . . . 7 ⊢ ((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ ∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1))) → (𝑀 ∈ ℕ → (∀𝑖 ∈ (0..^𝑀)(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)) → ∀𝑖 ∈ (0..^𝑀)((𝑃 ↾ (0...𝑀))‘𝑖) < ((𝑃 ↾ (0...𝑀))‘(𝑖 + 1)))))
40	39	impcom 410	. . . . . 6 ⊢ ((𝑀 ∈ ℕ ∧ (𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ ∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)))) → (∀𝑖 ∈ (0..^𝑀)(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)) → ∀𝑖 ∈ (0..^𝑀)((𝑃 ↾ (0...𝑀))‘𝑖) < ((𝑃 ↾ (0...𝑀))‘(𝑖 + 1))))
41	19, 40	mpd 15	. . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ (𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ ∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)))) → ∀𝑖 ∈ (0..^𝑀)((𝑃 ↾ (0...𝑀))‘𝑖) < ((𝑃 ↾ (0...𝑀))‘(𝑖 + 1)))
42		iccpart 43596	. . . . . 6 ⊢ (𝑀 ∈ ℕ → ((𝑃 ↾ (0...𝑀)) ∈ (RePart‘𝑀) ↔ ((𝑃 ↾ (0...𝑀)) ∈ (ℝ* ↑m (0...𝑀)) ∧ ∀𝑖 ∈ (0..^𝑀)((𝑃 ↾ (0...𝑀))‘𝑖) < ((𝑃 ↾ (0...𝑀))‘(𝑖 + 1)))))
43	42	adantr 483	. . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ (𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ ∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)))) → ((𝑃 ↾ (0...𝑀)) ∈ (RePart‘𝑀) ↔ ((𝑃 ↾ (0...𝑀)) ∈ (ℝ* ↑m (0...𝑀)) ∧ ∀𝑖 ∈ (0..^𝑀)((𝑃 ↾ (0...𝑀))‘𝑖) < ((𝑃 ↾ (0...𝑀))‘(𝑖 + 1)))))
44	13, 41, 43	mpbir2and 711	. . . 4 ⊢ ((𝑀 ∈ ℕ ∧ (𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ ∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)))) → (𝑃 ↾ (0...𝑀)) ∈ (RePart‘𝑀))
45	44	ex 415	. . 3 ⊢ (𝑀 ∈ ℕ → ((𝑃 ∈ (ℝ* ↑m (0...(𝑀 + 1))) ∧ ∀𝑖 ∈ (0..^(𝑀 + 1))(𝑃‘𝑖) < (𝑃‘(𝑖 + 1))) → (𝑃 ↾ (0...𝑀)) ∈ (RePart‘𝑀)))
46	3, 45	sylbid 242	. 2 ⊢ (𝑀 ∈ ℕ → (𝑃 ∈ (RePart‘(𝑀 + 1)) → (𝑃 ↾ (0...𝑀)) ∈ (RePart‘𝑀)))
47	46	imp 409	1 ⊢ ((𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘(𝑀 + 1))) → (𝑃 ↾ (0...𝑀)) ∈ (RePart‘𝑀))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114  ∀wral 3138   ⊆ wss 3936   class class class wbr 5066   ↾ cres 5557  ‘cfv 6355  (class class class)co 7156   ↑_m cmap 8406  0cc0 10537  1c1 10538   + caddc 10540  ℝ^*cxr 10674   < clt 10675  ℕcn 11638  ℤ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:  iccelpart  43613