| 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 34997. (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 12593 | . . . 4 ⊢ ℕ0 ∈ V | |
| 2 | nnex 12322 | . . . 4 ⊢ ℕ ∈ V | |
| 3 | 1, 2 | elmap 8883 | . . 3 ⊢ (𝐴 ∈ (ℕ0 ↑m ℕ) ↔ 𝐴:ℕ⟶ℕ0) |
| 4 | 3 | anbi1i 636 | . 2 ⊢ ((𝐴 ∈ (ℕ0 ↑m ℕ) ∧ ((◡𝐴 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁)) ↔ (𝐴:ℕ⟶ℕ0 ∧ ((◡𝐴 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁))) |
| 5 | cnveq 5851 | . . . . . 6 ⊢ (𝑓 = 𝐴 → ◡𝑓 = ◡𝐴) | |
| 6 | 5 | imaeq1d 6053 | . . . . 5 ⊢ (𝑓 = 𝐴 → (◡𝑓 “ ℕ) = (◡𝐴 “ ℕ)) |
| 7 | 6 | eleq1d 2846 | . . . 4 ⊢ (𝑓 = 𝐴 → ((◡𝑓 “ ℕ) ∈ Fin ↔ (◡𝐴 “ ℕ) ∈ Fin)) |
| 8 | fveq1 6876 | . . . . . . 7 ⊢ (𝑓 = 𝐴 → (𝑓‘𝑘) = (𝐴‘𝑘)) | |
| 9 | 8 | oveq1d 7427 | . . . . . 6 ⊢ (𝑓 = 𝐴 → ((𝑓‘𝑘) · 𝑘) = ((𝐴‘𝑘) · 𝑘)) |
| 10 | 9 | sumeq2sdv 15850 | . . . . 5 ⊢ (𝑓 = 𝐴 → Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘)) |
| 11 | 10 | eqeq1d 2763 | . . . 4 ⊢ (𝑓 = 𝐴 → (Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁 ↔ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁)) |
| 12 | 7, 11 | anbi12d 644 | . . 3 ⊢ (𝑓 = 𝐴 → (((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁) ↔ ((◡𝐴 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝐴‘𝑘) · 𝑘) = 𝑁))) |
| 13 | eulerpart.p | . . 3 ⊢ 𝑃 = {𝑓 ∈ (ℕ0 ↑m ℕ) ∣ ((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁)} | |
| 14 | 12, 13 | elrab2 3649 | . 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 3413 ◡ccnv 5650 “ cima 5654 ⟶wf 6527 ‘cfv 6531 (class class class)co 7412 ↑m cmap 8831 Fincfn 8957 · cmul 11186 ℕcn 12316 ℕ0cn0 12587 Σcsu 15833 |
| 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 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-1cn 11239 ax-addcl 11241 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-map 8833 df-nn 12317 df-n0 12588 df-seq 14125 df-sum 15834 |
| This theorem is used by: eulerpartlemv 34979 eulerpartlemd 34981 eulerpartlemb 34983 eulerpartlemn 34996 |
| Copyright terms: Public domain | W3C validator |