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 3440 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
2 | pwexg 5296 | . . . . 5 ⊢ (𝐴 ∈ V → 𝒫 𝐴 ∈ V) | |
3 | 2 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ V ∧ 𝑁 ∈ ℕ0) → 𝒫 𝐴 ∈ V) |
4 | rabexg 5250 | . . . 4 ⊢ (𝒫 𝐴 ∈ V → {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ∈ V) | |
5 | 3, 4 | syl 17 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝑁 ∈ ℕ0) → {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ∈ V) |
6 | fveqeq2 6765 | . . . . . 6 ⊢ (𝑏 = 𝑥 → ((♯‘𝑏) = 𝑖 ↔ (♯‘𝑥) = 𝑖)) | |
7 | 6 | cbvrabv 3416 | . . . . 5 ⊢ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖} = {𝑥 ∈ 𝒫 𝑎 ∣ (♯‘𝑥) = 𝑖} |
8 | simpl 482 | . . . . . . 7 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 = 𝑁) → 𝑎 = 𝐴) | |
9 | 8 | pweqd 4549 | . . . . . 6 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 = 𝑁) → 𝒫 𝑎 = 𝒫 𝐴) |
10 | simpr 484 | . . . . . . 7 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 = 𝑁) → 𝑖 = 𝑁) | |
11 | 10 | eqeq2d 2749 | . . . . . 6 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 = 𝑁) → ((♯‘𝑥) = 𝑖 ↔ (♯‘𝑥) = 𝑁)) |
12 | 9, 11 | rabeqbidv 3410 | . . . . 5 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 = 𝑁) → {𝑥 ∈ 𝒫 𝑎 ∣ (♯‘𝑥) = 𝑖} = {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁}) |
13 | 7, 12 | eqtrid 2790 | . . . 4 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 = 𝑁) → {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖} = {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁}) |
14 | ramval.c | . . . 4 ⊢ 𝐶 = (𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖}) | |
15 | 13, 14 | ovmpoga 7405 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ∈ V) → (𝐴𝐶𝑁) = {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁}) |
16 | 5, 15 | mpd3an3 1460 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝑁 ∈ ℕ0) → (𝐴𝐶𝑁) = {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁}) |
17 | 1, 16 | sylan 579 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝐴𝐶𝑁) = {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 {crab 3067 Vcvv 3422 𝒫 cpw 4530 ‘cfv 6418 (class class class)co 7255 ∈ cmpo 7257 ℕ0cn0 12163 ♯chash 13972 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-iota 6376 df-fun 6420 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 |
This theorem is referenced by: hashbccl 16632 hashbcss 16633 hashbc0 16634 hashbc2 16635 ramval 16637 ram0 16651 ramub1lem1 16655 ramub1lem2 16656 |
Copyright terms: Public domain | W3C validator |