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

Theorem fssrescdmd 7120
Description: Restriction of a function to a subclass of its domain as a function with domain and codomain. (Contributed by AV, 13-May-2025.)
Hypotheses
Ref Expression
fssrescdmd.f (𝜑𝐹:𝐴𝐵)
fssrescdmd.c (𝜑𝐶𝐴)
fssrescdmd.d (𝜑 → (𝐹𝐶) ⊆ 𝐷)
Assertion
Ref Expression
fssrescdmd (𝜑 → (𝐹𝐶):𝐶𝐷)

Proof of Theorem fssrescdmd
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 fssrescdmd.f . . . 4 (𝜑𝐹:𝐴𝐵)
21ffnd 6703 . . 3 (𝜑𝐹 Fn 𝐴)
3 fssrescdmd.c . . 3 (𝜑𝐶𝐴)
42, 3fnssresd 6656 . 2 (𝜑 → (𝐹𝐶) Fn 𝐶)
5 resima 6008 . . . 4 ((𝐹𝐶) “ 𝐶) = (𝐹𝐶)
6 fssrescdmd.d . . . 4 (𝜑 → (𝐹𝐶) ⊆ 𝐷)
75, 6eqsstrid 3969 . . 3 (𝜑 → ((𝐹𝐶) “ 𝐶) ⊆ 𝐷)
81ffund 6707 . . . . 5 (𝜑 → Fun 𝐹)
98funresd 6576 . . . 4 (𝜑 → Fun (𝐹𝐶))
101fdmd 6713 . . . . . . 7 (𝜑 → dom 𝐹 = 𝐴)
113, 10sseqtrrd 3968 . . . . . 6 (𝜑𝐶 ⊆ dom 𝐹)
12 ssdmres 6006 . . . . . . . 8 (𝐶 ⊆ dom 𝐹 ↔ dom (𝐹𝐶) = 𝐶)
1312a1i 11 . . . . . . 7 (𝜑 → (𝐶 ⊆ dom 𝐹 ↔ dom (𝐹𝐶) = 𝐶))
14 eqcom 2767 . . . . . . 7 (dom (𝐹𝐶) = 𝐶𝐶 = dom (𝐹𝐶))
1513, 14bitrdi 290 . . . . . 6 (𝜑 → (𝐶 ⊆ dom 𝐹𝐶 = dom (𝐹𝐶)))
1611, 15mpbid 235 . . . . 5 (𝜑𝐶 = dom (𝐹𝐶))
1716eqimssd 3987 . . . 4 (𝜑𝐶 ⊆ dom (𝐹𝐶))
18 funimass4 6942 . . . 4 ((Fun (𝐹𝐶) ∧ 𝐶 ⊆ dom (𝐹𝐶)) → (((𝐹𝐶) “ 𝐶) ⊆ 𝐷 ↔ ∀𝑥𝐶 ((𝐹𝐶)‘𝑥) ∈ 𝐷))
199, 17, 18syl2anc 596 . . 3 (𝜑 → (((𝐹𝐶) “ 𝐶) ⊆ 𝐷 ↔ ∀𝑥𝐶 ((𝐹𝐶)‘𝑥) ∈ 𝐷))
207, 19mpbid 235 . 2 (𝜑 → ∀𝑥𝐶 ((𝐹𝐶)‘𝑥) ∈ 𝐷)
21 ffnfv 7112 . 2 ((𝐹𝐶):𝐶𝐷 ↔ ((𝐹𝐶) Fn 𝐶 ∧ ∀𝑥𝐶 ((𝐹𝐶)‘𝑥) ∈ 𝐷))
224, 20, 21sylanbrc 595 1 (𝜑 → (𝐹𝐶):𝐶𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209   = wceq 1570  wcel 2145  wral 3076  wss 3899  dom cdm 5655  cres 5657  cima 5658  Fun wfun 6527   Fn wfn 6528  wf 6529  cfv 6533
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541
This theorem is used by:  isubgruhgr  48784
  Copyright terms: Public domain W3C validator