Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > eulerpartlemo | Structured version Visualization version GIF version |
Description: Lemma for eulerpart 29771: 𝑂 is the set of odd partitions of 𝑁. (Contributed by Thierry Arnoux, 10-Aug-2017.) |
Ref | Expression |
---|---|
eulerpart.p | ⊢ 𝑃 = {𝑓 ∈ (ℕ0 ↑𝑚 ℕ) ∣ ((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁)} |
eulerpart.o | ⊢ 𝑂 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ (◡𝑔 “ ℕ) ¬ 2 ∥ 𝑛} |
eulerpart.d | ⊢ 𝐷 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ ℕ (𝑔‘𝑛) ≤ 1} |
Ref | Expression |
---|---|
eulerpartlemo | ⊢ (𝐴 ∈ 𝑂 ↔ (𝐴 ∈ 𝑃 ∧ ∀𝑛 ∈ (◡𝐴 “ ℕ) ¬ 2 ∥ 𝑛)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnveq 5218 | . . . 4 ⊢ (𝑔 = 𝐴 → ◡𝑔 = ◡𝐴) | |
2 | 1 | imaeq1d 5384 | . . 3 ⊢ (𝑔 = 𝐴 → (◡𝑔 “ ℕ) = (◡𝐴 “ ℕ)) |
3 | 2 | raleqdv 3121 | . 2 ⊢ (𝑔 = 𝐴 → (∀𝑛 ∈ (◡𝑔 “ ℕ) ¬ 2 ∥ 𝑛 ↔ ∀𝑛 ∈ (◡𝐴 “ ℕ) ¬ 2 ∥ 𝑛)) |
4 | eulerpart.o | . 2 ⊢ 𝑂 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ (◡𝑔 “ ℕ) ¬ 2 ∥ 𝑛} | |
5 | 3, 4 | elrab2 3333 | 1 ⊢ (𝐴 ∈ 𝑂 ↔ (𝐴 ∈ 𝑃 ∧ ∀𝑛 ∈ (◡𝐴 “ ℕ) ¬ 2 ∥ 𝑛)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∀wral 2896 {crab 2900 class class class wbr 4583 ◡ccnv 5037 “ cima 5041 ‘cfv 5804 (class class class)co 6549 ↑𝑚 cmap 7744 Fincfn 7841 1c1 9816 · cmul 9820 ≤ cle 9954 ℕcn 10897 2c2 10947 ℕ0cn0 11169 Σcsu 14264 ∥ cdvds 14821 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-br 4584 df-opab 4644 df-cnv 5046 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 |
This theorem is referenced by: eulerpartlemr 29763 |
Copyright terms: Public domain | W3C validator |