Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  subfaclefac Structured version   Visualization version   GIF version

Theorem subfaclefac 35161
Description: The subfactorial is less than the factorial. (Contributed by Mario Carneiro, 19-Jan-2015.)
Hypotheses
Ref Expression
derang.d 𝐷 = (𝑥 ∈ Fin ↦ (♯‘{𝑓 ∣ (𝑓:𝑥1-1-onto𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) ≠ 𝑦)}))
subfac.n 𝑆 = (𝑛 ∈ ℕ0 ↦ (𝐷‘(1...𝑛)))
Assertion
Ref Expression
subfaclefac (𝑁 ∈ ℕ0 → (𝑆𝑁) ≤ (!‘𝑁))
Distinct variable groups:   𝑓,𝑛,𝑥,𝑦,𝑁   𝐷,𝑛   𝑆,𝑛,𝑥,𝑦
Allowed substitution hints:   𝐷(𝑥,𝑦,𝑓)   𝑆(𝑓)

Proof of Theorem subfaclefac
StepHypRef Expression
1 anidm 564 . . . . . 6 ((𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)) ↔ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁))
21abbii 2807 . . . . 5 {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁))} = {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}
3 fzfid 14011 . . . . . 6 (𝑁 ∈ ℕ0 → (1...𝑁) ∈ Fin)
4 deranglem 35151 . . . . . 6 ((1...𝑁) ∈ Fin → {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁))} ∈ Fin)
53, 4syl 17 . . . . 5 (𝑁 ∈ ℕ0 → {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁))} ∈ Fin)
62, 5eqeltrrid 2844 . . . 4 (𝑁 ∈ ℕ0 → {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ∈ Fin)
7 simpl 482 . . . . 5 ((𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦) → 𝑓:(1...𝑁)–1-1-onto→(1...𝑁))
87ss2abi 4077 . . . 4 {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)} ⊆ {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}
9 ssdomg 9039 . . . 4 ({𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ∈ Fin → ({𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)} ⊆ {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} → {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)} ≼ {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
106, 8, 9mpisyl 21 . . 3 (𝑁 ∈ ℕ0 → {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)} ≼ {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
11 deranglem 35151 . . . . 5 ((1...𝑁) ∈ Fin → {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)} ∈ Fin)
123, 11syl 17 . . . 4 (𝑁 ∈ ℕ0 → {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)} ∈ Fin)
13 hashdom 14415 . . . 4 (({𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)} ∈ Fin ∧ {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ∈ Fin) → ((♯‘{𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)}) ≤ (♯‘{𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) ↔ {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)} ≼ {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
1412, 6, 13syl2anc 584 . . 3 (𝑁 ∈ ℕ0 → ((♯‘{𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)}) ≤ (♯‘{𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) ↔ {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)} ≼ {𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
1510, 14mpbird 257 . 2 (𝑁 ∈ ℕ0 → (♯‘{𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)}) ≤ (♯‘{𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
16 derang.d . . . 4 𝐷 = (𝑥 ∈ Fin ↦ (♯‘{𝑓 ∣ (𝑓:𝑥1-1-onto𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) ≠ 𝑦)}))
17 subfac.n . . . 4 𝑆 = (𝑛 ∈ ℕ0 ↦ (𝐷‘(1...𝑛)))
1816, 17subfacval 35158 . . 3 (𝑁 ∈ ℕ0 → (𝑆𝑁) = (𝐷‘(1...𝑁)))
1916derangval 35152 . . . 4 ((1...𝑁) ∈ Fin → (𝐷‘(1...𝑁)) = (♯‘{𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)}))
203, 19syl 17 . . 3 (𝑁 ∈ ℕ0 → (𝐷‘(1...𝑁)) = (♯‘{𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)}))
2118, 20eqtrd 2775 . 2 (𝑁 ∈ ℕ0 → (𝑆𝑁) = (♯‘{𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓𝑦) ≠ 𝑦)}))
22 hashfac 14494 . . . 4 ((1...𝑁) ∈ Fin → (♯‘{𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) = (!‘(♯‘(1...𝑁))))
233, 22syl 17 . . 3 (𝑁 ∈ ℕ0 → (♯‘{𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) = (!‘(♯‘(1...𝑁))))
24 hashfz1 14382 . . . 4 (𝑁 ∈ ℕ0 → (♯‘(1...𝑁)) = 𝑁)
2524fveq2d 6911 . . 3 (𝑁 ∈ ℕ0 → (!‘(♯‘(1...𝑁))) = (!‘𝑁))
2623, 25eqtr2d 2776 . 2 (𝑁 ∈ ℕ0 → (!‘𝑁) = (♯‘{𝑓𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
2715, 21, 263brtr4d 5180 1 (𝑁 ∈ ℕ0 → (𝑆𝑁) ≤ (!‘𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2106  {cab 2712  wne 2938  wral 3059  wss 3963   class class class wbr 5148  cmpt 5231  1-1-ontowf1o 6562  cfv 6563  (class class class)co 7431  cdom 8982  Fincfn 8984  1c1 11154  cle 11294  0cn0 12524  ...cfz 13544  !cfa 14309  chash 14366
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-oadd 8509  df-er 8744  df-map 8867  df-pm 8868  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-dju 9939  df-card 9977  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-div 11919  df-nn 12265  df-n0 12525  df-xnn0 12598  df-z 12612  df-uz 12877  df-fz 13545  df-seq 14040  df-fac 14310  df-bc 14339  df-hash 14367
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator