| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > iccpartgtprec | Structured version Visualization version GIF version | ||
| Description: If there is a partition, then all intermediate points and the upper bound are strictly greater than the preceeding intermediate points or lower bound. (Contributed by AV, 11-Jul-2020.) |
| Ref | Expression |
|---|---|
| iccpartgtprec.m | ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| iccpartgtprec.p | ⊢ (𝜑 → 𝑃 ∈ (RePart‘𝑀)) |
| iccpartgtprec.i | ⊢ (𝜑 → 𝐼 ∈ (1...𝑀)) |
| Ref | Expression |
|---|---|
| iccpartgtprec | ⊢ (𝜑 → (𝑃‘(𝐼 − 1)) < (𝑃‘𝐼)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iccpartgtprec.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ) | |
| 2 | iccpartgtprec.p | . . . 4 ⊢ (𝜑 → 𝑃 ∈ (RePart‘𝑀)) | |
| 3 | iccpartgtprec.i | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ (1...𝑀)) | |
| 4 | 1 | nnzd 12759 | . . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 5 | fzval3 13909 | . . . . . . . 8 ⊢ (𝑀 ∈ ℤ → (1...𝑀) = (1..^(𝑀 + 1))) | |
| 6 | 5 | eleq2d 2850 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → (𝐼 ∈ (1...𝑀) ↔ 𝐼 ∈ (1..^(𝑀 + 1)))) |
| 7 | 4, 6 | syl 18 | . . . . . 6 ⊢ (𝜑 → (𝐼 ∈ (1...𝑀) ↔ 𝐼 ∈ (1..^(𝑀 + 1)))) |
| 8 | 3, 7 | mpbid 235 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ (1..^(𝑀 + 1))) |
| 9 | 1 | nncnd 12391 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℂ) |
| 10 | pncan1 11779 | . . . . . . . . . 10 ⊢ (𝑀 ∈ ℂ → ((𝑀 + 1) − 1) = 𝑀) | |
| 11 | 9, 10 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → ((𝑀 + 1) − 1) = 𝑀) |
| 12 | 11 | eqcomd 2769 | . . . . . . . 8 ⊢ (𝜑 → 𝑀 = ((𝑀 + 1) − 1)) |
| 13 | 12 | oveq2d 7467 | . . . . . . 7 ⊢ (𝜑 → (0..^𝑀) = (0..^((𝑀 + 1) − 1))) |
| 14 | 13 | eleq2d 2850 | . . . . . 6 ⊢ (𝜑 → ((𝐼 − 1) ∈ (0..^𝑀) ↔ (𝐼 − 1) ∈ (0..^((𝑀 + 1) − 1)))) |
| 15 | 3 | elfzelzd 13697 | . . . . . . 7 ⊢ (𝜑 → 𝐼 ∈ ℤ) |
| 16 | 4 | peano2zd 12846 | . . . . . . 7 ⊢ (𝜑 → (𝑀 + 1) ∈ ℤ) |
| 17 | elfzom1b 13941 | . . . . . . 7 ⊢ ((𝐼 ∈ ℤ ∧ (𝑀 + 1) ∈ ℤ) → (𝐼 ∈ (1..^(𝑀 + 1)) ↔ (𝐼 − 1) ∈ (0..^((𝑀 + 1) − 1)))) | |
| 18 | 15, 16, 17 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → (𝐼 ∈ (1..^(𝑀 + 1)) ↔ (𝐼 − 1) ∈ (0..^((𝑀 + 1) − 1)))) |
| 19 | 14, 18 | bitr4d 285 | . . . . 5 ⊢ (𝜑 → ((𝐼 − 1) ∈ (0..^𝑀) ↔ 𝐼 ∈ (1..^(𝑀 + 1)))) |
| 20 | 8, 19 | mpbird 260 | . . . 4 ⊢ (𝜑 → (𝐼 − 1) ∈ (0..^𝑀)) |
| 21 | iccpartimp 48833 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ (𝐼 − 1) ∈ (0..^𝑀)) → (𝑃 ∈ (ℝ* ↑m (0...𝑀)) ∧ (𝑃‘(𝐼 − 1)) < (𝑃‘((𝐼 − 1) + 1)))) | |
| 22 | 1, 2, 20, 21 | syl3anc 1399 | . . 3 ⊢ (𝜑 → (𝑃 ∈ (ℝ* ↑m (0...𝑀)) ∧ (𝑃‘(𝐼 − 1)) < (𝑃‘((𝐼 − 1) + 1)))) |
| 23 | 22 | simprd 501 | . 2 ⊢ (𝜑 → (𝑃‘(𝐼 − 1)) < (𝑃‘((𝐼 − 1) + 1))) |
| 24 | 15 | zcnd 12844 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ ℂ) |
| 25 | npcan1 11780 | . . . . 5 ⊢ (𝐼 ∈ ℂ → ((𝐼 − 1) + 1) = 𝐼) | |
| 26 | 24, 25 | syl 18 | . . . 4 ⊢ (𝜑 → ((𝐼 − 1) + 1) = 𝐼) |
| 27 | 26 | eqcomd 2769 | . . 3 ⊢ (𝜑 → 𝐼 = ((𝐼 − 1) + 1)) |
| 28 | 27 | fveq2d 6920 | . 2 ⊢ (𝜑 → (𝑃‘𝐼) = (𝑃‘((𝐼 − 1) + 1))) |
| 29 | 23, 28 | breqtrrd 5139 | 1 ⊢ (𝜑 → (𝑃‘(𝐼 − 1)) < (𝑃‘𝐼)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 ↑m cmap 8885 ℂcc 11237 0cc0 11239 1c1 11240 + caddc 11242 ℝ*cxr 11381 < clt 11382 − cmin 11580 ℕcn 12375 ℤcz 12733 ...cfz 13679 ..^cfzo 13828 RePartciccp 48829 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-iccp 48830 |
| This theorem is used by: iccpartipre 48837 iccpartiltu 48838 |
| Copyright terms: Public domain | W3C validator |