Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > iccpartgtl | 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 lower bound. (Contributed by AV, 14-Jul-2020.) |
Ref | Expression |
---|---|
iccpartgtprec.m | ⊢ (𝜑 → 𝑀 ∈ ℕ) |
iccpartgtprec.p | ⊢ (𝜑 → 𝑃 ∈ (RePart‘𝑀)) |
Ref | Expression |
---|---|
iccpartgtl | ⊢ (𝜑 → ∀𝑖 ∈ (1...𝑀)(𝑃‘0) < (𝑃‘𝑖)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iccpartgtprec.m | . . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℕ) | |
2 | elnnuz 12264 | . . . . . . 7 ⊢ (𝑀 ∈ ℕ ↔ 𝑀 ∈ (ℤ≥‘1)) | |
3 | 1, 2 | sylib 220 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘1)) |
4 | fzisfzounsn 13134 | . . . . . 6 ⊢ (𝑀 ∈ (ℤ≥‘1) → (1...𝑀) = ((1..^𝑀) ∪ {𝑀})) | |
5 | 3, 4 | syl 17 | . . . . 5 ⊢ (𝜑 → (1...𝑀) = ((1..^𝑀) ∪ {𝑀})) |
6 | 5 | eleq2d 2896 | . . . 4 ⊢ (𝜑 → (𝑖 ∈ (1...𝑀) ↔ 𝑖 ∈ ((1..^𝑀) ∪ {𝑀}))) |
7 | elun 4108 | . . . . 5 ⊢ (𝑖 ∈ ((1..^𝑀) ∪ {𝑀}) ↔ (𝑖 ∈ (1..^𝑀) ∨ 𝑖 ∈ {𝑀})) | |
8 | 7 | a1i 11 | . . . 4 ⊢ (𝜑 → (𝑖 ∈ ((1..^𝑀) ∪ {𝑀}) ↔ (𝑖 ∈ (1..^𝑀) ∨ 𝑖 ∈ {𝑀}))) |
9 | velsn 4564 | . . . . . 6 ⊢ (𝑖 ∈ {𝑀} ↔ 𝑖 = 𝑀) | |
10 | 9 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑖 ∈ {𝑀} ↔ 𝑖 = 𝑀)) |
11 | 10 | orbi2d 912 | . . . 4 ⊢ (𝜑 → ((𝑖 ∈ (1..^𝑀) ∨ 𝑖 ∈ {𝑀}) ↔ (𝑖 ∈ (1..^𝑀) ∨ 𝑖 = 𝑀))) |
12 | 6, 8, 11 | 3bitrd 307 | . . 3 ⊢ (𝜑 → (𝑖 ∈ (1...𝑀) ↔ (𝑖 ∈ (1..^𝑀) ∨ 𝑖 = 𝑀))) |
13 | fveq2 6651 | . . . . . . . 8 ⊢ (𝑘 = 𝑖 → (𝑃‘𝑘) = (𝑃‘𝑖)) | |
14 | 13 | breq2d 5059 | . . . . . . 7 ⊢ (𝑘 = 𝑖 → ((𝑃‘0) < (𝑃‘𝑘) ↔ (𝑃‘0) < (𝑃‘𝑖))) |
15 | 14 | rspccv 3607 | . . . . . 6 ⊢ (∀𝑘 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑘) → (𝑖 ∈ (1..^𝑀) → (𝑃‘0) < (𝑃‘𝑖))) |
16 | iccpartgtprec.p | . . . . . . 7 ⊢ (𝜑 → 𝑃 ∈ (RePart‘𝑀)) | |
17 | 1, 16 | iccpartigtl 43668 | . . . . . 6 ⊢ (𝜑 → ∀𝑘 ∈ (1..^𝑀)(𝑃‘0) < (𝑃‘𝑘)) |
18 | 15, 17 | syl11 33 | . . . . 5 ⊢ (𝑖 ∈ (1..^𝑀) → (𝜑 → (𝑃‘0) < (𝑃‘𝑖))) |
19 | 1, 16 | iccpartlt 43669 | . . . . . . . 8 ⊢ (𝜑 → (𝑃‘0) < (𝑃‘𝑀)) |
20 | 19 | adantl 484 | . . . . . . 7 ⊢ ((𝑖 = 𝑀 ∧ 𝜑) → (𝑃‘0) < (𝑃‘𝑀)) |
21 | fveq2 6651 | . . . . . . . 8 ⊢ (𝑖 = 𝑀 → (𝑃‘𝑖) = (𝑃‘𝑀)) | |
22 | 21 | adantr 483 | . . . . . . 7 ⊢ ((𝑖 = 𝑀 ∧ 𝜑) → (𝑃‘𝑖) = (𝑃‘𝑀)) |
23 | 20, 22 | breqtrrd 5075 | . . . . . 6 ⊢ ((𝑖 = 𝑀 ∧ 𝜑) → (𝑃‘0) < (𝑃‘𝑖)) |
24 | 23 | ex 415 | . . . . 5 ⊢ (𝑖 = 𝑀 → (𝜑 → (𝑃‘0) < (𝑃‘𝑖))) |
25 | 18, 24 | jaoi 853 | . . . 4 ⊢ ((𝑖 ∈ (1..^𝑀) ∨ 𝑖 = 𝑀) → (𝜑 → (𝑃‘0) < (𝑃‘𝑖))) |
26 | 25 | com12 32 | . . 3 ⊢ (𝜑 → ((𝑖 ∈ (1..^𝑀) ∨ 𝑖 = 𝑀) → (𝑃‘0) < (𝑃‘𝑖))) |
27 | 12, 26 | sylbid 242 | . 2 ⊢ (𝜑 → (𝑖 ∈ (1...𝑀) → (𝑃‘0) < (𝑃‘𝑖))) |
28 | 27 | ralrimiv 3176 | 1 ⊢ (𝜑 → ∀𝑖 ∈ (1...𝑀)(𝑃‘0) < (𝑃‘𝑖)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 = wceq 1537 ∈ wcel 2114 ∀wral 3133 ∪ cun 3917 {csn 4548 class class class wbr 5047 ‘cfv 6336 (class class class)co 7137 0cc0 10518 1c1 10519 < clt 10656 ℕcn 11619 ℤ≥cuz 12225 ...cfz 12877 ..^cfzo 13018 RePartciccp 43658 |
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 2792 ax-sep 5184 ax-nul 5191 ax-pow 5247 ax-pr 5311 ax-un 7442 ax-cnex 10574 ax-resscn 10575 ax-1cn 10576 ax-icn 10577 ax-addcl 10578 ax-addrcl 10579 ax-mulcl 10580 ax-mulrcl 10581 ax-mulcom 10582 ax-addass 10583 ax-mulass 10584 ax-distr 10585 ax-i2m1 10586 ax-1ne0 10587 ax-1rid 10588 ax-rnegex 10589 ax-rrecex 10590 ax-cnre 10591 ax-pre-lttri 10592 ax-pre-lttrn 10593 ax-pre-ltadd 10594 ax-pre-mulgt0 10595 |
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 2653 df-clab 2799 df-cleq 2813 df-clel 2891 df-nfc 2959 df-ne 3012 df-nel 3119 df-ral 3138 df-rex 3139 df-reu 3140 df-rab 3142 df-v 3483 df-sbc 3759 df-csb 3867 df-dif 3922 df-un 3924 df-in 3926 df-ss 3935 df-pss 3937 df-nul 4275 df-if 4449 df-pw 4522 df-sn 4549 df-pr 4551 df-tp 4553 df-op 4555 df-uni 4820 df-iun 4902 df-br 5048 df-opab 5110 df-mpt 5128 df-tr 5154 df-id 5441 df-eprel 5446 df-po 5455 df-so 5456 df-fr 5495 df-we 5497 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-pred 6129 df-ord 6175 df-on 6176 df-lim 6177 df-suc 6178 df-iota 6295 df-fun 6338 df-fn 6339 df-f 6340 df-f1 6341 df-fo 6342 df-f1o 6343 df-fv 6344 df-riota 7095 df-ov 7140 df-oprab 7141 df-mpo 7142 df-om 7562 df-1st 7670 df-2nd 7671 df-wrecs 7928 df-recs 7989 df-rdg 8027 df-er 8270 df-map 8389 df-en 8491 df-dom 8492 df-sdom 8493 df-pnf 10658 df-mnf 10659 df-xr 10660 df-ltxr 10661 df-le 10662 df-sub 10853 df-neg 10854 df-nn 11620 df-2 11682 df-n0 11880 df-z 11964 df-uz 12226 df-fz 12878 df-fzo 13019 df-iccp 43659 |
This theorem is referenced by: iccpartgel 43674 |
Copyright terms: Public domain | W3C validator |