Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > numclwwlkovf2exlem1 | Structured version Visualization version GIF version |
Description: Lemma 1 for numclwwlkovf2ex 27219: Transformation of a special half-open integer range into a union of a smaller half-open integer range and an unordered pair. (Contributed by AV, 22-Sep-2018.) (Revised by AV, 26-Jan-2022.) |
Ref | Expression |
---|---|
numclwwlkovf2exlem1 | ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → (0..^(((#‘𝑊) + 2) − 1)) = ((0..^((#‘𝑊) − 1)) ∪ {((#‘𝑊) − 1), (#‘𝑊)})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eluzelcn 11699 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ ℂ) | |
2 | 2cnd 11093 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘3) → 2 ∈ ℂ) | |
3 | 1, 2 | subcld 10392 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘3) → (𝑁 − 2) ∈ ℂ) |
4 | 3 | adantr 481 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → (𝑁 − 2) ∈ ℂ) |
5 | eleq1 2689 | . . . . . 6 ⊢ ((#‘𝑊) = (𝑁 − 2) → ((#‘𝑊) ∈ ℂ ↔ (𝑁 − 2) ∈ ℂ)) | |
6 | 5 | adantl 482 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → ((#‘𝑊) ∈ ℂ ↔ (𝑁 − 2) ∈ ℂ)) |
7 | 4, 6 | mpbird 247 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → (#‘𝑊) ∈ ℂ) |
8 | 2cnd 11093 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → 2 ∈ ℂ) | |
9 | 1cnd 10056 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → 1 ∈ ℂ) | |
10 | 7, 8, 9 | addsubd 10413 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → (((#‘𝑊) + 2) − 1) = (((#‘𝑊) − 1) + 2)) |
11 | 10 | oveq2d 6666 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → (0..^(((#‘𝑊) + 2) − 1)) = (0..^(((#‘𝑊) − 1) + 2))) |
12 | oveq1 6657 | . . . . 5 ⊢ ((#‘𝑊) = (𝑁 − 2) → ((#‘𝑊) − 1) = ((𝑁 − 2) − 1)) | |
13 | 12 | adantl 482 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → ((#‘𝑊) − 1) = ((𝑁 − 2) − 1)) |
14 | uznn0sub 11719 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘3) → (𝑁 − 3) ∈ ℕ0) | |
15 | 1cnd 10056 | . . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘3) → 1 ∈ ℂ) | |
16 | 1, 2, 15 | subsub4d 10423 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘3) → ((𝑁 − 2) − 1) = (𝑁 − (2 + 1))) |
17 | 2p1e3 11151 | . . . . . . . 8 ⊢ (2 + 1) = 3 | |
18 | 17 | oveq2i 6661 | . . . . . . 7 ⊢ (𝑁 − (2 + 1)) = (𝑁 − 3) |
19 | 16, 18 | syl6eq 2672 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘3) → ((𝑁 − 2) − 1) = (𝑁 − 3)) |
20 | nn0uz 11722 | . . . . . . . 8 ⊢ ℕ0 = (ℤ≥‘0) | |
21 | 20 | eqcomi 2631 | . . . . . . 7 ⊢ (ℤ≥‘0) = ℕ0 |
22 | 21 | a1i 11 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘3) → (ℤ≥‘0) = ℕ0) |
23 | 14, 19, 22 | 3eltr4d 2716 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘3) → ((𝑁 − 2) − 1) ∈ (ℤ≥‘0)) |
24 | 23 | adantr 481 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → ((𝑁 − 2) − 1) ∈ (ℤ≥‘0)) |
25 | 13, 24 | eqeltrd 2701 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → ((#‘𝑊) − 1) ∈ (ℤ≥‘0)) |
26 | fzosplitpr 12577 | . . 3 ⊢ (((#‘𝑊) − 1) ∈ (ℤ≥‘0) → (0..^(((#‘𝑊) − 1) + 2)) = ((0..^((#‘𝑊) − 1)) ∪ {((#‘𝑊) − 1), (((#‘𝑊) − 1) + 1)})) | |
27 | 25, 26 | syl 17 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → (0..^(((#‘𝑊) − 1) + 2)) = ((0..^((#‘𝑊) − 1)) ∪ {((#‘𝑊) − 1), (((#‘𝑊) − 1) + 1)})) |
28 | 7, 9 | npcand 10396 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → (((#‘𝑊) − 1) + 1) = (#‘𝑊)) |
29 | 28 | preq2d 4275 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → {((#‘𝑊) − 1), (((#‘𝑊) − 1) + 1)} = {((#‘𝑊) − 1), (#‘𝑊)}) |
30 | 29 | uneq2d 3767 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → ((0..^((#‘𝑊) − 1)) ∪ {((#‘𝑊) − 1), (((#‘𝑊) − 1) + 1)}) = ((0..^((#‘𝑊) − 1)) ∪ {((#‘𝑊) − 1), (#‘𝑊)})) |
31 | 11, 27, 30 | 3eqtrd 2660 | 1 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ (#‘𝑊) = (𝑁 − 2)) → (0..^(((#‘𝑊) + 2) − 1)) = ((0..^((#‘𝑊) − 1)) ∪ {((#‘𝑊) − 1), (#‘𝑊)})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∪ cun 3572 {cpr 4179 ‘cfv 5888 (class class class)co 6650 ℂcc 9934 0cc0 9936 1c1 9937 + caddc 9939 − cmin 10266 2c2 11070 3c3 11071 ℕ0cn0 11292 ℤ≥cuz 11687 ..^cfzo 12465 #chash 13117 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 |
This theorem is referenced by: numclwwlkovf2ex 27219 |
Copyright terms: Public domain | W3C validator |