Theorem subfaclefac 33138

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 565	. . . . . 6 ⊢ ((𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)) ↔ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁))
2	1	abbii 2808	. . . . 5 ⊢ {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁))} = {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}
3		fzfid 13693	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (1...𝑁) ∈ Fin)
4		deranglem 33128	. . . . . 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 2844	. . . 4 ⊢ (𝑁 ∈ ℕ0 → {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ∈ Fin)
7		simpl 483	. . . . 5 ⊢ ((𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓‘𝑦) ≠ 𝑦) → 𝑓:(1...𝑁)–1-1-onto→(1...𝑁))
8	7	ss2abi 4000	. . . 4 ⊢ {𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓‘𝑦) ≠ 𝑦)} ⊆ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}
9		ssdomg 8786	. . . 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 33128	. . . . 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 14094	. . . 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 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...𝑁)}))
15	10, 14	mpbird 256	. 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 33135	. . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑆‘𝑁) = (𝐷‘(1...𝑁)))
19	16	derangval 33129	. . . 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 2778	. 2 ⊢ (𝑁 ∈ ℕ0 → (𝑆‘𝑁) = (♯‘{𝑓 ∣ (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ∧ ∀𝑦 ∈ (1...𝑁)(𝑓‘𝑦) ≠ 𝑦)}))
22		hashfac 14172	. . . 4 ⊢ ((1...𝑁) ∈ Fin → (♯‘{𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) = (!‘(♯‘(1...𝑁))))
23	3, 22	syl 17	. . 3 ⊢ (𝑁 ∈ ℕ0 → (♯‘{𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) = (!‘(♯‘(1...𝑁))))
24		hashfz1 14060	. . . 4 ⊢ (𝑁 ∈ ℕ0 → (♯‘(1...𝑁)) = 𝑁)
25	24	fveq2d 6778	. . 3 ⊢ (𝑁 ∈ ℕ0 → (!‘(♯‘(1...𝑁))) = (!‘𝑁))
26	23, 25	eqtr2d 2779	. 2 ⊢ (𝑁 ∈ ℕ0 → (!‘𝑁) = (♯‘{𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
27	15, 21, 26	3brtr4d 5106	1 ⊢ (𝑁 ∈ ℕ0 → (𝑆‘𝑁) ≤ (!‘𝑁))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106  {cab 2715   ≠ wne 2943  ∀wral 3064   ⊆ wss 3887   class class class wbr 5074   ↦ cmpt 5157  –1-1-onto→wf1o 6432  ‘cfv 6433  (class class class)co 7275   ≼ cdom 8731  Fincfn 8733  1c1 10872   ≤ cle 11010  ℕ₀cn0 12233  ...cfz 13239  !cfa 13987  ♯chash 14044

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-1o 8297  df-oadd 8301  df-er 8498  df-map 8617  df-pm 8618  df-en 8734  df-dom 8735  df-sdom 8736  df-fin 8737  df-dju 9659  df-card 9697  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-div 11633  df-nn 11974  df-n0 12234  df-xnn0 12306  df-z 12320  df-uz 12583  df-fz 13240  df-seq 13722  df-fac 13988  df-bc 14017  df-hash 14045

This theorem is referenced by: (None)