| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fsum0diaglem | Structured version Visualization version GIF version | ||
| Description: Lemma for fsum0diag 15987. (Contributed by Mario Carneiro, 28-Apr-2014.) (Revised by Mario Carneiro, 8-Apr-2016.) |
| Ref | Expression |
|---|---|
| fsum0diaglem | ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑘 ∈ (0...𝑁) ∧ 𝑗 ∈ (0...(𝑁 − 𝑘)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfzle1 13700 | . . . . . . 7 ⊢ (𝑗 ∈ (0...𝑁) → 0 ≤ 𝑗) | |
| 2 | 1 | adantr 486 | . . . . . 6 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 0 ≤ 𝑗) |
| 3 | elfz3nn0 13795 | . . . . . . . . . 10 ⊢ (𝑗 ∈ (0...𝑁) → 𝑁 ∈ ℕ0) | |
| 4 | 3 | adantr 486 | . . . . . . . . 9 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑁 ∈ ℕ0) |
| 5 | 4 | nn0zd 12758 | . . . . . . . 8 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑁 ∈ ℤ) |
| 6 | 5 | zred 12843 | . . . . . . 7 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑁 ∈ ℝ) |
| 7 | elfzelz 13696 | . . . . . . . . 9 ⊢ (𝑗 ∈ (0...𝑁) → 𝑗 ∈ ℤ) | |
| 8 | 7 | adantr 486 | . . . . . . . 8 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ∈ ℤ) |
| 9 | 8 | zred 12843 | . . . . . . 7 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ∈ ℝ) |
| 10 | 6, 9 | subge02d 11948 | . . . . . 6 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (0 ≤ 𝑗 ↔ (𝑁 − 𝑗) ≤ 𝑁)) |
| 11 | 2, 10 | mpbid 235 | . . . . 5 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑁 − 𝑗) ≤ 𝑁) |
| 12 | 5, 8 | zsubcld 12848 | . . . . . 6 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑁 − 𝑗) ∈ ℤ) |
| 13 | eluz 13019 | . . . . . 6 ⊢ (((𝑁 − 𝑗) ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘(𝑁 − 𝑗)) ↔ (𝑁 − 𝑗) ≤ 𝑁)) | |
| 14 | 12, 5, 13 | syl2anc 596 | . . . . 5 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑁 ∈ (ℤ≥‘(𝑁 − 𝑗)) ↔ (𝑁 − 𝑗) ≤ 𝑁)) |
| 15 | 11, 14 | mpbird 260 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑁 ∈ (ℤ≥‘(𝑁 − 𝑗))) |
| 16 | fzss2 13738 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘(𝑁 − 𝑗)) → (0...(𝑁 − 𝑗)) ⊆ (0...𝑁)) | |
| 17 | 15, 16 | syl 18 | . . 3 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (0...(𝑁 − 𝑗)) ⊆ (0...𝑁)) |
| 18 | simpr 490 | . . 3 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ∈ (0...(𝑁 − 𝑗))) | |
| 19 | 17, 18 | sseldd 3914 | . 2 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ∈ (0...𝑁)) |
| 20 | elfzelz 13696 | . . . . . 6 ⊢ (𝑘 ∈ (0...(𝑁 − 𝑗)) → 𝑘 ∈ ℤ) | |
| 21 | 20 | adantl 487 | . . . . 5 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ∈ ℤ) |
| 22 | 21 | zred 12843 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ∈ ℝ) |
| 23 | elfzle2 13701 | . . . . 5 ⊢ (𝑘 ∈ (0...(𝑁 − 𝑗)) → 𝑘 ≤ (𝑁 − 𝑗)) | |
| 24 | 23 | adantl 487 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ≤ (𝑁 − 𝑗)) |
| 25 | 22, 6, 9, 24 | lesubd 11960 | . . 3 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ≤ (𝑁 − 𝑘)) |
| 26 | elfzuz 13692 | . . . . 5 ⊢ (𝑗 ∈ (0...𝑁) → 𝑗 ∈ (ℤ≥‘0)) | |
| 27 | 26 | adantr 486 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ∈ (ℤ≥‘0)) |
| 28 | 5, 21 | zsubcld 12848 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑁 − 𝑘) ∈ ℤ) |
| 29 | elfz5 13688 | . . . 4 ⊢ ((𝑗 ∈ (ℤ≥‘0) ∧ (𝑁 − 𝑘) ∈ ℤ) → (𝑗 ∈ (0...(𝑁 − 𝑘)) ↔ 𝑗 ≤ (𝑁 − 𝑘))) | |
| 30 | 27, 28, 29 | syl2anc 596 | . . 3 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑗 ∈ (0...(𝑁 − 𝑘)) ↔ 𝑗 ≤ (𝑁 − 𝑘))) |
| 31 | 25, 30 | mpbird 260 | . 2 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ∈ (0...(𝑁 − 𝑘))) |
| 32 | 19, 31 | jca 521 | 1 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑘 ∈ (0...𝑁) ∧ 𝑗 ∈ (0...(𝑁 − 𝑘)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2147 ⊆ wss 3900 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 0cc0 11239 ≤ cle 11383 − cmin 11580 ℕ0cn0 12646 ℤcz 12733 ℤ≥cuz 13005 ...cfz 13679 |
| 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 |
| This theorem is used by: fsum0diag 15987 fprod0diag 16197 |
| Copyright terms: Public domain | W3C validator |