MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fidomdm Structured version   Visualization version   GIF version

Theorem fidomdm 9361
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.
StepHypRef Expression
1 dmresv 6213 . 2 dom (𝐹 ↾ V) = dom 𝐹
2 finresfin 9301 . . . 4 (𝐹 ∈ Fin → (𝐹 ↾ V) ∈ Fin)
3 fvex 6929 . . . . . . 7 (1st ‘𝑥) ∈ V
4 eqid 2763 . . . . . . 7 (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)) = (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥))
53, 4fnmpti 6712 . . . . . 6 (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)) Fn (𝐹 ↾ V)
6 dffn4 6832 . . . . . 6 ((𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)) Fn (𝐹 ↾ V) ↔ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)⟶ontoran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)))
75, 6mpbi 233 . . . . 5 (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)⟶ontoran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥))
8 relres 6012 . . . . . 6 Rel (𝐹 ↾ V)
9 reldm 8089 . . . . . 6 (Rel (𝐹 ↾ V) → dom (𝐹 ↾ V) = ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)))
10 foeq3 6824 . . . . . 6 (dom (𝐹 ↾ V) = ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)) → ((𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)⟶ontodom (𝐹 ↾ V) ↔ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)⟶ontoran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥))))
118, 9, 10mp2b 10 . . . . 5 ((𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)⟶ontodom (𝐹 ↾ V) ↔ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)⟶ontoran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)))
127, 11mpbir 234 . . . 4 (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)⟶ontodom (𝐹 ↾ V)
13 fodomfi 9342 . . . 4 (((𝐹 ↾ V) ∈ Fin ∧ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st ‘𝑥)):(𝐹 ↾ V)⟶ontodom (𝐹 ↾ V)) → dom (𝐹 ↾ V) ≼ (𝐹 ↾ V))
142, 12, 13sylancl 598 . . 3 (𝐹 ∈ Fin → dom (𝐹 ↾ V) ≼ (𝐹 ↾ V))
15 resss 6008 . . . 4 (𝐹 ↾ V) ⊆ 𝐹
16 ssdomg 9065 . . . 4 (𝐹 ∈ Fin → ((𝐹 ↾ V) ⊆ 𝐹 → (𝐹 ↾ V) ≼ 𝐹))
1715, 16mpi 21 . . 3 (𝐹 ∈ Fin → (𝐹 ↾ V) ≼ 𝐹)
18 domtr 9072 . . 3 ((dom (𝐹 ↾ V) ≼ (𝐹 ↾ V) ∧ (𝐹 ↾ V) ≼ 𝐹) → dom (𝐹 ↾ V) ≼ 𝐹)
1914, 17, 18syl2anc 596 . 2 (𝐹 ∈ Fin → dom (𝐹 ↾ V) ≼ 𝐹)
201, 19eqbrtrrid 5147 1 (𝐹 ∈ Fin → dom 𝐹 ≼ 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   class class class wbr 5108   ↦ cmpt 5192  dom cdm 5658  ran crn 5659   ↾ cres 5660  Rel wrel 5663   Fn wfn 6561  ⟶ontowfo 6564  ‘cfv 6566  1st c1st 8033   ≼ cdom 9009  Fincfn 9011
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-om 7912  df-1st 8035  df-2nd 8036  df-1o 8514  df-en 9012  df-dom 9013  df-fin 9015
This theorem is used by:  dmfi  9362  hashfun  14623
  Copyright terms: Public domain W3C validator