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

Theorem fidomdm 9237
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 6158 . 2 dom (𝐹 ↾ V) = dom 𝐹
2 finresfin 9175 . . . 4 (𝐹 ∈ Fin → (𝐹 ↾ V) ∈ Fin)
3 fvex 6847 . . . . . . 7 (1st𝑥) ∈ V
4 eqid 2737 . . . . . . 7 (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)) = (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥))
53, 4fnmpti 6635 . . . . . 6 (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)) Fn (𝐹 ↾ V)
6 dffn4 6752 . . . . . 6 ((𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)) Fn (𝐹 ↾ V) ↔ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)):(𝐹 ↾ V)–onto→ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)))
75, 6mpbi 230 . . . . 5 (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)):(𝐹 ↾ V)–onto→ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥))
8 relres 5964 . . . . . 6 Rel (𝐹 ↾ V)
9 reldm 7990 . . . . . 6 (Rel (𝐹 ↾ V) → dom (𝐹 ↾ V) = ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)))
10 foeq3 6744 . . . . . 6 (dom (𝐹 ↾ V) = ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)) → ((𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)):(𝐹 ↾ V)–onto→dom (𝐹 ↾ V) ↔ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)):(𝐹 ↾ V)–onto→ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥))))
118, 9, 10mp2b 10 . . . . 5 ((𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)):(𝐹 ↾ V)–onto→dom (𝐹 ↾ V) ↔ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)):(𝐹 ↾ V)–onto→ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)))
127, 11mpbir 231 . . . 4 (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)):(𝐹 ↾ V)–onto→dom (𝐹 ↾ V)
13 fodomfi 9215 . . . 4 (((𝐹 ↾ V) ∈ Fin ∧ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)):(𝐹 ↾ V)–onto→dom (𝐹 ↾ V)) → dom (𝐹 ↾ V) ≼ (𝐹 ↾ V))
142, 12, 13sylancl 587 . . 3 (𝐹 ∈ Fin → dom (𝐹 ↾ V) ≼ (𝐹 ↾ V))
15 resss 5960 . . . 4 (𝐹 ↾ V) ⊆ 𝐹
16 ssdomg 8940 . . . 4 (𝐹 ∈ Fin → ((𝐹 ↾ V) ⊆ 𝐹 → (𝐹 ↾ V) ≼ 𝐹))
1715, 16mpi 20 . . 3 (𝐹 ∈ Fin → (𝐹 ↾ V) ≼ 𝐹)
18 domtr 8947 . . 3 ((dom (𝐹 ↾ V) ≼ (𝐹 ↾ V) ∧ (𝐹 ↾ V) ≼ 𝐹) → dom (𝐹 ↾ V) ≼ 𝐹)
1914, 17, 18syl2anc 585 . 2 (𝐹 ∈ Fin → dom (𝐹 ↾ V) ≼ 𝐹)
201, 19eqbrtrrid 5122 1 (𝐹 ∈ Fin → dom 𝐹𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1542  wcel 2114  Vcvv 3430  wss 3890   class class class wbr 5086  cmpt 5167  dom cdm 5624  ran crn 5625  cres 5626  Rel wrel 5629   Fn wfn 6487  ontowfo 6490  cfv 6492  1st c1st 7933  cdom 8884  Fincfn 8886
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-om 7811  df-1st 7935  df-2nd 7936  df-1o 8398  df-en 8887  df-dom 8888  df-fin 8890
This theorem is referenced by:  dmfi  9238  hashfun  14390
  Copyright terms: Public domain W3C validator