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

Theorem fidomdm 9246
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 6166 . 2 dom (𝐹 ↾ V) = dom 𝐹
2 finresfin 9184 . . . 4 (𝐹 ∈ Fin → (𝐹 ↾ V) ∈ Fin)
3 fvex 6855 . . . . . . 7 (1st𝑥) ∈ V
4 eqid 2737 . . . . . . 7 (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)) = (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥))
53, 4fnmpti 6643 . . . . . 6 (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)) Fn (𝐹 ↾ V)
6 dffn4 6760 . . . . . 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 5972 . . . . . 6 Rel (𝐹 ↾ V)
9 reldm 7998 . . . . . 6 (Rel (𝐹 ↾ V) → dom (𝐹 ↾ V) = ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)))
10 foeq3 6752 . . . . . 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 9224 . . . 4 (((𝐹 ↾ V) ∈ Fin ∧ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)):(𝐹 ↾ V)–onto→dom (𝐹 ↾ V)) → dom (𝐹 ↾ V) ≼ (𝐹 ↾ V))
142, 12, 13sylancl 587 . . 3 (𝐹 ∈ Fin → dom (𝐹 ↾ V) ≼ (𝐹 ↾ V))
15 resss 5968 . . . 4 (𝐹 ↾ V) ⊆ 𝐹
16 ssdomg 8949 . . . 4 (𝐹 ∈ Fin → ((𝐹 ↾ V) ⊆ 𝐹 → (𝐹 ↾ V) ≼ 𝐹))
1715, 16mpi 20 . . 3 (𝐹 ∈ Fin → (𝐹 ↾ V) ≼ 𝐹)
18 domtr 8956 . . 3 ((dom (𝐹 ↾ V) ≼ (𝐹 ↾ V) ∧ (𝐹 ↾ V) ≼ 𝐹) → dom (𝐹 ↾ V) ≼ 𝐹)
1914, 17, 18syl2anc 585 . 2 (𝐹 ∈ Fin → dom (𝐹 ↾ V) ≼ 𝐹)
201, 19eqbrtrrid 5136 1 (𝐹 ∈ Fin → dom 𝐹𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1542  wcel 2114  Vcvv 3442  wss 3903   class class class wbr 5100  cmpt 5181  dom cdm 5632  ran crn 5633  cres 5634  Rel wrel 5637   Fn wfn 6495  ontowfo 6498  cfv 6500  1st c1st 7941  cdom 8893  Fincfn 8895
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 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-om 7819  df-1st 7943  df-2nd 7944  df-1o 8407  df-en 8896  df-dom 8897  df-fin 8899
This theorem is referenced by:  dmfi  9247  hashfun  14372
  Copyright terms: Public domain W3C validator