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

Theorem fidomdm 9285
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 6173 . 2 dom (𝐹 ↾ V) = dom 𝐹
2 finresfin 9215 . . . 4 (𝐹 ∈ Fin → (𝐹 ↾ V) ∈ Fin)
3 fvex 6871 . . . . . . 7 (1st𝑥) ∈ V
4 eqid 2729 . . . . . . 7 (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)) = (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥))
53, 4fnmpti 6661 . . . . . 6 (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)) Fn (𝐹 ↾ V)
6 dffn4 6778 . . . . . 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 5976 . . . . . 6 Rel (𝐹 ↾ V)
9 reldm 8023 . . . . . 6 (Rel (𝐹 ↾ V) → dom (𝐹 ↾ V) = ran (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)))
10 foeq3 6770 . . . . . 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 9261 . . . 4 (((𝐹 ↾ V) ∈ Fin ∧ (𝑥 ∈ (𝐹 ↾ V) ↦ (1st𝑥)):(𝐹 ↾ V)–onto→dom (𝐹 ↾ V)) → dom (𝐹 ↾ V) ≼ (𝐹 ↾ V))
142, 12, 13sylancl 586 . . 3 (𝐹 ∈ Fin → dom (𝐹 ↾ V) ≼ (𝐹 ↾ V))
15 resss 5972 . . . 4 (𝐹 ↾ V) ⊆ 𝐹
16 ssdomg 8971 . . . 4 (𝐹 ∈ Fin → ((𝐹 ↾ V) ⊆ 𝐹 → (𝐹 ↾ V) ≼ 𝐹))
1715, 16mpi 20 . . 3 (𝐹 ∈ Fin → (𝐹 ↾ V) ≼ 𝐹)
18 domtr 8978 . . 3 ((dom (𝐹 ↾ V) ≼ (𝐹 ↾ V) ∧ (𝐹 ↾ V) ≼ 𝐹) → dom (𝐹 ↾ V) ≼ 𝐹)
1914, 17, 18syl2anc 584 . 2 (𝐹 ∈ Fin → dom (𝐹 ↾ V) ≼ 𝐹)
201, 19eqbrtrrid 5143 1 (𝐹 ∈ Fin → dom 𝐹𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1540  wcel 2109  Vcvv 3447  wss 3914   class class class wbr 5107  cmpt 5188  dom cdm 5638  ran crn 5639  cres 5640  Rel wrel 5643   Fn wfn 6506  ontowfo 6509  cfv 6511  1st c1st 7966  cdom 8916  Fincfn 8918
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-om 7843  df-1st 7968  df-2nd 7969  df-1o 8434  df-en 8919  df-dom 8920  df-fin 8922
This theorem is referenced by:  dmfi  9286  hashfun  14402
  Copyright terms: Public domain W3C validator