Theorem subfaclefac 32425

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

Step	Hyp	Ref	Expression
1		anidm 567	. . . . . 6 ⊢ ((𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)) ↔ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁))
2	1	abbii 2888	. . . . 5 ⊢ {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁))} = {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}
3		fzfid 13344	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (1...𝑁) ∈ Fin)
4		deranglem 32415	. . . . . 6 ⊢ ((1...𝑁) ∈ Fin → {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁))} ∈ Fin)
5	3, 4	syl 17	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁))} ∈ Fin)
6	2, 5	eqeltrrid 2920	. . . 4 ⊢ (𝑁 ∈ ℕ0 → {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ∈ Fin)
7		simpl 485	. . . . 5 ⊢ ((𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓‘𝑦) ≠ 𝑦) → 𝑓:(1...𝑁)–1-1-onto→(1...𝑁))
8	7	ss2abi 4045	. . . 4 ⊢ {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓‘𝑦) ≠ 𝑦)} ⊆ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}
9		ssdomg 8557	. . . 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...𝑁)}))
10	6, 8, 9	mpisyl 21	. . 3 ⊢ (𝑁 ∈ ℕ0 → {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓‘𝑦) ≠ 𝑦)} ≼ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
11		deranglem 32415	. . . . 5 ⊢ ((1...𝑁) ∈ Fin → {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓‘𝑦) ≠ 𝑦)} ∈ Fin)
12	3, 11	syl 17	. . . 4 ⊢ (𝑁 ∈ ℕ0 → {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓‘𝑦) ≠ 𝑦)} ∈ Fin)
13		hashdom 13743	. . . 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...𝑁)}))
14	12, 6, 13	syl2anc 586	. . 3 ⊢ (𝑁 ∈ ℕ0 → ((♯‘{𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓‘𝑦) ≠ 𝑦)}) ≤ (♯‘{𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) ↔ {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓‘𝑦) ≠ 𝑦)} ≼ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
15	10, 14	mpbird 259	. 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...𝑛)))
18	16, 17	subfacval 32422	. . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑆‘𝑁) = (𝐷‘(1...𝑁)))
19	16	derangval 32416	. . . 4 ⊢ ((1...𝑁) ∈ Fin → (𝐷‘(1...𝑁)) = (♯‘{𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓‘𝑦) ≠ 𝑦)}))
20	3, 19	syl 17	. . 3 ⊢ (𝑁 ∈ ℕ0 → (𝐷‘(1...𝑁)) = (♯‘{𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓‘𝑦) ≠ 𝑦)}))
21	18, 20	eqtrd 2858	. 2 ⊢ (𝑁 ∈ ℕ0 → (𝑆‘𝑁) = (♯‘{𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓‘𝑦) ≠ 𝑦)}))
22		hashfac 13819	. . . 4 ⊢ ((1...𝑁) ∈ Fin → (♯‘{𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) = (!‘(♯‘(1...𝑁))))
23	3, 22	syl 17	. . 3 ⊢ (𝑁 ∈ ℕ0 → (♯‘{𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) = (!‘(♯‘(1...𝑁))))
24		hashfz1 13709	. . . 4 ⊢ (𝑁 ∈ ℕ0 → (♯‘(1...𝑁)) = 𝑁)
25	24	fveq2d 6676	. . 3 ⊢ (𝑁 ∈ ℕ0 → (!‘(♯‘(1...𝑁))) = (!‘𝑁))
26	23, 25	eqtr2d 2859	. 2 ⊢ (𝑁 ∈ ℕ0 → (!‘𝑁) = (♯‘{𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
27	15, 21, 26	3brtr4d 5100	1 ⊢ (𝑁 ∈ ℕ0 → (𝑆‘𝑁) ≤ (!‘𝑁))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114  {cab 2801   ≠ wne 3018  ∀wral 3140   ⊆ wss 3938   class class class wbr 5068   ↦ cmpt 5148  –1-1-onto→wf1o 6356  ‘cfv 6357  (class class class)co 7158   ≼ cdom 8509  Fincfn 8511  1c1 10540   ≤ cle 10678  ℕ₀cn0 11900  ...cfz 12895  !cfa 13636  ♯chash 13693

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-1st 7691  df-2nd 7692  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-2o 8105  df-oadd 8108  df-er 8291  df-map 8410  df-pm 8411  df-en 8512  df-dom 8513  df-sdom 8514  df-fin 8515  df-dju 9332  df-card 9370  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-div 11300  df-nn 11641  df-n0 11901  df-xnn0 11971  df-z 11985  df-uz 12247  df-fz 12896  df-seq 13373  df-fac 13637  df-bc 13666  df-hash 13694

This theorem is referenced by: (None)