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

Theorem f1ssf1 6640
Description: A subset of an injective function is injective. (Contributed by AV, 20-Nov-2020.)
Assertion
Ref Expression
f1ssf1 ((Fun 𝐹 ∧ Fun 𝐹𝐺𝐹) → Fun 𝐺)

Proof of Theorem f1ssf1
StepHypRef Expression
1 funssres 6392 . . . . 5 ((Fun 𝐹𝐺𝐹) → (𝐹 ↾ dom 𝐺) = 𝐺)
2 funres11 6425 . . . . . . 7 (Fun 𝐹 → Fun (𝐹 ↾ dom 𝐺))
3 cnveq 5738 . . . . . . . 8 (𝐺 = (𝐹 ↾ dom 𝐺) → 𝐺 = (𝐹 ↾ dom 𝐺))
43funeqd 6371 . . . . . . 7 (𝐺 = (𝐹 ↾ dom 𝐺) → (Fun 𝐺 ↔ Fun (𝐹 ↾ dom 𝐺)))
52, 4syl5ibr 248 . . . . . 6 (𝐺 = (𝐹 ↾ dom 𝐺) → (Fun 𝐹 → Fun 𝐺))
65eqcoms 2829 . . . . 5 ((𝐹 ↾ dom 𝐺) = 𝐺 → (Fun 𝐹 → Fun 𝐺))
71, 6syl 17 . . . 4 ((Fun 𝐹𝐺𝐹) → (Fun 𝐹 → Fun 𝐺))
87ex 415 . . 3 (Fun 𝐹 → (𝐺𝐹 → (Fun 𝐹 → Fun 𝐺)))
98com23 86 . 2 (Fun 𝐹 → (Fun 𝐹 → (𝐺𝐹 → Fun 𝐺)))
1093imp 1107 1 ((Fun 𝐹 ∧ Fun 𝐹𝐺𝐹) → Fun 𝐺)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1083   = wceq 1533  wss 3935  ccnv 5548  dom cdm 5549  cres 5551  Fun wfun 6343
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pr 5321
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-br 5059  df-opab 5121  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-res 5561  df-fun 6351
This theorem is referenced by:  subusgr  27065
  Copyright terms: Public domain W3C validator