| Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > derangval | Structured version Visualization version GIF version | ||
| Description: Define the derangement function, which counts the number of bijections from a set to itself such that no element is mapped to itself. (Contributed by Mario Carneiro, 19-Jan-2015.) |
| Ref | Expression |
|---|---|
| derang.d | ⊢ 𝐷 = (𝑥 ∈ Fin ↦ (♯‘{𝑓 ∣ (𝑓:𝑥–1-1-onto→𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) ≠ 𝑦)})) |
| Ref | Expression |
|---|---|
| derangval | ⊢ (𝐴 ∈ Fin → (𝐷‘𝐴) = (♯‘{𝑓 ∣ (𝑓:𝐴–1-1-onto→𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ≠ 𝑦)})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1oeq2 6805 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑓:𝑥–1-1-onto→𝑥 ↔ 𝑓:𝐴–1-1-onto→𝑥)) | |
| 2 | f1oeq3 6806 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑓:𝐴–1-1-onto→𝑥 ↔ 𝑓:𝐴–1-1-onto→𝐴)) | |
| 3 | 1, 2 | bitrd 282 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑓:𝑥–1-1-onto→𝑥 ↔ 𝑓:𝐴–1-1-onto→𝐴)) |
| 4 | raleq 3317 | . . . . 5 ⊢ (𝑥 = 𝐴 → (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) ≠ 𝑦 ↔ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ≠ 𝑦)) | |
| 5 | 3, 4 | anbi12d 644 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑓:𝑥–1-1-onto→𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) ≠ 𝑦) ↔ (𝑓:𝐴–1-1-onto→𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ≠ 𝑦))) |
| 6 | 5 | abbidv 2827 | . . 3 ⊢ (𝑥 = 𝐴 → {𝑓 ∣ (𝑓:𝑥–1-1-onto→𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) ≠ 𝑦)} = {𝑓 ∣ (𝑓:𝐴–1-1-onto→𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ≠ 𝑦)}) |
| 7 | 6 | fveq2d 6881 | . 2 ⊢ (𝑥 = 𝐴 → (♯‘{𝑓 ∣ (𝑓:𝑥–1-1-onto→𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) ≠ 𝑦)}) = (♯‘{𝑓 ∣ (𝑓:𝐴–1-1-onto→𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ≠ 𝑦)})) |
| 8 | derang.d | . 2 ⊢ 𝐷 = (𝑥 ∈ Fin ↦ (♯‘{𝑓 ∣ (𝑓:𝑥–1-1-onto→𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) ≠ 𝑦)})) | |
| 9 | fvex 6890 | . 2 ⊢ (♯‘{𝑓 ∣ (𝑓:𝐴–1-1-onto→𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ≠ 𝑦)}) ∈ V | |
| 10 | 7, 8, 9 | fvmpt 6985 | 1 ⊢ (𝐴 ∈ Fin → (𝐷‘𝐴) = (♯‘{𝑓 ∣ (𝑓:𝐴–1-1-onto→𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ≠ 𝑦)})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {cab 2739 ≠ wne 2956 ∀wral 3077 ↦ cmpt 5186 –1-1-onto→wf1o 6530 ‘cfv 6531 Fincfn 8957 ♯chash 14454 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 |
| This theorem is used by: derang0 35903 derangsn 35904 derangenlem 35905 subfaclefac 35910 subfacp1lem3 35916 subfacp1lem5 35918 subfacp1lem6 35919 |
| Copyright terms: Public domain | W3C validator |