Theorem fidomdm 8785

Description: Any finite set dominates its domain. (Contributed by Mario Carneiro, 22-Sep-2013.) (Revised by Mario Carneiro, 16-Nov-2014.)

Assertion

Ref	Expression
fidomdm	⊢ (𝐹 ∈ Fin → dom 𝐹 ≼ 𝐹)

Proof of Theorem fidomdm

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dmresv 6024	. 2 ⊢ dom (𝐹 ↾ V) = dom 𝐹
2		finresfin 8728	. . . 4 ⊢ (𝐹 ∈ Fin → (𝐹 ↾ V) ∈ Fin)
3		fvex 6658	. . . . . . 7 ⊢ (1st ‘𝑥) ∈ V
4		eqid 2798	. . . . . . 7 ⊢ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)) = (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥))
5	3, 4	fnmpti 6463	. . . . . 6 ⊢ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)) Fn (𝐹 ↾ V)
6		dffn4 6571	. . . . . 6 ⊢ ((𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)) Fn (𝐹 ↾ V) ↔ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)–onto→ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)))
7	5, 6	mpbi 233	. . . . 5 ⊢ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)–onto→ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥))
8		relres 5847	. . . . . 6 ⊢ Rel (𝐹 ↾ V)
9		reldm 7725	. . . . . 6 ⊢ (Rel (𝐹 ↾ V) → dom (𝐹 ↾ V) = ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)))
10		foeq3 6563	. . . . . 6 ⊢ (dom (𝐹 ↾ V) = ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)) → ((𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)–onto→dom (𝐹 ↾ V) ↔ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)–onto→ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥))))
11	8, 9, 10	mp2b 10	. . . . 5 ⊢ ((𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)–onto→dom (𝐹 ↾ V) ↔ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)–onto→ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)))
12	7, 11	mpbir 234	. . . 4 ⊢ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)–onto→dom (𝐹 ↾ V)
13		fodomfi 8781	. . . 4 ⊢ (((𝐹 ↾ V) ∈ Fin ∧ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)–onto→dom (𝐹 ↾ V)) → dom (𝐹 ↾ V) ≼ (𝐹 ↾ V))
14	2, 12, 13	sylancl 589	. . 3 ⊢ (𝐹 ∈ Fin → dom (𝐹 ↾ V) ≼ (𝐹 ↾ V))
15		resss 5843	. . . 4 ⊢ (𝐹 ↾ V) ⊆ 𝐹
16		ssdomg 8538	. . . 4 ⊢ (𝐹 ∈ Fin → ((𝐹 ↾ V) ⊆ 𝐹 → (𝐹 ↾ V) ≼ 𝐹))
17	15, 16	mpi 20	. . 3 ⊢ (𝐹 ∈ Fin → (𝐹 ↾ V) ≼ 𝐹)
18		domtr 8545	. . 3 ⊢ ((dom (𝐹 ↾ V) ≼ (𝐹 ↾ V) ∧ (𝐹 ↾ V) ≼ 𝐹) → dom (𝐹 ↾ V) ≼ 𝐹)
19	14, 17, 18	syl2anc 587	. 2 ⊢ (𝐹 ∈ Fin → dom (𝐹 ↾ V) ≼ 𝐹)
20	1, 19	eqbrtrrid 5066	1 ⊢ (𝐹 ∈ Fin → dom 𝐹 ≼ 𝐹)

Syntax hints:   → wi 4   ↔ wb 209   = wceq 1538   ∈ wcel 2111  Vcvv 3441   ⊆ wss 3881   class class class wbr 5030   ↦ cmpt 5110  dom cdm 5519  ran crn 5520   ↾ cres 5521  Rel wrel 5524   Fn wfn 6319  –onto→wfo 6322  ‘cfv 6324  1^st c1st 7669   ≼ cdom 8490  Fincfn 8492

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-om 7561  df-1st 7671  df-2nd 7672  df-1o 8085  df-er 8272  df-en 8493  df-dom 8494  df-fin 8496

This theorem is referenced by:  dmfi  8786  hashfun  13794