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

Theorem fipreima 8818
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 1130 . . 3 ((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) → 𝐴 ∈ Fin)
2 dfss3 3953 . . . . . 6 (𝐴 ⊆ ran 𝐹 ↔ ∀𝑥𝐴 𝑥 ∈ ran 𝐹)
3 fvelrnb 6719 . . . . . . 7 (𝐹 Fn 𝐵 → (𝑥 ∈ ran 𝐹 ↔ ∃𝑦𝐵 (𝐹𝑦) = 𝑥))
43ralbidv 3194 . . . . . 6 (𝐹 Fn 𝐵 → (∀𝑥𝐴 𝑥 ∈ ran 𝐹 ↔ ∀𝑥𝐴𝑦𝐵 (𝐹𝑦) = 𝑥))
52, 4syl5bb 284 . . . . 5 (𝐹 Fn 𝐵 → (𝐴 ⊆ ran 𝐹 ↔ ∀𝑥𝐴𝑦𝐵 (𝐹𝑦) = 𝑥))
65biimpa 477 . . . 4 ((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹) → ∀𝑥𝐴𝑦𝐵 (𝐹𝑦) = 𝑥)
763adant3 1124 . . 3 ((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) → ∀𝑥𝐴𝑦𝐵 (𝐹𝑦) = 𝑥)
8 fveqeq2 6672 . . . 4 (𝑦 = (𝑓𝑥) → ((𝐹𝑦) = 𝑥 ↔ (𝐹‘(𝑓𝑥)) = 𝑥))
98ac6sfi 8750 . . 3 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴𝑦𝐵 (𝐹𝑦) = 𝑥) → ∃𝑓(𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥))
101, 7, 9syl2anc 584 . 2 ((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) → ∃𝑓(𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥))
11 fimass 6548 . . . . . 6 (𝑓:𝐴𝐵 → (𝑓𝐴) ⊆ 𝐵)
12 vex 3495 . . . . . . . 8 𝑓 ∈ V
1312imaex 7610 . . . . . . 7 (𝑓𝐴) ∈ V
1413elpw 4542 . . . . . 6 ((𝑓𝐴) ∈ 𝒫 𝐵 ↔ (𝑓𝐴) ⊆ 𝐵)
1511, 14sylibr 235 . . . . 5 (𝑓:𝐴𝐵 → (𝑓𝐴) ∈ 𝒫 𝐵)
1615ad2antrl 724 . . . 4 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → (𝑓𝐴) ∈ 𝒫 𝐵)
17 ffun 6510 . . . . . 6 (𝑓:𝐴𝐵 → Fun 𝑓)
1817ad2antrl 724 . . . . 5 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → Fun 𝑓)
19 simpl3 1185 . . . . 5 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → 𝐴 ∈ Fin)
20 imafi 8805 . . . . 5 ((Fun 𝑓𝐴 ∈ Fin) → (𝑓𝐴) ∈ Fin)
2118, 19, 20syl2anc 584 . . . 4 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → (𝑓𝐴) ∈ Fin)
2216, 21elind 4168 . . 3 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → (𝑓𝐴) ∈ (𝒫 𝐵 ∩ Fin))
23 fvco3 6753 . . . . . . . . . . 11 ((𝑓:𝐴𝐵𝑥𝐴) → ((𝐹𝑓)‘𝑥) = (𝐹‘(𝑓𝑥)))
24 fvresi 6927 . . . . . . . . . . . 12 (𝑥𝐴 → (( I ↾ 𝐴)‘𝑥) = 𝑥)
2524adantl 482 . . . . . . . . . . 11 ((𝑓:𝐴𝐵𝑥𝐴) → (( I ↾ 𝐴)‘𝑥) = 𝑥)
2623, 25eqeq12d 2834 . . . . . . . . . 10 ((𝑓:𝐴𝐵𝑥𝐴) → (((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥) ↔ (𝐹‘(𝑓𝑥)) = 𝑥))
2726ralbidva 3193 . . . . . . . . 9 (𝑓:𝐴𝐵 → (∀𝑥𝐴 ((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥) ↔ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥))
2827biimprd 249 . . . . . . . 8 (𝑓:𝐴𝐵 → (∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥 → ∀𝑥𝐴 ((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥)))
2928adantl 482 . . . . . . 7 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ 𝑓:𝐴𝐵) → (∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥 → ∀𝑥𝐴 ((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥)))
3029impr 455 . . . . . 6 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → ∀𝑥𝐴 ((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥))
31 simpl1 1183 . . . . . . . 8 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → 𝐹 Fn 𝐵)
32 ffn 6507 . . . . . . . . 9 (𝑓:𝐴𝐵𝑓 Fn 𝐴)
3332ad2antrl 724 . . . . . . . 8 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → 𝑓 Fn 𝐴)
34 frn 6513 . . . . . . . . 9 (𝑓:𝐴𝐵 → ran 𝑓𝐵)
3534ad2antrl 724 . . . . . . . 8 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → ran 𝑓𝐵)
36 fnco 6458 . . . . . . . 8 ((𝐹 Fn 𝐵𝑓 Fn 𝐴 ∧ ran 𝑓𝐵) → (𝐹𝑓) Fn 𝐴)
3731, 33, 35, 36syl3anc 1363 . . . . . . 7 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → (𝐹𝑓) Fn 𝐴)
38 fnresi 6469 . . . . . . 7 ( I ↾ 𝐴) Fn 𝐴
39 eqfnfv 6794 . . . . . . 7 (((𝐹𝑓) Fn 𝐴 ∧ ( I ↾ 𝐴) Fn 𝐴) → ((𝐹𝑓) = ( I ↾ 𝐴) ↔ ∀𝑥𝐴 ((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥)))
4037, 38, 39sylancl 586 . . . . . 6 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → ((𝐹𝑓) = ( I ↾ 𝐴) ↔ ∀𝑥𝐴 ((𝐹𝑓)‘𝑥) = (( I ↾ 𝐴)‘𝑥)))
4130, 40mpbird 258 . . . . 5 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → (𝐹𝑓) = ( I ↾ 𝐴))
4241imaeq1d 5921 . . . 4 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → ((𝐹𝑓) “ 𝐴) = (( I ↾ 𝐴) “ 𝐴))
43 imaco 6097 . . . 4 ((𝐹𝑓) “ 𝐴) = (𝐹 “ (𝑓𝐴))
44 ssid 3986 . . . . 5 𝐴𝐴
45 resiima 5937 . . . . 5 (𝐴𝐴 → (( I ↾ 𝐴) “ 𝐴) = 𝐴)
4644, 45ax-mp 5 . . . 4 (( I ↾ 𝐴) “ 𝐴) = 𝐴
4742, 43, 463eqtr3g 2876 . . 3 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → (𝐹 “ (𝑓𝐴)) = 𝐴)
48 imaeq2 5918 . . . . 5 (𝑐 = (𝑓𝐴) → (𝐹𝑐) = (𝐹 “ (𝑓𝐴)))
4948eqeq1d 2820 . . . 4 (𝑐 = (𝑓𝐴) → ((𝐹𝑐) = 𝐴 ↔ (𝐹 “ (𝑓𝐴)) = 𝐴))
5049rspcev 3620 . . 3 (((𝑓𝐴) ∈ (𝒫 𝐵 ∩ Fin) ∧ (𝐹 “ (𝑓𝐴)) = 𝐴) → ∃𝑐 ∈ (𝒫 𝐵 ∩ Fin)(𝐹𝑐) = 𝐴)
5122, 47, 50syl2anc 584 . 2 (((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) ∧ (𝑓:𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹‘(𝑓𝑥)) = 𝑥)) → ∃𝑐 ∈ (𝒫 𝐵 ∩ Fin)(𝐹𝑐) = 𝐴)
5210, 51exlimddv 1927 1 ((𝐹 Fn 𝐵𝐴 ⊆ ran 𝐹𝐴 ∈ Fin) → ∃𝑐 ∈ (𝒫 𝐵 ∩ Fin)(𝐹𝑐) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1079   = wceq 1528  wex 1771  wcel 2105  wral 3135  wrex 3136  cin 3932  wss 3933  𝒫 cpw 4535   I cid 5452  ran crn 5549  cres 5550  cima 5551  ccom 5552  Fun wfun 6342   Fn wfn 6343  wf 6344  cfv 6348  Fincfn 8497
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7450
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3or 1080  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-ral 3140  df-rex 3141  df-reu 3142  df-rab 3144  df-v 3494  df-sbc 3770  df-csb 3881  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-pss 3951  df-nul 4289  df-if 4464  df-pw 4537  df-sn 4558  df-pr 4560  df-tp 4562  df-op 4564  df-uni 4831  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-om 7570  df-1o 8091  df-er 8278  df-en 8498  df-dom 8499  df-fin 8501
This theorem is referenced by:  fodomfi2  9474  cmpfi  21944  elrfirn  39170  lmhmfgsplit  39564  hbtlem6  39607
  Copyright terms: Public domain W3C validator