Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fsum0diaglem | Structured version Visualization version GIF version |
Description: Lemma for fsum0diag 15117. (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 12900 | . . . . . . 7 ⊢ (𝑗 ∈ (0...𝑁) → 0 ≤ 𝑗) | |
2 | 1 | adantr 483 | . . . . . 6 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 0 ≤ 𝑗) |
3 | elfz3nn0 12991 | . . . . . . . . . 10 ⊢ (𝑗 ∈ (0...𝑁) → 𝑁 ∈ ℕ0) | |
4 | 3 | adantr 483 | . . . . . . . . 9 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑁 ∈ ℕ0) |
5 | 4 | nn0zd 12072 | . . . . . . . 8 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑁 ∈ ℤ) |
6 | 5 | zred 12074 | . . . . . . 7 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑁 ∈ ℝ) |
7 | elfzelz 12898 | . . . . . . . . 9 ⊢ (𝑗 ∈ (0...𝑁) → 𝑗 ∈ ℤ) | |
8 | 7 | adantr 483 | . . . . . . . 8 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ∈ ℤ) |
9 | 8 | zred 12074 | . . . . . . 7 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ∈ ℝ) |
10 | 6, 9 | subge02d 11218 | . . . . . 6 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (0 ≤ 𝑗 ↔ (𝑁 − 𝑗) ≤ 𝑁)) |
11 | 2, 10 | mpbid 234 | . . . . 5 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑁 − 𝑗) ≤ 𝑁) |
12 | 5, 8 | zsubcld 12079 | . . . . . 6 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑁 − 𝑗) ∈ ℤ) |
13 | eluz 12244 | . . . . . 6 ⊢ (((𝑁 − 𝑗) ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘(𝑁 − 𝑗)) ↔ (𝑁 − 𝑗) ≤ 𝑁)) | |
14 | 12, 5, 13 | syl2anc 586 | . . . . 5 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑁 ∈ (ℤ≥‘(𝑁 − 𝑗)) ↔ (𝑁 − 𝑗) ≤ 𝑁)) |
15 | 11, 14 | mpbird 259 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑁 ∈ (ℤ≥‘(𝑁 − 𝑗))) |
16 | fzss2 12937 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘(𝑁 − 𝑗)) → (0...(𝑁 − 𝑗)) ⊆ (0...𝑁)) | |
17 | 15, 16 | syl 17 | . . 3 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (0...(𝑁 − 𝑗)) ⊆ (0...𝑁)) |
18 | simpr 487 | . . 3 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ∈ (0...(𝑁 − 𝑗))) | |
19 | 17, 18 | sseldd 3956 | . 2 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ∈ (0...𝑁)) |
20 | elfzelz 12898 | . . . . . 6 ⊢ (𝑘 ∈ (0...(𝑁 − 𝑗)) → 𝑘 ∈ ℤ) | |
21 | 20 | adantl 484 | . . . . 5 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ∈ ℤ) |
22 | 21 | zred 12074 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ∈ ℝ) |
23 | elfzle2 12901 | . . . . 5 ⊢ (𝑘 ∈ (0...(𝑁 − 𝑗)) → 𝑘 ≤ (𝑁 − 𝑗)) | |
24 | 23 | adantl 484 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑘 ≤ (𝑁 − 𝑗)) |
25 | 22, 6, 9, 24 | lesubd 11230 | . . 3 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ≤ (𝑁 − 𝑘)) |
26 | elfzuz 12894 | . . . . 5 ⊢ (𝑗 ∈ (0...𝑁) → 𝑗 ∈ (ℤ≥‘0)) | |
27 | 26 | adantr 483 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ∈ (ℤ≥‘0)) |
28 | 5, 21 | zsubcld 12079 | . . . 4 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑁 − 𝑘) ∈ ℤ) |
29 | elfz5 12890 | . . . 4 ⊢ ((𝑗 ∈ (ℤ≥‘0) ∧ (𝑁 − 𝑘) ∈ ℤ) → (𝑗 ∈ (0...(𝑁 − 𝑘)) ↔ 𝑗 ≤ (𝑁 − 𝑘))) | |
30 | 27, 28, 29 | syl2anc 586 | . . 3 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑗 ∈ (0...(𝑁 − 𝑘)) ↔ 𝑗 ≤ (𝑁 − 𝑘))) |
31 | 25, 30 | mpbird 259 | . 2 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → 𝑗 ∈ (0...(𝑁 − 𝑘))) |
32 | 19, 31 | jca 514 | 1 ⊢ ((𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗))) → (𝑘 ∈ (0...𝑁) ∧ 𝑗 ∈ (0...(𝑁 − 𝑘)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∈ wcel 2114 ⊆ wss 3924 class class class wbr 5052 ‘cfv 6341 (class class class)co 7142 0cc0 10523 ≤ cle 10662 − cmin 10856 ℕ0cn0 11884 ℤcz 11968 ℤ≥cuz 12230 ...cfz 12882 |
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 5189 ax-nul 5196 ax-pow 5252 ax-pr 5316 ax-un 7447 ax-cnex 10579 ax-resscn 10580 ax-1cn 10581 ax-icn 10582 ax-addcl 10583 ax-addrcl 10584 ax-mulcl 10585 ax-mulrcl 10586 ax-mulcom 10587 ax-addass 10588 ax-mulass 10589 ax-distr 10590 ax-i2m1 10591 ax-1ne0 10592 ax-1rid 10593 ax-rnegex 10594 ax-rrecex 10595 ax-cnre 10596 ax-pre-lttri 10597 ax-pre-lttrn 10598 ax-pre-ltadd 10599 ax-pre-mulgt0 10600 |
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 3488 df-sbc 3764 df-csb 3872 df-dif 3927 df-un 3929 df-in 3931 df-ss 3940 df-pss 3942 df-nul 4280 df-if 4454 df-pw 4527 df-sn 4554 df-pr 4556 df-tp 4558 df-op 4560 df-uni 4825 df-iun 4907 df-br 5053 df-opab 5115 df-mpt 5133 df-tr 5159 df-id 5446 df-eprel 5451 df-po 5460 df-so 5461 df-fr 5500 df-we 5502 df-xp 5547 df-rel 5548 df-cnv 5549 df-co 5550 df-dm 5551 df-rn 5552 df-res 5553 df-ima 5554 df-pred 6134 df-ord 6180 df-on 6181 df-lim 6182 df-suc 6183 df-iota 6300 df-fun 6343 df-fn 6344 df-f 6345 df-f1 6346 df-fo 6347 df-f1o 6348 df-fv 6349 df-riota 7100 df-ov 7145 df-oprab 7146 df-mpo 7147 df-om 7567 df-1st 7675 df-2nd 7676 df-wrecs 7933 df-recs 7994 df-rdg 8032 df-er 8275 df-en 8496 df-dom 8497 df-sdom 8498 df-pnf 10663 df-mnf 10664 df-xr 10665 df-ltxr 10666 df-le 10667 df-sub 10858 df-neg 10859 df-nn 11625 df-n0 11885 df-z 11969 df-uz 12231 df-fz 12883 |
This theorem is referenced by: fsum0diag 15117 fprod0diag 15325 |
Copyright terms: Public domain | W3C validator |