![]() |
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 16933 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝑁 ∈ ℕ0) → (𝐴𝐶𝑁) = {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁}) |
3 | simpl 482 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝑁 ∈ ℕ0) → 𝐴 ∈ Fin) | |
4 | pwfi 9173 | . . . 4 ⊢ (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Fin) | |
5 | 3, 4 | sylib 217 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝑁 ∈ ℕ0) → 𝒫 𝐴 ∈ Fin) |
6 | ssrab2 4069 | . . 3 ⊢ {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ⊆ 𝒫 𝐴 | |
7 | ssfi 9168 | . . 3 ⊢ ((𝒫 𝐴 ∈ Fin ∧ {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ⊆ 𝒫 𝐴) → {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ∈ Fin) | |
8 | 5, 6, 7 | sylancl 585 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝑁 ∈ ℕ0) → {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} ∈ Fin) |
9 | 2, 8 | eqeltrd 2825 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝑁 ∈ ℕ0) → (𝐴𝐶𝑁) ∈ Fin) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1533 ∈ wcel 2098 {crab 3424 Vcvv 3466 ⊆ wss 3940 𝒫 cpw 4594 ‘cfv 6533 (class class class)co 7401 ∈ cmpo 7403 Fincfn 8934 ℕ0cn0 12468 ♯chash 14286 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-ral 3054 df-rex 3063 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3770 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-pss 3959 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-op 4627 df-uni 4900 df-br 5139 df-opab 5201 df-mpt 5222 df-tr 5256 df-id 5564 df-eprel 5570 df-po 5578 df-so 5579 df-fr 5621 df-we 5623 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-ord 6357 df-on 6358 df-lim 6359 df-suc 6360 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7404 df-oprab 7405 df-mpo 7406 df-om 7849 df-1o 8461 df-en 8935 df-fin 8938 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |