| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hashbcval | Structured version Visualization version GIF version | ||
| Description: Value of the "binomial set", the set of all 𝑁-element subsets of 𝐴. (Contributed by Mario Carneiro, 20-Apr-2015.) |
| Ref | Expression |
|---|---|
| ramval.c | ⊢ 𝐶 = (𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖}) |
| Ref | Expression |
|---|---|
| hashbcval | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝐴𝐶𝑁) = {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 3480 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | pwexg 5348 | . . . . 5 ⊢ (𝐴 ∈ V → 𝒫 𝐴 ∈ V) | |
| 3 | 2 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ V ∧ 𝑁 ∈ ℕ0) → 𝒫 𝐴 ∈ V) |
| 4 | rabexg 5307 | . . . 4 ⊢ (𝒫 𝐴 ∈ V → {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ∈ V) | |
| 5 | 3, 4 | syl 17 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝑁 ∈ ℕ0) → {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ∈ V) |
| 6 | fveqeq2 6885 | . . . . . 6 ⊢ (𝑏 = 𝑥 → ((♯‘𝑏) = 𝑖 ↔ (♯‘𝑥) = 𝑖)) | |
| 7 | 6 | cbvrabv 3426 | . . . . 5 ⊢ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖} = {𝑥 ∈ 𝒫 𝑎 ∣ (♯‘𝑥) = 𝑖} |
| 8 | simpl 482 | . . . . . . 7 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 = 𝑁) → 𝑎 = 𝐴) | |
| 9 | 8 | pweqd 4592 | . . . . . 6 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 = 𝑁) → 𝒫 𝑎 = 𝒫 𝐴) |
| 10 | simpr 484 | . . . . . . 7 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 = 𝑁) → 𝑖 = 𝑁) | |
| 11 | 10 | eqeq2d 2746 | . . . . . 6 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 = 𝑁) → ((♯‘𝑥) = 𝑖 ↔ (♯‘𝑥) = 𝑁)) |
| 12 | 9, 11 | rabeqbidv 3434 | . . . . 5 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 = 𝑁) → {𝑥 ∈ 𝒫 𝑎 ∣ (♯‘𝑥) = 𝑖} = {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁}) |
| 13 | 7, 12 | eqtrid 2782 | . . . 4 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 = 𝑁) → {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖} = {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁}) |
| 14 | ramval.c | . . . 4 ⊢ 𝐶 = (𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖}) | |
| 15 | 13, 14 | ovmpoga 7561 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ∈ V) → (𝐴𝐶𝑁) = {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁}) |
| 16 | 5, 15 | mpd3an3 1464 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝑁 ∈ ℕ0) → (𝐴𝐶𝑁) = {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁}) |
| 17 | 1, 16 | sylan 580 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝐴𝐶𝑁) = {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 {crab 3415 Vcvv 3459 𝒫 cpw 4575 ‘cfv 6531 (class class class)co 7405 ∈ cmpo 7407 ℕ0cn0 12501 ♯chash 14348 |
| 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-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ral 3052 df-rex 3061 df-rab 3416 df-v 3461 df-sbc 3766 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-opab 5182 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-iota 6484 df-fun 6533 df-fv 6539 df-ov 7408 df-oprab 7409 df-mpo 7410 |
| This theorem is referenced by: hashbccl 17023 hashbcss 17024 hashbc0 17025 hashbc2 17026 ramval 17028 ram0 17042 ramub1lem1 17046 ramub1lem2 17047 |
| Copyright terms: Public domain | W3C validator |