| Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > derangfmla | Structured version Visualization version GIF version | ||
| Description: The derangements formula, which expresses the number of derangements of a finite nonempty set in terms of the factorial. The expression ⌊‘(𝑥 + 1 / 2) is a way of saying "rounded to the nearest integer". This is part of Metamath 100 proof #88. (Contributed by Mario Carneiro, 23-Jan-2015.) |
| Ref | Expression |
|---|---|
| derangfmla.d | ⊢ 𝐷 = (𝑥 ∈ Fin ↦ (♯‘{𝑓 ∣ (𝑓:𝑥–1-1-onto→𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) ≠ 𝑦)})) |
| Ref | Expression |
|---|---|
| derangfmla | ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → (𝐷‘𝐴) = (⌊‘(((!‘(♯‘𝐴)) / e) + (1 / 2)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | derangfmla.d | . . . 4 ⊢ 𝐷 = (𝑥 ∈ Fin ↦ (♯‘{𝑓 ∣ (𝑓:𝑥–1-1-onto→𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) ≠ 𝑦)})) | |
| 2 | oveq2 7361 | . . . . . 6 ⊢ (𝑛 = 𝑚 → (1...𝑛) = (1...𝑚)) | |
| 3 | 2 | fveq2d 6830 | . . . . 5 ⊢ (𝑛 = 𝑚 → (𝐷‘(1...𝑛)) = (𝐷‘(1...𝑚))) |
| 4 | 3 | cbvmptv 5199 | . . . 4 ⊢ (𝑛 ∈ ℕ0 ↦ (𝐷‘(1...𝑛))) = (𝑚 ∈ ℕ0 ↦ (𝐷‘(1...𝑚))) |
| 5 | 1, 4 | derangen2 35146 | . . 3 ⊢ (𝐴 ∈ Fin → (𝐷‘𝐴) = ((𝑛 ∈ ℕ0 ↦ (𝐷‘(1...𝑛)))‘(♯‘𝐴))) |
| 6 | 5 | adantr 480 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → (𝐷‘𝐴) = ((𝑛 ∈ ℕ0 ↦ (𝐷‘(1...𝑛)))‘(♯‘𝐴))) |
| 7 | hashnncl 14291 | . . . 4 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) ∈ ℕ ↔ 𝐴 ≠ ∅)) | |
| 8 | 7 | biimpar 477 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → (♯‘𝐴) ∈ ℕ) |
| 9 | 1, 4 | subfacval3 35161 | . . 3 ⊢ ((♯‘𝐴) ∈ ℕ → ((𝑛 ∈ ℕ0 ↦ (𝐷‘(1...𝑛)))‘(♯‘𝐴)) = (⌊‘(((!‘(♯‘𝐴)) / e) + (1 / 2)))) |
| 10 | 8, 9 | syl 17 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ((𝑛 ∈ ℕ0 ↦ (𝐷‘(1...𝑛)))‘(♯‘𝐴)) = (⌊‘(((!‘(♯‘𝐴)) / e) + (1 / 2)))) |
| 11 | 6, 10 | eqtrd 2764 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → (𝐷‘𝐴) = (⌊‘(((!‘(♯‘𝐴)) / e) + (1 / 2)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 {cab 2707 ≠ wne 2925 ∀wral 3044 ∅c0 4286 ↦ cmpt 5176 –1-1-onto→wf1o 6485 ‘cfv 6486 (class class class)co 7353 Fincfn 8879 1c1 11029 + caddc 11031 / cdiv 11795 ℕcn 12146 2c2 12201 ℕ0cn0 12402 ...cfz 13428 ⌊cfl 13712 !cfa 14198 ♯chash 14255 eceu 15987 |
| 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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-inf2 9556 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3345 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-int 4900 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-se 5577 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-isom 6495 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-oadd 8399 df-er 8632 df-map 8762 df-pm 8763 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-sup 9351 df-inf 9352 df-oi 9421 df-dju 9816 df-card 9854 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-div 11796 df-nn 12147 df-2 12209 df-3 12210 df-4 12211 df-n0 12403 df-xnn0 12476 df-z 12490 df-uz 12754 df-q 12868 df-rp 12912 df-ico 13272 df-fz 13429 df-fzo 13576 df-fl 13714 df-seq 13927 df-exp 13987 df-fac 14199 df-bc 14228 df-hash 14256 df-shft 14992 df-cj 15024 df-re 15025 df-im 15026 df-sqrt 15160 df-abs 15161 df-limsup 15396 df-clim 15413 df-rlim 15414 df-sum 15612 df-ef 15992 df-e 15993 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |