![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > crctcshwlkn0lem2 | Structured version Visualization version GIF version |
Description: Lemma for crctcshwlkn0 27607. (Contributed by AV, 12-Mar-2021.) |
Ref | Expression |
---|---|
crctcshwlkn0lem.s | ⊢ (𝜑 → 𝑆 ∈ (1..^𝑁)) |
crctcshwlkn0lem.q | ⊢ 𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁 − 𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁)))) |
Ref | Expression |
---|---|
crctcshwlkn0lem2 | ⊢ ((𝜑 ∧ 𝐽 ∈ (0...(𝑁 − 𝑆))) → (𝑄‘𝐽) = (𝑃‘(𝐽 + 𝑆))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | crctcshwlkn0lem.q | . . 3 ⊢ 𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁 − 𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁)))) | |
2 | breq1 5033 | . . . 4 ⊢ (𝑥 = 𝐽 → (𝑥 ≤ (𝑁 − 𝑆) ↔ 𝐽 ≤ (𝑁 − 𝑆))) | |
3 | fvoveq1 7158 | . . . 4 ⊢ (𝑥 = 𝐽 → (𝑃‘(𝑥 + 𝑆)) = (𝑃‘(𝐽 + 𝑆))) | |
4 | oveq1 7142 | . . . . 5 ⊢ (𝑥 = 𝐽 → (𝑥 + 𝑆) = (𝐽 + 𝑆)) | |
5 | 4 | fvoveq1d 7157 | . . . 4 ⊢ (𝑥 = 𝐽 → (𝑃‘((𝑥 + 𝑆) − 𝑁)) = (𝑃‘((𝐽 + 𝑆) − 𝑁))) |
6 | 2, 3, 5 | ifbieq12d 4452 | . . 3 ⊢ (𝑥 = 𝐽 → if(𝑥 ≤ (𝑁 − 𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))) = if(𝐽 ≤ (𝑁 − 𝑆), (𝑃‘(𝐽 + 𝑆)), (𝑃‘((𝐽 + 𝑆) − 𝑁)))) |
7 | crctcshwlkn0lem.s | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ (1..^𝑁)) | |
8 | fzo0ss1 13062 | . . . . . 6 ⊢ (1..^𝑁) ⊆ (0..^𝑁) | |
9 | 8 | sseli 3911 | . . . . 5 ⊢ (𝑆 ∈ (1..^𝑁) → 𝑆 ∈ (0..^𝑁)) |
10 | elfzoel2 13032 | . . . . . . . 8 ⊢ (𝑆 ∈ (0..^𝑁) → 𝑁 ∈ ℤ) | |
11 | elfzonn0 13077 | . . . . . . . 8 ⊢ (𝑆 ∈ (0..^𝑁) → 𝑆 ∈ ℕ0) | |
12 | eluzmn 12238 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 𝑆 ∈ ℕ0) → 𝑁 ∈ (ℤ≥‘(𝑁 − 𝑆))) | |
13 | 10, 11, 12 | syl2anc 587 | . . . . . . 7 ⊢ (𝑆 ∈ (0..^𝑁) → 𝑁 ∈ (ℤ≥‘(𝑁 − 𝑆))) |
14 | fzss2 12942 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘(𝑁 − 𝑆)) → (0...(𝑁 − 𝑆)) ⊆ (0...𝑁)) | |
15 | 13, 14 | syl 17 | . . . . . 6 ⊢ (𝑆 ∈ (0..^𝑁) → (0...(𝑁 − 𝑆)) ⊆ (0...𝑁)) |
16 | 15 | sseld 3914 | . . . . 5 ⊢ (𝑆 ∈ (0..^𝑁) → (𝐽 ∈ (0...(𝑁 − 𝑆)) → 𝐽 ∈ (0...𝑁))) |
17 | 7, 9, 16 | 3syl 18 | . . . 4 ⊢ (𝜑 → (𝐽 ∈ (0...(𝑁 − 𝑆)) → 𝐽 ∈ (0...𝑁))) |
18 | 17 | imp 410 | . . 3 ⊢ ((𝜑 ∧ 𝐽 ∈ (0...(𝑁 − 𝑆))) → 𝐽 ∈ (0...𝑁)) |
19 | fvex 6658 | . . . . 5 ⊢ (𝑃‘(𝐽 + 𝑆)) ∈ V | |
20 | fvex 6658 | . . . . 5 ⊢ (𝑃‘((𝐽 + 𝑆) − 𝑁)) ∈ V | |
21 | 19, 20 | ifex 4473 | . . . 4 ⊢ if(𝐽 ≤ (𝑁 − 𝑆), (𝑃‘(𝐽 + 𝑆)), (𝑃‘((𝐽 + 𝑆) − 𝑁))) ∈ V |
22 | 21 | a1i 11 | . . 3 ⊢ ((𝜑 ∧ 𝐽 ∈ (0...(𝑁 − 𝑆))) → if(𝐽 ≤ (𝑁 − 𝑆), (𝑃‘(𝐽 + 𝑆)), (𝑃‘((𝐽 + 𝑆) − 𝑁))) ∈ V) |
23 | 1, 6, 18, 22 | fvmptd3 6768 | . 2 ⊢ ((𝜑 ∧ 𝐽 ∈ (0...(𝑁 − 𝑆))) → (𝑄‘𝐽) = if(𝐽 ≤ (𝑁 − 𝑆), (𝑃‘(𝐽 + 𝑆)), (𝑃‘((𝐽 + 𝑆) − 𝑁)))) |
24 | elfzle2 12906 | . . . 4 ⊢ (𝐽 ∈ (0...(𝑁 − 𝑆)) → 𝐽 ≤ (𝑁 − 𝑆)) | |
25 | 24 | adantl 485 | . . 3 ⊢ ((𝜑 ∧ 𝐽 ∈ (0...(𝑁 − 𝑆))) → 𝐽 ≤ (𝑁 − 𝑆)) |
26 | 25 | iftrued 4433 | . 2 ⊢ ((𝜑 ∧ 𝐽 ∈ (0...(𝑁 − 𝑆))) → if(𝐽 ≤ (𝑁 − 𝑆), (𝑃‘(𝐽 + 𝑆)), (𝑃‘((𝐽 + 𝑆) − 𝑁))) = (𝑃‘(𝐽 + 𝑆))) |
27 | 23, 26 | eqtrd 2833 | 1 ⊢ ((𝜑 ∧ 𝐽 ∈ (0...(𝑁 − 𝑆))) → (𝑄‘𝐽) = (𝑃‘(𝐽 + 𝑆))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 Vcvv 3441 ⊆ wss 3881 ifcif 4425 class class class wbr 5030 ↦ cmpt 5110 ‘cfv 6324 (class class class)co 7135 0cc0 10526 1c1 10527 + caddc 10529 ≤ cle 10665 − cmin 10859 ℕ0cn0 11885 ℤcz 11969 ℤ≥cuz 12231 ...cfz 12885 ..^cfzo 13028 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-fzo 13029 |
This theorem is referenced by: crctcshwlkn0lem4 27599 crctcshwlkn0lem6 27601 |
Copyright terms: Public domain | W3C validator |