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

Theorem fipreima 9215
Description: Given a finite subset 𝐴 of the range of a function, there exists a finite subset of the domain whose image is 𝐴. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Stefan O'Rear, 22-Feb-2015.)
Assertion
Ref Expression
fipreima ((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) → ∃𝑐 ∈ (𝒫 𝐵 ∩ Fin)(𝐹𝑐) = 𝐴)
Distinct variable groups:   𝐴,𝑐   𝐵,𝑐   𝐹,𝑐

Proof of Theorem fipreima
Dummy variables 𝑓 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp3 1137 . . 3 ((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) → 𝐴 ∈ Fin)
2 dfss3 3919 . . . . . 6 (𝐴 ⊆ ran 𝐹 ↔ ∀𝑥𝐴 𝑥 ∈ ran 𝐹)
3 fvelrnb 6880 . . . . . . 7 (𝐹 Fn 𝐵 → (𝑥 ∈ ran 𝐹 ↔ ∃𝑦𝐵 (𝐹𝑦) = 𝑥))
43ralbidv 3170 . . . . . 6 (𝐹 Fn 𝐵 → (∀𝑥𝐴 𝑥 ∈ ran 𝐹 ↔ ∀𝑥𝐴𝑦𝐵 (𝐹𝑦) = 𝑥))
52, 4bitrid 282 . . . . 5 (𝐹 Fn 𝐵 → (𝐴 ⊆ ran 𝐹 ↔ ∀𝑥𝐴𝑦𝐵 (𝐹𝑦) = 𝑥))
65biimpa 477 . . . 4 ((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹) → ∀𝑥𝐴𝑦𝐵 (𝐹𝑦) = 𝑥)
763adant3 1131 . . 3 ((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) → ∀𝑥𝐴𝑦𝐵 (𝐹𝑦) = 𝑥)
8 fveqeq2 6828 . . . 4 (𝑦 = (𝑓𝑥) → ((𝐹𝑦) = 𝑥 ↔ (𝐹‘(𝑓𝑥)) = 𝑥))
98ac6sfi 9144 . . 3 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴𝑦𝐵 (𝐹𝑦) = 𝑥) → ∃𝑓(𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥))
101, 7, 9syl2anc 584 . 2 ((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) → ∃𝑓(𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥))
11 fimass 6666 . . . . . 6 (𝑓:𝐴𝐵 → (𝑓𝐴) ⊆ 𝐵)
12 vex 3445 . . . . . . . 8 𝑓 ∈ V
1312imaex 7823 . . . . . . 7 (𝑓𝐴) ∈ V
1413elpw 4550 . . . . . 6 ((𝑓𝐴) ∈ 𝒫 𝐵 ↔ (𝑓𝐴) ⊆ 𝐵)
1511, 14sylibr 233 . . . . 5 (𝑓:𝐴𝐵 → (𝑓𝐴) ∈ 𝒫 𝐵)
1615ad2antrl 725 . . . 4 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → (𝑓𝐴) ∈ 𝒫 𝐵)
17 ffun 6648 . . . . . 6 (𝑓:𝐴𝐵 → Fun 𝑓)
1817ad2antrl 725 . . . . 5 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → Fun 𝑓)
19 simpl3 1192 . . . . 5 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → 𝐴 ∈ Fin)
20 imafi 9032 . . . . 5 ((Fun 𝑓𝐴 ∈ Fin) → (𝑓𝐴) ∈ Fin)
2118, 19, 20syl2anc 584 . . . 4 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → (𝑓𝐴) ∈ Fin)
2216, 21elind 4140 . . 3 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → (𝑓𝐴) ∈ (𝒫 𝐵 ∩ Fin))
23 fvco3 6917 . . . . . . . . . . 11 ((𝑓:𝐴𝐵𝑥𝐴) → ((𝐹𝑓)‘𝑥) = (𝐹‘(𝑓𝑥)))
24 fvresi 7095 . . . . . . . . . . . 12 (𝑥𝐴 → (( I ↾ 𝐴)‘𝑥) = 𝑥)
2524adantl 482 . . . . . . . . . . 11 ((𝑓:𝐴𝐵𝑥𝐴) → (( I ↾ 𝐴)‘𝑥) = 𝑥)
2623, 25eqeq12d 2752 . . . . . . . . . 10 ((𝑓:𝐴𝐵𝑥𝐴) → (((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥) ↔ (𝐹‘(𝑓𝑥)) = 𝑥))
2726ralbidva 3168 . . . . . . . . 9 (𝑓:𝐴𝐵 → (∀𝑥𝐴 ((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥) ↔ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥))
2827biimprd 247 . . . . . . . 8 (𝑓:𝐴𝐵 → (∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥 → ∀𝑥𝐴 ((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥)))
2928adantl 482 . . . . . . 7 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ 𝑓:𝐴𝐵) → (∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥 → ∀𝑥𝐴 ((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥)))
3029impr 455 . . . . . 6 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → ∀𝑥𝐴 ((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥))
31 simpl1 1190 . . . . . . . 8 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → 𝐹 Fn 𝐵)
32 ffn 6645 . . . . . . . . 9 (𝑓:𝐴𝐵𝑓 Fn 𝐴)
3332ad2antrl 725 . . . . . . . 8 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → 𝑓 Fn 𝐴)
34 frn 6652 . . . . . . . . 9 (𝑓:𝐴𝐵 → ran 𝑓𝐵)
3534ad2antrl 725 . . . . . . . 8 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → ran 𝑓𝐵)
36 fnco 6595 . . . . . . . 8 ((𝐹 Fn 𝐵𝑓 Fn 𝐴 ∧ ran 𝑓𝐵) → (𝐹𝑓) Fn 𝐴)
3731, 33, 35, 36syl3anc 1370 . . . . . . 7 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → (𝐹𝑓) Fn 𝐴)
38 fnresi 6607 . . . . . . 7 ( I ↾ 𝐴) Fn 𝐴
39 eqfnfv 6959 . . . . . . 7 (((𝐹𝑓) Fn 𝐴 ∧ ( I ↾ 𝐴) Fn 𝐴) → ((𝐹𝑓) = ( I ↾ 𝐴) ↔ ∀𝑥𝐴 ((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥)))
4037, 38, 39sylancl 586 . . . . . 6 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → ((𝐹𝑓) = ( I ↾ 𝐴) ↔ ∀𝑥𝐴 ((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥)))
4130, 40mpbird 256 . . . . 5 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → (𝐹𝑓) = ( I ↾ 𝐴))
4241imaeq1d 5992 . . . 4 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → ((𝐹𝑓) “ 𝐴) = (( I ↾ 𝐴) “ 𝐴))
43 imaco 6183 . . . 4 ((𝐹𝑓) “ 𝐴) = (𝐹 “ (𝑓𝐴))
44 ssid 3953 . . . . 5 𝐴𝐴
45 resiima 6008 . . . . 5 (𝐴𝐴 → (( I ↾ 𝐴) “ 𝐴) = 𝐴)
4644, 45ax-mp 5 . . . 4 (( I ↾ 𝐴) “ 𝐴) = 𝐴
4742, 43, 463eqtr3g 2799 . . 3 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → (𝐹 “ (𝑓𝐴)) = 𝐴)
48 imaeq2 5989 . . . . 5 (𝑐 = (𝑓𝐴) → (𝐹𝑐) = (𝐹 “ (𝑓𝐴)))
4948eqeq1d 2738 . . . 4 (𝑐 = (𝑓𝐴) → ((𝐹𝑐) = 𝐴 ↔ (𝐹 “ (𝑓𝐴)) = 𝐴))
5049rspcev 3570 . . 3 (((𝑓𝐴) ∈ (𝒫 𝐵 ∩ Fin) ∧ (𝐹 “ (𝑓𝐴)) = 𝐴) → ∃𝑐 ∈ (𝒫 𝐵 ∩ Fin)(𝐹𝑐) = 𝐴)
5122, 47, 50syl2anc 584 . 2 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → ∃𝑐 ∈ (𝒫 𝐵 ∩ Fin)(𝐹𝑐) = 𝐴)
5210, 51exlimddv 1937 1 ((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) → ∃𝑐 ∈ (𝒫 𝐵 ∩ Fin)(𝐹𝑐) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1086   = wceq 1540  wex 1780  wcel 2105  wral 3061  wrex 3070  cin 3896  wss 3897  𝒫 cpw 4546   I cid 5511  ran crn 5615  cres 5616  cima 5617  ccom 5618  Fun wfun 6467   Fn wfn 6468  wf 6469  cfv 6473  Fincfn 8796
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2707  ax-sep 5240  ax-nul 5247  ax-pr 5369  ax-un 7642
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3350  df-rab 3404  df-v 3443  df-sbc 3727  df-csb 3843  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3916  df-nul 4269  df-if 4473  df-pw 4548  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4852  df-br 5090  df-opab 5152  df-mpt 5173  df-tr 5207  df-id 5512  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5569  df-we 5571  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-ord 6299  df-on 6300  df-lim 6301  df-suc 6302  df-iota 6425  df-fun 6475  df-fn 6476  df-f 6477  df-f1 6478  df-fo 6479  df-f1o 6480  df-fv 6481  df-om 7773  df-1o 8359  df-en 8797  df-fin 8800
This theorem is referenced by:  fodomfi2  9909  cmpfi  22657  elrfirn  40767  lmhmfgsplit  41162  hbtlem6  41205
  Copyright terms: Public domain W3C validator