| 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 34384: 𝑂 is the set of odd partitions of 𝑁. (Contributed by Thierry Arnoux, 10-Aug-2017.) |
| Ref | Expression |
|---|---|
| eulerpart.p | ⊢ 𝑃 = {𝑓 ∈ (ℕ0 ↑m ℕ) ∣ ((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁)} |
| eulerpart.o | ⊢ 𝑂 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ (◡𝑔 “ ℕ) ¬ 2 ∥ 𝑛} |
| eulerpart.d | ⊢ 𝐷 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ ℕ (𝑔‘𝑛) ≤ 1} |
| Ref | Expression |
|---|---|
| eulerpartlemo | ⊢ (𝐴 ∈ 𝑂 ↔ (𝐴 ∈ 𝑃 ∧ ∀𝑛 ∈ (◡𝐴 “ ℕ) ¬ 2 ∥ 𝑛)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnveq 5884 | . . . 4 ⊢ (𝑔 = 𝐴 → ◡𝑔 = ◡𝐴) | |
| 2 | 1 | imaeq1d 6077 | . . 3 ⊢ (𝑔 = 𝐴 → (◡𝑔 “ ℕ) = (◡𝐴 “ ℕ)) |
| 3 | 2 | raleqdv 3326 | . 2 ⊢ (𝑔 = 𝐴 → (∀𝑛 ∈ (◡𝑔 “ ℕ) ¬ 2 ∥ 𝑛 ↔ ∀𝑛 ∈ (◡𝐴 “ ℕ) ¬ 2 ∥ 𝑛)) |
| 4 | eulerpart.o | . 2 ⊢ 𝑂 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ (◡𝑔 “ ℕ) ¬ 2 ∥ 𝑛} | |
| 5 | 3, 4 | elrab2 3695 | 1 ⊢ (𝐴 ∈ 𝑂 ↔ (𝐴 ∈ 𝑃 ∧ ∀𝑛 ∈ (◡𝐴 “ ℕ) ¬ 2 ∥ 𝑛)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ∀wral 3061 {crab 3436 class class class wbr 5143 ◡ccnv 5684 “ cima 5688 ‘cfv 6561 (class class class)co 7431 ↑m cmap 8866 Fincfn 8985 1c1 11156 · cmul 11160 ≤ cle 11296 ℕcn 12266 2c2 12321 ℕ0cn0 12526 Σcsu 15722 ∥ cdvds 16290 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-ral 3062 df-rex 3071 df-rab 3437 df-v 3482 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-nul 4334 df-if 4526 df-sn 4627 df-pr 4629 df-op 4633 df-br 5144 df-opab 5206 df-cnv 5693 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 |
| This theorem is referenced by: eulerpartlemr 34376 |
| Copyright terms: Public domain | W3C validator |