![]() |
Mathbox for metakunt |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > sticksstones5 | Structured version Visualization version GIF version |
Description: Count the number of strictly monotonely increasing functions on finite domains and codomains. (Contributed by metakunt, 28-Sep-2024.) |
Ref | Expression |
---|---|
sticksstones5.1 | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
sticksstones5.2 | ⊢ (𝜑 → 𝐾 ∈ ℕ0) |
sticksstones5.3 | ⊢ 𝐴 = {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} |
Ref | Expression |
---|---|
sticksstones5 | ⊢ (𝜑 → (♯‘𝐴) = (𝑁C𝐾)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sticksstones5.1 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
2 | sticksstones5.2 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℕ0) | |
3 | eqid 2727 | . . . 4 ⊢ {𝑠 ∈ 𝒫 (1...𝑁) ∣ (♯‘𝑠) = 𝐾} = {𝑠 ∈ 𝒫 (1...𝑁) ∣ (♯‘𝑠) = 𝐾} | |
4 | sticksstones5.3 | . . . 4 ⊢ 𝐴 = {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} | |
5 | 1, 2, 3, 4 | sticksstones4 41553 | . . 3 ⊢ (𝜑 → 𝐴 ≈ {𝑠 ∈ 𝒫 (1...𝑁) ∣ (♯‘𝑠) = 𝐾}) |
6 | hasheni 14331 | . . 3 ⊢ (𝐴 ≈ {𝑠 ∈ 𝒫 (1...𝑁) ∣ (♯‘𝑠) = 𝐾} → (♯‘𝐴) = (♯‘{𝑠 ∈ 𝒫 (1...𝑁) ∣ (♯‘𝑠) = 𝐾})) | |
7 | 5, 6 | syl 17 | . 2 ⊢ (𝜑 → (♯‘𝐴) = (♯‘{𝑠 ∈ 𝒫 (1...𝑁) ∣ (♯‘𝑠) = 𝐾})) |
8 | fzfid 13962 | . . . . 5 ⊢ (𝜑 → (1...𝑁) ∈ Fin) | |
9 | 2 | nn0zd 12606 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℤ) |
10 | hashbc 14436 | . . . . 5 ⊢ (((1...𝑁) ∈ Fin ∧ 𝐾 ∈ ℤ) → ((♯‘(1...𝑁))C𝐾) = (♯‘{𝑠 ∈ 𝒫 (1...𝑁) ∣ (♯‘𝑠) = 𝐾})) | |
11 | 8, 9, 10 | syl2anc 583 | . . . 4 ⊢ (𝜑 → ((♯‘(1...𝑁))C𝐾) = (♯‘{𝑠 ∈ 𝒫 (1...𝑁) ∣ (♯‘𝑠) = 𝐾})) |
12 | 11 | eqcomd 2733 | . . 3 ⊢ (𝜑 → (♯‘{𝑠 ∈ 𝒫 (1...𝑁) ∣ (♯‘𝑠) = 𝐾}) = ((♯‘(1...𝑁))C𝐾)) |
13 | hashfz1 14329 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (♯‘(1...𝑁)) = 𝑁) | |
14 | 1, 13 | syl 17 | . . . 4 ⊢ (𝜑 → (♯‘(1...𝑁)) = 𝑁) |
15 | 14 | oveq1d 7429 | . . 3 ⊢ (𝜑 → ((♯‘(1...𝑁))C𝐾) = (𝑁C𝐾)) |
16 | 12, 15 | eqtrd 2767 | . 2 ⊢ (𝜑 → (♯‘{𝑠 ∈ 𝒫 (1...𝑁) ∣ (♯‘𝑠) = 𝐾}) = (𝑁C𝐾)) |
17 | 7, 16 | eqtrd 2767 | 1 ⊢ (𝜑 → (♯‘𝐴) = (𝑁C𝐾)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 {cab 2704 ∀wral 3056 {crab 3427 𝒫 cpw 4598 class class class wbr 5142 ⟶wf 6538 ‘cfv 6542 (class class class)co 7414 ≈ cen 8952 Fincfn 8955 1c1 11131 < clt 11270 ℕ0cn0 12494 ℤcz 12580 ...cfz 13508 Ccbc 14285 ♯chash 14313 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-cnex 11186 ax-resscn 11187 ax-1cn 11188 ax-icn 11189 ax-addcl 11190 ax-addrcl 11191 ax-mulcl 11192 ax-mulrcl 11193 ax-mulcom 11194 ax-addass 11195 ax-mulass 11196 ax-distr 11197 ax-i2m1 11198 ax-1ne0 11199 ax-1rid 11200 ax-rnegex 11201 ax-rrecex 11202 ax-cnre 11203 ax-pre-lttri 11204 ax-pre-lttrn 11205 ax-pre-ltadd 11206 ax-pre-mulgt0 11207 ax-pre-sup 11208 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-int 4945 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-se 5628 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-isom 6551 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7865 df-1st 7987 df-2nd 7988 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-oadd 8484 df-er 8718 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-sup 9457 df-inf 9458 df-oi 9525 df-dju 9916 df-card 9954 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11468 df-neg 11469 df-div 11894 df-nn 12235 df-n0 12495 df-z 12581 df-uz 12845 df-rp 12999 df-fz 13509 df-seq 13991 df-fac 14257 df-bc 14286 df-hash 14314 |
This theorem is referenced by: sticksstones14 41564 |
Copyright terms: Public domain | W3C validator |