![]() |
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 31750: 𝑂 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 5708 | . . . 4 ⊢ (𝑔 = 𝐴 → ◡𝑔 = ◡𝐴) | |
2 | 1 | imaeq1d 5895 | . . 3 ⊢ (𝑔 = 𝐴 → (◡𝑔 “ ℕ) = (◡𝐴 “ ℕ)) |
3 | 2 | raleqdv 3364 | . 2 ⊢ (𝑔 = 𝐴 → (∀𝑛 ∈ (◡𝑔 “ ℕ) ¬ 2 ∥ 𝑛 ↔ ∀𝑛 ∈ (◡𝐴 “ ℕ) ¬ 2 ∥ 𝑛)) |
4 | eulerpart.o | . 2 ⊢ 𝑂 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ (◡𝑔 “ ℕ) ¬ 2 ∥ 𝑛} | |
5 | 3, 4 | elrab2 3631 | 1 ⊢ (𝐴 ∈ 𝑂 ↔ (𝐴 ∈ 𝑃 ∧ ∀𝑛 ∈ (◡𝐴 “ ℕ) ¬ 2 ∥ 𝑛)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∀wral 3106 {crab 3110 class class class wbr 5030 ◡ccnv 5518 “ cima 5522 ‘cfv 6324 (class class class)co 7135 ↑m cmap 8389 Fincfn 8492 1c1 10527 · cmul 10531 ≤ cle 10665 ℕcn 11625 2c2 11680 ℕ0cn0 11885 Σcsu 15034 ∥ cdvds 15599 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rab 3115 df-v 3443 df-un 3886 df-in 3888 df-ss 3898 df-sn 4526 df-pr 4528 df-op 4532 df-br 5031 df-opab 5093 df-cnv 5527 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 |
This theorem is referenced by: eulerpartlemr 31742 |
Copyright terms: Public domain | W3C validator |