| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fsum0diaglem | Structured version Visualization version GIF version | ||
| Description: Lemma for fsum0diag 15855. (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 13575 | . . . . . . 7 ⊢ (𝑗 ∈ (0...𝑁) → 0 ≤ 𝑗) | |
| 2 | 1 | adantr 486 | . . . . . 6 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 0 ≤ 𝑗) |
| 3 | elfz3nn0 13670 | . . . . . . . . . 10 ⊢ (𝑗 ∈ (0...𝑁) → 𝑁 ∈ ℕ0) | |
| 4 | 3 | adantr 486 | . . . . . . . . 9 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑁 ∈ ℕ0) |
| 5 | 4 | nn0zd 12635 | . . . . . . . 8 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑁 ∈ ℤ) |
| 6 | 5 | zred 12720 | . . . . . . 7 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑁 ∈ ℝ) |
| 7 | elfzelz 13572 | . . . . . . . . 9 ⊢ (𝑗 ∈ (0...𝑁) → 𝑗 ∈ ℤ) | |
| 8 | 7 | adantr 486 | . . . . . . . 8 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ∈ ℤ) |
| 9 | 8 | zred 12720 | . . . . . . 7 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ∈ ℝ) |
| 10 | 6, 9 | subge02d 11825 | . . . . . 6 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (0 ≤ 𝑗 ↔ (𝑁 − 𝑗) ≤ 𝑁)) |
| 11 | 2, 10 | mpbid 235 | . . . . 5 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑁 − 𝑗) ≤ 𝑁) |
| 12 | 5, 8 | zsubcld 12725 | . . . . . 6 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑁 − 𝑗) ∈ ℤ) |
| 13 | eluz 12896 | . . . . . 6 ⊢ (((𝑁 − 𝑗) ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘(𝑁 − 𝑗)) ↔ (𝑁 − 𝑗) ≤ 𝑁)) | |
| 14 | 12, 5, 13 | syl2anc 596 | . . . . 5 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑁 ∈ (ℤ≥‘(𝑁 − 𝑗)) ↔ (𝑁 − 𝑗) ≤ 𝑁)) |
| 15 | 11, 14 | mpbird 260 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑁 ∈ (ℤ≥‘(𝑁 − 𝑗))) |
| 16 | fzss2 13613 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘(𝑁 − 𝑗)) → (0...(𝑁 − 𝑗)) ⊆ (0...𝑁)) | |
| 17 | 15, 16 | syl 18 | . . 3 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (0...(𝑁 − 𝑗)) ⊆ (0...𝑁)) |
| 18 | simpr 490 | . . 3 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ∈ (0...(𝑁 − 𝑗))) | |
| 19 | 17, 18 | sseldd 3939 | . 2 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ∈ (0...𝑁)) |
| 20 | elfzelz 13572 | . . . . . 6 ⊢ (𝑘 ∈ (0...(𝑁 − 𝑗)) → 𝑘 ∈ ℤ) | |
| 21 | 20 | adantl 487 | . . . . 5 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ∈ ℤ) |
| 22 | 21 | zred 12720 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ∈ ℝ) |
| 23 | elfzle2 13576 | . . . . 5 ⊢ (𝑘 ∈ (0...(𝑁 − 𝑗)) → 𝑘 ≤ (𝑁 − 𝑗)) | |
| 24 | 23 | adantl 487 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ≤ (𝑁 − 𝑗)) |
| 25 | 22, 6, 9, 24 | lesubd 11837 | . . 3 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ≤ (𝑁 − 𝑘)) |
| 26 | elfzuz 13568 | . . . . 5 ⊢ (𝑗 ∈ (0...𝑁) → 𝑗 ∈ (ℤ≥‘0)) | |
| 27 | 26 | adantr 486 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ∈ (ℤ≥‘0)) |
| 28 | 5, 21 | zsubcld 12725 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑁 − 𝑘) ∈ ℤ) |
| 29 | elfz5 13564 | . . . 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 2146 ⊆ wss 3906 class class class wbr 5111 ‘cfv 6540 (class class class)co 7419 0cc0 11119 ≤ cle 11263 − cmin 11460 ℕ0cn0 12523 ℤcz 12610 ℤ≥cuz 12882 ...cfz 13555 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11175 ax-resscn 11176 ax-1cn 11177 ax-icn 11178 ax-addcl 11179 ax-addrcl 11180 ax-mulcl 11181 ax-mulrcl 11182 ax-mulcom 11183 ax-addass 11184 ax-mulass 11185 ax-distr 11186 ax-i2m1 11187 ax-1ne0 11188 ax-1rid 11189 ax-rnegex 11190 ax-rrecex 11191 ax-cnre 11192 ax-pre-lttri 11193 ax-pre-lttrn 11194 ax-pre-ltadd 11195 ax-pre-mulgt0 11196 |
| 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 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-pnf 11264 df-mnf 11265 df-xr 11266 df-ltxr 11267 df-le 11268 df-sub 11462 df-neg 11463 df-nn 12253 df-n0 12524 df-z 12611 df-uz 12883 df-fz 13556 |
| This theorem is used by: fsum0diag 15855 fprod0diag 16067 |
| Copyright terms: Public domain | W3C validator |