![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > smuval | Structured version Visualization version GIF version |
Description: Define the addition of two bit sequences, using df-had 1596 and df-cad 1609 bit operations. (Contributed by Mario Carneiro, 9-Sep-2016.) |
Ref | Expression |
---|---|
smuval.a | ⊢ (𝜑 → 𝐴 ⊆ ℕ0) |
smuval.b | ⊢ (𝜑 → 𝐵 ⊆ ℕ0) |
smuval.p | ⊢ 𝑃 = seq0((𝑝 ∈ 𝒫 ℕ0, 𝑚 ∈ ℕ0 ↦ (𝑝 sadd {𝑛 ∈ ℕ0 ∣ (𝑚 ∈ 𝐴 ∧ (𝑛 − 𝑚) ∈ 𝐵)})), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))) |
smuval.n | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
Ref | Expression |
---|---|
smuval | ⊢ (𝜑 → (𝑁 ∈ (𝐴 smul 𝐵) ↔ 𝑁 ∈ (𝑃‘(𝑁 + 1)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | smuval.a | . . . 4 ⊢ (𝜑 → 𝐴 ⊆ ℕ0) | |
2 | smuval.b | . . . 4 ⊢ (𝜑 → 𝐵 ⊆ ℕ0) | |
3 | smuval.p | . . . 4 ⊢ 𝑃 = seq0((𝑝 ∈ 𝒫 ℕ0, 𝑚 ∈ ℕ0 ↦ (𝑝 sadd {𝑛 ∈ ℕ0 ∣ (𝑚 ∈ 𝐴 ∧ (𝑛 − 𝑚) ∈ 𝐵)})), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))) | |
4 | 1, 2, 3 | smufval 16418 | . . 3 ⊢ (𝜑 → (𝐴 smul 𝐵) = {𝑘 ∈ ℕ0 ∣ 𝑘 ∈ (𝑃‘(𝑘 + 1))}) |
5 | 4 | eleq2d 2820 | . 2 ⊢ (𝜑 → (𝑁 ∈ (𝐴 smul 𝐵) ↔ 𝑁 ∈ {𝑘 ∈ ℕ0 ∣ 𝑘 ∈ (𝑃‘(𝑘 + 1))})) |
6 | smuval.n | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
7 | id 22 | . . . . 5 ⊢ (𝑘 = 𝑁 → 𝑘 = 𝑁) | |
8 | fvoveq1 7432 | . . . . 5 ⊢ (𝑘 = 𝑁 → (𝑃‘(𝑘 + 1)) = (𝑃‘(𝑁 + 1))) | |
9 | 7, 8 | eleq12d 2828 | . . . 4 ⊢ (𝑘 = 𝑁 → (𝑘 ∈ (𝑃‘(𝑘 + 1)) ↔ 𝑁 ∈ (𝑃‘(𝑁 + 1)))) |
10 | 9 | elrab3 3685 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ∈ {𝑘 ∈ ℕ0 ∣ 𝑘 ∈ (𝑃‘(𝑘 + 1))} ↔ 𝑁 ∈ (𝑃‘(𝑁 + 1)))) |
11 | 6, 10 | syl 17 | . 2 ⊢ (𝜑 → (𝑁 ∈ {𝑘 ∈ ℕ0 ∣ 𝑘 ∈ (𝑃‘(𝑘 + 1))} ↔ 𝑁 ∈ (𝑃‘(𝑁 + 1)))) |
12 | 5, 11 | bitrd 279 | 1 ⊢ (𝜑 → (𝑁 ∈ (𝐴 smul 𝐵) ↔ 𝑁 ∈ (𝑃‘(𝑁 + 1)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 {crab 3433 ⊆ wss 3949 ∅c0 4323 ifcif 4529 𝒫 cpw 4603 ↦ cmpt 5232 ‘cfv 6544 (class class class)co 7409 ∈ cmpo 7411 0cc0 11110 1c1 11111 + caddc 11113 − cmin 11444 ℕ0cn0 12472 seqcseq 13966 sadd csad 16361 smul csmu 16362 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-1cn 11168 ax-addcl 11170 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-nn 12213 df-n0 12473 df-seq 13967 df-smu 16417 |
This theorem is referenced by: smuval2 16423 smupvallem 16424 smu01lem 16426 |
Copyright terms: Public domain | W3C validator |