| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hashbccl | Structured version Visualization version GIF version | ||
| Description: The binomial set is a finite set. (Contributed by Mario Carneiro, 20-Apr-2015.) |
| Ref | Expression |
|---|---|
| ramval.c | ⊢ 𝐶 = (𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖}) |
| Ref | Expression |
|---|---|
| hashbccl | ⊢ ((𝐴 ∈ Fin ∧ 𝑁 ∈ ℕ0) → (𝐴𝐶𝑁) ∈ Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ramval.c | . . 3 ⊢ 𝐶 = (𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖}) | |
| 2 | 1 | hashbcval 16967 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝑁 ∈ ℕ0) → (𝐴𝐶𝑁) = {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁}) |
| 3 | simpl 483 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝑁 ∈ ℕ0) → 𝐴 ∈ Fin) | |
| 4 | pwfi 9222 | . . . 4 ⊢ (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Fin) | |
| 5 | 3, 4 | sylib 219 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝑁 ∈ ℕ0) → 𝒫 𝐴 ∈ Fin) |
| 6 | ssrab2 4014 | . . 3 ⊢ {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ⊆ 𝒫 𝐴 | |
| 7 | ssfi 9100 | . . 3 ⊢ ((𝒫 𝐴 ∈ Fin ∧ {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ⊆ 𝒫 𝐴) → {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ∈ Fin) | |
| 8 | 5, 6, 7 | sylancl 588 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝑁 ∈ ℕ0) → {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ∈ Fin) |
| 9 | 2, 8 | eqeltrd 2836 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝑁 ∈ ℕ0) → (𝐴𝐶𝑁) ∈ Fin) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1543 ∈ wcel 2115 {crab 3388 Vcvv 3428 ⊆ wss 3886 𝒫 cpw 4532 ‘cfv 6488 (class class class)co 7359 ∈ cmpo 7361 Fincfn 8886 ℕ0cn0 12431 ♯chash 14286 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1970 ax-7 2011 ax-8 2117 ax-9 2125 ax-10 2148 ax-11 2164 ax-12 2185 ax-ext 2708 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7681 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 850 df-3or 1089 df-3an 1090 df-tru 1546 df-fal 1556 df-ex 1783 df-nf 1787 df-sb 2070 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2932 df-ral 3051 df-rex 3061 df-reu 3342 df-rab 3389 df-v 3430 df-sbc 3727 df-dif 3889 df-un 3891 df-in 3893 df-ss 3903 df-pss 3906 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-1o 8398 df-en 8887 df-dom 8888 df-fin 8890 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |