| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > eulerpartleme | Structured version Visualization version GIF version | ||
| Description: Lemma for eulerpart 34901. (Contributed by Mario Carneiro, 26-Jan-2015.) |
| Ref | Expression |
|---|---|
| eulerpart.p | ⊢ 𝑃 = {𝑓 ∈ (ℕ0 ↑m ℕ) ∣ ((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁)} |
| Ref | Expression |
|---|---|
| eulerpartleme | ⊢ (𝐴 ∈ 𝑃 ↔ (𝐴:ℕ⟶ℕ0 ∧ (◡𝐴 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nn0ex 12538 | . . . 4 ⊢ ℕ0 ∈ V | |
| 2 | nnex 12267 | . . . 4 ⊢ ℕ ∈ V | |
| 3 | 1, 2 | elmap 8882 | . . 3 ⊢ (𝐴 ∈ (ℕ0 ↑m ℕ) ↔ 𝐴:ℕ⟶ℕ0) |
| 4 | 3 | anbi1i 636 | . 2 ⊢ ((𝐴 ∈ (ℕ0 ↑m ℕ) ∧ ((◡𝐴 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁)) ↔ (𝐴:ℕ⟶ℕ0 ∧ ((◡𝐴 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁))) |
| 5 | cnveq 5857 | . . . . . 6 ⊢ (𝑓 = 𝐴 → ◡𝑓 = ◡𝐴) | |
| 6 | 5 | imaeq1d 6059 | . . . . 5 ⊢ (𝑓 = 𝐴 → (◡𝑓 “ ℕ) = (◡𝐴 “ ℕ)) |
| 7 | 6 | eleq1d 2847 | . . . 4 ⊢ (𝑓 = 𝐴 → ((◡𝑓 “ ℕ) ∈ Fin ↔ (◡𝐴 “ ℕ) ∈ Fin)) |
| 8 | fveq1 6881 | . . . . . . 7 ⊢ (𝑓 = 𝐴 → (𝑓‘𝑘) = (𝐴‘𝑘)) | |
| 9 | 8 | oveq1d 7432 | . . . . . 6 ⊢ (𝑓 = 𝐴 → ((𝑓‘𝑘) · 𝑘) = ((𝐴‘𝑘) · 𝑘)) |
| 10 | 9 | sumeq2sdv 15794 | . . . . 5 ⊢ (𝑓 = 𝐴 → Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘)) |
| 11 | 10 | eqeq1d 2764 | . . . 4 ⊢ (𝑓 = 𝐴 → (Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁 ↔ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁)) |
| 12 | 7, 11 | anbi12d 644 | . . 3 ⊢ (𝑓 = 𝐴 → (((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁) ↔ ((◡𝐴 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁))) |
| 13 | eulerpart.p | . . 3 ⊢ 𝑃 = {𝑓 ∈ (ℕ0 ↑m ℕ) ∣ ((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁)} | |
| 14 | 12, 13 | elrab2 3652 | . 2 ⊢ (𝐴 ∈ 𝑃 ↔ (𝐴 ∈ (ℕ0 ↑m ℕ) ∧ ((◡𝐴 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁))) |
| 15 | 3anass 1111 | . 2 ⊢ ((𝐴:ℕ⟶ℕ0 ∧ (◡𝐴 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁) ↔ (𝐴:ℕ⟶ℕ0 ∧ ((◡𝐴 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁))) | |
| 16 | 4, 14, 15 | 3bitr4i 306 | 1 ⊢ (𝐴 ∈ 𝑃 ↔ (𝐴:ℕ⟶ℕ0 ∧ (◡𝐴 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 {crab 3414 ◡ccnv 5658 “ cima 5662 ⟶wf 6533 ‘cfv 6537 (class class class)co 7417 ↑m cmap 8830 Fincfn 8956 · cmul 11133 ℕcn 12261 ℕ0cn0 12532 Σcsu 15777 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-1cn 11186 ax-addcl 11188 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-map 8832 df-nn 12262 df-n0 12533 df-seq 14070 df-sum 15778 |
| This theorem is used by: eulerpartlemv 34883 eulerpartlemd 34885 eulerpartlemb 34887 eulerpartlemn 34900 |
| Copyright terms: Public domain | W3C validator |