| 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 35084. (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 12639 | . . . 4 ⊢ ℕ0 ∈ V | |
| 2 | nnex 12368 | . . . 4 ⊢ ℕ ∈ V | |
| 3 | 1, 2 | elmap 8927 | . . 3 ⊢ (𝐴 ∈ (ℕ0 ↑m ℕ) ↔ 𝐴:ℕ⟶ℕ0) |
| 4 | 3 | anbi1i 636 | . 2 ⊢ ((𝐴 ∈ (ℕ0 ↑m ℕ) ∧ ((◡𝐴 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁)) ↔ (𝐴:ℕ⟶ℕ0 ∧ ((◡𝐴 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁))) |
| 5 | cnveq 5858 | . . . . . 6 ⊢ (𝑓 = 𝐴 → ◡𝑓 = ◡𝐴) | |
| 6 | 5 | imaeq1d 6063 | . . . . 5 ⊢ (𝑓 = 𝐴 → (◡𝑓 “ ℕ) = (◡𝐴 “ ℕ)) |
| 7 | 6 | eleq1d 2849 | . . . 4 ⊢ (𝑓 = 𝐴 → ((◡𝑓 “ ℕ) ∈ Fin ↔ (◡𝐴 “ ℕ) ∈ Fin)) |
| 8 | fveq1 6907 | . . . . . . 7 ⊢ (𝑓 = 𝐴 → (𝑓‘𝑘) = (𝐴‘𝑘)) | |
| 9 | 8 | oveq1d 7458 | . . . . . 6 ⊢ (𝑓 = 𝐴 → ((𝑓‘𝑘) · 𝑘) = ((𝐴‘𝑘) · 𝑘)) |
| 10 | 9 | sumeq2sdv 15899 | . . . . 5 ⊢ (𝑓 = 𝐴 → Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘)) |
| 11 | 10 | eqeq1d 2765 | . . . 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 2147 {crab 3416 ◡ccnv 5654 “ cima 5658 ⟶wf 6554 ‘cfv 6558 (class class class)co 7443 ↑m cmap 8875 Fincfn 9001 · cmul 11232 ℕcn 12362 ℕ0cn0 12633 Σcsu 15882 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-1cn 11285 ax-addcl 11287 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-map 8877 df-nn 12363 df-n0 12634 df-seq 14172 df-sum 15883 |
| This theorem is used by: eulerpartlemv 35066 eulerpartlemd 35068 eulerpartlemb 35070 eulerpartlemn 35083 |
| Copyright terms: Public domain | W3C validator |